machine learning

Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions

arXiv:2607.26955

summary

The paper introduces BAND, a sparse Bayesian network method for high‑dimensional distribution estimation that achieves faster polynomial convergence rates by leveraging sparsity-aware conditional mean estimators.

Abstract

Minimax-optimal rates for multivariate distribution estimation are known to suffer from the curse of dimensionality. We propose a sparse Bayesian network approach in which each conditional probability is estimated using sparsity-aware conditional mean methods. The resulting estimator, \textit{BAyesian Network Distribution regression} (BAND), handles mixed data types in high-dimensional time series and achieves polynomial total variation convergence rates while allowing the feature dimension to grow polynomially with the sample size. These rates are substantially faster than the classical optimal rates for multivariate histogram density estimators that lack sparsity. Empirical evaluations show that BAND performs competitively for data sampling and confidence region forecasting against a range of state-of-the-art benchmarks.

24 pages, 2 figures, 5 tables

Topics & keywords

#distribution estimation#bayesian networks#high-dimensional data#sparse methods#time seriesminimax optimal ratestotal variation convergenceconditional mean estimationsparse Bayesian networkBAND
Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions · wovepaper