Maximum-Completion Forests via Sharp Spectral QuantizationResearch Paper
Determinant maximization asks, for a positive semidefinite matrix and a budget , for the indices maximizing . For a Gram matrix this is the squared volume spanned by the chosen vectors; in a fixed-size determinantal model it is the most likely subset. For general positive semidefinite matrices the best known deterministic polynomial-time…