research
∙
07/03/2023
On Symmetric Factorizations of Hankel Matrices
We present two conjectures regarding the running time of computing symme...
share
research
∙
04/04/2023
The Bit Complexity of Efficient Continuous Optimization
We analyze the bit complexity of efficient algorithms for fundamental op...
research
∙
02/08/2023
Approximately Optimal Core Shapes for Tensor Decompositions
This work studies the combinatorial optimization problem of finding an o...
research
∙
09/11/2022
Subquadratic Kronecker Regression with Applications to Tensor Decomposition
Kronecker regression is a highly-structured least squares problem min_𝐱‖...
research
∙
06/22/2022
Constant-Factor Approximation Algorithms for Socially Fair k-Clustering
We study approximation algorithms for the socially fair (ℓ_p, k)-cluster...
research
∙
09/23/2021
Sparse Regression Faster than d^ω
The current complexity of regression is nearly linear in the complexity ...
research
∙
07/22/2021
Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling
Low-rank tensor decomposition generalizes low-rank matrix approximation ...
research
∙
06/23/2020
A Parameterized Family of Meta-Submodular Functions
Submodular function maximization has found a wealth of new applications ...
research
∙
06/17/2020
Socially Fair k-Means Clustering
We show that the popular k-means clustering algorithm (Lloyd's heuristic...
research
∙
10/20/2019
Amortized Rejection Sampling in Universal Probabilistic Programming
Existing approaches to amortized inference in probabilistic programs wit...
research
∙
04/19/2019
Beyond Submodular Maximization
While there are well-developed tools for maximizing a submodular functio...
research
∙
03/20/2019
