Concept

Stochastic gradient descent

Related publications (431)

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.

Large Steps in Inverse Rendering of Geometry

Wenzel Alban Jakob, Baptiste Alexandre Marie Philippe Claude Nicolet

Inverse reconstruction from images is a central problem in many scientific and engineering disciplines. Recent progress on differentiable rendering has led to methods that can efficiently differentiate the full process of image formation with respect to mi ...

ASSOC COMPUTING MACHINERY2021

Is there an analog of Nesterov acceleration for gradient-based MCMC?

Nicolas Henri Bernard Flammarion, Xiang Cheng

We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback-Leibler (KL) divergence as the objective functional. We show that an under-damped form of the Langevin algorithm perfor ...

INT STATISTICAL INST2021

Trainable Preprocessing for Reduced Precision Neural Networks

Gabor Andras Csordas

Applications of neural networks are emerging in many fields and are frequently implemented in embedded environment, introducing power, throughput and latency constraints next to accuracy. Although practical computer vision solutions always involve some kin ...

EUROPEAN ASSOC SIGNAL SPEECH & IMAGE PROCESSING-EURASIP2021

Learning from History for Byzantine Robust Optimization

Martin Jaggi, Lie He, Sai Praneeth Reddy Karimireddy

Byzantine robustness has received significant attention recently given its importance for distributed and federated learning. In spite of this, we identify severe flaws in existing algorithms even when the data across the participants is identically distri ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Optimization methods for collaborative learning

Sai Praneeth Reddy Karimireddy

A traditional machine learning pipeline involves collecting massive amounts of data centrally on a server and training models to fit the data. However, increasing concerns about the privacy and security of user's data, combined with the sheer growth in the ...

EPFL2021

Competing Adaptive Networks

Ali H. Sayed, Stefan Vlaski

Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally optimal behavior, w ...

IEEE2021

PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees

Andreas Krause, Martin Josifoski

Meta-learning can successfully acquire useful inductive biases from data. Yet, its generalization properties to unseen learning tasks are poorly understood. Particularly if the number of meta-training tasks is small, this raises concerns about overfitting. ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Adaptive Social Learning

Ali H. Sayed, Virginia Bordignon

This work proposes a novel strategy for social learning by introducing the critical feature of adaptation. In social learning, several distributed agents update continually their belief about a phenomenon of interest through: i) direct observation of strea ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?

Rachid Guerraoui, Nirupam Gupta, John Stephan, Sébastien Louis Alexandre Rouault, Rafaël Benjamin Pinot

This paper addresses the problem of combining Byzantine resilience with privacy in machine learning (ML). Specifically, we study if a distributed implementation of the renowned Stochastic Gradient Descent (SGD) learning algorithm is feasible with both diff ...

ASSOC COMPUTING MACHINERY2021

Graph-Homomorphic Perturbations For Private Decentralized Learning

Ali H. Sayed, Stefan Vlaski

Decentralized algorithms for stochastic optimization and learning rely on the diffusion of information through repeated local exchanges of intermediate estimates. Such structures are particularly appealing in situations where agents may be hesitant to shar ...

IEEE2021