mlsanityData to 14 Oct 2026

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

arXiv 2607.26955 ↗First posted 29 Jul 2026stat.ML cs.LG stat.MEcited by 0

Not on the map. Why?

Abstract (arXiv)

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, textitBAyesian 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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 61 references that are in the map. First posted on arXiv 29 Jul 2026.

Builds on

21 of 61 references.

References · 21

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  2. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  3. 2022DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Modelscited by 938
  4. 2016Pixel Recurrent Neural Networkscited by 816
  5. 2019Neural Spline Flowscited by 596
  6. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 445
  7. 2017PixelCNN++: Improving the PixelCNN with Discretized Logistic Mixture Likelihood and Other Modificationscited by 417
  8. 2022TabDDPM: Modelling Tabular Data with Diffusion Modelscited by 377
  9. 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localizationcited by 235
  10. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  11. 2023Diffusion Models are Minimax Optimal Distribution Estimatorscited by 165
  12. 2020Missing Data Imputation using Optimal Transportcited by 100
9 more
  1. 2023Predict, Refine, Synthesize: Self-Guiding Diffusion Models for Probabilistic Time Series Forecastingcited by 88
  2. 2024Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptionscited by 47
  3. 2020Distributional Random Forests: Heterogeneity Adjustment and Multivariate Distributional Regressioncited by 37
  4. 2025Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distancecited by 29
  5. 2015Evading the curse of dimensionality in nonparametric density estimation with simplified vine copulascited by 18
  6. 2024Kernel Density Estimators in Large Dimensionscited by 5
  7. 2024Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexitycited by 5
  8. 2025Optimal Denoising in Score-Based Generative Models: The Role of Data Regularitycited by 4
  9. 2024Breaking the curse of dimensionality in structured density estimationcited by 3

Built on by

Not cited yet.