07168af6cb0ef9f78dae15739dd73255-Paper.pdf

Feb-7-2026, 09:14:51 GMT–Neural Information Processing Systems

Our algorithm is based on an abstract (and simple) reduction to online convex optimization, which efficiently converts an arbitrary online convex optimizer to a boosting algorithm. Moreover, this reduction extends to the statistical as well astheonlinerealizablesettings, thusunifying the4casesofstatistical/online and agnostic/realizableboosting.

algorithm, artificial intelligence, machine learning, (13 more...)

Neural Information Processing Systems

Feb-7-2026, 09:14:51 GMT

Conferences PDF

Add feedback

Country:
- Europe > Spain
  - Catalonia > Barcelona Province > Barcelona (0.04)
- North America
  - Canada > British Columbia
    - Metro Vancouver Regional District > Vancouver (0.04)
  - United States > New York
    - Monroe County > Rochester (0.04)
- Oceania > Australia
  - New South Wales > Sydney (0.04)

Technology:
- Information Technology > Artificial Intelligence > Machine Learning (0.68)

Duplicate Docs Excel Report

Title
Online Agnostic Boosting via Regret Minimization

Similar Docs Excel Report more

Title	Similarity	Source
None found