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.
By Dor Elimelech, Wasim Huleihel
arXiv:2606. 14335v1 Announce Type: cross Abstract: Recovering structural information from noisy high-dimensional data is a fundamental task in statistical inference.
By Zhe Hou, Jingcheng Liu
arXiv:2609.14953v1 Announce Type: cross
Abstract: This paper aims to develop new and efficient distributed algorithms for solving a class of monotone inclusions, $0 \in \sum_{i=1}^n (G_ix + T_ix)$, o...
By Nghia Nguyen-Trung, Ion Necoara, Quoc Tran-Dinh
arXiv:2606. 02223v1 Announce Type: new Abstract: Estimating the generative mechanism of large-scale networks is a fundamental challenge in statistical machine learning.
By Charles Dufour, Ulysse Naepels, Leonardo V. Santoro
The paper applies parameterised graph theory to tensor networks, showing that cutwidth and tree‑cutwidth bound the bond‑dimension overhead needed to represent a tensor‑network state as a matrix product state or tree tensor network. It derives graph‑dependent upper bounds on the sample and computational complexity of tensor‑network tomography, introducing a new graph parameter called learning complexity. Finally, it extends the framework to an agnostic learner that approximates any state with a tensor‑network state of given bond dimension, providing explicit graph‑dependent complexity bounds.
By Matthias C. Caro, Natalie McHugh, Sergii Strelchuk
The paper investigates how to balance approximation accuracy and stability in deep spline superposition networks under a strict layerwise Lipschitz budget. It provides an exact solution to the finite‑depth diagonal balancing problem, shows how to construct spline discretisations that respect the budget, and establishes minimax lower bounds for operators constrained in both first and third derivative norms. The authors also demonstrate that layer errors can accumulate linearly with depth, indicating that the upper bound is not merely a theoretical artifact.
By Aleksander Tankman