Publication

Decompositions of dependence for high-dimensional extremes

Publications associées (32)

Modelling of sawtooth-induced fast ion transport in positive and negative triangularity in TCV

Basil Duval, Olivier Sauter, Alexander Karpushov, Mario Ludovico Podesta, Duccio Testa, Antoine Pierre Emmanuel Alexis Merle, Marcelo Baquero Ruiz, Lorenzo Stipani, Matteo Vallar, Dmytry Mykytchuk

Internal kinks are a common magneto hydro-dynamic (MHD) instability observed in tokamak operation when the q profile in the plasma core is close to unity. This MHD instability impacts both the transport of the bulk plasma (current, particle and energy tran ...

IOP Publishing Ltd2022

System and method for transcoding spectral data with task-based optimization via symmetric non-negative matrix factorization

Forrest Simon Webler

A computer-implemented method for reconstructing/recovering high-resolution visible light spectral data at a target resolution d, that comprises obtaining a configuration of a low- resolution multi-channel imaging sensor of resolution p, the configuration ...

2022

A Determinantal Identity for the Permanent of a Rank 2 Matrix

Adam Wade Marcus

We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...

TAYLOR & FRANCIS INC2022

Fourier uniqueness and interpolation in Euclidean space

Martin Peter Stoller

We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radii are square roots of integers. In particular, the only ...

EPFL2022

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Tommaso Vanzan

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

2022

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

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

Further results on latent discourse models and word embeddings

Youssef Allouah

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Microtome Publishing2021

Realizing doubles: a conjugation zoo

Jérôme Scherer

Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod 2 cohomology (as a graded vector space, a ring and even an unstable algebra) but with all degrees divided by two, generalizing the classica ...

CAMBRIDGE UNIV PRESS2021

Differentially Private Stochastic Coordinate Descent

Rachid Guerraoui, Georgios Damaskinos

In this paper we tackle the challenge of making the stochastic coordinate descent algorithm differentially private. Compared to the classical gradient descent algorithm where updates operate on a single model vector and controlled noise addition to this ve ...

AIAA2021

Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems

Pascal Fua, Mathieu Salzmann, Fei Wang, Kwang Moo Yi, Zheng Dang, Yinlin Hu

Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smal ...

IEEE COMPUTER SOC2021