Computational learning theory : proceedings
User Rating: Be the first one!
Author: Ben-David, Shai, Fischer, Paul, Vitányi, Paul M
Added by: sketch
Added Date: 2015-12-30
Language: eng
Publishers: Berlin [u.a.] : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540657010, 9783540657019
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 138.28 MB
PDF Size: 4.17 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 458
Views: 508
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 49097 3 archive t...torrent
Last Modified: 2022-03-09 08:50:17
Download
Size: 9.50 KB
Description
Computational Learning Theory: 4th European Conference, EuroCOLT’99 Nordkirchen, Germany, March 29–31, 1999 Proceedings
Author: Paul Fischer, Hans Ulrich Simon
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-65701-9
DOI: 10.1007/3-540-49097-3
Table of Contents:
Literaturangaben
Author: Paul Fischer, Hans Ulrich Simon
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-65701-9
DOI: 10.1007/3-540-49097-3
Table of Contents:
- Theoretical Views of Boosting
- Open Theoretical Questions in Reinforcement Learning
- A Geometric Approach to Leveraging Weak Learners
- Query by Committee, Linear Separation and Random Walks
- Hardness Results for Neural Network Approximation Problems
- Learnability of Quantified Formulas
- Learning Multiplicity Automata from Smallest Counterexamples
- Exact Learning when Irrelevant Variables Abound
- An Application of Codes to Attribute-Efficient Learning
- Learning Range Restricted Horn Expressions
- On the Asymptotic Behavior of a Constant Stepsize Temporal-Difference Learning Algorithm
- Direct and Indirect Algorithms for On-line Learning of Disjunctions
- Averaging Expert Predictions
- On Teaching and Learning Intersection-Closed Concept Classes
- Avoiding Coding Tricks by Hyperrobust Learning
- Mind Change Complexity of Learning Logic Programs
- Regularized Principal Manifolds
- Distribution-Dependent Vapnik-Chervonenkis Bounds
- Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition
- On Error Estimation for the Partitioning Classification Rule
Literaturangaben
You May Also Like
We will be happy to hear your thoughts