Title |
|---|
 |
 Nearly Minimax Optimal Regret for Multinomial Logistic BanditNeural Information Processing Systems (NeurIPS), 2024 |
 Improved Regret Bounds of (Multinomial) Logistic Bandits via
Regret-to-Confidence-Set ConversionInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023 |
 A Doubly Robust Approach to Sparse Reinforcement LearningInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023 |
 Learning the Pareto Front Using Bootstrapped Observation SamplesInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023 |
 Improved Algorithms for Multi-period Multi-class Packing Problems with
Bandit FeedbackInternational Conference on Machine Learning (ICML), 2023 |
 Risk-aware linear bandits with convex lossInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022 |
 Squeeze All: Novel Estimator and Self-Normalized Bound for Linear
Contextual BanditsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022 |
