Copertina

Fixed-sparsity matrix approximation from matrix-vector products

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Amsel, Noah, Chen, Tyler, Keles, Feyza Duman, Halikias, Diana, Musco, Cameron, Musco, Christopher
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Numerical Analysis
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Near-optimal hierarchical matrix approximation from matrix-vector products
di: Chen, Tyler, et al.
Pubblicazione: (2024)

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

Query Efficient Structured Matrix Learning
di: Amsel, Noah, et al.
Pubblicazione: (2025)

Stability of the Lanczos Method for Matrix Function Approximation
di: Musco, Cameron, et al.
Pubblicazione: (2017)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
di: Musco, Cameron, et al.
Pubblicazione: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
di: Kapralov, Michael, et al.
Pubblicazione: (2025)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
di: Doney, Kyle, et al.
Pubblicazione: (2025)

An Exact Algorithm for the Unanimous Vote Problem
di: Keles, Feyza Duman, et al.
Pubblicazione: (2025)

The Lanczos algorithm for matrix functions: a handbook for scientists
di: Chen, Tyler
Pubblicazione: (2024)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
di: Persson, David, et al.
Pubblicazione: (2023)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
di: Dereziński, Michał, et al.
Pubblicazione: (2024)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
di: Chen, Tyler, et al.
Pubblicazione: (2022)

The matrix-vector complexity of $Ax=b$
di: Dereziński, Michał, et al.
Pubblicazione: (2026)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2024)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
di: Amsel, Noah, et al.
Pubblicazione: (2026)

Sharper Bounds for Chebyshev Moment Matching, with Applications
di: Musco, Cameron, et al.
Pubblicazione: (2024)

Does block size matter in randomized block Krylov low-rank approximation?
di: Chen, Tyler, et al.
Pubblicazione: (2025)

Quantum matrix arithmetics with Hamiltonian evolution
di: Kang, Christopher, et al.
Pubblicazione: (2025)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
di: Bessa, Aline, et al.
Pubblicazione: (2023)

Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
di: Amsel, Noah, et al.
Pubblicazione: (2023)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
di: Balabanov, Oleg, et al.
Pubblicazione: (2022)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
di: Diwan, Haya, et al.
Pubblicazione: (2024)

A Monte Carlo algorithm for efficient large matrix inversion
di: Garcia-Cortes, L. A., et al.
Pubblicazione: (2004)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
di: Persson, David, et al.
Pubblicazione: (2025)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
di: Drineas, Petros, et al.
Pubblicazione: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
di: Netay, Igor V.
Pubblicazione: (2024)

Analysis of Different Algorithmic Design Techniques for Seam Carving
di: Aijaz, Owais, et al.
Pubblicazione: (2024)

Finer-Grained Hardness of Kernel Density Estimation
di: Alman, Josh, et al.
Pubblicazione: (2024)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
di: Suslo, Tomasz
Pubblicazione: (2005)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
di: Larsen, Brett W., et al.
Pubblicazione: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
di: Malik, Osman Asif, et al.
Pubblicazione: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
di: Mango, John M., et al.
Pubblicazione: (2025)

Invariant subspaces and PCA in nearly matrix multiplication time
di: Sobczyk, Aleksandros, et al.
Pubblicazione: (2023)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2023)

Sampling Methods for Inner Product Sketching
di: Daliri, Majid, et al.
Pubblicazione: (2023)

Simple Analysis of Priority Sampling
di: Daliri, Majid, et al.
Pubblicazione: (2023)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
di: Saak, Jens, et al.
Pubblicazione: (2023)

Matrix Product Sketching via Coordinated Sampling
di: Daliri, Majid, et al.
Pubblicazione: (2025)