Copertina

Spectral clustering in the Gaussian mixture block model

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Shuangping, Schramm, Tselil
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning Data Structures and Algorithms Social and Information Networks Probability Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Easy, robust approximate message passing for planted spike models
di: Ivkov, Misha, et al.
Pubblicazione: (2026)

Some easy optimization problems have the overlap-gap property
di: Li, Shuangping, et al.
Pubblicazione: (2024)

Efficient Graph Matching for Correlated Stochastic Block Models
di: Chai, Shuwen, et al.
Pubblicazione: (2024)

Discrepancy Algorithms for the Binary Perceptron
di: Li, Shuangping, et al.
Pubblicazione: (2024)

Detection of local geometry in random graphs: information-theoretic and computational limits
di: Bok, Jinho, et al.
Pubblicazione: (2026)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
di: Kunisky, Dmitriy
Pubblicazione: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
di: Barnes, Leighton Pate, et al.
Pubblicazione: (2025)

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

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

Modularity and partially observed graphs
di: McDiarmid, Colin, et al.
Pubblicazione: (2021)

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

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

Fast, robust approximate message passing
di: Ivkov, Misha, et al.
Pubblicazione: (2024)

Node Similarities under Random Projections: Limits and Pathological Cases
di: Tadić, Tvrtko, et al.
Pubblicazione: (2024)

Learning bounded-degree polytrees with known skeleton
di: Choo, Davin, et al.
Pubblicazione: (2023)

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

Fitting an ellipsoid to a quadratic number of random points
di: Bandeira, Afonso S., et al.
Pubblicazione: (2023)

Functional Stochastic Localization
di: Gu, Anming, et al.
Pubblicazione: (2026)

High-accuracy log-concave sampling with stochastic queries
di: Chen, Fan, et al.
Pubblicazione: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
di: Blanca, Antonio, et al.
Pubblicazione: (2022)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
di: Ma, Yuxin, et al.
Pubblicazione: (2025)

Perspectives on Stochastic Localization
di: Shi, Bobby, et al.
Pubblicazione: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
di: De, Debsurya, et al.
Pubblicazione: (2025)

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)

Correlation detection in trees for planted graph alignment
di: Ganassali, Luca, et al.
Pubblicazione: (2021)

Universality of first-order methods on random and deterministic matrices
di: Gorini, Nicola, et al.
Pubblicazione: (2026)

Polynomial-time sampling despite disorder chaos
di: Ma, Eric, et al.
Pubblicazione: (2025)

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)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
di: Basiri, Salar, et al.
Pubblicazione: (2022)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
di: Matsumoto, Namiko, et al.
Pubblicazione: (2025)

The stochastic block model has the overlap graph property for modularity
di: Bhamidi, Shankar, et al.
Pubblicazione: (2026)

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

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
di: He, Yiyun, et al.
Pubblicazione: (2023)

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

Tensor cumulants for statistical inference on invariant distributions
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
di: Zhou, Leo, et al.
Pubblicazione: (2024)

Planted Bipartite Graph Detection
di: Rotenberg, Asaf, et al.
Pubblicazione: (2023)