PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Perchet, Vianney"

Author of the publication

copydeleteadd this publication to your clipboard
Approachability, Regret and Calibration; implications and equivalences

. CoRR, (2013)

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.

No persons found for author name Perchet, Vianney
add a person with the name Perchet, Vianney
 

Other publications of authors with the same name

Approachability, Regret and Calibration; implications and equivalences. CoRR, (2013)Bandits with Side Observations: Bounded vs. Logarithmic Regret., , and . UAI, page 467-476. AUAI Press, (2018)Batched Bandit Problems., , , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1456. JMLR.org, (2015)Bounded regret in stochastic multi-armed bandits., , and . COLT, volume 30 of JMLR Workshop and Conference Proceedings, page 122-134. JMLR.org, (2013)Bridging the gap between regret minimization and best arm identification, with application to A/B tests., , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 1988-1996. PMLR, (2019)Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe., and . NIPS, page 2225-2234. (2017)An algorithmic solution to the Blotto game using multi-marginal couplings., , and . CoRR, (2022)Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case., and . J. Mach. Learn. Res., (2016)Set-valued approachability and online learning with partial monitoring., , and . J. Mach. Learn. Res., 15 (1): 3247-3295 (2014)Calibration and Internal No-Regret with Random Signals.. ALT, volume 5809 of Lecture Notes in Computer Science, page 68-82. Springer, (2009)