arXiv:2210.07808
Optimal AdaBoost Converges
원문 초록
The following work is a preprint collection of formal proofs regarding the convergence properties of the AdaBoost machine learning algorithm's classifier and margins. Various math and computer science papers have been written regarding conjectures and special cases of these convergence properties. Furthermore, the margins of AdaBoost feature prominently in the research surrounding the algorithm. At the zenith of this paper we present how AdaBoost's classifier and margins converge on a value that agrees with decades of research. After this, we show how various quantities associated with the combined classifier converge.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Personalized Exercise Recommendation with Semantically-Grounded Knowledge Tracing
Reasoning or Memorization? Unreliable Results of Reinforcement Learning Due to Data Contamination
A Practical Two-Stage Recipe for Mathematical LLMs: Maximizing Accuracy with SFT and Efficiency with Reinforcement Learning
The Delta Learning Hypothesis: Preference Tuning on Weak Data can Yield Strong Gains
LLMThinkBench: Towards Basic Math Reasoning and Overthinking in Large Language Models
EvoAgentX: An Automated Framework for Evolving Agentic Workflows
토론
이 논문과 연결된 포럼 글이 아직 없습니다.