Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Higher-dimensional gamma matrices

Publications associées (27)

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Daniel Kressner, Haoze He

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...

Siam Publications2024

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Duality and bicrystals on infinite binary matrices

Thomas Gerber

The set of finite binary matrices of a given size is known to carry a finite type AA bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and one-dimensional sums t ...

EMS Press2023

Optimal denoising of rotationally invariant rectangular matrices

Lenka Zdeborová, Florent Gérard Krzakala, Emanuele Troiani, Vittorio Erba

In this manuscript we consider denoising of large rectangular matrices: given a noisy observation of a signal matrix, what is the best way of recovering the signal matrix itself? For Gaussian noise and rotationally-invariant signal priors, we completely ch ...

2022

Bias Cancellation of MixColumns

Francesco Regazzoni, Subhadeep Banik, Andrea Felice Caforio

At COSADE'2020, Carre et al. established a novel biascancelling property of the AES MixColumns matrix that effectively corrects any skewed output distribution of a state byte due to a faulty substitution box. Consequently, any effected byte is rendered uni ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Robust Differentiable SVD

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

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

Asymptotics of Cheeger constants and unitarisability of groups

Nicolas Monod

Given a group Gamma, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of Gamma for increasingly large generating sets. The connection ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Staggered flux state for rectangular-lattice spin-1/2 Heisenberg antiferromagnets

Henrik Moodysson Rønnow, Dmitri Ivanov, Bastien Dalla Piazza, Noore Elahi Shaik

We investigate the spin-1/2 Heisenberg model on a rectangular lattice, using the Gutzwiller projected variational wave function known as the staggered flux state. Using Monte Carlo techniques, the variational parameters and instantaneous spin-spin correlat ...

AMER PHYSICAL SOC2020

On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Daniel Kressner, Stefano Massei, Alice Cortinovis

The problem of finding a k x k submatrix of maximum volume of a matrix A is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of A. We show that such a submatrix can a ...

ELSEVIER SCIENCE INC2020

Evaporation of Metals during the Thermal Treatment of Oxide Nanomaterials in Cellulose-Based Matrices

Christian Ludwig

Like conventional material products, waste is the last stage of the life cycle of engineered nanomaterials, which are then incinerated or stabilized before disposal. However, because of their special physical characteristics, the fate of the thermally trea ...

2020

hm-toolbox: MATLAB SOFTWARE FOR HODLR AND HSS MATRICES

Daniel Kressner, Stefano Massei

Matrices with hierarchical low-rank structure, including HODLR and HSS matrices, constitute a versatile tool to develop fast algorithms for addressing large-scale problems. While existing software packages for such matrices often focus on linear systems, t ...

SIAM PUBLICATIONS2020

Complements to Mugge and Friedel's Theory of Twinning

Cyril Cayron

The crystallography of twinning is based on the concepts of simple shear and obliquity introduced by Mugge, Mallard and Friedel at the turn of the last century, with tensor mathematics later developed by Bilby, Bevis and Crocker in the 1960s. We propose a ...

2020

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Yusuf Leblebici, Severin Sidler, Alessandro Fumarola

Crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing highly energy-efficient neuromorphic computing systems. For Deep Neural Networks (DNN), where information can be encoded as analog voltage and current levels, ...

IEEE2019

Backpropagation-Friendly Eigendecomposition

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

Eigendecomposition (ED) is widely used in deep networks. However, the backpropagation of its results tends to be numerically unstable, whether using ED directly or approximating it with the Power Iteration method, particularly when dealing with large matri ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

hm-toolbox: Matlab software for HODLR and HSS matrices

Daniel Kressner, Stefano Massei

2019

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

Fast hierarchical solvers for symmetric eigenvalue problems

Ana Susnjara

In this thesis we address the computation of a spectral decomposition for symmetric banded matrices. In light of dealing with large-scale matrices, where classical dense linear algebra routines are not applicable, it is essential to design alternative tech ...

EPFL2018

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Volkan Cevher, Jonathan Mark Scarlett

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of interest for i.i ...

Ieee2016

A block algorithm for computing antitriangular factorizations of symmetric matrices

Daniel Kressner, Zvonimir Bujanovic

Any symmetric matrix can be reduced to antitriangular form in finitely many steps by orthogonal similarity transformations. This form reveals the inertia of the matrix and has found applications in, e.g., model predictive control and constraint preconditio ...

Springer2016