Sciweavers

11910 search results - page 482 / 2382
» Online Learning Algorithms
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Democratic approximation of lexicographic preference models
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democra...
Fusun Yaman, Thomas J. Walsh, Michael L. Littman, ...
CICLING
2004
Springer
15 years 10 months ago
Korean Compound Noun Decomposition Using Syllabic Information Only
The compound nouns are freely composed in Korean, since it is possible to concatenate independent nouns without a postposition. Therefore, the systems that handle compound nouns su...
Seong-Bae Park, Jeong Ho Chang, Byoung-Tak Zhang
ICML
2006
IEEE
16 years 7 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...
NIPS
1997
15 years 8 months ago
Nonparametric Model-Based Reinforcement Learning
This paper describes some of the interactions of model learning algorithms and planning algorithms we have found in exploring model-based reinforcement learning. The paper focuses...
Christopher G. Atkeson
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik