On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In this paper we propose a Monte Carlo maximum likelihood estimation strategy for discretely observed Wright–Fisher diffusions. Our approach provides an unbiased estimator of the likelihood function and is based on exact simulation techniques that are of s ...

An a posteriori error estimator based on an equilibrated flux reconstruction is proposed for defeaturing problems in the context of finite element discretizations. Defeaturing consists in the simplification of a geometry by removing features that are consi ...

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

Activity-based models offer the potential of a far deeper understanding of daily mobility behaviour than trip-based models. However, activity-based models used both in research and practice have often relied on applying sequential choice models between sub ...

Given two jointly distributed random variables (X,Y), a functional representation of X is a random variable Z independent of Y, and a deterministic function g(⋅,⋅) such that X=g(Y,Z). The problem of finding a minimum entropy functional representation is kn ...

Unsupervised Domain Adaptation Regression (DAR) aims to bridge the domain gap between a labeled source dataset and an unlabelled target dataset for regression problems. Recent works mostly focus on learning a deep feature encoder by minimizing the discrepa ...

We present an extended validation of semi-analytical, semi-empirical covariance matrices for the two-point correlation function (2PCF) on simulated catalogs representative of luminous red galaxies (LRGs) data collected during the initial 2 months of operat ...

In this thesis we present three closed form approximation methods for portfolio valuation and risk management. The first chapter is titled ``Kernel methods for portfolio valuation and risk management'', and is a joint work with Damir Filipovi'c (SFI and ...

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

We introduce the elliptical Ornstein-Uhlenbeck (OU) process, which is a generalisation of the well-known univariate OU process to bivariate time series. This process maps out elliptical stochastic oscillations over time in the complex plane, which are obse ...

Phase transitions in non-Hermitian systems are at the focus of cutting edge theoretical and experimental research. On the one hand, parity-time- (PT-) and anti-PT-symmetric physics have gained ever-growing interest, due to the existence of non-Hermitian sp ...

This thesis presents work at the junction of statistics and climate science. We first provide methodology for use by climate scientists when performing fast event attribution using extreme value theory, and then describe two interdisciplinary projects in c ...

Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by using kernel me ...

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Chattez avec Graph Search

Unbiased Likelihood Estimation of Wright–Fisher Diffusion Processes

An equilibrated flux a posteriori error estimator for defeaturing problems

Positive Definite Completions and Continuous Graphical Models

Bayes-optimal Learning of Deep Random Networks of Extensive-width

OASIS: Optimisation-based Activity Scheduling with Integrated Simultaneous choice dimensions

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations

DARE-GRAM : Unsupervised Domain Adaptation Regression by Aligning Inverse Gram Matrices

Validation of semi-analytical, semi-empirical covariance matrices for two-point correlation function for early DESI data

Closed form approximation methods for portfolio valuation and risk management

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

The elliptical Ornstein-Uhlenbeck process

Emergent non-Hermitian localization phenomena in the synthetic space of zero-dimensional bosonic systems

Wind, Hail, and Climate Extremes: Modelling and Attribution Studies for Environmental Data

Learning ground states of gapped quantum Hamiltonians with Kernel Methods