Cover Image

Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Juneja, Ishank, Joe-Wong, Carlee, Yağan, Osman
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

Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy
by: Juneja, Ishank, et al.
Published: (2025)

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

FedSPD: A Soft-clustering Approach for Personalized Decentralized Federated Learning
by: Lin, I-Cheng, et al.
Published: (2024)

Intelligent Communication Planning for Constrained Environmental IoT Sensing with Reinforcement Learning
by: Hu, Yi, et al.
Published: (2023)

An LLM-Based Digital Twin for Optimizing Human-in-the Loop Systems
by: Yang, Hanqing, et al.
Published: (2024)

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

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability
by: Soni, Ashutosh, et al.
Published: (2026)

Analysis and Optimization of Robustness in Multiplex Flow Networks Against Cascading Failures
by: İrsoy, Orkun, et al.
Published: (2025)

The Ground Cost for Optimal Transport of Angular Velocity
by: Elamvazhuthi, Karthik, 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)

Neural Approximators for Low-Thrust Trajectory Transfer Cost and Reachability
by: Zhang, Zhong, et al.
Published: (2025)

Stability-informed Bayesian Optimization for MPC Cost Function Learning
by: Hirt, Sebastian, et al.
Published: (2024)

Neural Combinatorial Clustered Bandits for Recommendation Systems
by: Atalar, Baran, et al.
Published: (2024)

Bandits with Anytime Knapsacks
by: Elumar, Eray Can, et al.
Published: (2025)

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

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part II
by: Tian, Yi, et al.
Published: (2026)

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part I
by: Tian, Yi, et al.
Published: (2022)

Integrated Optimization and Game Theory Framework for Fair Cost Allocation in Community Microgrids
by: Babu, K. Victor Sam Moses, et al.
Published: (2025)

Cost-aware LLM-based Online Dataset Annotation
by: Elumar, Eray Can, et al.
Published: (2025)

FIRE: A Failure-Adaptive Reinforcement Learning Framework for Edge Computing Migrations
by: Siew, Marie, et al.
Published: (2022)

Fixed Horizon Linear Quadratic Covariance Steering in Continuous Time with Hilbert-Schmidt Terminal Cost
by: Sial, Tushar, 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)

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

Schrödinger Bridge with Quadratic State Cost is Exactly Solvable
by: Teter, Alexis M. H., et al.
Published: (2024)

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

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

Proactive Load-Shaping Strategies with Privacy-Cost Trade-offs in Residential Households based on Deep Reinforcement Learning
by: Zhang, Ruichang, et al.
Published: (2024)

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

Weyl Calculus and Exactly Solvable Schrödinger Bridges with Quadratic State Cost
by: Teter, Alexis M. H., et al.
Published: (2024)

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

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

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

Feasible Policy Iteration for Safe Reinforcement Learning
by: Yang, Yujie, et al.
Published: (2023)

Multi-Target Radar Search and Track Using Sequence-Capable Deep Reinforcement Learning
by: Ewers, Jan-Hendrik, et al.
Published: (2025)

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

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

Risk-Aware Decision Making in Restless Bandits: Theory and Algorithms for Planning and Learning
by: Akbarzadeh, Nima, et al.
Published: (2024)

Discovering Nonlinear Static Relationships in Unlabeled Dataset using Autoencoder with Ordered Variance
by: Augustine, Midhun T., et al.
Published: (2024)