Research map / Bandits and online learning / Online convex optimization and games
A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
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
- Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets (NeurIPS 2025 · similarity 0.84)
- Online Resource Allocation With General Constraints (NeurIPS 2026 · similarity 0.84)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.84)
- Online Markov Decision Processes Configuration with Continuous Decision Space (AAAI 2024 · similarity 0.83)
- Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods (ICML 2024 · similarity 0.82)
- Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint (AAAI 2025 · similarity 0.82)
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.