Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008766319/catalog> ?p ?o. }

• catalog abstract "This volume contains papers presented at the joint 14th Annual Conference on Computational Learning Theory and 5th European Conference on Computat- nal Learning Theory, held at the Trippenhuis in Amsterdam, The Netherlands from July 16 to 19, 2001. The technical program contained 40 papers selected from 69 submissions. In addition, David Stork (Ricoh California Research Center) was invited to give an invited lecture and make a written contribution to the proceedings. The Mark Fulk Award is presented annually for the best paper co-authored by a student. This year’s award was won by Olivier Bousquet for the paper “Tracking a Small Set of Modes by Mixing Past Posteriors” (co-authored with Manfred K. Warmuth). We gratefully thank all of the individuals and organizations responsible for the success of the conference. We are especially grateful to the program c- mittee: Dana Angluin (Yale), Peter Auer (Univ. of Technology, Graz), Nello Christianini (Royal Holloway), Claudio Gentile (Universit`a di Milano), Lisa H- lerstein (Polytechnic Univ.), Jyrki Kivinen (Univ. of Helsinki), Phil Long (- tional Univ. of Singapore), Manfred Opper (Aston Univ.), John Shawe-Taylor (Royal Holloway), Yoram Singer (Hebrew Univ.), Bob Sloan (Univ. of Illinois at Chicago), Carl Smith (Univ. of Maryland), Alex Smola (Australian National Univ.), and Frank Stephan (Univ. of Heidelberg), for their e?orts in reviewing and selecting the papers in this volume.".
• catalog contributor b12286471.
• catalog contributor b12286472.
• catalog contributor b12286473.
• catalog contributor b12286474.
• catalog created "2001.".
• catalog date "2001".
• catalog date "2001.".
• catalog dateCopyrighted "2001.".
• catalog description "How Many Queries Are Needed to Learn One Bit of Information? / Hans Ulrich Simon -- Radial Basis Function Neural Networks Have Superlinear VC Dimension / Michael Schmitt -- Tracking a Small Set of Experts by Mixing Past Posteriors / Oliver Bousquet and Manfred K. Warmuth -- Potential-Based Algorithms in On-Line Prediction and Game Theory / Nicolo Cesa-Bianchi and Gabor Lugosi -- A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning / Tong Zhang -- Efficiently Approximating Weighted Sums with Exponentially Many Terms / Deepak Chawla, Lin Li and Stephen Scott -- Ultraconservative Online Algorithms for Multiclass Problems / Koby Crammer and Yoram Singer -- Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required / Paul W. Goldberg -- Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments / Shie Mannor and Nahum Shimkin -- Robust Learning -- ".
• catalog description "Includes bibliographical references and index.".
• catalog description "Learning Additive Models Online with Fast Evaluating Kernels / Mark Herbster -- Geometric Bounds for Generalization in Boosting / Shie Mannor and Ron Meir -- Smooth Boosting and Learning with Malicious Noise / Rocco A. Servedio -- On Boosting with Optimal Poly-Bounded Distributions / Nader H. Bshouty and Dmitry Gavinsky -- Agnostic Boosting / Shai Ben-David, Philip M. Long and Yishay Mansour -- A Theoretical Analysis of Query Selection for Collaborative Filtering / Wee Sun Lee and Philip M. Long -- On Using Extended Statistical Queries to Avoid Membership Queries / Nader H. Bshouty and Vitaly Feldman -- Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries / Nader H. Bshouty and Nadav Eiron -- On Learning Montone DNF under Product Distributions / Rocco A. Servedio -- Learning Regular Sets with an Incomplete Membership Oracle / Nader Bshouty and Avi Owshanko -- Learning Rates for Q-Learning / Eyal Even-Dar and Yishay Mansour -- ".
• catalog description "Optimizing Average Reward Using Discounted Rewards / Sham Kakade -- Bounds on Sample Size for Policy Evaluation in Markov Environments / Leonid Peshkin and Sayan Mukherjee.".
• catalog description "Rich and Poor / John Case, Sanjay Jain and Frank Stephan / [et al.] -- On the Synthesis of Strategies Identifying Recursive Functions / Sandra Zilles -- Intrinsic Complexity of Learning Geometrical Concepts from Positive Data / Sanjay Jain and Efim Kinber -- Toward a Computational Theory of Data Acquisition and Truthing / David G. Stork -- Discrete Prediction Games with Arbitrary Feedback and Loss / Antonio Piccolboni and Christian Schindelhauer -- Rademacher and Gaussian Complexities: Risk Bounds and Structural Results / Peter L. Bartlett and Shahar Mendelson -- Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights / Vladimir Koltchinskii, Dmitriy Panchenko and Fernando Lozano -- Geometric Methods in the Analysis of Glivenko-Cantelli Classes / Shahar Mendelson -- Learning Relatively Small Classes / Shahar Mendelson -- On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses / Philip M. Long -- ".
• catalog description "This volume contains papers presented at the joint 14th Annual Conference on Computational Learning Theory and 5th European Conference on Computat- nal Learning Theory, held at the Trippenhuis in Amsterdam, The Netherlands from July 16 to 19, 2001. The technical program contained 40 papers selected from 69 submissions. In addition, David Stork (Ricoh California Research Center) was invited to give an invited lecture and make a written contribution to the proceedings. The Mark Fulk Award is presented annually for the best paper co-authored by a student. This year’s award was won by Olivier Bousquet for the paper “Tracking a Small Set of Modes by Mixing Past Posteriors” (co-authored with Manfred K. Warmuth). We gratefully thank all of the individuals and organizations responsible for the success of the conference. We are especially grateful to the program c- mittee: Dana Angluin (Yale), Peter Auer (Univ. of Technology, Graz), Nello Christianini (Royal Holloway), Claudio Gentile (Universit`a di Milano), Lisa H- lerstein (Polytechnic Univ.), Jyrki Kivinen (Univ. of Helsinki), Phil Long (- tional Univ. of Singapore), Manfred Opper (Aston Univ.), John Shawe-Taylor (Royal Holloway), Yoram Singer (Hebrew Univ.), Bob Sloan (Univ. of Illinois at Chicago), Carl Smith (Univ. of Maryland), Alex Smola (Australian National Univ.), and Frank Stephan (Univ. of Heidelberg), for their e?orts in reviewing and selecting the papers in this volume.".
• catalog description "When Can Two Unsupervised Learners Achieve PAC Separation? / Paul W. Goldberg -- Strong Entropy Concentration, Game Theory and Algorithmic Randomness / Peter Grunwald -- Pattern Recognition and Density Estimation under the General i.i.d. Assumption / Ilia Nouretdinov, Volodya Vovk and Michael Vyugin / [et al.] -- A General Dimension for Exact Learning / Jose L. Balcazar, Jorge Castro and David Guijarro -- Data-Dependent Margin-Based Generalization Bounds for Classification / Balazs Kegl, Tamas Linder and Gabor Lugosi -- Limitations of Learning Via Embeddings in Euclidean Half-Spaces / Shai Ben-David, Nadav Eiron and Hans Ulrich Simon -- Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces / Jurgen Forster, Niels Schmitt and Hans Ulrich Simon -- A Generalized Representer Theorem / Bernhard Scholkopf, Ralf Herbrich and Alex J. Smola -- A Leave-One Out Cross Validation Bound for Kernel Methods with Applications in Learning / Tong Zhang -- ".
• catalog extent "ix, 629 p. ;".
• catalog identifier "3540423435 (pbk. : alk. paper)".
• catalog isPartOf "Lecture notes in computer science ; 2111.".
• catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
• catalog isPartOf "Lecture notes in computer science; 2111. Lecture notes in artificial intelligence".
• catalog issued "2001".
• catalog issued "2001.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "006.3/1 21".
• catalog subject "Artificial intelligence.".
• catalog subject "Computational learning theory Congresses.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Q325.5 .C66 2001".
• catalog tableOfContents "How Many Queries Are Needed to Learn One Bit of Information? / Hans Ulrich Simon -- Radial Basis Function Neural Networks Have Superlinear VC Dimension / Michael Schmitt -- Tracking a Small Set of Experts by Mixing Past Posteriors / Oliver Bousquet and Manfred K. Warmuth -- Potential-Based Algorithms in On-Line Prediction and Game Theory / Nicolo Cesa-Bianchi and Gabor Lugosi -- A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning / Tong Zhang -- Efficiently Approximating Weighted Sums with Exponentially Many Terms / Deepak Chawla, Lin Li and Stephen Scott -- Ultraconservative Online Algorithms for Multiclass Problems / Koby Crammer and Yoram Singer -- Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required / Paul W. Goldberg -- Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments / Shie Mannor and Nahum Shimkin -- Robust Learning -- ".
• catalog tableOfContents "Learning Additive Models Online with Fast Evaluating Kernels / Mark Herbster -- Geometric Bounds for Generalization in Boosting / Shie Mannor and Ron Meir -- Smooth Boosting and Learning with Malicious Noise / Rocco A. Servedio -- On Boosting with Optimal Poly-Bounded Distributions / Nader H. Bshouty and Dmitry Gavinsky -- Agnostic Boosting / Shai Ben-David, Philip M. Long and Yishay Mansour -- A Theoretical Analysis of Query Selection for Collaborative Filtering / Wee Sun Lee and Philip M. Long -- On Using Extended Statistical Queries to Avoid Membership Queries / Nader H. Bshouty and Vitaly Feldman -- Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries / Nader H. Bshouty and Nadav Eiron -- On Learning Montone DNF under Product Distributions / Rocco A. Servedio -- Learning Regular Sets with an Incomplete Membership Oracle / Nader Bshouty and Avi Owshanko -- Learning Rates for Q-Learning / Eyal Even-Dar and Yishay Mansour -- ".
• catalog tableOfContents "Optimizing Average Reward Using Discounted Rewards / Sham Kakade -- Bounds on Sample Size for Policy Evaluation in Markov Environments / Leonid Peshkin and Sayan Mukherjee.".
• catalog tableOfContents "Rich and Poor / John Case, Sanjay Jain and Frank Stephan / [et al.] -- On the Synthesis of Strategies Identifying Recursive Functions / Sandra Zilles -- Intrinsic Complexity of Learning Geometrical Concepts from Positive Data / Sanjay Jain and Efim Kinber -- Toward a Computational Theory of Data Acquisition and Truthing / David G. Stork -- Discrete Prediction Games with Arbitrary Feedback and Loss / Antonio Piccolboni and Christian Schindelhauer -- Rademacher and Gaussian Complexities: Risk Bounds and Structural Results / Peter L. Bartlett and Shahar Mendelson -- Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights / Vladimir Koltchinskii, Dmitriy Panchenko and Fernando Lozano -- Geometric Methods in the Analysis of Glivenko-Cantelli Classes / Shahar Mendelson -- Learning Relatively Small Classes / Shahar Mendelson -- On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses / Philip M. Long -- ".
• catalog tableOfContents "When Can Two Unsupervised Learners Achieve PAC Separation? / Paul W. Goldberg -- Strong Entropy Concentration, Game Theory and Algorithmic Randomness / Peter Grunwald -- Pattern Recognition and Density Estimation under the General i.i.d. Assumption / Ilia Nouretdinov, Volodya Vovk and Michael Vyugin / [et al.] -- A General Dimension for Exact Learning / Jose L. Balcazar, Jorge Castro and David Guijarro -- Data-Dependent Margin-Based Generalization Bounds for Classification / Balazs Kegl, Tamas Linder and Gabor Lugosi -- Limitations of Learning Via Embeddings in Euclidean Half-Spaces / Shai Ben-David, Nadav Eiron and Hans Ulrich Simon -- Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces / Jurgen Forster, Niels Schmitt and Hans Ulrich Simon -- A Generalized Representer Theorem / Bernhard Scholkopf, Ralf Herbrich and Alex J. Smola -- A Leave-One Out Cross Validation Bound for Kernel Methods with Applications in Learning / Tong Zhang -- ".
• catalog title "Computational learning theory : 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001 : proceedings / David Helmbold, Bob Williamson, eds.".
• catalog type "Amsterdam (2001) swd".
• catalog type "Conference proceedings. fast".
• catalog type "Kongress. swd".
• catalog type "text".