Accelerating Spectral Clustering under Fairness Constraints

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Accelerating Spectral Clustering under Fairness Constraints

Chat with Graph Search

Towards Self-Supervised Covariance Estimation in Deep Heteroscedastic Regression

Learning to Optimize with Convergence Guarantees Using Nonlinear System Theory

WILD SOLUTIONS TO SCALAR EULER-LAGRANGE EQUATIONS

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

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

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

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

PDE-Constrained Optimal Control Problems with Uncertain Parameters using SAGA

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

Parallel and Scalable Bioinformatics

Streaming Principal Component Analysis From Incomplete Data

Data-Interpretation Methodologies for Practical Asset-Management

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

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

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

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Exploiting Satisfiability Solvers for Efficient Logic Synthesis

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

Computation of a 768-Bit Prime Field Discrete Logarithm