Research map / Bandits and online learning / Online convex optimization and games
Learning-augmented Rent-or-Buy with a Sample
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
- Learning-Augmented Algorithms for the Bahncard Problem (NeurIPS 2024 · similarity 0.92)
- Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem (AAAI 2024 · similarity 0.88)
- Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions (NeurIPS 2020 · similarity 0.88)
- Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search (ICML 2025 · similarity 0.84)
- Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets (NeurIPS 2025 · similarity 0.84)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.84)
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.