Improving Nonparametric Density Estimation with Tensor Decompositions
Robert A. Vandermeulen

TL;DR
This paper explores how tensor decompositions can improve high-dimensional nonparametric density estimation by reducing the curse of dimensionality, with theoretical proofs and experimental validation.
Contribution
It introduces low-rank nonnegative tensor decompositions to enhance density estimation, extending beyond simple independence assumptions.
Findings
Low-rank tensor restrictions remove the dimensionality exponent in histogram rates.
Theoretical proof that tensor decompositions mitigate curse of dimensionality.
Experimental validation shows significant improvements in density estimation accuracy.
Abstract
While nonparametric density estimators often perform well on low dimensional data, their performance can suffer when applied to higher dimensional data, owing presumably to the curse of dimensionality. One technique for avoiding this is to assume no dependence between features and that the data are sampled from a separable density. This allows one to estimate each marginal distribution independently thereby avoiding the slow rates associated with estimating the full joint density. This is a strategy employed in naive Bayes models and is analogous to estimating a rank-one tensor. In this paper we investigate whether these improvements can be extended to other simplified dependence assumptions which we model via nonnegative tensor decompositions. In our central theoretical results we prove that restricting estimation to low-rank nonnegative PARAFAC or Tucker decompositions removes the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTuckER
