Detection of Dense Subhypergraphs by Low-Degree Polynomials
- URL: http://arxiv.org/abs/2304.08135v1
- Date: Mon, 17 Apr 2023 10:38:08 GMT
- Title: Detection of Dense Subhypergraphs by Low-Degree Polynomials
- Authors: Abhishek Dhawan, Cheng Mao, Alexander S. Wein
- Abstract summary: Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem.
We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph.
Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
- Score: 72.4451045270967
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Detection of a planted dense subgraph in a random graph is a fundamental
statistical and computational problem that has been extensively studied in
recent years. We study a hypergraph version of the problem. Let $G^r(n,p)$
denote the $r$-uniform Erd\H{o}s-R\'enyi hypergraph model with $n$ vertices and
edge density $p$. We consider detecting the presence of a planted
$G^r(n^\gamma, n^{-\alpha})$ subhypergraph in a $G^r(n, n^{-\beta})$
hypergraph, where $0< \alpha < \beta < r-1$ and $0 < \gamma < 1$. Focusing on
tests that are degree-$n^{o(1)}$ polynomials of the entries of the adjacency
tensor, we determine the threshold between the easy and hard regimes for the
detection problem. More precisely, for $0 < \gamma < 1/2$, the threshold is
given by $\alpha = \beta \gamma$, and for $1/2 \le \gamma < 1$, the threshold
is given by $\alpha = \beta/2 + r(\gamma - 1/2)$.
Our results are already new in the graph case $r=2$, as we consider the
subtle log-density regime where hardness based on average-case reductions is
not known. Our proof of low-degree hardness is based on a conditional variant
of the standard low-degree likelihood calculation.
Related papers
- A computational transition for detecting correlated stochastic block models by low-degree polynomials [13.396246336911842]
Detection of correlation in a pair of random graphs is a fundamental statistical and computational problem that has been extensively studied in recent years.
We consider a pair of correlated block models $mathcalS(n,tfraclambdan;k,epsilon;s)$ that are subsampled from a common parent block model $mathcal S(n,tfraclambdan;k,epsilon;s)$
We focus on tests based on emphlow-degrees of the entries of the adjacency
arXiv Detail & Related papers (2024-09-02T06:14:05Z) - Distribution-Independent Regression for Generalized Linear Models with
Oblivious Corruptions [49.69852011882769]
We show the first algorithms for the problem of regression for generalized linear models (GLMs) in the presence of additive oblivious noise.
We present an algorithm that tackles newthis problem in its most general distribution-independent setting.
This is the first newalgorithmic result for GLM regression newwith oblivious noise which can handle more than half the samples being arbitrarily corrupted.
arXiv Detail & Related papers (2023-09-20T21:41:59Z) - Planted Bipartite Graph Detection [13.95780443241133]
We consider the task of detecting a hidden bipartite subgraph in a given random graph.
Under the null hypothesis, the graph is a realization of an ErdHosR'enyi random graph over $n$ with edge density $q$.
Under the alternative, there exists a planted $k_mathsfR times k_mathsfL$ bipartite subgraph with edge density $p>q$.
arXiv Detail & Related papers (2023-02-07T18:18:17Z) - Learning (Very) Simple Generative Models Is Hard [45.13248517769758]
We show that no-time algorithm can solve problem even when output coordinates of $mathbbRdtobbRd'$ are one-hidden-layer ReLU networks with $mathrmpoly(d)$ neurons.
Key ingredient in our proof is an ODE-based construction of a compactly supported, piecewise-linear function $f$ with neurally-bounded slopes such that the pushforward of $mathcalN(0,1)$ under $f$ matches all low-degree moments of $mathcal
arXiv Detail & Related papers (2022-05-31T17:59:09Z) - Fast Graph Sampling for Short Video Summarization using Gershgorin Disc
Alignment [52.577757919003844]
We study the problem of efficiently summarizing a short video into several paragraphs, leveraging recent progress in fast graph sampling.
Experimental results show that our algorithm achieves comparable video summarization as state-of-the-art methods, at a substantially reduced complexity.
arXiv Detail & Related papers (2021-10-21T18:43:00Z) - Infinite-Horizon Offline Reinforcement Learning with Linear Function
Approximation: Curse of Dimensionality and Algorithm [46.36534144138337]
In this paper, we investigate the sample complexity of policy evaluation in offline reinforcement learning.
Under the low distribution shift assumption, we show that there is an algorithm that needs at most $Oleft(maxleft fracleftVert thetapirightVert _24varepsilon4logfracddelta,frac1varepsilon2left(d+logfrac1deltaright)right right)$ samples to approximate the
arXiv Detail & Related papers (2021-03-17T18:18:57Z) - Sharp threshold for alignment of graph databases with Gaussian weights [1.6752182911522522]
We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment.
We prove that there is a sharp threshold for exact recovery of $pi*$.
arXiv Detail & Related papers (2020-10-30T14:42:17Z) - Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample
Complexity [59.34067736545355]
Given an MDP with $S$ states, $A$ actions, the discount factor $gamma in (0,1)$, and an approximation threshold $epsilon > 0$, we provide a model-free algorithm to learn an $epsilon$-optimal policy.
For small enough $epsilon$, we show an improved algorithm with sample complexity.
arXiv Detail & Related papers (2020-06-06T13:34:41Z) - Curse of Dimensionality on Randomized Smoothing for Certifiable
Robustness [151.67113334248464]
We show that extending the smoothing technique to defend against other attack models can be challenging.
We present experimental results on CIFAR to validate our theory.
arXiv Detail & Related papers (2020-02-08T22:02:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.