Home > Computing and Information Technology > Computer science > Artificial intelligence > Machine learning > Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)
Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)

Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

ThisvolumecontainspaperspresentedattheFifteenthAnnualConferenceon ComputationalLearningTheory(COLT2002)heldonthemaincampusofthe UniversityofNewSouthWalesinSydney,AustraliafromJuly8to10,2002. Naturally,thesearepapersinthe?eldofcomputationallearningtheory,a- search?elddevotedtostudyingthedesignandanalysisofalgorithmsformaking predictionsaboutthefuturebasedonpastexperiences,withanemphasisonr- orousmathematicalanalysis. COLT2002wasco-locatedwiththeNineteenthInternationalConferenceon MachineLearning(ICML2002)andwiththeTwelfthInternationalConference onInductiveLogicProgramming(ILP2002). NotethatCOLT2002wasthe?rstconferencetotakeplaceafterthefull mergeroftheAnnualConferenceonComputationalLearningTheorywiththe EuropeanConferenceonComputationalLearningTheory. (In2001ajointc- ferenceconsistingofthe5thEuropeanConferenceonComputationalLearning Theoryandthe14thAnnualConferenceonComputationalLearningTheory washeld;thelastindependentEuropeanConferenceonComputationalLea- ingTheorywasheldin1999. ) ThetechnicalprogramofCOLT2002contained26papersselectedfrom 55submissions. Inaddition,ChristosPapadimitriou(UniversityofCaliforniaat Berkeley)wasinvitedtogiveakeynotelectureandtocontributeanabstractof hislecturetotheseproceedings. TheMarkFulkAwardispresentedannuallyforthebestpapercoauthored byastudent. Thisyear'sawardwaswonbySandraZillesforthepaper"Merging UniformInductiveLearners. " April2002 JyrkiKivinen RobertH. Sloan Thanks and Acknowledgments Wegratefullythankalltheindividualsandorganizationsresponsibleforthe successoftheconference. ProgramCommittee Weespeciallywanttothanktheprogramcommittee:DanaAngluin(Yale), JavedAslam(Dartmouth),PeterBartlett(BIOwulfTechnologies),ShaiBen- David(Technion),JohnCase(Univ. ofDelaware),PeterGru..nwald(CWI),Ralf Herbrich(MicrosoftResearch),MarkHerbster(UniversityCollegeLondon), G'aborLugosi(PompeuFabraUniversity),RonMeir(Technion),ShaharMend- son(AustralianNationalUniv. ),MichaelSchmitt(Ruhr-Universit..atBochum), RoccoServedio(Harvard),andSantoshVempala(MIT). WealsoacknowledgethecreatorsoftheCyberChairsoftwareformakinga softwarepackagethathelpedthecommitteedoitswork. Local Arrangements, Co-located Conferences Support SpecialthanksgotoourconferencechairArunSharmaandlocalarrangements chairEricMartin(bothatUniv. ofNewSouthWales)forsettingupCOLT2002 inSydney. RochelleMcDonaldandSueLewisprovidedadministrativesupport. ClaudeSammutinhisroleasconferencechairofICMLandprogramco-chair ofILPensuredsmoothcoordinationwiththetwoco-locatedconferences. COLT Community ForkeepingtheCOLTseriesgoing,wethanktheCOLTsteeringcommittee, andespeciallyChairJohnShawe-TaylorandTreasurerJohnCaseforalltheir hardwork. WealsothankStephenKwekformaintainingtheCOLTwebsiteat http://www. learningtheory. org. Sponsoring Institution SchoolofComputerScienceandEngineering,UniversityofNewSouthWales, Australia VIII Thanks and Acknowledgments Referees PeterAuer LisaHellerstein AlainPajor AndrewBarto DanielHerrmann GunnarR..atsch StephaneBoucheron ColindelaHiguera RobertSchapire OlivierBousquet SeanHolden JohnShawe-Taylor Nicol'oCesa-Bianchi MarcusHutter TakeshiShinohara TapioElomaa SanjayJain DavidShmoys RanEl-Yaniv YuriKalnishkan YoramSinger AllanErskine MakotoKanazawa CarlSmith HenningFernau SatoshiKobayashi FrankStephan J..urgenForster VladimirKoltchinskii Gy..orgyTur'an DeanFoster MattiKa...ariai ..nen PaulVitan 'yi ClaudioGentile WeeSunLee ManfredWarmuth JudyGoldsmith ShieMannor JonA. Wellner ThoreGraepel RyanO'Donnell RobertC. Williamson Table of Contents Statistical Learning Theory AgnosticLearningNonconvexFunctionClasses...1 Shahar Mendelson andRobertC. Williamson Entropy,CombinatorialDimensionsandRandomAverages...14 Shahar Mendelson andRoman Vershynin GeometricParametersofKernelMachines...29 Shahar Mendelson LocalizedRademacherComplexities...44 PeterL. Bartlett,Olivier Bousquet,and Shahar Mendelson SomeLocalMeasuresofComplexityofConvexHulls andGeneralizationBounds ...59 Olivier Bousquet,Vladimir Koltchinskii, and DmitriyPanchenko OnlineLearning PathKernelsandMultiplicativeUpdates...74 Eiji Takimoto andManfred K. Warmuth PredictiveComplexityandInformation...90 Michael V. Vyugin andVladimir V. V'yugin MixabilityandtheExistenceofWeakComplexities...105 YuriKalnishkan andMichael V. Vyugin ASecond-OrderPerceptronAlgorithm...121 Nicolo ' Cesa-Bianchi, AlexConconi, and Claudio Gentile TrackingLinear-ThresholdConceptswithWinnow ...138 Chris Mesterharm Inductive Inference LearningTreeLanguagesfromText...153 HenningFernau PolynomialTimeInductiveInferenceofOrderedTreePatterns withInternalStructuredVariablesfromPositiveData ...1 69 YusukeSuzuki,RyutaAkanuma,Takayoshi Shoudai, TetsuhiroMiyahara, andTomoyuki Uchida X Table of Contents InferringDeterministicLinearLanguages...185 Colin dela HigueraandJoseOncina MergingUniformInductiveLearners...201 SandraZilles TheSpeedPrior:ANewSimplicityMeasure YieldingNear-OptimalComputablePredictions...216 J.. urgenSchmidhuber PAC Learning NewLowerBoundsforStatisticalQueryLearning...229 KeYang ExploringLearnabilitybetweenExactandPAC...244 Nader H. Bshouty, Je?reyC. Jackson, andChristino Tamon PACBoundsforMulti-armedBanditandMarkovDecisionProcesses...

