( en | de | ru )

 

Disambiguation of "Rakhlin, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Online Learning: Random Averages, Combinatorial Parameters, and Learnability.

, , and . NIPS, page 1984-1992. Curran Associates, Inc., (2010)

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.

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

Other publications of authors with the same name

On the Risk of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels., , and . CoRR, (2019)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 Detection and Structural Reconstruction of Small-World Random Networks., , and . IEEE Trans. Network Science and Engineering, 4 (3): 165-176 (2017)Online Learning with Predictable Sequences, and . CoRR, (2012)Relax and Localize: From Value to Algorithms, , and . CoRR, (2012)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)