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

Shuo-Chieh Huang, Chien-Ming Chi, Jau-er Chen
7/29/2026
stat.MLcs.LGstat.ME

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{huang2026breaking,
  title  = {Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions},
  author = {Shuo-Chieh Huang and Chien-Ming Chi and Jau-er Chen},
  year   = {2026},
  eprint = {2607.26955},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.26955v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.26955.svg)](https://codeofpaper.com/paper/2607.26955)

Discussion