Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Robustifying AdaBoost by adding the naive error rate.

Takashi Takenouchi1, Shinto Eguchi

  • 1Department of Statistical Science, Graduate University of Advanced Studies, Tokyo, Japan.

Neural Computation
|March 18, 2004
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Area under the curve-optimized synthesis of prediction models from a meta-analytical perspective.

Research synthesis methods·2022
Same author

Generalized quasi-linear mixed-effects model.

Statistical methods in medical research·2022
Same author

Copula-based measures of asymmetry between the lower and upper tail probabilities.

Statistical papers (Berlin, Germany)·2022
Same author

Novel robust time series analysis for long-term and short-term prediction.

Scientific reports·2021
Same author

A Unified Formulation of k-Means, Fuzzy c-Means and Gaussian Mixture Model by the Kolmogorov-Nagumo Average.

Entropy (Basel, Switzerland)·2021
Same author

Quasi-linear Cox proportional hazards model with cross- L<sub>1</sub> penalty.

BMC medical research methodology·2020
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

This study introduces a modified AdaBoost algorithm that reduces overlearning and improves robustness by incorporating a forgetfulness effect. This new boosting method enhances classification accuracy through a mixed loss function, addressing AdaBoost

Area of Science:

  • Machine Learning
  • Computer Science
  • Statistical Learning

Background:

  • AdaBoost (Adaptive Boosting) is a machine learning algorithm derived from sequential minimization of the exponential loss function.
  • AdaBoost exponentially reweights training examples, but can suffer from nonrobustness and overlearning due to sharply tuned weights.

Purpose of the Study:

  • To propose a novel boosting method that modifies AdaBoost to enhance robustness and reduce overlearning.
  • To introduce a forgetfulness effect into the AdaBoost algorithm.

Main Methods:

  • A new boosting method is proposed, slightly modifying the standard AdaBoost algorithm.
  • The modified method utilizes a loss function that is a mixture of the exponential loss and naive error loss functions.
  • The statistical significance and performance are evaluated through simulations.

Related Experiment Videos

Main Results:

  • The proposed method successfully incorporates a forgetfulness effect into AdaBoost.
  • The modifications aim to mitigate issues of nonrobustness and overlearning inherent in the original AdaBoost algorithm.
  • Simulations are presented to confirm the effectiveness and statistical significance of the new method.

Conclusions:

  • The proposed modified AdaBoost algorithm offers improved robustness and reduced overlearning.
  • The incorporation of a mixed loss function effectively introduces a forgetfulness effect, enhancing the boosting process.
  • The new method provides a statistically significant advancement in boosting techniques.