Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Learning Theory de Sanjay Jain

Algorithmic Learning Theory: Lecture Notes in Artificial Intelligence

Editat de Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
en Limba Engleză Paperback – 11 sep 2013
This book constitutes the proceedings of the 24th International Conference on Algorithmic Learning Theory, ALT 2013, held in Singapore in October 2013, and co-located with the 16th International Conference on Discovery Science, DS 2013. The 23 papers presented in this volume were carefully reviewed and selected from 39 submissions. In addition the book contains 3 full papers of invited talks. The papers are organized in topical sections named: online learning, inductive inference and grammatical inference, teaching and learning from queries, bandit theory, statistical learning theory, Bayesian/stochastic learning, and unsupervised/semi-supervised learning.
Citește tot Restrânge

Din seria Lecture Notes in Artificial Intelligence

Preț: 32712 lei

Preț vechi: 40889 lei
-20%

Puncte Express: 491
Preț estimativ în valută:
5789€ • 6766$ • 5026£

Carte tipărită la comandă

Livrare economică 19 februarie-05 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642409349
ISBN-10: 3642409342
Pagini: 416
Ilustrații: XVIII, 397 p. 30 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.63 kg
Ediția:2013
Editura: Springer
Seria Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Editors’ Introduction.- Learning and Optimizing with Preferences.- Efficient Algorithms for Combinatorial Online Prediction.- Exact Learning from Membership Queries: Some Techniques, Results and New Directions.- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration.- Combinatorial Online Prediction via Metarounding.- On Competitive Recommendations.- Online PCA with Optimal Regrets.- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages.- Topological Separations in Inductive Inference.- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data.- Universal Knowledge-Seeking Agents for Stochastic Environments.- Teaching and Learning from Queries Order Compression Schemes.- Learning a Bounded-Degree Tree Using Separator Queries.- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates.- Robust Risk-Averse Stochastic Multi-armed Bandits.- An Efficient Algorithm for Learning with Semi-bandit Feedback.- Differentially-Private Learning of Low Dimensional Manifolds.- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data.- Adaptive Metric Dimensionality Reduction.- Dimension-Adaptive Bounds on Compressive FLD Classification.- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study.- Concentration and Confidence for Discrete Bayesian Sequence Predictors.- Algorithmic Connections between Active Learning and Stochastic Convex Optimization.- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning.- Fast Spectral Clustering via the Nyström Method.- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series.

Caracteristici

Conference proceedings of the International Conference on Algorithmic Learning Theory