Publication

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

Publications associées (55)

Context. We report the exploitation of a sample of Solar System observations based on data from the third Gaia Data Release (Gaia DR3) of nearly 157 000 asteroids. It extends the epoch astrometric solution over the time coverage planned for the Gaia DR4, w ...

Les Ulis Cedex A2023

Iterative pre-conditioning for expediting the distributed gradient-descent method: The case of linear least-squares problem

Nirupam Gupta

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

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 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

, ,

The performance of SwissSPAD2 (SS2), a large scale, widefield time-gated CMOS SPAD imager developed for fluorescence lifetime imaging, has recently been described in the context of visible range and fluorescence lifetime imaging microscopy (FLIM) of dyes w ...

SPIE-INT SOC OPTICAL ENGINEERING2022

, , , ,

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

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

, , ,

Advances in high-speed imaging techniques have opened new possibilities for capturing ultrafast phenomena such as light propagation in air or through media. Capturing light in flight in three-dimensional xyt space has been reported based on various types o ...

AMER PHYSICAL SOC2021

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

Time-Synchronization Attacks against Critical Infrastructures and their Mitigation

Marguerite Marie Nathalie Delcourt

This work focuses on the security of critical infrastructures against time-synchronization attacks (TSA). A TSA can impact any network that relies on the dynamic analysis of data, by altering the time synchronization between its nodes. Such attacked networ ...

EPFL2021

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