Ainesh Bakshi

Email: abakshi (at) cs (dot) cmu (dot) edu

Office: GHC 7515

I am a second year PhD student at Carnegie Mellon University. I am extremely fortunate to be advised by David Woodruff. I am broadly interested in Theoretical Computer Science and my current research interests are algorithms for randomized linear algebra, communication complexity and provable guarantees for learning problems.

Previously, I was an undergrad at Rutgers, New Brunswick, where I had the pleasure of working with Martin Farach-Colton and Pranjal Awasthi on external memory algorithms and clustering respectively.


Publications

"Learning Two Layer Rectified Neural Networks in Polynomial Time"
Ainesh Bakshi, Rajesh Jayaram, David Woodruff
Preprint.

"Sublinear Time Low-Rank Approximation of Distance Matrices"
Ainesh Bakshi, David Woodruff
NIPS 2018 (to appear). Selected for Spotlight Presentation.

"How to Fragment your File System"
A. Conway, A. Bakshi, Y. Jiao, Y. Zhan, M. Bender, W. Jannen, R. Johnson, B. Kuzmaul, D. Porter, J. Yuan, M. Farach-Colton
;login: magazine, vol. 42(2), 2017.

"File Systems fated for Senescence? Nonsense, Says Science!"
A. Conway, A. Bakshi, Y. Jiao, Y. Zhan, M. Bender, W. Jannen, R. Johnson, B. Kuzmaul, D. Porter, J. Yuan, M. Farach-Colton
Proceedings of the 15th USENIX Conference on File and Storage Technologies (FAST '17), Santa Clara, CA, February 2017.

"Non Dominated Sorting Genetic Algorithm for Chance Constrained Supplier Selection Model with Volume Discounts"
R. Agarwal, A. Bakshi
ACIIDS, Lecture Notes in Computer Science pp. 465–474, Apr 2014.

"A Novel Feature Selection and Extraction Technique for Classification"
K. Goel, R. Vohra A. Bakshi
ICFHR 2014, pp. 104-109.

"Autonomous Robot Navigation: Path Planning on a Detail-Preserving Reduced-Complexity Representation of 3D Point Clouds"
R. Sant, N. Kulkarni, A. Bakshi, K. Goel, S. Kapur
ICFHR 2014, pp. 104-109.