252 citations · 3.3k across the 92 of their papers we have counts for
5 papers · 1 filter
Optimal Design of Process Flexibility for General Production Systems
Xi Chen, Tengyu Ma, Jiawei Zhang +1
Process flexibility is widely adopted as an effective strategy for responding to uncertain demand. Many algorithms for constructing sparse flexibility designs with good theoretical…
Polynomial-time Tensor Decompositions with Sum-of-Squares
Tengyu Ma, Jonathan Shi, David Steurer
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several…
Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms
Rong Ge, Tengyu Ma
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up…
More Algorithms for Provable Dictionary Learning
Sanjeev Arora, Aditya Bhaskara, Rong Ge +1
In dictionary learning, also known as sparse coding, the algorithm is given samples of the form where is an unknown random sparse vector and is an…
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
Tengyu Ma, Bo Tang, Yajun Wang
We study the matroid secretary problems with submodular valuation functions. In these problems, the elements arrive in random order. When one element arrives, we have to make an im…