Folgen
Ainesh Bakshi
Ainesh Bakshi
Massachusetts Institute of Technology
Bestätigte E-Mail-Adresse bei cs.cmu.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Learning two layer rectified neural networks in polynomial time
A Bakshi, R Jayaram, DP Woodruff
Conference on Learning Theory, 195-268, 2019
842019
File systems fated for senescence? nonsense, says science!
A Conway, A Bakshi, Y Jiao, W Jannen, Y Zhan, J Yuan, MA Bender, ...
15th USENIX Conference on File and Storage Technologies (FAST 17), 45-58, 2017
822017
Robustly learning mixtures of k arbitrary Gaussians
A Bakshi, I Diakonikolas, H Jia, DM Kane, PK Kothari, SS Vempala
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
652022
Robust linear regression: Optimal rates in polynomial time
A Bakshi, A Prasad
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
602021
List-decodable subspace recovery: Dimension independent error in polynomial time
A Bakshi, PK Kothari
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
45*2021
Outlier-robust clustering of non-spherical mixtures
A Bakshi, P Kothari
arXiv preprint arXiv:2005.02970, 2020
412020
Sublinear time low-rank approximation of distance matrices
A Bakshi, DP Woodruff
arXiv preprint arXiv:1809.06986, 2018
34*2018
Outlier-robust clustering of gaussians and other non-spherical mixtures
A Bakshi, I Diakonikolas, SB Hopkins, D Kane, S Karmalkar, PK Kothari
2020 ieee 61st annual symposium on foundations of computer science (focs …, 2020
322020
Low-rank approximation with 1/𝜖1/3 matrix-vector products
A Bakshi, KL Clarkson, DP Woodruff
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
202022
Robust and sample optimal algorithms for PSD low rank approximation
A Bakshi, N Chepurko, DP Woodruff
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
192020
Testing positive semi-definiteness via random submatrices
A Bakshi, N Chepurko, R Jayaram
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
172020
Learning quantum Hamiltonians at any temperature in polynomial time
A Bakshi, A Liu, A Moitra, E Tang
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1470-1477, 2024
152024
A novel feature selection and extraction technique for classification
K Goel, R Vohra, A Bakshi
2014 14th International Conference on Frontiers in Handwriting Recognition …, 2014
132014
An improved classical singular value transformation for quantum machine learning
A Bakshi, E Tang
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
122024
A new approach to learning linear dynamical systems
A Bakshi, A Liu, A Moitra, M Yau
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 335-348, 2023
102023
Learning a Latent Simplex in Input-Sparsity Time
A Bakshi, C Bhattacharyya, R Kannan, DP Woodruff, S Zhou
arXiv preprint arXiv:2105.08005, 2021
102021
Chance constraint based multi-objective vendor selection using NSGAII
R Aggarwal, A Bakshi
Procedia Computer Science 48, 699-705, 2015
102015
Weighted maximum independent set of geometric objects in turnstile streams
A Bakshi, N Chepurko, DP Woodruff
arXiv preprint arXiv:1902.10328, 2019
92019
Krylov methods are (nearly) optimal for low-rank approximation
A Bakshi, S Narayanan
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
82023
Robust communication-optimal distributed clustering algorithms
P Awasthi, A Bakshi, MF Balcan, C White, D Woodruff
arXiv preprint arXiv:1703.00830, 2017
82017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20