Copertina

Finding planted cliques using gradient descent

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gheissari, Reza, Jagannath, Aukosh, Xu, Yiming
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms Probability Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Universality of high-dimensional scaling limits of stochastic gradient descent
di: Gheissari, Reza, et al.
Pubblicazione: (2025)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
di: Fan, Zhou, et al.
Pubblicazione: (2026)

Fixed-magnetization Ising on random graphs up to reconstruction
di: Gheissari, Reza, et al.
Pubblicazione: (2025)

Mixing of general biased adjacent transposition chains
di: Gheissari, Reza, et al.
Pubblicazione: (2025)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
di: Blanca, Antonio, et al.
Pubblicazione: (2024)

On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
di: Blanca, Antonio, et al.
Pubblicazione: (2023)

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

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

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
di: Chen, Zongchen, et al.
Pubblicazione: (2024)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
di: Jaquard, Hugo, et al.
Pubblicazione: (2024)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
di: Lovig, Maxwell, et al.
Pubblicazione: (2024)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
di: Bandeira, Afonso S.
Pubblicazione: (2025)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
di: Chen, Guanyi, et al.
Pubblicazione: (2025)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
di: Fu, Daniel, et al.
Pubblicazione: (2026)

Inference of rankings planted in random tournaments
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Local geometry of high-dimensional mixture models: Effective spectral theory and dynamical transitions
di: Arous, Gerard Ben, et al.
Pubblicazione: (2025)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
di: Zhang, Matthew S.
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)

Fast relaxation of the random field Ising dynamics
di: Alaoui, Ahmed El, et al.
Pubblicazione: (2023)

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)

Testing Convex Truncation
di: De, Anindya, et al.
Pubblicazione: (2023)

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

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)

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

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)

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

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)

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

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
di: R., Abhishek Hegade K., et al.
Pubblicazione: (2025)

Strong Low Degree Hardness for the Number Partitioning Problem
di: Mallarapu, Rushil, et al.
Pubblicazione: (2025)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
di: Sohn, Youngtak, et al.
Pubblicazione: (2025)

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
di: Lai, Peiyao, et al.
Pubblicazione: (2024)