Boosting with the Logistic Loss is Consistent
원문 초록
This manuscript provides optimization guarantees, generalization bounds, and statistical consistency results for AdaBoost variants which replace the exponential loss with the logistic and similar losses (specifically, twice differentiable convex losses which are Lipschitz and tend to zero on one side). The heart of the analysis is to show that, in lieu of explicit regularization and constraints, the structure of the problem is fairly rigidly controlled by the source distribution itself. The first control of this type is in the separable case, where a distribution-dependent relaxed weak learning rate induces speedy convergence with high probability over any sample. Otherwise, in the nonseparable case, the convex surrogate risk itself exhibits distribution-dependent levels of curvature, and consequently the algorithm's output has small norm with high probability.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Non-Vacuous Generalization Bounds from Optimization
Learning Where to Learn: Training Distribution Selection for Provable OOD Performance
Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization
Graph Representational Learning: When Does More Expressivity Hurt Generalization?
Model Steering: Learning with a Reference Model Improves Generalization Bounds and Scaling Laws
Achieving Distributive Justice in Federated Learning via Uncertainty Quantification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.