REVIEW 3 cited by
Fast randomized entropically regularized semidefinite programming
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a carefully chosen randomized trace estimator can be used to estimate dual gradients effectively. We also introduce specialized optimization approaches for common SDP, specifically SDP with diagonal constraint and the problem of the determining the spectral projector onto the span of extremal eigenvectors. We validate our approach on such problems with applications to combinatorial optimization and spectral embedding.
Forward citations
Cited by 3 Pith papers
-
Unifying quantum measurement constructions via a relative-entropy minimum change principle
A relative-entropy minimum change principle yields a unified closed-form family of optimal measurements, including pretty good, Fermi-Dirac thermal, and new softmin thermal measurements.
-
Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming
A non-Euclidean dual gradient ascent for entropically regularized SDPs is shown to converge with dimension-independent rates, achieving Sinkhorn-like complexity for optimal transport and optimal-scaling results for pe...
-
Maximal entropy in the moment body
After preconditioning the defining linear map, global minimization of the dual log-partition function certifies moment body membership, and L-BFGS handles dense n=m=1000 instances in seconds.
Discussion (0). Continue with ORCID to comment.