Finding planted cliques using gradient descent

DOI10.1137/24M1680489MaRDI QIDQ6956548zbMATH OpenFDO

Authors Reza Gheissari, Aukosh Jagannath, Yiming Xu

Publication date 18 July 2025

Published in SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

zbMATH Keywords

Markov chain Monte Carlo methodgradient descentplanted clique problemstatistical-to-computational gaps

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

This page was built for publication: Finding planted cliques using gradient descent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956548)