The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms
Fuente:
arXiv
Guardado en:
| Autores principales: | Manoj, Naren Sarayu, Ovsiankin, Max |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The Localization Method for High-Dimensional Inequalities
por: Kook, Yunbum, et al.
Publicado: (2025)
por: Kook, Yunbum, et al.
Publicado: (2025)
Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
por: Makarychev, Yury, et al.
Publicado: (2024)
por: Makarychev, Yury, et al.
Publicado: (2024)
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
por: Bhaskara, Aditya, et al.
Publicado: (2024)
por: Bhaskara, Aditya, et al.
Publicado: (2024)
Zeroth-order Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2025)
por: Kook, Yunbum, et al.
Publicado: (2025)
An Upper Bound on Grothendieck's Constant
por: Heilman, Steven
Publicado: (2026)
por: Heilman, Steven
Publicado: (2026)
Stability of the Lanczos Method for Matrix Function Approximation
por: Musco, Cameron, et al.
Publicado: (2017)
por: Musco, Cameron, et al.
Publicado: (2017)
Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
por: Lai, Peiyao, et al.
Publicado: (2024)
por: Lai, Peiyao, et al.
Publicado: (2024)
Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
por: Chen, Guanyi, et al.
Publicado: (2025)
por: Chen, Guanyi, et al.
Publicado: (2025)
Markov Chains Approximate Message Passing
por: Rajaraman, Amit, et al.
Publicado: (2025)
por: Rajaraman, Amit, et al.
Publicado: (2025)
Near-Optimal Parallel Approximate Counting via Sampling
por: Harris, David G., et al.
Publicado: (2026)
por: Harris, David G., et al.
Publicado: (2026)
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
por: Wolfson, Daniel, et al.
Publicado: (2026)
por: Wolfson, Daniel, et al.
Publicado: (2026)
Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
por: Balabanov, Oleg, et al.
Publicado: (2022)
por: Balabanov, Oleg, et al.
Publicado: (2022)
Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
por: Jia, He, et al.
Publicado: (2020)
por: Jia, He, et al.
Publicado: (2020)
Random zero sets with local growth guarantees
por: Chang, Alan, et al.
Publicado: (2024)
por: Chang, Alan, et al.
Publicado: (2024)
Exact and Efficient Sampling from Dynamic Discrete Distributions with Finite-Precision Weights
por: Hafner, Lilith Orion, et al.
Publicado: (2025)
por: Hafner, Lilith Orion, et al.
Publicado: (2025)
Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
por: Larsen, Brett W., et al.
Publicado: (2022)
por: Larsen, Brett W., et al.
Publicado: (2022)
Data organization limits the predictability of binary classification
por: Jing, Fei, et al.
Publicado: (2024)
por: Jing, Fei, et al.
Publicado: (2024)
Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality
por: Koehler, Frederic, et al.
Publicado: (2026)
por: Koehler, Frederic, et al.
Publicado: (2026)
Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
por: Mangoubi, Oren, et al.
Publicado: (2025)
por: Mangoubi, Oren, et al.
Publicado: (2025)
Approximating the Total Variation Distance between Gaussians
por: Bhattacharyya, Arnab, et al.
Publicado: (2025)
por: Bhattacharyya, Arnab, et al.
Publicado: (2025)
On Smale's 17th problem over the reals
por: Montanari, Andrea, et al.
Publicado: (2024)
por: Montanari, Andrea, et al.
Publicado: (2024)
Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
por: Chenakkod, Shabarish, et al.
Publicado: (2024)
por: Chenakkod, Shabarish, et al.
Publicado: (2024)
Well-Conditioned Oblivious Perturbations in Linear Space
por: Chenakkod, Shabarish, et al.
Publicado: (2026)
por: Chenakkod, Shabarish, et al.
Publicado: (2026)
Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
por: Chenakkod, Shabarish, et al.
Publicado: (2025)
por: Chenakkod, Shabarish, et al.
Publicado: (2025)
Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
por: Zhang, Matthew S.
Publicado: (2025)
por: Zhang, Matthew S.
Publicado: (2025)
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
por: Dereziński, Michał, et al.
Publicado: (2024)
por: Dereziński, Michał, et al.
Publicado: (2024)
Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)
por: Fang, Qiangpeng, et al.
Publicado: (2026)
Approximating the total variation distance between spin systems
por: Feng, Weiming, et al.
Publicado: (2025)
por: Feng, Weiming, et al.
Publicado: (2025)
Block Encoding of Sparse Matrices via Coherent Permutation
por: Setty, Abhishek
Publicado: (2025)
por: Setty, Abhishek
Publicado: (2025)
Supermodular Approximation of Norms and Applications
por: Kesselheim, Thomas, et al.
Publicado: (2024)
por: Kesselheim, Thomas, et al.
Publicado: (2024)
Entrywise Low-Rank Approximation and Matrix $p \rightarrow q$ Norms via Global Correlation Rounding
por: Anderson, Prashanti, et al.
Publicado: (2026)
por: Anderson, Prashanti, et al.
Publicado: (2026)
Scalable network reconstruction in subquadratic time
por: Peixoto, Tiago P.
Publicado: (2024)
por: Peixoto, Tiago P.
Publicado: (2024)
Distance Estimation for High-Dimensional Discrete Distributions
por: Kumar, Gunjan, et al.
Publicado: (2023)
por: Kumar, Gunjan, et al.
Publicado: (2023)
Parallelising Glauber dynamics
por: Lee, Holden
Publicado: (2023)
por: Lee, Holden
Publicado: (2023)
A Sampling Lovász Local Lemma for Large Domain Sizes
por: Wang, Chunyang, et al.
Publicado: (2023)
por: Wang, Chunyang, et al.
Publicado: (2023)
Sampling Proper Colorings on Line Graphs Using $(1+o(1))Δ$ Colors
por: Wang, Yulin, et al.
Publicado: (2023)
por: Wang, Yulin, et al.
Publicado: (2023)
Mixing of general biased adjacent transposition chains
por: Gheissari, Reza, et al.
Publicado: (2025)
por: Gheissari, Reza, et al.
Publicado: (2025)
Robust recovery for stochastic block models, simplified and generalized
por: Mohanty, Sidhanth, et al.
Publicado: (2024)
por: Mohanty, Sidhanth, et al.
Publicado: (2024)
Reconstruction of geometric random graphs with the Simple algorithm
por: Stegehuis, Clara, et al.
Publicado: (2024)
por: Stegehuis, Clara, et al.
Publicado: (2024)
On Sampling from Ising Models with Spectral Constraints
por: Galanis, Andreas, et al.
Publicado: (2024)
por: Galanis, Andreas, et al.
Publicado: (2024)
Ejemplares similares
-
The Localization Method for High-Dimensional Inequalities
por: Kook, Yunbum, et al.
Publicado: (2025) -
Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
por: Makarychev, Yury, et al.
Publicado: (2024) -
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
por: Bhaskara, Aditya, et al.
Publicado: (2024) -
Zeroth-order Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2025) -
An Upper Bound on Grothendieck's Constant
por: Heilman, Steven
Publicado: (2026)