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

• URL: http://arxiv.org/abs/2607.26955v1
• Date: Wed, 29 Jul 2026 14:21:39 GMT
• Title: Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions
• Abstract summary: We propose a sparse Bayesian network approach in which each conditional probability is estimated using sparsity-aware conditional mean methods.<n>The resulting estimator, textitBAyesian Network Distribution (BAND) handles mixed data types in high-dimensional time series.<n>BAND performs competitively for data sampling and confidence region forecasting against a range of state-of-the-art benchmarks.
• Score: 1.338174941551702
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Generative Predictive Distributions for Time Series [0.0]
  We propose a flexible framework for modeling the predictive distributions of nonlinear, possibly multivariate time series.<n>Our approach expresses a general predictive distribution in an appropriate generative representation that is based on a folklore result from measure theoretic probability.<n>We estimate this generative representation using a version of conditional generative adversarial networks and provide a formal statistical analysis of estimation under weak temporal dependence.
  arXiv  Detail & Related papers  (2026-06-15T14:20:21Z)
• On the Use of Bagging for Local Intrinsic Dimensionality Estimation [6.621518682026852]
  We propose an ensemble approach that uses subbagging to preserve the local distribution of nearest neighbor (NN) distances.<n>We analyze both theoretically and experimentally how the choice of the sampling rate and the k-NN size used for LID estimation, alongside the ensemble size, affects performance.
  arXiv  Detail & Related papers  (2026-03-25T15:03:25Z)
• Flow-Based Density Ratio Estimation for Intractable Distributions with Applications in Genomics [80.05951561886123]
  We leverage condition-aware flow matching to derive a single dynamical formulation for tracking density ratios along generative trajectories.<n>We demonstrate competitive performance on simulated benchmarks for closed-form ratio estimation, and show that our method supports versatile tasks in single-cell genomics data analysis.
  arXiv  Detail & Related papers  (2026-02-27T17:27:55Z)
• Nonparametric Estimation of Joint Entropy through Partitioned Sample-Spacing Method [0.0]
  We propose a nonparametric estimator of multivariate joint entropy based on partitioned sample spacings (PSS)<n>PSS consistently outperforms k-nearest neighbor estimators and achieves accuracy competitive with recent normalizing flow-based methods.<n>These properties position PSS as a practical alternative to normalizing flow-based approaches, with broad potential in information-theoretic machine learning applications.
  arXiv  Detail & Related papers  (2025-11-17T17:05:34Z)
• RDIT: Residual-based Diffusion Implicit Models for Probabilistic Time Series Forecasting [4.140149411004857]
  RDIT is a plug-and-play framework that combines point estimation and residual-based conditional diffusion with a bidirectional Mamba network.<n>We show that RDIT achieves lower CRPS, rapid inference, and improved coverage compared to strong baselines.
  arXiv  Detail & Related papers  (2025-09-02T14:06:29Z)
• Adaptive Sampled Softmax with Inverted Multi-Index: Methods, Theory and Applications [79.53938312089308]
  The MIDX-Sampler is a novel adaptive sampling strategy based on an inverted multi-index approach.<n>Our method is backed by rigorous theoretical analysis, addressing key concerns such as sampling bias, gradient bias, convergence rates, and generalization error bounds.
  arXiv  Detail & Related papers  (2025-01-15T04:09:21Z)
• Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal [9.766173684831324]
  We characterize the minimax optimal rates for all regimes, and identify phase transitions of the optimal rates as the samples per terminal vary from sparse to dense.<n>This fully solves the problem left open by previous works, whose scopes are limited to regimes with either dense samples or a single sample per terminal.<n>The optimal rates are immediate for various special cases such as density estimation, Gaussian, binary, Poisson and heteroskedastic regression models.
  arXiv  Detail & Related papers  (2025-01-14T06:41:55Z)
• On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates [5.13323375365494]
  We provide theoretical guarantees for the convergence behaviour of diffusion-based generative models under strongly log-concave data.<n>Our class of functions used for score estimation is made of Lipschitz continuous functions avoiding any Lipschitzness assumption on the score function.<n>This approach yields the best known convergence rate for our sampling algorithm.
  arXiv  Detail & Related papers  (2023-11-22T18:40:45Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• A Unified Framework for Multi-distribution Density Ratio Estimation [101.67420298343512]
  Binary density ratio estimation (DRE) provides the foundation for many state-of-the-art machine learning algorithms. We develop a general framework from the perspective of Bregman minimization divergence. We show that our framework leads to methods that strictly generalize their counterparts in binary DRE.
  arXiv  Detail & Related papers  (2021-12-07T01:23:20Z)
• Unlabelled Data Improves Bayesian Uncertainty Calibration under Covariate Shift [100.52588638477862]
  We develop an approximate Bayesian inference scheme based on posterior regularisation. We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
  arXiv  Detail & Related papers  (2020-06-26T13:50:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.