Login / Signup
An $\widetilde\mathcalO(m/\varepsilon^3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints.
Yin Tat Lee
Swati Padmanabhan
Published in:
COLT (2020)
Keyphrases
</>
learning algorithm
dynamic programming
computational complexity
semidefinite programming
objective function
feature selection
training data
np hard
image restoration
sample size
convergence rate
distance transform
semidefinite