No article text was recorded for this version.
action space scalability
Version 2 of 2417 papers476 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
- Blog: Top-k eXtreme Contextual Bandits with Arm Hierarchy
- Blog: Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
- Blog: Fast Online Inference for Nonlinear Contextual Bandit Based on Generative Adversarial Network
- Blog: Sparse Nonparametric Contextual Bandits
- Blog: On Regret with Multiple Best Arms
- Blog: Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds
- Blog: Improved Regret of Linear Ensemble Sampling
- Blog: A simple multi-armed bandit algorithm with optimal variation-bounded regret
- Blog: Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards
- Blog: Parallelizing Thompson Sampling
- Blog: Efficient Learning in Large-Scale Combinatorial Semi-Bandits
- Blog: PAC Identification of a Bandit Arm Relative to a Reward Quantile
- Blog: Linear Contextual Bandits with Knapsacks
- Blog: Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
- Blog: Contextual Multinomial Logit Bandits with General Value Functions
- Blog: Generalized Low-Rank Matrix Contextual Bandits with Graph Information
- Blog: An Information-Theoretic Analysis for Thompson Sampling with Many Actions
- Blog: Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits
- Blog: Bi-level Hierarchical Neural Contextual Bandits for Online Recommendation
- Blog: An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits
- Blog: Latent Bandits Revisited
- Blog: Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
- Blog: Bandits with Abstention under Expert Advice
- Blog: Linear Contextual Bandits with Global Constraints and Objective
- Blog: Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
- Blog: From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
- Blog: Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits
- Blog: Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits
- Blog: Efficient Swap Regret Minimization in Combinatorial Bandits
- Blog: Does Stochastic Gradient really succeed for bandits?
- Blog: Doubly-Robust Lasso Bandit
- Blog: Contextual Combinatorial Bandits with Probabilistically Triggered Arms
- Blog: Exploring k out of Top $ρ$ Fraction of Arms in Stochastic Bandits
- Blog: Contextual Bandits with Large Action Spaces: Made Practical
- Blog: Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits
- Blog: An Information-Theoretic Analysis of Nonstationary Bandit Learning
- Blog: Cascading Bandits
- Blog: Online Bidding under RoS Constraints without Knowing the Value
- Blog: Thompson Sampling for Contextual Bandits with Linear Payoffs
- Blog: Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality
- Blog: Identifying near-optimal decisions in linear-in-parameter bandit models with continuous decision sets
- Blog: From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces
- Blog: Top-k eXtreme Contextual Bandits with Arm Hierarchy
- Blog: Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games
- Blog: Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
- Blog: Optimal and Greedy Algorithms for Multi-Armed Bandits with Many Arms
- Blog: The K-armed Dueling Bandits Problem
- Blog: Feature and Parameter Selection in Stochastic Linear Bandits
- Blog: Multi-Armed Bandits on Unit Interval Graphs
- Blog: Algorithms for Infinitely Many-Armed Bandits
- Blog: An Analysis of Ensemble Sampling
- Blog: Contextual Bandit Learning with Predictable Rewards
- Blog: Reducing Dueling Bandits to Cardinal Bandits
- Blog: Speed Up the Cold-Start Learning in Two-Sided Bandits with Many Arms
- Blog: Revealing Graph Bandits for Maximizing Local Influence
- Blog: Matroid Bandits: Fast Combinatorial Optimization with Learning
- Blog: Achieving Limited Adaptivity for Multinomial Logistic Bandits
- Blog: Causal Bandits: Learning Good Interventions via Causal Inference
- Blog: Double Matching Under Complementary Preferences
Showing 60 of 417 papers.
History & citation
Current · Permanent link
- Variance Modulated Smoothness for Combinatorial Bandits merged into this direction (57% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_action_space_scalability_69157d62,
title = {action space scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/action-space-scalability/rdr_69157d6238e44539a5df1434749a8c2a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_action_space_scalability_69157d62_v2,
title = {action space scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/action-space-scalability/rdr_69157d6238e44539a5df1434749a8c2a/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}