← Back to all news
arXiv Machine Learning By Dor Elimelech, Wasim Huleihel

Robust Detection of Planted Subgraphs in Semi-Random Models

Read the original on arXiv Machine Learning →

arXiv:2508. 02158v2 Announce Type: replace-cross Abstract: Detection of planted subgraphs in Erd\"os-R\'enyi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresholds.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 3

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming

arXiv:2601. 03946v3 Announce Type: replace-cross Abstract: We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero entries.

By Valentine Olanubi (University of Alabama, Department of Mathematics), Phineas Agar (University of Alabama, Department of Mathematics), Brendan Ames (University of Southampton, School of Mathematical Sciences)
safety
More like this →
arXiv Machine Learning
Jun 5

Sharp Low-Degree Thresholds for Planted-vs-Planted Testing

arXiv:2606. 05266v1 Announce Type: new Abstract: We establish the first sharp thresholds for low-degree polynomial tests in planted-vs-planted settings, where the goal is to determine with vanishing error which of two structured planted mechanisms generated the observed data.

By Anda Skeja, Daniel Guti\'errez Espinoza, Fiona Skerman, Alexander S. Wein
More like this →
arXiv Machine Learning
Aug 26

Multi-Source Complex Network Reconstruction via Wasserstein Distributionally Robust Optimization and Algorithm Unrolling

The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.

By Chuansen Peng, Yifan Xia, Jinshan Zhong, Xiaojing Shen
efficiencybenchmarkssafety
More like this →