A Determinantal Identity for the Permanent of a Rank 2 Matrix

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.

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

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider algebraic parame ...

We present a nonperturbative recipe for directly computing the S-matrix in strongly-coupled QFTs. The method makes use of spectral data obtained in a Hamiltonian framework and can be applied to a wide range of theories, including potentially QCD. We demons ...

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

In this thesis we study how physical principles imposed on the S-matrix, such as Lorentz invariance, unitarity, crossing symmetry and analyticity constrain quantum field theories at the nonperturbative level. We start with a pedagogical introduction to the ...

Research on founder identity has significantly advanced our understanding of entrepreneurship and related literatures. By departing from the widely held-though often implicit-assumption that culture defines the parameters of identity formation, this paper ...

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

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

The Transfer Matrix formalism is ubiquitous when it comes to study wave propagation in various stratified media, applications ranging from Seismology to Quantum Mechanics. A relation between variables at two points in two different layers can be establishe ...

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks: finding low-rank approximations of matrices, computing matrix functions, and estimating the trace of matrices. In the first part, we consider algorithms for building ...

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

In this thesis, we present a theory of value for the design and analysis of service ecosystems. The theory is based on general systems thinking. The concept of a system is used for relating knowledge from different disciplines (such as software engineering ...

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

We consider the phase retrieval problem, in which the observer wishes to recover a n-dimensional real or complex signal X⋆ from the (possibly noisy) observation of |ΦX⋆|, in which Φ is a matrix of size m×n. We consider a \emph{high-dimensional} setting whe ...

In this paper, we attempt to show some consequences of bringing the body back into higher education, through the use of performing arts in the curricular context of scientific programs. We start by arguing that dominant traditions in higher education repro ...

The detection of oxygen (O-2) by optical sensors is of growing importance, for example, in biology, life science, environmental science, and aerodynamics, where the composition of gases is crucial for many applications. Purely organic optical O-2 sensors a ...

A Determinantal Identity for the Permanent of a Rank 2 Matrix

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

Randomized low-rank approximation and its applications

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Preconditioning techniques for generalized Sylvester matrix equations

Towards a nonperturbative construction of the S-matrix

Robust Collaborative Learning with Linear Gradient Overhead

Nonperturbative aspects of scattering amplitudes

Identity-Society (Mis)Alignment And The Instrumentalization Of Firm Creation: Creative Destruction And Creative Reconstruction

TimeEvolver: A program for time evolution with improved error bound

Optimal denoising of rotationally invariant rectangular matrices

Harmonic decomposition of the trace of 1D transfer matrices in layered media

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Leveraging topology, geometry, and symmetries for efficient Machine Learning

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

A Theory of Value for Service Ecosystems

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

Construction of optimal spectral methods in phase retrieval

The Dimension of the Body in Higher Education: Matrix of Meanings in Students’ Diaries

Reversible and Broad-Range Oxygen Sensing Based on Purely Organic Long-Lived Photoemitters