Publication

MATHICSE Technical Report : Discrete least squares polynomial approximation with random evaluations – application to parametric and stochastic elliptic PDES

Publications associées (78)

Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity

Rachid Guerraoui, Nirupam Gupta, Youssef Allouah, Geovani Rizk, Rafaël Benjamin Pinot

The theory underlying robust distributed learning algorithms, designed to resist adversarial machines, matches empirical observations when data is homogeneous. Under data heterogeneity however, which is the norm in practical scenarios, established lower bo ...

2023

A Least-Squares Method for the Solution of the Non-smooth Prescribed Jacobian Equation

Alexandre Caboussat, Dimitrios Gourzoulidis

We consider a least-squares/relaxation finite element method for the numerical solution of the prescribed Jacobian equation. We look for its solution via a least-squares approach. We introduce a relaxation algorithm that decouples this least-squares proble ...

SPRINGER/PLENUM PUBLISHERS2022

This paper considers the multi-agent linear least-squares problem in a server-agent network architecture. The system comprises multiple agents, each with a set of local data points. The agents are connected to a server, and there is no inter-agent communic ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Rapid Scalable Distributed Power Flow with Open-Source Implementation

Yuning Jiang, Xinliang Dai

This paper introduces a new method for solving the distributed AC power flow (PF) problem by further exploiting the problem formulation. We propose a new variant of the ALADIN algorithm devised specifically for this type of problem. This new variant is cha ...

ELSEVIER2022

Accelerated SGD for Non-Strongly-Convex Least Squares

Nicolas Henri Bernard Flammarion, Aditya Vardhan Varre

We consider stochastic approximation for the least squares regression problem in the non-strongly convex setting. We present the first practical algorithm that achieves the optimal prediction error rates in terms of dependence on the noise of the problem, ...

2022

Unlocking crowding by ensemble statistics

Michael Herzog, David Pascucci, Oh-Hyeon Choung, Yury Markov, Natalia Tiurina

In crowding,1-7 objects that can be easily recognized in isolation appear jumbled when surrounded by other elements.8 Traditionally, crowding is explained by local pooling mechanisms,3,6,9-15 but many findings have shown that the global configuration of th ...

CELL PRESS2022

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

Nicolas Henri Bernard Flammarion, Aditya Vardhan Varre, Loucas Pillaud-Vivien

Motivated by the recent successes of neural networks that have the ability to fit the data perfectly \emph{and} generalize well, we study the noiseless model in the fundamental least-squares setup. We assume that an optimum predictor fits perfectly inputs ...

2021

We introduce several spatially adaptive model order reduction approaches tailored to non-coercive elliptic boundary value problems, specifically, parametric-in-frequency Helmholtz problems. The offline information is computed by means of adaptive finite el ...

2021

Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems

Pascal Fua, Mathieu Salzmann, Zheng Dang, Kwang Moo Yi, Fei Wang, Yinlin Hu

Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smal ...

IEEE COMPUTER SOC2021

, ,

This paper analyzes the implementation of least-mean-squares (LMS)-based, adaptive diffusion algorithms over networks in the frequency-domain (FD). We focus on a scenario of noisy links and include a moving-average step for denoising after self-learning to ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search