{"entities":{"Q5943777":{"pageid":8120579,"ns":120,"title":"Item:Q5943777","lastrevid":97653680,"modified":"2026-06-05T15:10:20Z","type":"item","id":"Q5943777","labels":{"en":{"language":"en","value":"Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16--19, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648176"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943777$0FD5BD9A-4E9A-4E14-A986-7FC2E2C808B7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5d8e4f55ce54a09e42c92d6d5c452f0c08869a85","datavalue":{"value":{"text":"Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16--19, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5943777$D61E3898-F9BB-4785-97EA-3FD447F52357","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"35a1845317255352977c6b42a7887da3759c592f","datavalue":{"value":"0969.00077","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$5983B882-DC5B-48B0-895A-6DE1C3BB4A78","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9bfbaeb2e4d128ff2e695b3c44b88f94bd2e037c","datavalue":{"value":"10.1007/3-540-44581-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$E80C0707-F042-479F-AE96-F52110F53C60","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943777$DA766399-61DE-4986-9847-1494666F399E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a12c476678ac830de6d391e0b3f53860587b6e09","datavalue":{"value":{"time":"+2001-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5943777$7A0E085C-F9B4-4DCC-8CE5-56F9AD81D53A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"96d0f41ca119eb154276b245f4fb384eef2697f4","datavalue":{"value":"The articles of mathematical interest will be reviewed individually.  Indexed articles:  \\textit{Simon, Hans Ulrich}, How many queries are needed to learn one bit of information?, 1-13 [Zbl 0992.68095]  \\textit{Schmitt, Michael}, Radial basis function neural networks have superlinear VC dimension, 14-30 [Zbl 0992.68107]  \\textit{Bousquet, Olivier; Warmuth, Manfred K.}, Tracking a small set of experts by mixing past posteriors, 31-47 [Zbl 0992.68110]  \\textit{Cesa-Bianchi, Nicol\u00f2; Lugosi, G\u00e1bor}, Potential-based algorithms in online prediction and game theory, 48-64 [Zbl 0992.68105]  \\textit{Zhang, Tong}, A sequential approximation bound for some sample-dependent convex optimization problems with applications in learning, 65-81 [Zbl 0998.68071]  \\textit{Chawla, Deepak; Li, Lin; Scott, Stephen}, Efficiently approximating weighted sums with exponentially many terms, 82-98 [Zbl 0992.68092]  \\textit{Crammer, Koby; Singer, Yoram}, Ultraconservative online algorithms for multiclass problems, 99-115 [Zbl 0992.68111]  \\textit{Goldberg, Paul W.}, Estimating a Boolean perceptron from its average satisfying assignment: A bound on the precision required, 116-127 [Zbl 0998.68070]  \\textit{Mannor, Shie; Shimkin, Nahum}, Adaptive strategies and regret minimization in arbitrarily varying Markov environments, 128-142 [Zbl 0992.68115]  \\textit{Case, John; Jain, Sanjay; Stephan, Frank; Wiehagen, Rolf}, Robust learning -- rich and poor, 143-159 [Zbl 0992.68108]  \\textit{Zilles, Sandra}, On the synthesis of strategies identifying recursive functions, 160-176 [Zbl 0992.68101]  \\textit{Jain, Sanjay; Kinber, Efim}, Intrinsic complexity of learning geometrical concepts from positive data, 177-193 [Zbl 0992.68096]  \\textit{Stork, David G.}, Toward a computational theory of data acquisition and truthing, 194-207 [Zbl 0992.68510]  \\textit{Piccolboni, Antonio; Schindelhauer, Christian}, Discrete prediction games with arbitrary feedback and loss. (Extended abstract), 208-223 [Zbl 0992.68506]  \\textit{Bartlett, Peter L.; Mendelson, Shahar}, Rademacher and Gaussian complexities: Risk bounds and structural results, 224-240 [Zbl 0992.68106]  \\textit{Koltchinskii, Vladimir; Panchenko, Dmitriy; Lozano, Fernando}, Further explanation of the effectiveness of voting methods: The game between margins and weights, 241-255 [Zbl 0992.68511]  \\textit{Mendelson, Shahar}, Geometric methods in the analysis of Glivenko-Cantelli classes, 256-272 [Zbl 0992.68094]  \\textit{Mendelson, Shahar}, Learning relatively small classes, 273-288 [Zbl 0998.68068]  \\textit{Long, Philip M.}, On agnostic learning with \\(\\{0, *, 1\\}\\)-valued and real-valued hypotheses, 289-302 [Zbl 0992.68099]  \\textit{Goldberg, Paul W.}, When can two unsupervised learners achieve PAC separation?, 303-319 [Zbl 0992.68112]  \\textit{Gr\u00fcnwald, Peter}, Strong entropy concentration, game theory, and algorithmic randomness, 320-336 [Zbl 0992.68109]  \\textit{Nouretdinov, Ilia; Vovk, Volodya; Vyugin, Michael; Gammerman, Alex}, Pattern recognition and density estimation under the general i. i. d. assumption, 337-353 [Zbl 0992.68104]  \\textit{Balc\u00e1zar, Jos\u00e9 L.; Castro, Jorge; Guijarro, David}, A general dimension for exact learning, 354-367 [Zbl 0992.68087]  \\textit{K\u00e9gl, Bal\u00e1zs; Linder, Tam\u00e1s; Lugosi, G\u00e1bor}, Data-dependent margin-based generalization bounds for classification, 368-384 [Zbl 0992.68091]  \\textit{Ben-David, Shai; Eiron, Nadav; Simon, Hans Ulrich}, Limitations of learning via embeddings in Euclidean half-spaces, 385-401 [Zbl 0998.68069]  \\textit{Forster, J\u00fcrgen; Schmitt, Niels; Simon, Hans Ulrich}, Estimating the optimal margins of embeddings in Euclidean half spaces, 402-415 [Zbl 0998.68067]  \\textit{Sch\u00f6lkopf, Bernhard; Herbrich, Ralf; Smola, Alex J.}, A generalized representer theorem, 416-426 [Zbl 0992.68088]  \\textit{Zhang, Tong}, A leave-one-out cross validation bound for kernel methods with applications in learning, 427-443 [Zbl 0992.68113]  \\textit{Herbster, Mark}, Learning additive models online with fast evaluating kernels, 444-460 [Zbl 0992.68507]  \\textit{Mannor, Shie; Meir, Ron}, Geometric bounds for generalization in boosting, 461-472 [Zbl 0992.68093]  \\textit{Servedio, Rocco A.}, Smooth boosting and learning with malicious noise, 473-489 [Zbl 0992.68509]  \\textit{Bshouty, Nader H.; Gavinsky, Dmitry}, On boosting with optimal poly-bounded distributions, 490-506 [Zbl 0992.68508]  \\textit{Ben-David, Shai; Long, Philip M.; Mansour, Yishay}, Agnostic boosting, 507-516 [Zbl 0992.68089]  \\textit{Lee, Wee Sun; Long, Philip M.}, A theoretical analysis of query selection for collaborative filtering, 517-528 [Zbl 0992.68505]  \\textit{Bshouty, Nader H.; Feldman, Vitaly}, On using extended statistical queries to avoid membership queries, 529-545 [Zbl 0992.68102]  \\textit{Bshouty, Nader H.; Eiron, Nadav}, Learning monotone DNF from a teacher that almost does not answer membership queries, 546-557 [Zbl 0992.68114]  \\textit{Servedio, Rocco A.}, On learning monotone DNF under product distributions, 558-573 [Zbl 0992.68100]  \\textit{Bshouty, Nader; Owshanko, Avi}, Learning regular sets with an incomplete membership oracle, 574-588 [Zbl 0992.68098]  \\textit{Even-Dar, Eyal; Mansour, Yishay}, Learning rates for Q-learning, 589-604 [Zbl 0992.68097]  \\textit{Kakade, Sham}, Optimizing average reward using discounted rewards, 605-615 [Zbl 0992.68103]  \\textit{Peshkin, Leonid; Mukherjee, Sayan}, Bounds on sample size for policy evaluation in Markov environments, 616-629 [Zbl 0992.68090]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$9D4F42A0-9C73-48B8-B91C-122C27E79E78","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$D26F5F82-E13E-421A-8263-6118ED8B86B0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$FC1ABD94-8869-478A-A39B-49AEBCB26185","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"65424420b8175b2c6d6137549ddafc7a080a2228","datavalue":{"value":"1648176","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$3D335680-3399-4686-94E0-94B20C18CED4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"552f33bb47b9133e865cc64b06277e6b7f5bd2fa","datavalue":{"value":"Amsterdam (Netherlands)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$3BFE536C-5D9B-401C-A464-FB25102F190C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$961986D6-B7C0-4375-A0BF-6D5DBE0E4A83","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$7F847759-6F79-4D55-A079-62B5F748C62C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1cc8e10437370ad7157bf303411a97e4ecfe0bc9","datavalue":{"value":"COLT 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$D807EB82-EC73-4049-8483-600791CF849C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d5afa6a04d548ed40b859382115fbfa02f6a3f7","datavalue":{"value":"EuroCOLT 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$0F86C890-0211-49CE-8944-2B236FC5E8DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"539f8b843bb8883ae10dfd1dae479c4ac359258e","datavalue":{"value":"Computational learning theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943777$CCAAC18E-8107-4550-BCBB-7F4ED36CBCB3","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943777$D0761C2B-2DF2-475C-BFDC-AD85E2CA9DCC","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"007a038f7b03a0181fc2b6960811eda320b9637b","datavalue":{"value":"https://doi.org/10.1007/3-540-44581-1","type":"string"},"datatype":"url"},"type":"statement","id":"Q5943777$9229D568-0994-4AA1-AA53-9DE779DAC653","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a2af9ade4de24b74ef2209f87f588acd3030f2f1","datavalue":{"value":"W2497770847","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943777$E12C778C-BED5-437E-8EEC-B09E306C8A4B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16--19, 2001. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computational_learning_theory._14th_annual_conference,_COLT_2001,_and_5th_European_conference,_EuroCOLT_2001,_Amsterdam,_Netherlands,_July_16--19,_2001._Proceedings"}}}}}