Research map / Bandits and online learning / Online convex optimization and games
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms
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
- A Theoretical Perspective for Speculative Decoding Algorithm (NeurIPS 2024 · similarity 0.86)
- Minimum Entropy Coupling with Bottleneck (NeurIPS 2024 · similarity 0.84)
- Confidence-Based Decoding is Provably Efficient for Diffusion Language Models (NeurIPS 2026 · similarity 0.84)
- Tokenized Bandit for LLM Decoding and Alignment (ICML 2025 · similarity 0.84)
- Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata (NeurIPS 2026 · similarity 0.84)
- Fast Large Language Model Collaborative Decoding via Speculation (ICML 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.