Publication

Universal and adaptive methods for robust stochastic optimization

Related publications (172)

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.

Universal and adaptive methods for robust stochastic optimization

Graph Chatbot

Chat with Graph Search

An accelerated communication-efficient primal-dual optimization framework for structured machine learning

Safe Convex Learning under Uncertain Constraints

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Mean-Field methods for Structured Deep-Learning in Computer Vision

Distributed Optimization and Control using Operator Splitting Methods

Learning without Smoothness and Strong Convexity

A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Fast and robust estimation of NODDI parameters using non-Gaussian noise models and spatial regularization

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

A real-time optimal inverse planning for Gamma Knife radiosurgery by convex optimization: description of the system and first dosimetry data