AI Paper Atlas

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

Online Decision-Focused Learning under Semi-Bandit Feedback

Aabhash Dhakal, Tim Lachner, Jayanta Mandi, Marco Foschini, Christoph M Flath

NeurIPS 2026 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure

Read the paperCheck your idea against 137,217 papers

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

Studies decision-focused learning in an online setting where the agent observes costs only for selected actions (semi-bandit feedback), rather than full cost vectors.

Problem

Decision-focused learning typically assumes offline full-feedback data with complete cost vectors, whereas many real-world decision systems operate online and observe costs only for the actions they select.

Approach

Extends decision-focused learning to online semi-bandit feedback, where predictive models are trained to minimize decision regret using only partial cost observations from past rounds. Details beyond the abstract are not available.

Experimental setup

Metrics: decision regret

Builds on: decision-focused learning predict-then-optimize

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