atlas

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

Likelihood Ratio Confidence Sets for Sequential Decision Making

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 1 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 likelihood-ratio confidence sets instead of other provably valid confidence setsUCB with RKHS payoff functions · Gaussian additive-noise banditcumulative regretHelped
Use likelihood-ratio confidence sets instead of other provably valid confidence setsUCB with RKHS payoff functions · Laplace additive-noise banditcumulative regretHelped
Apply adaptive bias-weighting instead of setting all weights to 1 (ablation)LR confidence sets for UCB · Gaussian additive-noise banditcumulative regretHelped
Use LR confidence sets instead of heuristic-confidence alternativesUCB · Poisson banditcumulative regretHelped
Use LR confidence sequences instead of sub-exponential confidence setsUCB for transformed Weibull survival observations · Weibull survival analysis (p=2)cumulative regretHelped
Use LR confidence sets instead of heuristic confidence setsUCB with RKHS payoff functions · Gaussian and Laplace additive-noise banditscumulative regretNo clear effect

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