Cover Image

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Soni, Ashutosh, Ju, Peizhong, Eryilmaz, Atilla, Shroff, Ness B.
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

BeST -- A Novel Source Selection Metric for Transfer Learning
by: Soni, Ashutosh, et al.
Published: (2025)

Recurrent Natural Policy Gradient for POMDPs
by: Cayci, Semih, et al.
Published: (2024)

How to Find the Exact Pareto Front for Multi-Objective MDPs?
by: Li, Yining, et al.
Published: (2024)

Optimal Parallel Scheduling under Concave Speedup Functions
by: Li, Chengzhang, et al.
Published: (2025)

Byzantine-Resilient Decentralized Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2023)

Provable Last-Iterate Convergence for Multi-Objective Safe LLM Alignment via Optimistic Primal-Dual
by: Li, Yining, et al.
Published: (2026)

Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
by: Juneja, Ishank, et al.
Published: (2026)

Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2021)

Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis
by: Cayci, Semih, et al.
Published: (2024)

Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers
by: Liang, Yuchen, et al.
Published: (2024)

Broadening Target Distributions for Accelerated Diffusion Models via a Novel Analysis Approach
by: Liang, Yuchen, et al.
Published: (2024)

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

Finite-Time Analysis of Gradient Descent for Shallow Transformers
by: Arda, Enes, et al.
Published: (2026)

Lagrangian Relaxation for Multi-Action Partially Observable Restless Bandits: Heuristic Policies and Indexability
by: Meshram, Rahul, et al.
Published: (2025)

Can We Theoretically Quantify the Impacts of Local Updates on the Generalization Performance of Federated Learning?
by: Ju, Peizhong, et al.
Published: (2024)

Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards
by: Adams, Katherine B., et al.
Published: (2025)

Beyond Freshness and Semantics: A Coupon-Collector Framework for Effective Status Updates
by: Ahmed, Youssef, et al.
Published: (2026)

Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization
by: Cao, Linfeng, et al.
Published: (2025)

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

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
by: Manupriya, Piyushi, et al.
Published: (2025)

Multi-Agent Stage-wise Conservative Linear Bandits
by: Afsharrad, Amirhossein, et al.
Published: (2025)

An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2025)

On Policy Stochasticity in Mutual Information Optimal Control of Linear Systems
by: Enami, Shoju, et al.
Published: (2025)

Unlocking the Power of Rehearsal in Continual Learning: A Theoretical Perspective
by: Deng, Junze, et al.
Published: (2025)

Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
by: Özyıldırım, Emre, et al.
Published: (2026)

Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates
by: Badings, Thom, et al.
Published: (2024)

Bandit Algorithms for Deep Brain Stimulation
by: Gupta, Arkaprava, et al.
Published: (2026)

Finite Sample and Large Deviations Analysis of Stochastic Gradient Algorithm with Correlated Noise
by: Yin, George, et al.
Published: (2024)

Multi-Armed Sampling Problem and the End of Exploration
by: Pedramfar, Mohammad, et al.
Published: (2025)

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

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

Non-Federated Multi-Task Split Learning for Heterogeneous Sources
by: Zheng, Yilin, et al.
Published: (2024)

Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
by: Dai, Yan, et al.
Published: (2024)

Posterior Sampling-based Online Learning for Episodic POMDPs
by: Tang, Dengwang, et al.
Published: (2023)

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

Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling
by: Adibi, Arman, et al.
Published: (2024)

Model approximation in MDPs with unbounded per-step cost
by: Bozkurt, Berk, et al.
Published: (2024)

Transfer Learning for Control Systems via Neural Simulation Relations
by: Nadali, Alireza, et al.
Published: (2024)

Model-Free Change Point Detection for Mixing Processes
by: Chen, Hao, et al.
Published: (2023)

Restless Bandit Problem with Rewards Generated by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2024)