Imagen de Portada

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Keqin, Weber, Richard, Zhang, Chengzhong
Formato:	Preprint
Publicado:	2021
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Relaxed Indexability and Index Policy for Partially Observable Restless Bandits
por: Liu, Keqin
Publicado: (2021)

Model Predictive Control is Almost Optimal for Restless Bandit
por: Gast, Nicolas, et al.
Publicado: (2024)

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
por: Xiong, Guojun, et al.
Publicado: (2024)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
por: Narasimha, Dheeraj, et al.
Publicado: (2025)

Lagrangian Index Policy for Restless Bandits with Average Reward
por: Avrachenkov, Konstantin, et al.
Publicado: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
por: Tran-The, Hung, et al.
Publicado: (2022)

The Vizier Gaussian Process Bandit Algorithm
por: Song, Xingyou, et al.
Publicado: (2024)

Contextual Bandits with Budgeted Information Reveal
por: Gan, Kyra, et al.
Publicado: (2023)

Faster Q-Learning Algorithms for Restless Bandits
por: Kakarapalli, Parvish, et al.
Publicado: (2024)

Learning to Sparsify Stochastic Linear Bandits
por: Wang, Zhengmiao, et al.
Publicado: (2026)

Bandit Convex Optimisation
por: Lattimore, Tor
Publicado: (2024)

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption
por: Hong, Yige, et al.
Publicado: (2023)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
por: Zhang, Liang, et al.
Publicado: (2023)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
por: Barakat, Anas, et al.
Publicado: (2026)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
por: Su, Yuexin, et al.
Publicado: (2025)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
por: Zhang, Richard Y.
Publicado: (2021)

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
por: Zhang, Richard Y.
Publicado: (2025)

Decentralized Contextual Bandits with Network Adaptivity
por: Deng, Chuyun, et al.
Publicado: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
por: Zibaie, Arghavan, et al.
Publicado: (2025)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
por: Crawshaw, Michael, et al.
Publicado: (2025)

Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms
por: Gu, Bin, et al.
Publicado: (2024)

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity
por: Chu, Tianshu, et al.
Publicado: (2024)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
por: Maran, Davide, et al.
Publicado: (2026)

Online Newton Method for Bandit Convex Optimisation
por: Fokkema, Hidde, et al.
Publicado: (2024)

Tight Rates for Bandit Control Beyond Quadratics
por: Sun, Y. Jennifer, et al.
Publicado: (2024)

Combinatorial Causal Bandits without Graph Skeleton
por: Feng, Shi, et al.
Publicado: (2023)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
por: Boveiri, Mohammad, et al.
Publicado: (2024)

Bandit Allocational Instability
por: Chen, Yilun, et al.
Publicado: (2026)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
por: Zhan, Jingxin, et al.
Publicado: (2025)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
por: Li, Yuchen, et al.
Publicado: (2024)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
por: Li, Xuheng, et al.
Publicado: (2024)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
por: Park, Jiho, et al.
Publicado: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
por: Yahmed, Ahmed Ben, et al.
Publicado: (2025)

Whittle Index Learning Algorithms for Restless Bandits with Constant Stepsizes
por: Mittal, Vishesh, et al.
Publicado: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
por: Hua, Youqing, et al.
Publicado: (2024)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
por: Choi, Sunmook, et al.
Publicado: (2025)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
por: Li, Xuheng, et al.
Publicado: (2025)

Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
por: Guo, Xin, et al.
Publicado: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
por: Zhang, Gavin, et al.
Publicado: (2023)