3 accepted papers
A novel Tucker decomposition based tensor approximation is considered herein: observations based on only a few lateral slices and side structural information of a true tensor are exploited. This work is motivated by quantum chemistry problems wherein full Hessian computation is expensive, but partia…
In prior work, it was shown that high performance matrix approximation/completion was possible when only a few fully sampled columns were available of a ground truth matrix if there was appropriate side information on the rowspace of the matrix. Several applications from quantum chemistry, magnetic…
A novel matrix completion problem is considered herein: observations based on fully sampled columns and quasi-polynomial side information is exploited. The framework is motivated by quantum chemistry problems wherein full matrix computation is expensive, but partial computations only lead to column…