4 citations · 6 across the 4 of their papers we have counts for
5 papers
Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspective
Kabir Aladin Chandrasekher, Ashwin Pananjady, Christos Thrampoulidis
We consider a general class of regression models with normally distributed covariates, and the associated nonconvex problem of fitting these models from data. We develop a general…
Finding Planted Cliques in Sublinear Time
Jay Mardia, Hilal Asi, Kabir Aladin Chandrasekher
We study the planted clique problem in which a clique of size k is planted in an Erdos-Renyi graph G(n,1/2) and one is interested in recovering this planted clique. It is widely be…
Imputation for High-Dimensional Linear Regression
Kabir Aladin Chandrasekher, Ahmed El Alaoui, Andrea Montanari
We study high-dimensional regression with missing entries in the covariates. A common strategy in practice is to \emph{impute} the missing entries with an appropriate substitute an…
Maximizing Road Capacity Using Cars that Influence People
Daniel A. Lazar, Kabir Chandrasekher, Ramtin Pedarsani +1
The emerging technology enabling autonomy in vehicles has led to a variety of new problems in transportation networks, such as planning and perception for autonomous vehicles. Othe…
Density Evolution on a Class of Smeared Random Graphs: A Theoretical Framework for Fast MRI
Kabir Chandrasekher, Orhan Ocal, Kannan Ramchandran
We introduce a new ensemble of random bipartite graphs, which we term the `smearing ensemble', where each left node is connected to some number of consecutive right nodes. Such gra…