The following pages link to Jiaming Xu (Q660952):
Displaying 33 items.
- A self-adaptive differential evolution algorithm for binary CSPs (Q660953) (← links)
- The planted matching problem: phase transitions and exact results (Q2075325) (← links)
- The all-or-nothing phenomenon in sparse linear regression (Q2078961) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- Local Algorithms for Block Models with Side Information (Q2800554) (← links)
- Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices (Q2810798) (← links)
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions (Q2976594) (← links)
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming (Q2976866) (← links)
- (Q4558187) (← links)
- Submatrix localization via message passing (Q4558513) (← links)
- Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization (Q4682810) (← links)
- Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942) (← links)
- Consistent Recovery Threshold of Hidden Nearest Neighbor Graphs (Q4958222) (← links)
- Improved queue-size scaling for input-queued switches via graph factorization (Q5005035) (← links)
- (Q5053318) (← links)
- Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs (Q5080672) (← links)
- Settling the Sharp Reconstruction Thresholds of Random Graph Matching (Q5096999) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- Seeded graph matching via large neighborhood statistics (Q5136925) (← links)
- The Supermarket Game (Q5168871) (← links)
- (Q5209012) (← links)
- Information Limits for Recovering a Hidden Community (Q5369834) (← links)
- (Q5399641) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- The planted matching problem: sharp threshold and infinite-order phase transition (Q6095833) (← links)
- Testing correlation of unlabeled random graphs (Q6109918) (← links)
- Learner-Private Convex Optimization (Q6196118) (← links)
- Rectangular matrix additions in low and high temperatures (Q6509305) (← links)
- Sharp Information-Theoretic Thresholds for Shuffled Linear Regression (Q6521886) (← links)
- Random sorting networks: edge limit (Q6596225) (← links)
- Clustering High-Dimensional Noisy Categorical Data (Q6651408) (← links)
- Global convergence of federated learning for mixed regression (Q6670138) (← links)
