Sciweavers

EUROCOLT
1995
Springer
13 years 8 months ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
FSKD
2006
Springer
124views Fuzzy Logic» more  FSKD 2006»
13 years 8 months ago
An Effective Combination of Multiple Classifiers for Toxicity Prediction
This paper presents an investigation into the combination of different classifiers for toxicity prediction. These classification methods involved in generating classifiers for comb...
Gongde Guo, Daniel Neagu, Xuming Huang, Yaxin Bi
ATAL
2006
Springer
13 years 8 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
ALT
2004
Springer
13 years 8 months ago
Applications of Regularized Least Squares to Classification Problems
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
Nicolò Cesa-Bianchi
CAV
2010
Springer
251views Hardware» more  CAV 2010»
13 years 8 months ago
Automated Assume-Guarantee Reasoning through Implicit Learning
Abstract. We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learnin...
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Min...
ICML
1990
IEEE
13 years 8 months ago
Average Case Analysis of Conjunctive Learning Algorithms
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...
Michael J. Pazzani, Wendy Sarrett
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
13 years 8 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
COLT
1993
Springer
13 years 8 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
ICML
1996
IEEE
13 years 8 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
ALT
1999
Springer
13 years 8 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz