5 citations · 16 across the 20 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.NA2023
On Symmetric Factorizations of Hankel Matrices
Mehrdad Ghadiri
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix and its inverse as $\mathbf{B}\mathbf…
cs.DS2023
The Bit Complexity of Efficient Continuous Optimization
Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, -norm regression, and linear programming (LP). State-of-t…
cs.DS2023★ 2 cited
Approximately Optimal Core Shapes for Tensor Decompositions
Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu +1
This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give…