Beyond Smoothness: Incorporating Low-Rank Analysis into Nonparametric Density Estimation
Robert A. Vandermeulen, Antoine Ledent
摘要
The construction and theoretical analysis of the most popular universally consistent nonparametric density estimators hinge on one functional property: smoothness. In this paper we investigate the theoretical implications of incorporating a multi-view latent variable model, a type of low-rank model, into nonparametric density estimation. To do this we perform extensive analysis on histogram-style estimators that integrate a multi-view model. Our analysis culminates in showing that there exists a universally consistent histogram-style estimator that converges to any multi-view model with a finite number of Lipschitz continuous components at a rate of O(1/ 3 √ n) in L 1 error. In contrast, the standard histogram estimator can converge at a rate slower than 1/ d √ n on the same class of densities. We also introduce a new nonparametric latent variable model based on the Tucker decomposition. A rudimentary implementation of our estimators experimentally demonstrates a considerable performance improvement over the standard histogram estimator. We also provide a thorough analysis of the sample complexity of our Tucker decomposition-based model and a variety of other results. Thus, our paper provides solid theoretical foundations for extending low-rank techniques to the nonparametric setting. * For an estimator V restricted space a of densities P, the estimation error refers to the difference between V -p and minq∈P p -q , where p is the target density. This is similar to estimator variance. † A density estimator is universally consistent if it asymptotically recovers any density.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Breaking the curse of dimensionality in structured density estimationRobert A. Vandermeulen, Wai Ming Tai, Bryon AragamNeurIPS 2024 · 被引用 5 次
- Generalization Bounds for Inductive Matrix Completion in Low-Noise SettingsAntoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur 等AAAI 2023 · 被引用 5 次
- Generalization Bounds for Rank-sparse Neural NetworksAntoine Ledent, Rodrigo Alves, Yunwen LeiNeurIPS 2025 · 被引用 4 次
- Explainable Neural Networks with Guarantee: A Sparse Estimation ApproachAntoine Ledent, Peng LiuAAAI 2025 · 被引用 1 次
- Dimension-Independent Rates for Structured Neural Density EstimationRobert A. Vandermeulen, Wai Ming Tai, Bryon AragamICML 2025
它引用的顶会 Paper1
相关 Paper
- Fast Tucker Rank Reduction for Non-Negative Tensors Using Mean-Field ApproximationKazu Ghalamkari, Mahito SugiyamaNeurIPS 2021 · 被引用 5 次
- Unified View Extraction with Low-Rankness and Smoothness Fusion for Multi-View Subspace ClusteringYapeng Wang, Quanxue Gao, Fangfang Li, Yu Yun 等AAAI 2026
- Low-Rank Kernel Tensor Learning for Incomplete Multi-View ClusteringTingting Wu, Songhe Feng, Jiazheng YuanAAAI 2024 · 被引用 42 次
- Faster 3D Gaussian Splatting Convergence via Structure-Aware DensificationLinjie Lyu, Ayush Tewari, Jianchun Chen, Thomas Leimkühler 等SIGGRAPH 2026
- Random Forest Density EstimationHongwei Wen, Hanyuan HangICML 2022 · 被引用 10 次
