Saved in:
| Main Authors: | Manoj, Naren Sarayu, Ovsiankin, Max |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.10013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Localization Method for High-Dimensional Inequalities
by: Kook, Yunbum, et al.
Published: (2025)
by: Kook, Yunbum, et al.
Published: (2025)
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
by: Bhaskara, Aditya, et al.
Published: (2024)
by: Bhaskara, Aditya, et al.
Published: (2024)
Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
by: Makarychev, Yury, et al.
Published: (2024)
by: Makarychev, Yury, et al.
Published: (2024)
Zeroth-order Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2025)
by: Kook, Yunbum, et al.
Published: (2025)
Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
by: Lai, Peiyao, et al.
Published: (2024)
by: Lai, Peiyao, et al.
Published: (2024)
An Upper Bound on Grothendieck's Constant
by: Heilman, Steven
Published: (2026)
by: Heilman, Steven
Published: (2026)
Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)
by: Musco, Cameron, et al.
Published: (2017)
Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
by: Chen, Guanyi, et al.
Published: (2025)
by: Chen, Guanyi, et al.
Published: (2025)
Markov Chains Approximate Message Passing
by: Rajaraman, Amit, et al.
Published: (2025)
by: Rajaraman, Amit, et al.
Published: (2025)
Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)
by: Harris, David G., et al.
Published: (2026)
Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
by: Jia, He, et al.
Published: (2020)
by: Jia, He, et al.
Published: (2020)
Random zero sets with local growth guarantees
by: Chang, Alan, et al.
Published: (2024)
by: Chang, Alan, et al.
Published: (2024)
Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)
by: Jing, Fei, et al.
Published: (2024)
Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
by: Mangoubi, Oren, et al.
Published: (2025)
by: Mangoubi, Oren, et al.
Published: (2025)
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
by: Wolfson, Daniel, et al.
Published: (2026)
by: Wolfson, Daniel, et al.
Published: (2026)
Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)
by: Balabanov, Oleg, et al.
Published: (2022)
Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality
by: Koehler, Frederic, et al.
Published: (2026)
by: Koehler, Frederic, et al.
Published: (2026)
On Smale's 17th problem over the reals
by: Montanari, Andrea, et al.
Published: (2024)
by: Montanari, Andrea, et al.
Published: (2024)
Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)
by: Chenakkod, Shabarish, et al.
Published: (2024)
Well-Conditioned Oblivious Perturbations in Linear Space
by: Chenakkod, Shabarish, et al.
Published: (2026)
by: Chenakkod, Shabarish, et al.
Published: (2026)
Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
by: Chenakkod, Shabarish, et al.
Published: (2025)
by: Chenakkod, Shabarish, et al.
Published: (2025)
Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
by: Zhang, Matthew S.
Published: (2025)
by: Zhang, Matthew S.
Published: (2025)
Exact and Efficient Sampling from Dynamic Discrete Distributions with Finite-Precision Weights
by: Hafner, Lilith Orion, et al.
Published: (2025)
by: Hafner, Lilith Orion, et al.
Published: (2025)
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
by: Dereziński, Michał, et al.
Published: (2024)
by: Dereziński, Michał, et al.
Published: (2024)
Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)
by: Larsen, Brett W., et al.
Published: (2022)
Scalable network reconstruction in subquadratic time
by: Peixoto, Tiago P.
Published: (2024)
by: Peixoto, Tiago P.
Published: (2024)
Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
by: Altschuler, Jason M., et al.
Published: (2025)
by: Altschuler, Jason M., et al.
Published: (2025)
Approximating the Total Variation Distance between Gaussians
by: Bhattacharyya, Arnab, et al.
Published: (2025)
by: Bhattacharyya, Arnab, et al.
Published: (2025)
Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)
by: Chai, Shuwen, et al.
Published: (2024)
Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)
by: Feng, Weiming, et al.
Published: (2025)
Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)
by: Setty, Abhishek
Published: (2025)
Interlacing Polynomial Method for the Column Subset Selection Problem
by: Cai, Jian-Feng, et al.
Published: (2023)
by: Cai, Jian-Feng, et al.
Published: (2023)
Approximate Counting in Local Lemma Regimes
by: Mann, Ryan L., et al.
Published: (2025)
by: Mann, Ryan L., et al.
Published: (2025)
Faster logconcave sampling from a cold start in high dimension
by: Kook, Yunbum, et al.
Published: (2025)
by: Kook, Yunbum, et al.
Published: (2025)
Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)
by: Kunisky, Dmitriy, et al.
Published: (2023)
Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
by: Fang, Qiangpeng, et al.
Published: (2026)
by: Fang, Qiangpeng, et al.
Published: (2026)
Distance Estimation for High-Dimensional Discrete Distributions
by: Kumar, Gunjan, et al.
Published: (2023)
by: Kumar, Gunjan, et al.
Published: (2023)
Parallelising Glauber dynamics
by: Lee, Holden
Published: (2023)
by: Lee, Holden
Published: (2023)
A Sampling Lovász Local Lemma for Large Domain Sizes
by: Wang, Chunyang, et al.
Published: (2023)
by: Wang, Chunyang, et al.
Published: (2023)
Sampling Proper Colorings on Line Graphs Using $(1+o(1))Δ$ Colors
by: Wang, Yulin, et al.
Published: (2023)
by: Wang, Yulin, et al.
Published: (2023)
Similar Items
-
The Localization Method for High-Dimensional Inequalities
by: Kook, Yunbum, et al.
Published: (2025) -
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
by: Bhaskara, Aditya, et al.
Published: (2024) -
Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
by: Makarychev, Yury, et al.
Published: (2024) -
Zeroth-order Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2025) -
Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
by: Lai, Peiyao, et al.
Published: (2024)