Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Doubly Robust Distributionally Robust Offline Contextual Pricing
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.
Closest papers by meaning
- Contextual Online Pricing with (Biased) Offline Data (NeurIPS 2025 · similarity 0.89)
- Distributionally Robust Policy Evaluation and Learning for Continuous Treatment with Observational Data (AAAI 2025 · similarity 0.87)
- Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand (NeurIPS 2026 · similarity 0.87)
- Distributionally Robust Performative Optimization (NeurIPS 2025 · similarity 0.86)
- Distributionally Robust Policy Learning under Concept Drifts (ICML 2025 · similarity 0.85)
- Large-Scale Non-convex Stochastic Constrained Distributionally Robust Optimization (AAAI 2024 · similarity 0.85)
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.