Author of the publication

Online discovery of similarity mappings.

, , and . ICML, volume 227 of ACM International Conference Proceeding Series, page 767-774. ACM, (2007)

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

Online discovery of similarity mappings., , and . ICML, volume 227 of ACM International Conference Proceeding Series, page 767-774. ACM, (2007)ResNet., , , , , , , , , and 1 other author(s). Computer-Aided Analysis of Gastrointestinal Videos, Springer, (2021)On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities., and . COLT, volume 65 of Proceedings of Machine Learning Research, page 1704-1722. PMLR, (2017)BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits., and . ICML, volume 48 of JMLR Workshop and Conference Proceedings, page 1977-1985. JMLR.org, (2016)Online Learning: Sufficient Statistics and the Burkholder Method., , and . COLT, volume 75 of Proceedings of Machine Learning Research, page 3028-3064. PMLR, (2018)Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization., , and . ICML, icml.cc / Omnipress, (2012)On the Risk of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels., , and . CoRR, (2019)Convex and Non-Convex Optimization under Generalized Smoothness, , , , and . (2023)cite arxiv:2306.01264Comment: 39 pages.Information-Based Complexity, Feedback and Dynamics in Convex Programming., and . IEEE Trans. Inf. Theory, 57 (10): 7036-7056 (2011)High-Probability Regret Bounds for Bandit Online Linear Optimization., , , , , and . COLT, page 335-342. Omnipress, (2008)