The Resource 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds
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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds
Resource Information
The item 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.
This item is available to borrow from 1 library branch.
 Language
 eng
 Extent
 ix, 629 pages
 Contents

 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
 PotentialBased Algorithms in OnLine Prediction and Game Theory / Nicolo CesaBianchi and Gabor Lugosi
 A Sequential Approximation Bound for Some SampleDependent 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
 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 GlivenkoCantelli Classes / Shahar Mendelson
 Learning Relatively Small Classes / Shahar Mendelson
 On Agnostic Learning with {0, *, 1}Valued and RealValued Hypotheses / Philip M. Long
 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
 DataDependent MarginBased Generalization Bounds for Classification / Balazs Kegl, Tamas Linder and Gabor Lugosi
 Limitations of Learning Via Embeddings in Euclidean HalfSpaces / Shai BenDavid, 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 LeaveOne Out Cross Validation Bound for Kernel Methods with Applications in Learning / Tong Zhang
 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 PolyBounded Distributions / Nader H. Bshouty and Dmitry Gavinsky
 Agnostic Boosting / Shai BenDavid, 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 QLearning / Eyal EvenDar and Yishay Mansour
 Optimizing Average Reward Using Discounted Rewards / Sham Kakade
 Bounds on Sample Size for Policy Evaluation in Markov Environments / Leonid Peshkin and Sayan Mukherjee
 Isbn
 9783540423430
 Label
 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 1619, 2001 : proceedings
 Title
 Computational learning theory
 Title remainder
 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 1619, 2001 : proceedings
 Statement of responsibility
 David Helmbold, Bob Williamson, eds
 Title variation

 COLT 2001
 EuroCOLT 2001
 Language
 eng
 Additional physical form
 Also available via World Wide Web. Abstracts available without subscription.
 Cataloging source
 DLC
 Dewey number
 006.3/1
 Illustrations
 illustrations
 Index
 index present
 LC call number
 Q325.5
 LC item number
 .C66 2001
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2001
 http://bibfra.me/vocab/lite/meetingName
 Conference on Computational Learning Theory
 Nature of contents
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate

 1962
 2001
 http://library.link/vocab/relatedWorkOrContributorName

 Helmbold, David
 Williamson, Bob
 European Conference on Computational Learning Theory
 Series statement

 Lecture notes in computer science
 Lecture notes in artificial intelligence
 Series volume
 2111.
 http://library.link/vocab/subjectName
 Computational learning theory
 Label
 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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  PotentialBased Algorithms in OnLine Prediction and Game Theory / Nicolo CesaBianchi and Gabor Lugosi  A Sequential Approximation Bound for Some SampleDependent 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  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 GlivenkoCantelli Classes / Shahar Mendelson  Learning Relatively Small Classes / Shahar Mendelson  On Agnostic Learning with {0, *, 1}Valued and RealValued Hypotheses / Philip M. Long  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  DataDependent MarginBased Generalization Bounds for Classification / Balazs Kegl, Tamas Linder and Gabor Lugosi  Limitations of Learning Via Embeddings in Euclidean HalfSpaces / Shai BenDavid, 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 LeaveOne Out Cross Validation Bound for Kernel Methods with Applications in Learning / Tong Zhang  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 PolyBounded Distributions / Nader H. Bshouty and Dmitry Gavinsky  Agnostic Boosting / Shai BenDavid, 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 QLearning / Eyal EvenDar and Yishay Mansour  Optimizing Average Reward Using Discounted Rewards / Sham Kakade  Bounds on Sample Size for Policy Evaluation in Markov Environments / Leonid Peshkin and Sayan Mukherjee
 Control code
 47521450
 Dimensions
 24 cm
 Extent
 ix, 629 pages
 Isbn
 9783540423430
 Isbn Type
 (pbk. : alk. paper)
 Lccn
 2001049117
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 Label
 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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  PotentialBased Algorithms in OnLine Prediction and Game Theory / Nicolo CesaBianchi and Gabor Lugosi  A Sequential Approximation Bound for Some SampleDependent 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  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 GlivenkoCantelli Classes / Shahar Mendelson  Learning Relatively Small Classes / Shahar Mendelson  On Agnostic Learning with {0, *, 1}Valued and RealValued Hypotheses / Philip M. Long  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  DataDependent MarginBased Generalization Bounds for Classification / Balazs Kegl, Tamas Linder and Gabor Lugosi  Limitations of Learning Via Embeddings in Euclidean HalfSpaces / Shai BenDavid, 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 LeaveOne Out Cross Validation Bound for Kernel Methods with Applications in Learning / Tong Zhang  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 PolyBounded Distributions / Nader H. Bshouty and Dmitry Gavinsky  Agnostic Boosting / Shai BenDavid, 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 QLearning / Eyal EvenDar and Yishay Mansour  Optimizing Average Reward Using Discounted Rewards / Sham Kakade  Bounds on Sample Size for Policy Evaluation in Markov Environments / Leonid Peshkin and Sayan Mukherjee
 Control code
 47521450
 Dimensions
 24 cm
 Extent
 ix, 629 pages
 Isbn
 9783540423430
 Isbn Type
 (pbk. : alk. paper)
 Lccn
 2001049117
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Computationallearningtheory14thAnnual/UurPEe5tWwQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Computationallearningtheory14thAnnual/UurPEe5tWwQ/">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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item 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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Computationallearningtheory14thAnnual/UurPEe5tWwQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Computationallearningtheory14thAnnual/UurPEe5tWwQ/">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 1619, 2001 : proceedings, David Helmbold, Bob Williamson, eds</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>