Cover Image

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tatlı, Meltem, Mukherjee, Arpan, A., Prashanth L., Shanmugam, Karthikeyan, Tajer, Ali
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)

Robust Causal Bandits for Linear Models
by: Yan, Zirui, et al.
Published: (2023)

Improved Bound for Robust Causal Bandits with Linear Models
by: Yan, Zirui, et al.
Published: (2024)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
by: Sharma, Nihal, et al.
Published: (2021)

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
by: Vijayan, Sushant, et al.
Published: (2025)

General Identifiability and Achievability for Causal Representation Learning
by: Varıcı, Burak, et al.
Published: (2023)

Linear Causal Representation Learning from Unknown Multi-node Interventions
by: Varıcı, Burak, et al.
Published: (2024)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
by: Varude, Chanakya, et al.
Published: (2025)

Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
by: Dasgupta, Arpan, et al.
Published: (2024)

Score-based Causal Representation Learning: Linear and General Transformations
by: Varıcı, Burak, et al.
Published: (2024)

Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Linear Causal Bandits: Unknown Graph and Soft Interventions
by: Yan, Zirui, et al.
Published: (2024)

ROPES: Robotic Pose Estimation via Score-Based Causal Representation Learning
by: Kulkarni, Pranamya, et al.
Published: (2025)

No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
by: Losalka, Arpan, et al.
Published: (2024)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms
by: Zhang, Qining, et al.
Published: (2023)

Fixed-Budget Constrained Best Arm Identification in Grouped Bandits
by: Mukherjee, Raunak, et al.
Published: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

EVaR-Optimal Arm Identification in Bandits
by: Ahmadipour, Mehrasa, et al.
Published: (2025)

Lasso Bandit with Compatibility Condition on Optimal Arm
by: Lee, Harin, et al.
Published: (2024)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)

Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
by: Simchi-Levi, David, et al.
Published: (2023)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

Efficient and Interpretable Bandit Algorithms
by: Mukherjee, Subhojyoti, et al.
Published: (2023)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
by: Qian, Jian, et al.
Published: (2026)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)

Be More Diverse than the Most Diverse: Optimal Mixtures of Generative Models via Mixture-UCB Bandit Algorithms
by: Rezaei, Parham, et al.
Published: (2024)

Neural Risk-sensitive Satisficing in Contextual Bandits
by: Ito, Shogo, et al.
Published: (2025)

Causal Bandits with General Causal Models and Interventions
by: Yan, Zirui, et al.
Published: (2024)