A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

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.

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

In this work, we develop first-order (Hessian-free) and zeroth-order (derivative-free) implementations of the Cubically Regularized Newton Method for solving general non-convex optimization problems. For that, we employ finite difference approximations of ...

We consider a network of agents that must solve an online optimization problem from continual observation of streaming data. To this end, the agents implement a distributed cooperative strategy where each agent is allowed to perform local exchange of infor ...

In this thesis, we study two closely related directions: robustness and generalization in modern deep learning. Deep learning models based on empirical risk minimization are known to be often non-robust to small, worst-case perturbations known as adversari ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

Catastrophic overfitting (CO) in single-step adversarial training (AT) results in abrupt drops in the adversarial test accuracy (even down to 0%). For models trained with multi-step AT, it has been observed that the loss function behaves locally linearly w ...

This paper studies kernel ridge regression in high dimensions under covariate shifts and analyzes the role of importance re-weighting. We first derive the asymptotic expansion of high dimensional kernels under covariate shifts. By a bias-variance decomposi ...

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that th ...

Driven by the need for more efficient and seamless integration of physical models and data, physics -informed neural networks (PINNs) have seen a surge of interest in recent years. However, ensuring the reliability of their convergence and accuracy remains ...

This work studies the learning process over social networks under partial and random information sharing. In traditional social learning models, agents exchange full belief information with each other while trying to infer the true state of nature. We stud ...

The remarkable ability of deep learning (DL) models to approximate high-dimensional functions from samples has sparked a revolution across numerous scientific and industrial domains that cannot be overemphasized. In sensitive applications, the good perform ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Beliefs inform the behaviour of forward-thinking agents in complex environments. Recently, sequential Bayesian inference has emerged as a mechanism to study belief formation among agents adapting to dynamical conditions. However, we lack critical theory to ...

Molecular quantum dynamics simulations are essential for understanding many fundamental phenomena in physics and chemistry. They often require solving the time-dependent Schrödinger equation for molecular nuclei, which is challenging even for medium-sized ...

Machine learning (ML) enables artificial intelligent (AI) agents to learn autonomously from data obtained from their environment to perform tasks. Modern ML systems have proven to be extremely effective, reaching or even exceeding human intelligence. Altho ...

Electrical stimulation of the nervous system has emerged as a promising assistive technology in case of many injuries and illnesses across various parts of the nervous system. In particular, the invasive neuromodulation of the peripheral nervous system see ...

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

Chat with Graph Search

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians

Distributed Adaptive Learning Under Communication Constraints

Understanding generalization and robustness in modern deep learning

Scalable constrained optimization

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Efficient local linearity regularization to overcome catastrophic overfitting

High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization

On the Generalization of Stochastic Gradient Descent with Momentum

Residual-based attention in physics-informed neural networks

Social Opinion Formation and Decision Making Under Communication Trends

Towards Trustworthy Deep Learning for Image Reconstruction

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Stochastic pairwise preference convergence in Bayesian agents

High-order geometric integrators for the variational Gaussian wavepacket dynamics and application to vibronic spectra at finite temperature

Few-shot Learning for Efficient and Effective Machine Learning Model Adaptation

Biophysically accurate and machine learning-based surrogate models to optimize neuroprosthesis design and operation

Bayes-optimal Learning of Deep Random Networks of Extensive-width

Learning to Remove Cuts in Integer Linear Programming