Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

From MaRDI portal
Publication:6406400

arXiv2207.14341MaRDI QIDQ6406400FDOQ6406400


Authors: Jeremy M. Myers, Daniel M. Dunlavy Edit this on Wikidata


Publication date: 18 July 2022

Abstract: In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-the-art local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.













This page was built for publication: Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406400)