Sledovať
Kabir Aladin Verchand
Kabir Aladin Verchand
Ďalšie menáKabir Aladin Chandrasekher
Postdoc, University of Cambridge and Georgia Institute of Technology
Overená e-mailová adresa na: gatech.edu - Domovská stránka
Názov
Citované v
Citované v
Rok
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
912019
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
442018
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
33*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
13*2024
Finding planted cliques in sublinear time
J Mardia, H Asi, KA Chandrasekher
arXiv preprint arXiv:2004.12002, 2020
92020
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
52020
Static & dynamic appointment scheduling with stochastic gradient descent
G Cheng, K Chandrasekher, J Walrand
2019 American Control Conference (ACC), 2092-2099, 2019
42019
Hyperparameter tuning via trajectory predictions: Stochastic prox-linear methods in matrix sensing
M Lou, KA Verchand, A Pananjady
arXiv preprint arXiv:2402.01599, 2024
32024
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
High-dimensional logistic regression with missing data: Imputation, regularization, and universality
KA Verchand, A Montanari
arXiv preprint arXiv:2410.01093, 2024
12024
Low-degree phase transitions for detecting a planted clique in sublinear time
J Mardia, KA Verchand, AS Wein
The Thirty Seventh Annual Conference on Learning Theory, 3798-3822, 2024
12024
High-probability minimax lower bounds
T Ma, KA Verchand, RJ Samworth
arXiv preprint arXiv:2406.13447, 2024
12024
Estimation beyond Missing (Completely) at Random
T Ma, KA Verchand, TB Berrett, T Wang, RJ Samworth
arXiv preprint arXiv:2410.10704, 2024
2024
Some Results in High Dimensional Statistics: Iterative Algorithms and Regression with Missing Data
KA Verchand
Stanford University, 2023
2023
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–15