PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kale, Satyen"

Author of the publication

copydeleteadd this publication to your clipboard
Parameter-free online learning via model selection.

, , , and . CoRR, (2018)

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 Kale, Satyen
add a person with the name Kale, Satyen
 

Other publications of authors with the same name

Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria., and . NIPS, page 625-632. Curran Associates, Inc., (2007)Learning rotations with little regret., , and . Machine Learning, 104 (1): 129-148 (2016)Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization., and . J. Mach. Learn. Res., 15 (1): 2489-2512 (2014)Logarithmic regret algorithms for online convex optimization., , and . Machine Learning, 69 (2-3): 169-192 (2007)A simple multi-armed bandit algorithm with optimal variation-bounded regret., and . COLT, volume 19 of JMLR Proceedings, page 817-820. JMLR.org, (2011)Preface: Conference on Learning Theory (COLT), 2017., and . COLT, volume 65 of Proceedings of Machine Learning Research, page 1-3. PMLR, (2017)Stochastic Negative Mining for Learning with Large Output Spaces., , , , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 1940-1949. PMLR, (2019)Parameter-Free Online Learning via Model Selection., , , and . NIPS, page 6020-6030. (2017)Agnostic Learnability of Halfspaces via Logistic Loss., , , , and . CoRR, (2022)Efficient aggregation algorithms for probabilistic data., , and . SODA, page 346-355. SIAM, (2007)