Publications related to Accelerating Spectral Clustering under Fairness Constraints

Related publications (20)

Towards Self-Supervised Covariance Estimation in Deep Heteroscedastic Regression

Mathieu Salzmann, Alexandre Massoud Alahi, Megh Hiren Shukla

Deep heteroscedastic regression models the mean and covariance of the target distribution through neural networks. The challenge arises from heteroscedasticity, which implies that the covariance is sample dependent and is often unknown. Consequently, recen ...

ICLR2025

Learning to Optimize with Convergence Guarantees Using Nonlinear System Theory

Luca Furieri, Andrea Martin

The increasing reliance on numerical methods for controlling dynamical systems and training machine learning models underscores the need to devise algorithms that dependably and efficiently navigate complex optimization landscapes. Classical gradient desce ...

2024

WILD SOLUTIONS TO SCALAR EULER-LAGRANGE EQUATIONS

Carl Johan Peter Johansson

. We study very weak solutions to scalar Euler-Lagrange equations associated with quadratic convex functionals. We investigate whether W1,1 solutions are necessarily W 1,2 Nash and Schauder applicable. We answer this question positively for a suitable clas ...

Amer Mathematical Soc2024

Decentralized gradient tracking with local steps

Anastasiia Koloskova

Gradient tracking (GT) is an algorithm designed for solving decentralized optimization problems over a network (such as training a machine learning model). A key feature of GT is a tracking mechanism that allows us to overcome data heterogeneity between no ...

2024

Identification of typical district configurations: A two-step global sensitivity analysis framework

François Maréchal, Jonas Schnidrig, Cédric Terrier, Arthur Antoine Chuat

The recent geopolitical conflicts in Europe have underscored the vulnerability of the current energy system to the volatility of energy carrier prices. In the prospect of defining robust energy systems ensuring sustainable energy supply in the future, the ...

Pergamon-Elsevier Science Ltd2024

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Christopher Arnold Criscitiello, Nicolas Boumal

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

SPRINGER2022

A Prony-based approach for accelerating the lightning electromagnetic fields computation above a perfectly conducting ground

Farhad Rachidi-Haeri, Marcos Rubinstein

Lightning strikes can seriously affect the reliability and availability of electrical infrastructures. The computation of lightning-electromagnetic fields represents one of the most crucial steps in the evaluation of the induced effects; thus, having at di ...

Elsevier2022

PDE-Constrained Optimal Control Problems with Uncertain Parameters using SAGA

Fabio Nobile, Matthieu Claude Martin

We consider an optimal control problem (OCP) for a partial differential equation (PDE) with random coefficients. The optimal control function is a deterministic, distributed forcing term that minimizes an expected quadratic regularized loss functional. For ...

2021

A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features

Ali H. Sayed, Sulaiman A S A E Alghunaim

This work studies multi-agent sharing optimization problems with the objective function being the sum of smooth local functions plus a convex (possibly non-smooth) function coupling all agents. This scenario arises in many machine learning and engineering ...

IEEE2020

Parallel and Scalable Bioinformatics

Stuart Anthony Byma

The field of genomics is likely to become the largest producer of data as a consequence of the large-scale application of next-generation sequencing technology for biological research and personalized medical treatments. The raw sequence data produced by t ...

EPFL2020

Streaming Principal Component Analysis From Incomplete Data

Armin Eftekhari

Linear subspace models are pervasive in computational sciences and particularly used for large datasets which are often incomplete due to privacy issues or sampling constraints. Therefore, a critical problem is developing an efficient algorithm for detecti ...

Microtome Publishing2019

Data-Interpretation Methodologies for Practical Asset-Management

Ian Smith, Yves Sylvain Gilles Reuland, Sai Ganesh Sarvotham Pai

Monitoring and interpreting structural response using structural-identification methodologies improves understanding of civil-infrastructure behavior. New sensing devices and inexpensive computation has made model-based data interpretation feasible in engi ...

2019

Real-time implementation with FPGA-based DAQ system of a probabilistic disruption predictor from scratch

Olivier Sauter, Martinus Adela Maria Gijs, Jonathan Graves, Ambrogio Fasoli, Stefano Coda, Basil Duval, Henri Weisen, Richard Pitts, Yves Martin, Javier García Hernández, Duccio Testa, Miguel Fernández Ruiz, Nicola Vianello, Robin Humphry-Baker, Sun Hee Kim, Federico Nespoli, Patrick Blanchard, Alessandro Pau, David Pfefferlé, Davide Galassi, Jonathan Marc Philippe Faustin, Cristian Sommariva, Hamish William Patten, Samuel Lanthaler, Jan Horacek, Yann Camenen, Bruno Emanuel Ferreira De Sousa Correia, José Pedro Rebelo Ferreira Marques, Mikhail Maslov, Marco Wischmeier, Dalziel Joseph Wilson, Liang Yao, Daniel Scott Alessi, Arnout Lodewijk M Beckers, Ana Francisca Leal Silva Soares, Jonnathan Cesar Hidalgo Acosta, Antonio José Pereira de Figueiredo, Partha Dutta, Pierre-Thomas Paul Brun, Pedro Camilo de Oliveira e Silva, Alberto Hernando de Castro, Julio Rodriguez, Vlad Trifa, Li Shuai, Rebecca Hill

Real-time (RT) disruption prediction (DP) is essential to trigger mitigation actions that avoid irreversible damage to the devices. This paper deals with disruption mitigation alarms and performs the RT implementation of a probabilistic predictor. The RT i ...

2018

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

Stefan Yves Gabriel Binder

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of lar ...

EPFL2018

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Michael Christoph Gastpar, Saeid Sahraei

A particular instance of the shortest vector problem (SVP) appears in the context of compute-and-forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order O(nψlog(nψ)) , where ψ=sqrt(P ||h||^2+1) ...

Institute of Electrical and Electronics Engineers2017

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Colin Neil Jones, Melanie Nicole Zeilinger, Ye Pu

In this technical note, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. Two splitting strategies with efficient implementations for MPC proble ...

2017

Exploiting Satisfiability Solvers for Efficient Logic Synthesis

Ana Petkovska

Logic synthesis is an important part of electronic design automation (EDA) flows, which enable the implementation of digital systems. As the design size and complexity increase, the data structures and algorithms for logic synthesis must adapt and improve ...

EPFL2017

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

Michael Christoph Gastpar, Su Li

We consider the cooperative data exchange problem, in which nodes are fully connected with each other. Each node initially only has a subset of the K packets making up a file and wants to recover the whole file. Node i can make a broadcast transmission, wh ...

2017

Computation of a 768-Bit Prime Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...

Springer International Publishing Ag2017