000 06264nam a22005895i 4500
001 978-3-540-31892-7
003 DE-He213
005 20240423125844.0
007 cr nn 008mamaa
008 100715s2005 gw | s |||| 0|eng d
020 _a9783540318927
_9978-3-540-31892-7
024 7 _a10.1007/b137542
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aLearning Theory
_h[electronic resource] :
_b18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings /
_cedited by Peter Auer, Ron Meir.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXII, 692 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3559
505 0 _aLearning to Rank -- Ranking and Scoring Using Empirical Risk Minimization -- Learnability of Bipartite Ranking Functions -- Stability and Generalization of Bipartite Ranking Algorithms -- Loss Bounds for Online Category Ranking -- Boosting -- Margin-Based Ranking Meets Boosting in the Middle -- Martingale Boosting -- The Value of Agreement, a New Boosting Algorithm -- Unlabeled Data, Multiclass Classification -- A PAC-Style Model for Learning from Labeled and Unlabeled Data -- Generalization Error Bounds Using Unlabeled Data -- On the Consistency of Multiclass Classification Methods -- Sensitive Error Correcting Output Codes -- Online Learning I -- Data Dependent Concentration Bounds for Sequential Prediction Algorithms -- The Weak Aggregating Algorithm and Weak Mixability -- Tracking the Best of Many Experts -- Improved Second-Order Bounds for Prediction with Expert Advice -- Online Learning II -- Competitive Collaborative Learning -- Analysis of Perceptron-Based Active Learning -- A New Perspective on an Old Perceptron Algorithm -- Support Vector Machines -- Fast Rates for Support Vector Machines -- Exponential Convergence Rates in Classification -- General Polynomial Time Decomposition Algorithms -- Kernels and Embeddings -- Approximating a Gram Matrix for Improved Kernel-Based Learning -- Learning Convex Combinations of Continuously Parameterized Basic Kernels -- On the Limitations of Embedding Methods -- Leaving the Span -- Inductive Inference -- Variations on U-Shaped Learning -- Mind Change Efficient Learning -- On a Syntactic Characterization of Classification with a Mind Change Bound -- Unsupervised Learning -- Ellipsoid Approximation Using Random Vectors -- The Spectral Method for General Mixture Models -- On Spectral Learning of Mixtures of Distributions -- From Graphs to Manifolds – Weak andStrong Pointwise Consistency of Graph Laplacians -- Towards a Theoretical Foundation for Laplacian-Based Manifold Methods -- Generalization Bounds -- Permutation Tests for Classification -- Localized Upper and Lower Bounds for Some Estimation Problems -- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers -- Rank, Trace-Norm and Max-Norm -- Query Learning, Attribute Efficiency, Compression Schemes -- Learning a Hidden Hypergraph -- On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions -- Unlabeled Compression Schemes for Maximum Classes -- Economics and Game Theory -- Trading in Markovian Price Models -- From External to Internal Regret -- Separation Results for Learning Models -- Separating Models of Learning from Correlated and Uncorrelated Data -- Asymptotic Log-Loss of Prequential Maximum Likelihood Codes -- Teaching Classes with High Teaching Dimension Using Few Examples -- Open Problems -- Optimum Follow the Leader Algorithm -- The Cross Validation Problem -- Compute Inclusion Depth of a Pattern.
520 _aThis volume contains papers presented at the Eighteenth Annual Conference on Learning Theory (previously known as the Conference on Computational Learning Theory) held in Bertinoro, Italy from June 27 to 30, 2005. The technical program contained 45 papers selected from 120 submissions, 3 open problems selected from among 5 contributed, and 2 invited lectures. The invited lectures were given by Sergiu Hart on “Uncoupled Dynamics and Nash Equilibrium”, and by Satinder Singh on “Rethinking State, Action, and Reward in Reinforcement Learning”. These papers were not included in this volume. The Mark Fulk Award is presented annually for the best paper co-authored by a student. The student selected this year was Hadi Salmasian for the paper titled “The Spectral Method for General Mixture Models” co-authored with Ravindran Kannan and Santosh Vempala. The number of papers submitted to COLT this year was exceptionally high. In addition to the classical COLT topics, we found an increase in the number of submissions related to novel classi?cation scenarios such as ranking. This - crease re?ects a healthy shift towards more structured classi?cation problems, which are becoming increasingly relevant to practitioners.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aAuer, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMeir, Ron.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540265566
776 0 8 _iPrinted edition:
_z9783540812425
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3559
856 4 0 _uhttps://doi.org/10.1007/b137542
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182420
_d182420