Coverart for item
The Resource Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings, Nader H. Bshouty...[et al.] (eds.), (electronic book)

Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings, Nader H. Bshouty...[et al.] (eds.), (electronic book)

Label
Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings
Title
Algorithmic learning theory
Title remainder
23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings
Statement of responsibility
Nader H. Bshouty...[et al.] (eds.)
Title variation
ALT 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
006.3/1
Index
index present
LC call number
QA76.9.A43
LC item number
A48 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
ALT 2012
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Bshouty, Nader H
Series statement
  • Lecture notes in artificial intelligence
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 7, Artificial intelligence
Series volume
7568
http://library.link/vocab/subjectName
  • Computer algorithms
  • Machine learning
Label
Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings, Nader H. Bshouty...[et al.] (eds.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • Recent Developments in Pattern Mining
  • Toon Calders
  • Exploring Sequential Data
  • Gilbert Ritschard
  • Enlarging Learnable Classes
  • Sanjay Jain, Timo Kötzing and Frank Stephan
  • Confident and Consistent Partial Learning of Recursive Functions
  • Ziyuan Gao and Frank Stephan
  • Automatic Learning from Positive Data and Negative Counterexamples
  • Sanjay Jain and Efim Kinber
  • Editors' Introduction
  • Regular Inference as Vertex Coloring
  • Christophe Costa Florêncio and Sicco Verwer
  • Sauer's Bound for a Notion of Teaching Complexity
  • Rahim Samei, Pavel Semukhin, Boting Yang and Sandra Zilles
  • On the Learnability of Shuffle Ideals
  • Dana Angluin, James Aspnes and Aryeh Kontorovich
  • New Analysis and Algorithm for Learning with Drifting Distributions
  • Mehryar Mohri and Andres Muñoz Medina
  • On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples
  • Shai Ben-David and Ruth Urner
  • Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis and Thomas Zeugmann
  • Efficient Protocols for Distributed Classification and Optimization
  • Hal Daumé III, Jeff M. Phillips, Avishek Saha and Suresh Venkatasubramanian --
  • Declarative Modeling for Machine Learning and Data Mining
  • Luc De Raedt
  • Learnability beyond Uniform Convergence
  • Shai Shalev-Shwartz
  • Some Rates of Convergence for the Selected Lasso Estimator
  • Pascal Massart and Caroline Meynet
  • Ronald Ortner, Daniil Ryabko, Peter Auer and Rémi Munos
  • Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples
  • Alexandra Carpentier and Rémi Munos
  • Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret
  • Edward Moroshko and Koby Crammer
  • Online Prediction under Submodular Constraints
  • Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Kiyohito Nagano
  • Lower Bounds on Individual Sequence Regret
  • Eyal Gofer and Yishay Mansour
  • A Closer Look at Adaptive Regret
  • The Safe Bayesian
  • Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov and Vladimir Vovk
  • Partial Monitoring with Side Information
  • Gábor Bartók and Csaba Szepesvári
  • PAC Bounds for Discounted MDPs
  • Tor Lattimore and Marcus Hutter
  • Buy Low, Sell High
  • Wouter M. Koolen and Vladimir Vovk
  • Kernelization of Matrix Updates, When and How?
  • Manfred K. Warmuth, Wojciech Kotłowski and Shuisheng Zhou
  • Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes
  • Learning the Learning Rate via the Mixability Gap
  • Mrinalkanti Ghosh and Satyadev Nandakumar
  • Peter Grünwald
  • Data Stability in Clustering: A Closer Look
  • Lev Reyzin
  • Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
  • Emilie Kaufmann, Nathaniel Korda and Rémi Munos
  • Regret Bounds for Restless Markov Bandits
Control code
SPR812453532
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642341069
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings, Nader H. Bshouty...[et al.] (eds.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • Recent Developments in Pattern Mining
  • Toon Calders
  • Exploring Sequential Data
  • Gilbert Ritschard
  • Enlarging Learnable Classes
  • Sanjay Jain, Timo Kötzing and Frank Stephan
  • Confident and Consistent Partial Learning of Recursive Functions
  • Ziyuan Gao and Frank Stephan
  • Automatic Learning from Positive Data and Negative Counterexamples
  • Sanjay Jain and Efim Kinber
  • Editors' Introduction
  • Regular Inference as Vertex Coloring
  • Christophe Costa Florêncio and Sicco Verwer
  • Sauer's Bound for a Notion of Teaching Complexity
  • Rahim Samei, Pavel Semukhin, Boting Yang and Sandra Zilles
  • On the Learnability of Shuffle Ideals
  • Dana Angluin, James Aspnes and Aryeh Kontorovich
  • New Analysis and Algorithm for Learning with Drifting Distributions
  • Mehryar Mohri and Andres Muñoz Medina
  • On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples
  • Shai Ben-David and Ruth Urner
  • Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis and Thomas Zeugmann
  • Efficient Protocols for Distributed Classification and Optimization
  • Hal Daumé III, Jeff M. Phillips, Avishek Saha and Suresh Venkatasubramanian --
  • Declarative Modeling for Machine Learning and Data Mining
  • Luc De Raedt
  • Learnability beyond Uniform Convergence
  • Shai Shalev-Shwartz
  • Some Rates of Convergence for the Selected Lasso Estimator
  • Pascal Massart and Caroline Meynet
  • Ronald Ortner, Daniil Ryabko, Peter Auer and Rémi Munos
  • Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples
  • Alexandra Carpentier and Rémi Munos
  • Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret
  • Edward Moroshko and Koby Crammer
  • Online Prediction under Submodular Constraints
  • Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Kiyohito Nagano
  • Lower Bounds on Individual Sequence Regret
  • Eyal Gofer and Yishay Mansour
  • A Closer Look at Adaptive Regret
  • The Safe Bayesian
  • Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov and Vladimir Vovk
  • Partial Monitoring with Side Information
  • Gábor Bartók and Csaba Szepesvári
  • PAC Bounds for Discounted MDPs
  • Tor Lattimore and Marcus Hutter
  • Buy Low, Sell High
  • Wouter M. Koolen and Vladimir Vovk
  • Kernelization of Matrix Updates, When and How?
  • Manfred K. Warmuth, Wojciech Kotłowski and Shuisheng Zhou
  • Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes
  • Learning the Learning Rate via the Mixability Gap
  • Mrinalkanti Ghosh and Satyadev Nandakumar
  • Peter Grünwald
  • Data Stability in Clustering: A Closer Look
  • Lev Reyzin
  • Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
  • Emilie Kaufmann, Nathaniel Korda and Rémi Munos
  • Regret Bounds for Restless Markov Bandits
Control code
SPR812453532
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642341069
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...