A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Fuente:
arXiv
Saved in:
| Main Authors: | Ding, Jian, Li, Zhangsong |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023)
by: Ding, Jian, et al.
Published: (2023)
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
by: Gong, Shuyang, et al.
Published: (2024)
by: Gong, Shuyang, et al.
Published: (2024)
Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024)
by: Li, Zhangsong
Published: (2024)
Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023)
by: Ding, Jian, et al.
Published: (2023)
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)
A Smooth Computational Transition in Tensor PCA
by: Li, Zhangsong
Published: (2025)
by: Li, Zhangsong
Published: (2025)
A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)
by: Chen, Guanyi, et al.
Published: (2024)
Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)
by: Li, Zhangsong
Published: (2025)
Universality of first-order methods on random and deterministic matrices
by: Gorini, Nicola, et al.
Published: (2026)
by: Gorini, Nicola, et al.
Published: (2026)
Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)
by: Gatmiry, Khashayar, et al.
Published: (2024)
Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
by: Kunisky, Dmitriy
Published: (2024)
by: Kunisky, Dmitriy
Published: (2024)
Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
by: Ding, Jian, et al.
Published: (2023)
by: Ding, Jian, et al.
Published: (2023)
Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
by: Kunisky, Dmitriy
Published: (2024)
by: Kunisky, Dmitriy
Published: (2024)
Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)
by: Hopkins, Samuel B., et al.
Published: (2024)
Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)
by: Li, Zhangsong
Published: (2026)
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)
by: Blanca, Antonio, et al.
Published: (2022)
Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)
by: Gu, Anming, et al.
Published: (2026)
High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)
by: Chen, Fan, et al.
Published: (2026)
Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)
by: Choo, Davin, et al.
Published: (2023)
Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)
by: Ma, Yuxin, et al.
Published: (2025)
Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)
by: Shi, Bobby, et al.
Published: (2025)
Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)
by: De, Debsurya, et al.
Published: (2025)
Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)
by: He, Yiyun, et al.
Published: (2024)
Correlation detection in trees for planted graph alignment
by: Ganassali, Luca, et al.
Published: (2021)
by: Ganassali, Luca, et al.
Published: (2021)
Fitting an ellipsoid to a quadratic number of random points
by: Bandeira, Afonso S., et al.
Published: (2023)
by: Bandeira, Afonso S., et al.
Published: (2023)
Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
by: Fan, Zhou, et al.
Published: (2026)
by: Fan, Zhou, et al.
Published: (2026)
Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)
by: Li, Shuangping, et al.
Published: (2023)
Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
by: Chen, Shujing, et al.
Published: (2025)
by: Chen, Shujing, et al.
Published: (2025)
On Unbiased Low-Rank Approximation with Minimum Distortion
by: Barnes, Leighton Pate, et al.
Published: (2025)
by: Barnes, Leighton Pate, et al.
Published: (2025)
Detection of local geometry in random graphs: information-theoretic and computational limits
by: Bok, Jinho, et al.
Published: (2026)
by: Bok, Jinho, et al.
Published: (2026)
Zeroth-order Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2025)
by: Kook, Yunbum, et al.
Published: (2025)
Tensor cumulants for statistical inference on invariant distributions
by: Kunisky, Dmitriy, et al.
Published: (2024)
by: Kunisky, Dmitriy, et al.
Published: (2024)
Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
by: Zhou, Leo, et al.
Published: (2024)
by: Zhou, Leo, et al.
Published: (2024)
Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
by: He, Yiyun, et al.
Published: (2023)
by: He, Yiyun, et al.
Published: (2023)
Probability Tools for Sequential Random Projection
by: Li, Yingru
Published: (2024)
by: Li, Yingru
Published: (2024)
Scalable network reconstruction in subquadratic time
by: Peixoto, Tiago P.
Published: (2024)
by: Peixoto, Tiago P.
Published: (2024)
A proximal gradient algorithm for composite log-concave sampling
by: Liu, Linghai, et al.
Published: (2026)
by: Liu, Linghai, et al.
Published: (2026)
Improved sampling algorithms and functional inequalities for non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)
by: He, Yuchen, et al.
Published: (2025)
Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)
by: Jing, Fei, et al.
Published: (2024)
Sample-Efficient Private Learning of Mixtures of Gaussians
by: Ashtiani, Hassan, et al.
Published: (2024)
by: Ashtiani, Hassan, et al.
Published: (2024)
Similar Items
-
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023) -
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
by: Gong, Shuyang, et al.
Published: (2024) -
Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024) -
Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023) -
Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
by: Chen, Guanyi, et al.
Published: (2025)