Table of Contents:
Statistical Learning Theory.- Agnostic Learning Nonconvex Function Classes.- Entropy, Combinatorial Dimensions and Random Averages.- Geometric Parameters of Kernel Machines.- Localized Rademacher Complexities.- Some Local Measures of Complexity of Convex Hulls and Generalization Bounds.- Online Learning.- Path Kernels and Multiplicative Updates.- Predictive Complexity and Information.- Mixability and the Existence of Weak Complexities.- A Second-Order Perceptron Algorithm.- Tracking Linear-Threshold Concepts with Winnow.- Inductive Inference.- Learning Tree Languages from Text.- Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data.- Inferring Deterministic Linear Languages.- Merging Uniform Inductive Learners.- The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions.- PAC Learning.- New Lower Bounds for Statistical Query Learning.- Exploring Learnability between Exact and PAC.- PAC Bounds for Multi-armed Bandit and Markov Decision Processes.- Bounds for the Minimum Disagreement Problem with Applications to Learning Theory.- On the Proper Learning of Axis Parallel Concepts.- Boosting.- A Consistent Strategy for Boosting Algorithms.- The Consistency of Greedy Algorithms for Classification.- Maximizing the Margin with Boosting.- Other Learning Paradigms.- Performance Guarantees for Hierarchical Clustering.- Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures.- Prediction and Dimension.- Invited Talk.- Learning the Internet.


Best Sellers


Product Details
  • ISBN-13: 9783540438366
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 412
  • Series Title: 2375 Lecture Notes in Computer Science
  • Sub Title: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings
  • Width: 155 mm
  • ISBN-10: 354043836X
  • Publisher Date: 26 Jun 2002
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Spine Width: 22 mm
  • Weight: 589 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computational Learning Theory: 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002. Proceedings(2375 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA