Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bakshi, Ainesh
41  Ergebnisse:
Personensuche X
?
1

Learning Quantum Hamiltonians at Any Temperature in Polynom..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Bakshi, Ainesh ; Liu, Allen ; Moitra, Ankur. - p. 1470-1477 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Krylov Methods are (nearly) Optimal for Low-Rank Approximat..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Bakshi, Ainesh ; Narayanan, Shyam - p. 2093-2101 , 2023
Link: https://doi.org/10.1109/..
 
?
3

A New Approach to Learning Linear Dynamical Systems:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bakshi, Ainesh ; Liu, Allen ; Moitra, Ankur. - p. 335-348 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Robustly learning mixtures of k arbitrary Gaussians:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bakshi, Ainesh ; Diakonikolas, Ilias ; Jia, He... - p. 1234-1247 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

Low-rank approximation with 1/𝜖1/3 matrix-vector products:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bakshi, Ainesh ; Clarkson, Kenneth L. ; Woodruff, David P. - p. 1130-1143 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

Robust linear regression: optimal rates in polynomial time:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bakshi, Ainesh ; Prasad, Adarsh - p. 102-115 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

List-Decodable Subspace Recovery: Dimension Independent Err..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Bakshi, Ainesh ; Kothari, Pravesh K. - p. 1279-1297 , 2021
Link: https://doi.org/10.1137/..
 
?
8

List-decodable subspace recovery : dimension independent..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Bakshi, Ainesh ; Kothari, Pravesh K. - p. 1279-1297 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Outlier-Robust Clustering of Gaussians and Other Non-Spheri..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bakshi, Ainesh ; Diakonikolas, Ilias ; Hopkins, Samuel B.... - p. 149-159 , 2020
Link: https://doi.org/10.1109/..
 
?
10

Robust and Sample Optimal Algorithms for PSD Low Rank Appro..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bakshi, Ainesh ; Chepurko, Nadiia ; Woodruff, David P. - p. 506-516 , 2020
Link: https://doi.org/10.1109/..
 
?
11

Testing Positive Semi-Definiteness via Random Submatrices:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bakshi, Ainesh ; Chepurko, Nadiia ; Jayaram, Rajesh - p. 1191-1202 , 2020
Link: https://doi.org/10.1109/..
 
?
12

Chance Constraint Based Multi-objective Vendor Selection Us..:

Aggarwal, Remica ; Bakshi, Ainesh
Procedia Computer Science.  48 (2015)  - p. 699-705 , 2015
Link: https://doi.org/10.1016/..
 
?
13

File System Aging:

Conway, Alex ; Bakshi, Ainesh ; Bhattacharya, Arghya...
http://arxiv.org/abs/2401.08858.  , 2024
Link: http://arxiv.org/abs/240..
 
?
14

Tensor Decompositions Meet Control Theory: Learning General..:

Bakshi, Ainesh ; Liu, Allen ; Moitra, Ankur.
http://arxiv.org/abs/2307.06538.  , 2023
Link: http://arxiv.org/abs/230..
 
?
15

A New Approach to Learning Linear Dynamical Systems:

Bakshi, Ainesh ; Liu, Allen ; Moitra, Ankur.
https://doi.org/10.1145/3564246.3585247.  , 2023
Link: https://hdl.handle.net/1..
 
1-15