Ainesh Bakshi

Orcid: 0009-0001-0225-8588

According to our database1, Ainesh Bakshi authored at least 34 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
File System Aging.
CoRR, 2024

Learning Quantum Hamiltonians at Any Temperature in Polynomial Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

An Improved Classical Singular Value Transformation for Quantum Machine Learning.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Structure Learning of Hamiltonians from Real-Time Evolution.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

High-Temperature Gibbs States are Unentangled and Efficiently Preparable.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Efficient Certificates of Anti-Concentration Beyond Gaussians.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies.
CoRR, 2023

A New Approach to Learning Linear Dynamical Systems.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Near-Linear Time Algorithm for the Chamfer Distance.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Tensor Decompositions Meet Control Theory: Learning General Mixtures of Linear Dynamical Systems.
Proceedings of the International Conference on Machine Learning, 2023

Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Krylov Methods are (nearly) Optimal for Low-Rank Approximation.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation.
CoRR, 2022

Low-Rank Approximation with 1/ε<sup>1/3</sup> Matrix-Vector Products.
CoRR, 2022

Robustly learning mixtures of <i>k</i> arbitrary Gaussians.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Low-rank approximation with <i>1/ε<sup>1/3</sup></i> matrix-vector products.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Robust linear regression: optimal rates in polynomial time.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Learning a Latent Simplex in Input Sparsity Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Robustly Learning Mixtures of k Arbitrary Gaussians.
CoRR, 2020

Outlier-Robust Clustering of Non-Spherical Mixtures.
CoRR, 2020

List-Decodable Subspace Recovery via Sum-of-Squares.
CoRR, 2020

Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Robust and Sample Optimal Algorithms for PSD Low Rank Approximation.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Testing Positive Semi-Definiteness via Random Submatrices.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
Proceedings of the Approximation, 2020

2019
Robust Communication-Optimal Distributed Clustering Algorithms.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Learning Two Layer Rectified Neural Networks in Polynomial Time.
Proceedings of the Conference on Learning Theory, 2019

2018
Sublinear Time Low-Rank Approximation of Distance Matrices.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
How to Fragment Your File System.
login Usenix Mag., 2017

File Systems Fated for Senescence? Nonsense, Says Science!
Proceedings of the 15th USENIX Conference on File and Storage Technologies, 2017

2014
A Novel Feature Selection and Extraction Technique for Classification.
Proceedings of the 14th International Conference on Frontiers in Handwriting Recognition, 2014

Non Dominated Sorting Genetic Algorithm for Chance Constrained Supplier Selection Model with Volume Discounts.
Proceedings of the Intelligent Information and Database Systems - 6th Asian Conference, 2014

2013
Autonomous Robot Navigation: Path Planning on a Detail-Preserving Reduced-Complexity Representation of 3D Point Clouds.
Proceedings of the Computer Vision Systems - 9th International Conference, 2013


  Loading...