Many-body localization in a fragmented Hilbert space

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

A kernel‐based change detection method to map shifts in phytoplankton communities measured by flow cytometry

Automated, ship-board flow cytometers provide high-resolution maps of phytoplankton composition over large swaths of the world's oceans. They therefore pave the way for understanding how environmental conditions shape community structure. Identification of ...

2021

Discrete-Choice Mining of Social Processes

Victor Kristof

Poor decisions and selfish behaviors give rise to seemingly intractable global problems, such as the lack of transparency in democratic processes, the spread of conspiracy theories, and the rise in greenhouse gas emissions. However, people are more predict ...

EPFL2021

Low-Rank Updates Of Matrix Functions Ii: Rational Krylov Methods

Daniel Kressner, Marcel Schweitzer, Alice Cortinovis

This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a simplified conve ...

SIAM PUBLICATIONS2021

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

2021

Forward-reflected-backward method with variance reduction

Volkan Cevher, Ahmet Alacaoglu

We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a soluti ...

2021

Robust Differentiable SVD

Pascal Fua, Mathieu Salzmann, Zheng Dang, Yinlin Hu, Wei Wang

Eigendecomposition of symmetric matrices is at the heart of many computer vision algorithms. However, the derivatives of the eigenvectors tend to be numerically unstable, whether using the SVD to compute them analytically or using the Power Iteration (PI) ...

2021

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage

Michael Christoph Gastpar, Ibrahim Issa, Amedeo Roberto Esposito

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two random variables. ...

2021

Running Speed Estimation Using Shoe-Worn Inertial Sensors: Direct Integration, Linear, and Personalized Model

Kamiar Aminian, Mathieu Pascal Falbriard, Abolfazl Soltani

The overground speed is a key component of running analysis. Today, most speed estimation wearable systems are based on GNSS technology. However, these devices can suffer from sparse communication with the satellites and have a high-power consumption. In t ...

2021

Electromagnetic waves under nonstationary conditions, the connection with parity-time symmetry and studies on resonant systems

Theodoros Koutserimpas

In this thesis, the electromagnetic wave propagation is studied in nonstationary-medium scenarios. The electromagnetic fields under material time-modulation are shown to conserve their momentum but not their energy. The mathematical foundations and analysi ...

EPFL2021

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Daniel Kressner, Stefano Massei, Kathryn Dianne Lund

Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...

2020

Page 2 sur 2