Search Results for author: Abhishek Dhawan

Found 3 papers, 0 papers with code

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs

no code implementations5 Apr 2024 Abhishek Dhawan, Yuzhou Wang

We prove that the maximum balanced independent set has density $\left(\frac{r\log d}{(r-1)d}\right)^{1/(r-1)}$ asymptotically.

Detection of Dense Subhypergraphs by Low-Degree Polynomials

no code implementations17 Apr 2023 Abhishek Dhawan, Cheng Mao, Alexander S. Wein

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$.

Sharp analysis of EM for learning mixtures of pairwise differences

no code implementations20 Feb 2023 Abhishek Dhawan, Cheng Mao, Ashwin Pananjady

We consider a symmetric mixture of linear regressions with random samples from the pairwise comparison design, which can be seen as a noisy version of a type of Euclidean distance geometry problem.

Cannot find the paper you are looking for? You can Submit a new open access paper.