{"paper_id":"2406.06552","title":"Optimizing Sharpe Ratio: Risk-Adjusted Decision-Making in Multi-Armed Bandits","authors":["Sabrina Khurshid","Mohammed Shahid Abdulla","Gourab Ghatak"],"paper_date":"2024-05-28","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2406.06552v1","page_url":"https://thequant.space/flowcharts/optimizing-sharpe-ratio-risk-adjusted-decision-making-in-mu/","scores":{"empirical_rigor":4,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a novel multi-armed bandit algorithm called UCB-RSSR for regret minimization of the regularized square Sharpe Ratio, and three best-arm identification algorithms SHVV, SHSR, and SuRSR for a fixed budget setting.","quote":"In this regard, we propose a novel multi-armed bandit (MAB) algorithm for RM called UCB-RSSR for RSSR maximization. Based on this, we propose a risk-averse bandit algorithm UCB-RSSR and derive its regret guarantee.","summary":"Sharpe Ratio (SR) is a critical parameter in characterizing financial time series as it jointly considers the reward and the volatility of any stock/portfolio through its variance. Deriving online algorithms for optimizing the SR is particularly challenging since even offline policies experience…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Rewards are bounded, which is required for the derived concentration inequalities for RSSR.","type":"statistical","stated":"explicit","quote":"Leveraging McDiarmid’s inequality, McDiarmid et al (1989), we derive the regret of UCB-VV and show it to scale logarithmically. • In section 4, leveraging McDiarmid’s inequality McDiarmid et al (1989) and Hoeffding’s inequality Hoeffding (1994), we derive a novel concentration inequality for SR-like for bounded rewards.","support":"full"},{"assumption":"The regret analysis of UCB-RSSR is performed for the two‑armed bandit case.","type":"model","stated":"explicit","quote":"Based on that, we derive the regret guarantees of UCB-RSSR and show that it evolves as O(log n) for the two-armed bandit case played for a horizon n.","support":"full"},{"assumption":"The regularized square Sharpe Ratio (RSSR) is used instead of the standard Sharpe Ratio.","type":"model","stated":"explicit","quote":"Thus, instead of optimizing the usual definition of SR, we optimize regularized square SR (RSSR).","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"UCB-RSSR achieves a regret that scales as O(log n) for the two‑armed case.","kind":"theoretical","quote":"Based on that, we derive the regret guarantees of UCB-RSSR and show that it evolves as O(log n) for the two-armed bandit case played for a horizon n.","support":"full"},{"finding":"UCB-RSSR outperforms the previously known SR‑optimizing bandit algorithm U‑UCB.","kind":"performance","quote":"We demonstrate that UCB-RSSR outperforms the only other known SR optimizing bandit algorithm, U-UCB Cassel et al (2023).","support":"full"},{"finding":"The proposed BAI algorithms (SHVV, SHSR, SuRSR) have provable upper bounds on their error probabilities.","kind":"theoretical","quote":"We derive the upper bound for the error probability of all proposed BAI algorithms. We derive the upper bound on the probability of error for each of them. • Next, in section 7, we provide numerical results for algorithms UCB-RSSR, SHVV, SHSR, and SuRSR.","support":"full"},{"finding":"UCB-RSSR shows lower regret than Modified‑GRA‑UCB and Modified‑MVTS across several bounded‑distribution experiments.","kind":"performance","quote":"For both values of K, the regret of UCB-RSSR is less than Modified-GRA-UCB and Modified-MVTS. We see that the regret for Modified-GRA-UCB and UCB-RSSR is far less as compared to the regret for Modified-MVTS.","support":"full"},{"finding":"Among the BAI methods, SHSR consistently exhibits the lowest error probability across multiple experimental setups.","kind":"performance","quote":"The trend is similar for all the algorithms, with SHSR having the lowest error. The error of SHSR is least compared to SuRSR and uniform sampling through all experiments.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":28,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:56:59Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}