TL;DR
The paper introduces Householder Dice, a matrix-free algorithm that efficiently simulates dynamics on Gaussian and orthogonal ensembles by avoiding full matrix generation, significantly reducing computational costs.
Contribution
It presents a novel recursive, matrix-free approach using Householder reflectors to simulate random matrix dynamics with lower resource requirements.
Findings
Reduces memory and computation costs to O(nT) and O(nT^2)
Efficient for T much smaller than n in practice
Numerical results validate the algorithm's effectiveness
Abstract
This paper proposes a new algorithm, named Householder Dice (HD), for simulating dynamics on dense random matrix ensembles with translation-invariant properties. Examples include the Gaussian ensemble, the Haar-distributed random orthogonal ensemble, and their complex-valued counterparts. A "direct" approach to the simulation, where one first generates a dense matrix from the ensemble, requires at least resource in space and time. The HD algorithm overcomes this bottleneck by using the principle of deferred decisions: rather than fixing the entire random matrix in advance, it lets the randomness unfold with the dynamics. At the heart of this matrix-free algorithm is an adaptive and recursive construction of (random) Householder reflectors. These orthogonal transformations exploit the group symmetry of the matrix ensembles, while…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
