Invertible residual networks
We show that standard ResNet architectures can be made invertible, allowing the same
model to be used for classification, density estimation, and generation. Typically, enforcing …
model to be used for classification, density estimation, and generation. Typically, enforcing …
Hutch++: Optimal stochastic trace estimation
We study the problem of estimating the trace of a matrix A that can only be accessed through
matrix-vector multiplication. We introduce a new randomized algorithm, Hutch++, which …
matrix-vector multiplication. We introduce a new randomized algorithm, Hutch++, which …
Fast Estimation of via Stochastic Lanczos Quadrature
The problem of estimating the trace of matrix functions appears in applications ranging from
machine learning and scientific computing, to computational biology. This paper presents an …
machine learning and scientific computing, to computational biology. This paper presents an …
Learning the stein discrepancy for training and evaluating energy-based models without sampling
We present a new method for evaluating and training unnormalized density models. Our
approach only requires access to the gradient of the unnormalized model's log-density. We …
approach only requires access to the gradient of the unnormalized model's log-density. We …
Distributed signal processing via Chebyshev polynomial approximation
DI Shuman, P Vandergheynst… - … on Signal and …, 2018 - ieeexplore.ieee.org
Unions of graph multiplier operators are an important class of linear operators for processing
signals defined on graphs. We present a novel method to efficiently distribute the application …
signals defined on graphs. We present a novel method to efficiently distribute the application …
[HTML][HTML] Quantum computing for market research
The digital ecosystem continues to expand around the world and is revolutionising the way
markets are researched. Indeed, consumer experiences are advertised and disseminated …
markets are researched. Indeed, consumer experiences are advertised and disseminated …
Krylov-aware stochastic trace estimation
We introduce an algorithm for estimating the trace of a matrix function using implicit products
with a symmetric matrix. Existing methods for implicit trace estimation of a matrix function …
with a symmetric matrix. Existing methods for implicit trace estimation of a matrix function …
On randomized trace estimates for indefinite matrices with an application to determinants
A Cortinovis, D Kressner - Foundations of Computational Mathematics, 2022 - Springer
Randomized trace estimation is a popular and well-studied technique that approximates the
trace of a large-scale matrix B by computing the average of x^ T Bx x TB x for many samples …
trace of a large-scale matrix B by computing the average of x^ T Bx x TB x for many samples …
[HTML][HTML] A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
We introduce a novel algorithm for approximating the logarithm of the determinant of a
symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the …
symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the …
Quantum topological data analysis with linear depth and exponential speedup
S Ubaru, IY Akhalwaya, MS Squillante… - arXiv preprint arXiv …, 2021 - arxiv.org
Quantum computing offers the potential of exponential speedups for certain classical
computations. Over the last decade, many quantum machine learning (QML) algorithms …
computations. Over the last decade, many quantum machine learning (QML) algorithms …