Copertina

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lai, Peiyao, Mangoubi, Oren
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Statistics Theory Data Structures and Algorithms Numerical Analysis Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
di: Mangoubi, Oren, et al.
Pubblicazione: (2025)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
di: Zhang, Matthew S.
Pubblicazione: (2025)

Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
di: Altschuler, Jason M., et al.
Pubblicazione: (2025)

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
di: Chen, Kun, et al.
Pubblicazione: (2024)

Probability Tools for Sequential Random Projection
di: Li, Yingru
Pubblicazione: (2024)

Perturbation Bounds for Low-Rank Inverse Approximations under Noise
di: Tran, Phuc, et al.
Pubblicazione: (2025)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
di: Chenakkod, Shabarish, et al.
Pubblicazione: (2024)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
di: Chenakkod, Shabarish, et al.
Pubblicazione: (2025)

Well-Conditioned Oblivious Perturbations in Linear Space
di: Chenakkod, Shabarish, et al.
Pubblicazione: (2026)

A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
di: Intallura, Philip, et al.
Pubblicazione: (2023)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
di: Jaquard, Hugo, et al.
Pubblicazione: (2024)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
di: Bandeira, Afonso S.
Pubblicazione: (2025)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
di: Lovig, Maxwell, et al.
Pubblicazione: (2024)

Lower bounds for trace estimation via Block Krylov and other methods
di: Yu, Shi Jie
Pubblicazione: (2025)

Efficient Diffusion Models for Symmetric Manifolds
di: Mangoubi, Oren, et al.
Pubblicazione: (2025)

Shifted Composition III: Local Error Framework for KL Divergence
di: Altschuler, Jason M., et al.
Pubblicazione: (2024)

Algorithmic warm starts for Hamiltonian Monte Carlo
di: Zhang, Matthew S., et al.
Pubblicazione: (2026)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
di: Chen, Zongchen, et al.
Pubblicazione: (2024)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
di: Chen, Shujing, et al.
Pubblicazione: (2025)

Finding planted cliques using gradient descent
di: Gheissari, Reza, et al.
Pubblicazione: (2023)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
di: Fan, Zhou, et al.
Pubblicazione: (2026)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
di: Chen, Guanyi, et al.
Pubblicazione: (2025)

Zeroth-order Logconcave Sampling
di: Kook, Yunbum, et al.
Pubblicazione: (2025)

On Smale's 17th problem over the reals
di: Montanari, Andrea, et al.
Pubblicazione: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
di: Gatmiry, Khashayar, et al.
Pubblicazione: (2024)

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

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

Adversarially-Robust Inference on Trees via Belief Propagation
di: Hopkins, Samuel B., et al.
Pubblicazione: (2024)

Data organization limits the predictability of binary classification
di: Jing, Fei, et al.
Pubblicazione: (2024)

Efficiently matching random inhomogeneous graphs via degree profiles
di: Ding, Jian, et al.
Pubblicazione: (2023)

An Instance-Based Approach to the Trace Reconstruction Problem
di: Mazooji, Kayvon, et al.
Pubblicazione: (2024)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
di: Morgan, Alexander, et al.
Pubblicazione: (2026)

Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
di: Tran, Phuc, et al.
Pubblicazione: (2025)

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

Optimal Embedding Dimension for Sparse Subspace Embeddings
di: Chenakkod, Shabarish, et al.
Pubblicazione: (2023)

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

Scalable network reconstruction in subquadratic time
di: Peixoto, Tiago P.
Pubblicazione: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
di: Kunisky, Dmitriy
Pubblicazione: (2024)

Online Differentially Private Synthetic Data Generation
di: He, Yiyun, et al.
Pubblicazione: (2024)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
di: Ding, Jian, et al.
Pubblicazione: (2022)