Kwangjun Ahn
Kwangjun Ahn
PhD Student, MIT
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Hypergraph spectral clustering in the weighted stochastic block model
K Ahn, K Lee, C Suh
IEEE Journal of Selected Topics in Signal Processing 12 (5), 959-974, 2018
262018
Community recovery in hypergraphs
K Ahn, K Lee, C Suh
IEEE Transactions on Information Theory 65 (10), 6561-6579, 2019
212019
Binary rating estimation with graph side information
K Ahn, K Lee, H Cha, C Suh
Advances in Neural Information Processing Systems (NeurIPS), 4272-4283, 2018
142018
From Nesterov's Estimate Sequence to Riemannian Acceleration
K Ahn, S Sra
Proceedings of Thirty Third Conference on Learning Theory (COLT), PMLR 125 …, 2020
122020
SGD with shuffling: optimal rates without component convexity and large epoch requirements
K Ahn, C Yun, S Sra
Advances in Neural Information Processing Systems (NeurIPS) 33, 2020
10*2020
Graph Matrices: Norm Bounds and Applications
K Ahn, D Medarametla, A Potechin
arXiv preprint 1604.03423, 2020
9*2020
Information-theoretic limits of subspace clustering
K Ahn, K Lee, C Suh
2017 IEEE International Symposium on Information Theory (ISIT), 2473-2477, 2017
52017
From Proximal Point Method to Nesterov's Acceleration
K Ahn
arXiv preprint arXiv:2005.08304, 2020
22020
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm
S Chewi, C Lu, K Ahn, X Cheng, TL Gouic, P Rigollet
arXiv preprint arXiv:2012.12810, 2020
12020
Efficient constrained sampling via the mirror-Langevin algorithm
K Ahn, S Chewi
arXiv preprint arXiv:2010.16212, 2020
12020
Computing the maximum matching width is NP-hard
K Ahn, J Jeong
arXiv preprint arXiv:1710.05117, 2017
12017
Riemannian Perspective on Matrix Factorization
K Ahn, F Suarez
arXiv preprint arXiv:2102.00937, 2021
2021
A simpler strong refutation of random -XOR
K Ahn
International Conference on Randomization and Computation (APPROX/RANDOM) 2020,, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–13