A decision-theoretic generalization of on-line learning and an application to boosting
Explore this paper's citation graph
Summary
The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
- Type
- article
- Published
- 1997-08-01
- Cited by
- 23,563
- References
- 31
- OpenAlex
- https://openalex.org/W1988790447
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6644398
Keywords
Boosting (machine learning), Multiplicative function, Bounded function, Computer science, Generalization
References
- Using experts for predicting continuous outcomes
- An Introduction to Computational Learning Theory
- Data filtering and distribution modeling algorithms for machine learning
- Solving Multiclass Learning Problems via Error-Correcting Output Codes
- An analog of the minimax theorem for vector payoffs.
- An Experimental and Theoretical Comparison of Model Selection Methods
- Approximate methods for sequential decision making using expert advice
- A game of prediction with expert advice
- Some special vapnik-chervonenkis classes
- How to use expert advice
- The weighted majority algorithm
- Boosting a weak learning algorithm by majority
- The Strength of Weak Learnability
- Game theory, on-line prediction and boosting
- Boosting Decision Trees
- Learning Sparse Perceptrons
- What Size Net Gives Valid Generalization?
- Boosting Performance in Neural Networks
- Contributions to the theory of games
- Aggregating strategies
Cited by
- A Modified Real AdaBoost algorithm to discover Intensive Care Unit subgroups with a poor outcome
- Surgical tools localization in 3D ultrasound images
- Foundations of Machine Learning
- A Knowledge Model Sharing Based Approach to Privacy-Preserving Data Mining
- A Feasibility Study of Bandwidth Smoothing on the World-Wide Web Using Machine Learning ; CU-CS-879-99
- Accelerating AdaBoost using UCB
- Apprentissage statistique pour la constitution des corpus d'évaluation
- Global vs. Local: Component Based Learning for Classification and Image Understanding
- Matching training and testing criteria in hybrid speech recognition systems
- Kernel Regression Trees
- Optimisation of Ensemble Classifiers using Genetic Algorithm
- Face Detection and Tracking in Dynamic Background of Street
- Data Mining and Visualization
- Classifying objects based on their visual similarity to target categories
- Improving representation and classification of image and video data for surveillance applications
- A voting-merging clustering algorithm
- Détection et reconnaissance de texte dans les documents vidéos. Et leurs apports à la reconnaissance de personnes
- An Incremental Neural Network for Online Supervised Learning and Topology Learning
- Entropy Guided Transformation Learning: Algorithms and Applications
- A Simple Algorithm for Learning Stable Machines
Related papers
- Researching on combining boosting ensembles
- A Brief Introduction to Boosting
- Resampling or Reweighting: A Comparison of Boosting Implementations
- A Boosting-like Online Learning Ensemble
- New explanation of boosting efficiency in classification problem
- New explanation of boosting efficiency in classification problem