Cover Image

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shah, Mohammad Taha, Khurshid, Sabrina, Ghatak, Gourab
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimizing Sharpe Ratio: Risk-Adjusted Decision-Making in Multi-Armed Bandits
by: Khurshid, Sabrina, et al.
Published: (2024)

Variance-Optimal Arm Selection: Misallocation Minimization and Best Arm Identification
by: Khurshid, Sabrina, et al.
Published: (2025)

Fine Grained Analysis and Optimization of Large Scale Automotive Radar Networks
by: Shah, Mohammad Taha, et al.
Published: (2024)

Distribution Bounds on the Conditional ROC in a Poisson Field of Interferers and Clutters
by: Ghatak, Gourab
Published: (2025)

Modeling and Statistical Characterization of Large-Scale Automotive Radar Networks
by: Shah, Mohammad Taha, et al.
Published: (2024)

Stochastic Information Geometry: Characterization of Fréchet Means of Gaussian Fields in Poisson Networks
by: Ghatak, Gourab
Published: (2025)

Target Tracking: Statistics of Successive Successful Target Detection in Automotive Radar Networks
by: Ghatak, Gourab
Published: (2024)

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

Best Arm Identification Based Beam Acquisition in Stationary and Abruptly Changing Environments
by: Ghatak, Gourab
Published: (2023)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

On Regret Bounds of Thompson Sampling for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2026)

Analysis of Age-Energy Trade-off in IoT Networks Using Stochastic Geometry
by: Das, Songita, et al.
Published: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
by: Tran-The, Hung, et al.
Published: (2020)

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

Joint Sleep Mode Activation and Load Balancing with Dynamic Cell Load: A Combinatorial Bandit Approach
by: Gilkar, Wajahat Bashir, et al.
Published: (2026)

Order-Optimal Sample Complexity of Rectified Flows
by: Sahoo, Hari Krishna, et al.
Published: (2026)

Age Optimal Sampling for Unreliable Channels under Unknown Channel Statistics
by: He, Hongyi, et al.
Published: (2024)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Sharp One-Dimensional Sub-Gaussian Comparison in Convex Order
by: Zhang, Yihan
Published: (2026)

Channel Access Strategies for Control-Communication Co-Designed Networks
by: Ghatak, Gourab, et al.
Published: (2024)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)

Block-Sample MAC-Bayes Generalization Bounds
by: Frey, Matthias, et al.
Published: (2026)

On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

Counterfactual Inference under Thompson Sampling
by: Jeunen, Olivier
Published: (2025)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
by: Ryu, J. Jon, et al.
Published: (2025)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

An Algorithm for Fixed Budget Best Arm Identification with Combinatorial Exploration
by: Parupudi, Siddhartha, et al.
Published: (2025)

Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)

Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications
by: Ghatak, Gourab, et al.
Published: (2024)

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
by: Naparstek, Oshri
Published: (2025)

Neural Probabilistic Shaping: Joint Distribution Learning for Optical Fiber Communications
by: Askari, Mohammad Taha, et al.
Published: (2025)