Metraipolis › archive › dc_30239f70a5dc

Efficient Recovery of Latent Coordinate Structure from Sparse Observations of the Hypercube — arXiv:2610.11741

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11741
License (as archived)
CC0-1.0
Archived
2026-10-09T06:36:24.445Z
SHA-256 of the archived text
a429f1cf0ef86a5f9452191a3f9c3b180f030cbad7f621f9f2f7508e5730eaa4
Stable URL of this page
https://metraipolis.com/documento/dc_30239f70a5dc

How to cite

Efficient Recovery of Latent Coordinate Structure from Sparse Observations of the Hypercube — arXiv:2610.11741 — arXiv (en), https://arxiv.org/abs/2610.11741 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30239f70a5dc (Metraipolis archive dc_30239f70a5dc, sha256 a429f1cf0ef86a5f9452191a3f9c3b180f030cbad7f621f9f2f7508e5730eaa4)
BibTeX
@misc{dc30239f70a5dc,
  title = {Efficient Recovery of Latent Coordinate Structure from Sparse Observations of the Hypercube — arXiv:2610.11741},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11741},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30239f70a5dc; sha256 a429f1cf0ef86a5f9452191a3f9c3b180f030cbad7f621f9f2f7508e5730eaa4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11741. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Recovering latent geometric structure from graph observations is a well-studied problem in statistical inference. Kapralov, Trevisan, and Wrzos-Kaminska (2026) introduced the problem of recovering the coordinate structure of the Boolean hypercube from a small random sample of its edges. More specifically, there are $n=2^d$ vertices, each corresponding to a distinct "feature" vector in $\{\pm 1\}^d$. Between each pair whose feature vectors are at Hamming distance one, an edge is observed independently with probability $p$. As long as the expected degree $pd$ is $\gtrsim \log d = \log \log n$, we give a polynomial-time algorithm that, given only the graph of observed edges, correctly recovers the entire feature vector of all but a vanishing fraction of vertices. This matches the information-theoretic guarantee of Kapralov, Trevisan, and Wrzos-Kaminska in polynomial rather than exponential time, resolving the algorithmic question left open by their work. Our algorithm combines a degree-$4$ sum-of-squares certificate for the structure of balanced near-minimum cuts with a rounding scheme originally developed for tensor decomposition by Ma, Shi, and Steurer (2016). The analysis relies on two novel ingredients: a sum-of-squares version of the Friedgut-Kalai-Naor theorem in Boolean Fourier analysis and a spectral concentration result for the observed subgraph of the hypercube. Finally, we provide a justification for why higher-degree sum-of-squares might be needed by showing a limitation of the basic SDP relaxation of this problem.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.11741 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:57:12.711Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).