paper-with-me

홈 › Papers

BOLT: Block-Orthonormal Lanczos for Trace estimation of matrix functions

2025-05-18 · Kingsley Yeon, Promit Ghosal, Mihai Anitescu

Efficient matrix trace estimation is essential for scalable computation of log-determinants, matrix norms, and distributional divergences. In many large-scale applications, the matrices involved are too large to store or access in full, making even a single matrix-vector (mat-vec) product infeasible. Instead, one often has access only to small subblocks of the matrix or localized matrix-vector products on restricted index sets. Hutch++ achieves optimal convergence rate but relies on randomized SVD and assumes full mat-vec access, making it difficult to apply in these constrained settings. We propose the Block-Orthonormal Stochastic Lanczos Quadrature (BOLT), which matches Hutch++ accuracy with a simpler implementation based on orthonormal block probes and Lanczos iterations. BOLT builds on the Stochastic Lanczos Quadrature (SLQ) framework, which combines random probing with Krylov subspace methods to efficiently approximate traces of matrix functions, and performs better than Hutch++ in near flat-spectrum regimes. To address memory limitations and partial access constraints, we introduce Subblock SLQ, a variant of BOLT that operates only on small principal submatrices. As a result, this framework yields a proxy KL divergence estimator and an efficient method for computing the Wasserstein-2 distance between Gaussians - both compatible with low-memory and partial-access regimes. We provide theoretical guarantees and demonstrate strong empirical performance across a range of high-dimensional settings.

📄 PDF Abstract BibTeX arXiv:2505.12289

Code (1)

chebyshevtech/BOLT 공식 구현

Tasks

subspace methods

Similar Papers 제목 키워드 기반

A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms

2010-12-02 · Zhouchen Lin, Siming Wei

Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimi…

Matrix Completion

Generalized Lanczos method for systematic optimization of neural-network quantum states

2025-02-03 · Jia-Qi Wang, Rong-Qiang He, Zhong-Yi Lu

Recently, artificial intelligence for science has made significant inroads into various fields of natural science research. In the field of quantum many-body computation, researchers have developed numerous ground state …

reinforcement-learningReinforcement LearningVariational Monte Carlo

LanczosNet: Multi-Scale Deep Graph Convolutional Networks

2019-01-06 · ICLR 2019 5 · Renjie Liao, Zhizhen Zhao, Raquel Urtasun, Richard S. Zemel

We propose the Lanczos network (LanczosNet), which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution. Relying on the tridiagonal decomposition of the Lanczos alg…

Node Classification

Low-degree lower bounds via almost orthonormal bases

2025-09-11 · Alexandra Carpentier, Simone Maria Giancola, Christophe Giraud, Nicolas Verzelen arxiv

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the go…

Computationally Efficient Approximations for Matrix-based Renyi's Entropy

2021-12-27 · Tieliang Gong, Yuxin Dong, Shujian Yu, Bo Dong

The recently developed matrix based Renyi's entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi definite (PSD) matrices in reproducing kernel Hilbert space, withou…