Author of the publication

Open Problem: Better Bounds for Online Logistic Regression.

, and . COLT, volume 23 of JMLR Proceedings, page 44.1-44.3. JMLR.org, (2012)

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

Generative Models for Effective ML on Private, Decentralized Datasets., , , , , , , and . CoRR, (2019)Ad click prediction: a view from the trenches, , , , , , , , , and 1 other author(s). Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, page 1222--1230. ACM, (2013)Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and Implicit Updates. CoRR, (2010)Distributed Mean Estimation with Limited Communication., , , and . CoRR, (2016)Federated Learning of Deep Networks using Model Averaging., , , and . CoRR, (2016)Communication-Efficient Learning of Deep Networks from Decentralized Data, , , , and . (2016)Towards Federated Learning at Scale: System Design., , , , , , , , , and 4 other author(s). CoRR, (2019)Multi-Epoch Matrix Factorization Mechanisms for Private Machine Learning., , , and . CoRR, (2022)Towards Federated Learning at Scale: System Design, , , , , , , , , and 4 other author(s). (2019)cite arxiv:1902.01046.Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization.. AISTATS, volume 15 of JMLR Proceedings, page 525-533. JMLR.org, (2011)