atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Robust Contextual Pricing

NeurIPS 2025 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 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.

Gives a regret bound O(C d log log T) for contextual pricing with C corrupted rounds via a black-box reduction to the uncorrupted algorithm.

Problem

Contextual pricing (online learning of a buyer's valuation from context) when some rounds are adversarially corrupted, where regret must degrade gracefully with the number of corruptions.

Approach

A reduction that treats the uncorrupted contextual pricing algorithm as a black box, rather than modifying its internals as in prior corrupted-setting work, yielding a regret of O(C d log log T) that improves on the earlier O(d^3 C log^2 T) bound and gives a conceptually simpler algorithm.

Key results

Experimental setup

Metrics: regret

Baselines: Krishnamurthy et al. corrupted contextual pricing algorithm

Builds on: Krishnamurthy et al. contextual pricing with corruptions

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