Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1402.1267
Cited By
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
6 February 2014
Yudong Chen
Jiaming Xu
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices"
32 / 32 papers shown
Title
Implications of sparsity and high triangle density for graph representation learning
Hannah Sansford
Alexander Modell
N. Whiteley
Patrick Rubin-Delanchy
25
1
0
27 Oct 2022
Detecting Planted Partition in Sparse Multi-Layer Networks
Anirban Chatterjee
Sagnik Nandy
Ritwik Sadhu
13
1
0
15 Sep 2022
Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
Jun Sheng
Thomas Strohmer
25
0
0
24 May 2022
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits
Doyeon Kim
Jeonghwa Lee
Hye Won Chung
41
3
0
19 Nov 2021
Inferring Hidden Structures in Random Graphs
Wasim Huleihel
14
7
0
05 Oct 2021
Random Subgraph Detection Using Queries
Wasim Huleihel
A. Mazumdar
S. Pal
23
6
0
02 Oct 2021
Semidefinite Programming for Community Detection with Side Information
Mohammadjafar Esmaeili
H. Saad
Aria Nosratinia
26
9
0
06 May 2021
A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix
C. Watanabe
Taiji Suzuki
25
0
0
23 Feb 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan
Guy Bresler
Samuel B. Hopkins
J. Li
T. Schramm
19
62
0
13 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits
Yuetian Luo
Anru R. Zhang
24
44
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
21
85
0
16 May 2020
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Matthew Brennan
Guy Bresler
21
50
0
20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection
Matthew Brennan
Guy Bresler
Wasim Huleihel
27
26
0
19 Feb 2019
Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach
Chiheon Kim
Afonso S. Bandeira
M. Goemans
12
53
0
08 Jul 2018
Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
Kwangjun Ahn
Kangwook Lee
Changho Suh
19
62
0
23 May 2018
Evaluating Overfit and Underfit in Models of Network Community Structure
Amir Ghasemian
Homa Hosseinmardi
A. Clauset
28
142
0
28 Feb 2018
Adaptive Clustering through Semidefinite Programming
Martin Royer
13
30
0
18 May 2017
Two-Sample Tests for Large Random Graphs Using Network Statistics
D. Ghoshdastidar
Maurilio Gutzeit
Alexandra Carpentier
U. V. Luxburg
22
39
0
17 May 2017
Community Detection in Hypergraphs, Spiked Tensor Models, and Sum-of-Squares
Chiheon Kim
Afonso S. Bandeira
M. Goemans
17
53
0
08 May 2017
Tensor SVD: Statistical and Computational Limits
Anru R. Zhang
Dong Xia
21
166
0
08 Mar 2017
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization
Jessica E. Banks
Cristopher Moore
Nicolas Verzélen
Roman Vershynin
Jiaming Xu
29
74
0
18 Jul 2016
The use of deep learning in image segmentation, classification and detection
Mihai-Sorin Badea
Iulian-Ionut Felea
L. Florea
C. Vertan
39
41
0
31 May 2016
Local Algorithms for Block Models with Side Information
Elchanan Mossel
Jiaming Xu
30
49
0
10 Aug 2015
Asymptotic Mutual Information for the Two-Groups Stochastic Block Model
Y. Deshpande
Emmanuel Abbe
Andrea Montanari
25
56
0
30 Jul 2015
Minimax Rates of Community Detection in Stochastic Block Models
A. Zhang
Harrison H. Zhou
27
185
0
19 Jul 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
Bruce Hajek
Yihong Wu
Jiaming Xu
35
136
0
26 Feb 2015
Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems
Y. Deshpande
Andrea Montanari
25
84
0
23 Feb 2015
Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix
T. Tony Cai
Tengyuan Liang
Alexander Rakhlin
32
61
0
06 Feb 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
Bruce Hajek
Yihong Wu
Jiaming Xu
53
249
0
24 Nov 2014
Statistical and computational trade-offs in estimation of sparse principal components
Tengyao Wang
Quentin Berthet
R. Samworth
56
136
0
22 Aug 2014
Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results
Jiaming Xu
Laurent Massoulié
Marc Lelarge
24
47
0
26 Jun 2014
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
92
0
0
11 Oct 2012
1