Searcharxiv⌕ Search

arXiv · 2611.04412

Bandwidth rules for Dirichlet kernel density estimation on the simplex

Abstract

Dirichlet kernels provide a natural tool for density estimation on the simplex, but data-driven bandwidth selection for them has been mostly limited to likelihood cross-validation (LCV). We develop bandwidth selectors for Dirichlet kernel estimators of densities and projected first derivatives for compositional data. Using a Dirichlet mixture as the reference model, we derive an exact representation of the mean integrated squared error (MISE) and define the exact MISE (EMI) selector. We also derive a closed-form least-squares cross-validation (LSCV) criterion and introduce the reference-smoothed least-squares (RSLS) selector, which replaces the unstable leave-one-out term of LSCV with the fitted Dirichlet mixture. For derivative estimation, we obtain projected derivatives of the Dirichlet density and their integrability conditions, extend the new bandwidth selectors, and carry out kernel mean shift clustering on the simplex. Simulations show that EMI is the most competitive selector for larger samples and Dirichlet-like targets, RSLS generally performs best for small samples and is more stable than LSCV for derivative estimation, and LCV remains competitive for non-Dirichlet targets in density estimation. Applications to wholesale customer expenditure and sectoral employment data illustrate density estimation and clustering, respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiajin Xie, Eduardo García-Portugués, Yong Wang. 2026-11-03. Bandwidth rules for Dirichlet kernel density estimation on the simplex. https://arxiv.org/abs/2611.04412

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