atlas

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

Online Non-Convex Optimization with Imperfect Feedback

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 5 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
Use entropic regularization rather than L2 regularization (ablation)Dual averaging with unbiased feedback · Online non-convex optimizationstatic regret: \bigoh(\nRuns^{\frac{\vdim+1}{\vdim+2}}) with L2 regularization; \bigoh(\nRuns^{1/2}) with entropic regularizationHelped
Construct smoothed loss models from realized losses and add explicit explorationDual averaging with Hedge variant · Online non-convex optimization, bandit feedbackstatic regret: \bigoh(\nRuns^{\frac{\vdim+2}{\vdim+3}})Helped
Tune the smoothing radius to balance estimator bias and varianceBDA · Online non-convex optimization, bandit feedbackstatic regret: \bigoh(\nRuns^{\frac{\vdim+2}{\vdim+3}})Helped

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