Publications associées à A parametric augmented Lagrangian algorithm for real-time economic NMPC

Fourier Interpolation From Spheres

In every dimension d >= 2, we give an explicit formula that expresses the values of any Schwartz function on R-d only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres whose radius is the square roo ...

2021

Invariant Integrals on Topological Groups and Applications

Vasco Schiavo

We study a fixed point property for linear actions of discrete groups on weakly complete convex proper cones in locally convex topological vector spaces. We search to understand the class of discrete groups which enjoys this property and we try to generali ...

EPFL2021

Numerical methods for structural anomaly detection using model order reduction and data-driven techniques

Caterina Bigoni

The objective of this thesis is to provide a mathematical and computational framework for the proactive maintenance of complex systems with a particular application to structural health monitoring (SHM). SHM techniques rely primarily on sensor responses to ...

EPFL2020

Fast Transformers with Clustered Attention

François Fleuret, Angelos Katharopoulos, Apoorv Vyas

Transformers have been proven a successful model for a variety of tasks in sequence modeling. However, computing the attention matrix, which is their key component, has quadratic complexity with respect to the sequence length, thus making them prohibitivel ...

2020

Efficient Treatment of Correlation Energies at the Basis-Set Limit by Monte Carlo Summation of Continuum States

Ursula Röthlisberger, Justin Villard, Martin Peter Bircher

The calculation of electron correlation is vital for the description of atomistic phenomena in physics, chemistry, and biology. However, accurate wavefunction-based methods exhibit steep scaling and often sluggish convergence with respect to the basis set ...

AMER CHEMICAL SOC2020

Feynman diagrams and the large charge expansion in 3-epsilon dimensions

Riccardo Rattazzi, Alexander Monin, Gil Badel, Gabriel Francisco Cuomo

In arXiv:1909.01269 it was shown that the scaling dimension of the lightest charge n operator in the U (1) model at the Wilson-Fisher fixed point in D = 4 - epsilon can be computed semiclassically for arbitrary values of lambda n, where lambda is the pertu ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On the Computational Complexity of Blind Detection of Binary Linear Codes

Alexios Konstantinos Balatsoukas Stimming, Aris Filos Ratsikas

In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...

IEEE2019

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile, Pablo Romero Gómez

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

WILEY2019