atlas

Research map / Bandits and online learning / Online convex optimization and games

Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace quadratic-in-d analysis with fine-grained FTRL regret decomposition (sub-Gaussian noise)FTRL for stochastic online linear regression · stochastic online linear regressionregret order in dHelped
Extend analysis from sub-Gaussian to Bernstein noise (bounded by R, variance σ^2)FTRL · stochastic online regressionregret bound formNo clear effect
Variance-aware layered FTRL (MOR-UCB) for heteroscedastic generalized linear banditsgeneralized linear bandits with heteroscedastic noise · heteroscedastic banditsregret orderHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy