:: Library Catalog

Cover Image

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:	https://arxiv.org/abs/2504.20877
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Risk-sensitive Bandits: Arm Mixture Optimality 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)

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)

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

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)

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)

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

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

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

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

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

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, 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)

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)

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

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

SharedRep-RLHF: A Shared Representation Approach to RLHF with Diverse Preferences
by: Mukherjee, Arpan, et al.
Published: (2025)

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

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

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

Selective classification using a robust meta-learning approach
by: Jain, Nishant, et al.
Published: (2022)

Glauber Generative Model: Discrete Diffusion Models via Binary Classification
by: Varma, Harshit, et al.
Published: (2024)

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

Representation Learning Preserving Ignorability and Covariate Matching for Treatment Effects
by: Nanavati, Praharsh, et al.
Published: (2025)

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)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

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

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)