Image de couverture de livre

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Kunisky, Dmitriy
Format:	Preprint
Publié:	2024
Sujets:	Statistics Theory Data Structures and Algorithms Combinatorics Probability Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
par: Kunisky, Dmitriy
Publié: (2024)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
par: De, Debsurya, et autres
Publié: (2025)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
par: Ma, Yuxin, et autres
Publié: (2025)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
par: Chen, Shujing, et autres
Publié: (2025)

Universality of first-order methods on random and deterministic matrices
par: Gorini, Nicola, et autres
Publié: (2026)

Inference of rankings planted in random tournaments
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Statistical inference of a ranked community in a directed graph
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Tensor cumulants for statistical inference on invariant distributions
par: Kunisky, Dmitriy, et autres
Publié: (2024)

The stochastic block model has the overlap graph property for modularity
par: Bhamidi, Shankar, et autres
Publié: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

Fitting an ellipsoid to random points: predictions using the replica method
par: Maillard, Antoine, et autres
Publié: (2023)

Learning bounded-degree polytrees with known skeleton
par: Choo, Davin, et autres
Publié: (2023)

Efficiently matching random inhomogeneous graphs via degree profiles
par: Ding, Jian, et autres
Publié: (2023)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Spectral clustering in the Gaussian mixture block model
par: Li, Shuangping, et autres
Publié: (2023)

Composition of random functions and word reconstruction
par: Chapuy, Guillaume, et autres
Publié: (2026)

On Unbiased Low-Rank Approximation with Minimum Distortion
par: Barnes, Leighton Pate, et autres
Publié: (2025)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Online Differentially Private Synthetic Data Generation
par: He, Yiyun, et autres
Publié: (2024)

Functional Stochastic Localization
par: Gu, Anming, et autres
Publié: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
par: Blanca, Antonio, et autres
Publié: (2022)

Perspectives on Stochastic Localization
par: Shi, Bobby, et autres
Publié: (2025)

Correlation detection in trees for planted graph alignment
par: Ganassali, Luca, et autres
Publié: (2021)

Fitting an ellipsoid to a quadratic number of random points
par: Bandeira, Afonso S., et autres
Publié: (2023)

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
par: He, Yiyun, et autres
Publié: (2023)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
par: Fu, Daniel, et autres
Publié: (2026)

Quality control in sublinear time: a case study via random graphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
par: Chen, Guanyi, et autres
Publié: (2024)

Modularity and partially observed graphs
par: McDiarmid, Colin, et autres
Publié: (2021)

Robust recovery for stochastic block models, simplified and generalized
par: Mohanty, Sidhanth, et autres
Publié: (2024)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
par: Chen, Zongchen, et autres
Publié: (2024)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
par: Zhou, Leo, et autres
Publié: (2024)

Zeroth-order Logconcave Sampling
par: Kook, Yunbum, et autres
Publié: (2025)

Detection of local geometry in random graphs: information-theoretic and computational limits
par: Bok, Jinho, et autres
Publié: (2026)

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
par: Luo, Yuetian, et autres
Publié: (2023)

A proximal gradient algorithm for composite log-concave sampling
par: Liu, Linghai, et autres
Publié: (2026)