Sotabase

Career

· Assistant Professor, Columbia University2021–
· Michael O. Rabin Postdoctoral Fellow, Harvard University2019–2021
· PhD in Computer Science, Massachusetts Institute of Technology (MIT)2017–2019
· MS in Computer Science, Stanford University2014–2016
· B.S. in Mathematics, Massachusetts Institute of Technology (MIT)2010–2014

Publications (44)

A Refined Laser Method and Faster Matrix Multiplication
ACM-SIAM Symposium on Discrete Algorithms · 2020
509
cited
Probabilistic Polynomials and Hamming Nearest Neighbors
IEEE Annual Symposium on Foundations of Computer Science · 2015
119
cited
Fast Attention Requires Bounded Entries
Neural Information Processing Systems · 2023
104
cited
More Asymmetry Yields Faster Matrix Multiplication
ACM-SIAM Symposium on Discrete Algorithms · 2024
90
cited
Polynomial Representations of Threshold Functions and Algorithmic Applications
IEEE Annual Symposium on Foundations of Computer Science · 2016
89
cited
Probabilistic rank and matrix rigidity
Symposium on the Theory of Computing · 2016
54
cited
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
IEEE Annual Symposium on Foundations of Computer Science · 2018
53
cited
How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation
International Conference on Learning Representations · 2023
49
cited
Limits on the Universal method for matrix multiplication
Cybersecurity and Cyberforensics Conference · 2018
44
cited
Further Limitations of the Known Approaches for Matrix Multiplication
Information Technology Convergence and Services · 2017
42
cited
Efficient Construction of Rigid Matrices Using an NP Oracle
IEEE Annual Symposium on Foundations of Computer Science · 2019
34
cited
Algorithms and Hardness for Linear Algebra on Geometric Graphs
IEEE Annual Symposium on Foundations of Computer Science · 2020
31
cited
Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing
Neural Information Processing Systems · 2022
29
cited
Dynamic Parameterized Problems and Algorithms
International Colloquium on Automata, Languages and Programming · 2017
29
cited
The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
Neural Information Processing Systems · 2024
27
cited
Optimal-degree polynomial approximations for exponentials and gaussian kernel density estimation
Cybersecurity and Cyberforensics Conference · 2022
23
cited
Laurent phenomenon sequences
2013
22
cited
An Illuminating Algorithm for the Light Bulb Problem
SIAM Symposium on Simplicity in Algorithms · 2018
20
cited
Circular planar electrical networks: Posets and positivity
Journal of Combinatorial Theory · 2015
15
cited
Kronecker products, low-depth circuits, and matrix rigidity
Symposium on the Theory of Computing · 2021
11
cited
Sotabase
Josh Alman | Researcher Profile | Sotabase | Sotabase