Publication

Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms

Related publications (60)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms

Graph Chatbot

Chat with Graph Search

Learning Non-Parametric Models with Guarantees: A Smooth Lipschitz Interpolation Approach

A Generalized Representer Theorem for Hilbert Space - Valued Functions

Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint

Diffusion Learning In Non-Convex Environments

Local SGD Converges Fast and Communicates Little

Learning Positive Functions with Pseudo Mirror Descent

Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise

Machine Learning at the Atomic Scale

Machine Learning at the Atomic Scale