Publications associées à Quantization for Decentralized Learning Under Subspace Constraints

Publications associées (49)

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

Anne-Clémence Corminboeuf, Friedrich Eisenbrand, Rubén Laplaza Solanas, Puck Elisabeth van Gerwen, Ksenia Briling, Jan Weinreich, Matthieu Nicolas Haeberle

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

IOP Publishing Ltd2025

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Diffusion Stochastic Optimization for Min-Max Problems

Ali H. Sayed, Haoyuan Cai

The optimistic gradient method is useful in addressing minimax optimization problems. Motivated by the observation that the conventional stochastic version suffers from the need for a large batch size on the order of O(ϵ-2) to achieve an ϵ-stationary solut ...

2025

Partial discharge localization in power transformer tanks using machine learning methods

Farhad Rachidi-Haeri, Marcos Rubinstein, Hamidreza Karami

This paper presents a comparison of machine learning (ML) methods used for three-dimensional localization of partial discharges (PD) in a power transformer tank. The study examines ML and deep learning (DL) methods, ranging from support vector machines (SV ...

Nature Publishing Group2024

Principles and Guidelines for Evaluating Social RobotNavigation Algorithms

Alexandre Massoud Alahi

A major challenge to deploying robots widely is navigation in human-populated environments, commonly referred to as social robot navigation. While the field of social navigation has advanced tremendously in recent years, the fair evaluation of algorithms t ...

ASSOC COMPUTING MACHINERY2025

Health Prediction for Lithium-Ion Batteries Under Unseen Working Conditions

Florent Evariste Forest, Yunhong Che

Battery health prediction is significant while challenging for intelligent battery management. This article proposes a general framework for both short-term and long-term predictions of battery health under unseen dynamic loading and temperature conditions ...

Ieee-Inst Electrical Electronics Engineers Inc2024

The Cost of Consistency: Submodular Maximization with Constant Recourse

Ola Nils Anders Svensson

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

ACM2025

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Fabio Nobile, Thomas Simon Spencer Trigo Trindade

We perform an error analysis of a fully discretised Streamline Upwind Petrov Galerkin Dynamical Low Rank (SUPG-DLR) method for random time-dependent advection-dominated problems. The time integration scheme has a splitting-like nature, allowing for potenti ...

Springer Nature Switzerland2025

Retrieval of Surface Solar Radiation through Implicit Albedo Recovery from Temporal Context

Michael Lehning, Devis Tuia, Yael Frischholz

To retrieve Surface Solar Radiation (SSR) from satellite images, a baseline reflectance of the observed ground in clear-sky conditions, also called background reflectance, is necessary to distinguish atmospheric absorption and scattering effects from surfa ...

2025

Intermediate complexity atmospheric modeling in complex terrain: is it right?

Michael Lehning, Dylan Stewart Reynolds, Michael Haugeneder

Dynamic downscaling of atmospheric forcing data to the hectometer resolution has shown increases in accuracy for landsurface models, but at great computational cost. Here we present a validation of a novel intermediate complexity atmospheric model, HICAR, ...

Frontiers Media Sa2024

Graph sparsification, sketching and adaptivity

Mikhail Makarov

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

Adaptive Finite Elements with Large Aspect Ratio. Application to Aluminium Electrolysis

Paride Passelli

The goal of this work is to use anisotropic adaptive finite elements for the numerical simulation of aluminium electrolysis. The anisotropic adaptive criteria are based on a posteriori error estimates derived for simplified problems. First, we consider an ...

EPFL2024

Machine Learning in Decision-Making Systems: Fairness, Robustness, and Data Bias

Yves Rychener

Machine learning is increasingly integrated with decision making by powering automated systems and informing human decision makers in applications such as CV screening, portfolio allocation, loan risk assessment, and insurance approval. In this thesis, I e ...

EPFL2025

Random matrix methods for high-dimensional machine learning models

Antoine Philippe Michel Bodin

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

EPFL2024

A shortcut model for batch distillation columns using pertinent effective factors

Dominique Bonvin

A shortcut model is a low-order model that provides a simplified representation of a complex process, thereby enabling faster and more efficient analysis, design and optimization without the computational intensity of a full-scale model. For continuous dis ...

Elsevier2025

Convex Computation of Value-at-risk Bounds for Stochastic Processes

Matteo Raphael Tacchi

This article formulates algorithms to upper-bound the maximum value-at-risk (VaR) of a state function along trajectories of stochastic processes. The VaR is upper bounded by two methods: minimax tail-bounds (Cantelli/Vysochanskij-Petunin) and Expected Shor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2025

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

Pakshal Narendra Bohra

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...

EPFL2024

Combining physics-based and data-driven models: advancing the frontiers of research with scientific machine learning

Alfio Quarteroni

Scientific Machine Learning (SciML) is a recently emerged research field which combines physics-based and data-driven models for the numerical approximation of differential problems. Physics-based models rely on the physical understanding of the problem at ...

2025

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Anastasiia Koloskova

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

EPFL2024

A Study on Quantum Graph Neural Networks Applied to Molecular Physics

Su Yeon Chang

This paper introduces a novel architecture for Quantum Graph Neural Networks, which is significantly different from previous approaches found in the literature. The proposed approach produces similar outcomes with respect to previous models but with fewer ...

IOP Publishing Ltd2025