Research map / Bandits and online learning / Online convex optimization and games
Online Decision Making with Generative Action Sets
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
- Online Learning with Sublinear Best-Action Queries (NeurIPS 2024 · similarity 0.89)
- Generator-Mediated Bandits: Thompson Sampling for GenAI-Powered Adaptive Interventions (NeurIPS 2025 · similarity 0.86)
- Reinforcing LLM Agents via Policy Optimization with Action Decomposition (NeurIPS 2024 · similarity 0.85)
- Grounded Answers for Multi-agent Decision-making Problem through Generative World Model (NeurIPS 2024 · similarity 0.85)
- MA-RLHF: Reinforcement Learning from Human Feedback with Macro Actions (ICLR 2025 · similarity 0.85)
- Do LLM Agents Have Regret? A Case Study in Online Learning and Games (ICLR 2025 · 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.