atlas

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

Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand

NeurIPS 2026 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Proposes CMRUP, a polynomial-time contextual pricing algorithm (randomized Stage-1 estimation, conservative markdown residual-grid probing, redirect-UCB) claiming O~(T^{2/3}) regret under agnostic non-Lipschitz bounded noise, plus small synthetic experiments.

Problem

Contextual dynamic pricing with linear valuations and bounded agnostic noise whose demand curve may be discontinuous (atoms, jumps); prior best regret was O~(T^{3/4}) and smoothness-based transfer fails.

Approach

Estimate the linear component with uniformly randomized prices, then use a conservative markdown so each binary observation becomes a one-sided probe of adjacent survival levels on a one-dimensional residual grid; a UCB rule redirects to the left once confidence radii reach grid scale, paying discontinuity costs only in a limited exploration period.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: synthetic contextual pricing streams (uniform noise, cliff noise)

Benchmarks: synthetic uniform-noise pricing instance synthetic cliff-noise pricing instance

Metrics: cumulative pseudo-regret fitted log-log scaling exponent

Baselines: D2-EXP4

Builds on: D2-EXP4 UCB

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