Follow
Kabir Aladin Verchand
Kabir Aladin Verchand
Other namesKabir Aladin Chandrasekher
Postdoc, University of Cambridge and Georgia Institute of Technology
Verified email at gatech.edu - Homepage
Title
Cited by
Cited by
Year
Saffron: A fast, efficient, and robust framework for group testing based on sparse-graph codes
K Lee, K Chandrasekher, R Pedarsani, K Ramchandran
IEEE Transactions on Signal Processing 67 (17), 4649-4664, 2019
862019
Maximizing road capacity using cars that influence people
DA Lazar, R Pedarsani, K Chandrasekher, D Sadigh
2018 IEEE Conference on Decision and Control (CDC), 1801-1808, 2018
422018
Sharp global convergence guarantees for iterative nonconvex optimization with random data
KA Chandrasekher, A Pananjady, C Thrampoulidis
The Annals of Statistics 51 (1), 179-210, 2023
24*2023
Alternating minimization for generalized rank one matrix sensing: Sharp predictions from a random initialization
KA Verchand, M Lou, A Pananjady
International Conference on Algorithmic Learning Theory, 808-809, 2024
10*2024
Finding planted cliques in sublinear time
J Mardia, H Asi, KA Chandrasekher
arXiv preprint arXiv:2004.12002, 2020
102020
Asynchronous and noncoherent neighbor discovery for the iot using sparse-graph codes
K Chandrasekher, K Lee, P Kairouz, R Pedarsani, K Ramchandran
2017 IEEE International Conference on Communications (ICC), 1-6, 2017
92017
Imputation for high-dimensional linear regression
KA Chandrasekher, AE Alaoui, A Montanari
arXiv preprint arXiv:2001.09180, 2020
42020
Static & dynamic appointment scheduling with stochastic gradient descent
G Cheng, K Chandrasekher, J Walrand
2019 American Control Conference (ACC), 2092-2099, 2019
32019
Hyperparameter tuning via trajectory predictions: Stochastic prox-linear methods in matrix sensing
M Lou, KA Verchand, A Pananjady
arXiv preprint arXiv:2402.01599, 2024
22024
Density evolution on a class of smeared random graphs
K Chandrasekher, O Ocal, K Ramchandran
2017 IEEE International Symposium on Information Theory (ISIT), 2915-2919, 2017
2*2017
Low-degree phase transitions for detecting a planted clique in sublinear time
J Mardia, KA Verchand, AS Wein
arXiv preprint arXiv:2402.05451, 2024
12024
High-probability minimax lower bounds
T Ma, KA Verchand, RJ Samworth
arXiv preprint arXiv:2406.13447, 2024
2024
Some Results in High Dimensional Statistics: Iterative Algorithms and Regression with Missing Data
KA Verchand
Stanford University, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–13