Efficient online algorithms for fast-rate regret bounds under sparsity

Pierre Gaillard, Olivier Wintenberger

Feb-12-2026, 05:08:28 GMT–Neural Information Processing Systems

Weintroduceaweak versionofexp-concavity; see Assumption (A2). Let 0 2 0 beapointinthegrid 0 minimizing D( , 0).

artificial intelligence, assumption, machine learning, (17 more...)

Neural Information Processing Systems

Feb-12-2026, 05:08:28 GMT

Conferences PDF

Country:
- Asia > Middle East
  - Jordan (0.04)
- Europe
  - France > Île-de-France
    - Paris > Paris (0.05)
  - United Kingdom (0.04)
- North America > Canada
  - Quebec > Montreal (0.04)

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

Duplicate Docs Excel Report

Title
Efficient online algorithms for fast-rate regret bounds under sparsity
Efficient online algorithms for fast-rate regret bounds under sparsity

Similar Docs Excel Report more

Title	Similarity	Source
None found