Author of the publication

Pure Exploration in Bandits with Linear Constraints.

, , , and . AISTATS, volume 238 of Proceedings of Machine Learning Research, page 334-342. PMLR, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

BelMan: An Information-Geometric Approach to Stochastic Bandits., , and . ECML/PKDD (3), volume 11908 of Lecture Notes in Computer Science, page 167-183. Springer, (2019)Differential Privacy at Risk: Bridging Randomness and Privacy Budget., , and . CoRR, (2020)Topological Data Analysis with ϵ -net Induced Lazy Witness Complex., , and . DEXA (2), volume 11707 of Lecture Notes in Computer Science, page 376-392. Springer, (2019)Top-k Queries Over Uncertain Scores., , , and . OTM Conferences, volume 10033 of Lecture Notes in Computer Science, page 245-262. (2016)Algorithmic Fairness Verification with Graphical Models., , and . AAAI, page 9539-9548. AAAI Press, (2022)Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback., , and . AAAI, page 10381-10390. AAAI Press, (2022)Fair Set Selection: Meritocracy and Social Welfare., , , and . CoRR, (2021)A Novel Strategy Adaptive Genetic Algorithm with Greedy Local Search for the Permutation Flowshop Scheduling Problem., , , and . SEMCCO, volume 7677 of Lecture Notes in Computer Science, page 687-696. Springer, (2012)When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits., and . NeurIPS, (2022)CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption., , , and . ALT, volume 237 of Proceedings of Machine Learning Research, page 74-124. PMLR, (2024)