On The Density Estimation by Super-Parametric Method

Yeong-Shyeong Tsai; Ying-Lin Hsu; Mung-Chung Shung

Home/Archive/arXiv

arXiv · 0709.3560

On The Density Estimation by Super-Parametric Method

Yeong-Shyeong Tsai·Ying-Lin Hsu·Mung-Chung Shung

View original source ↗Read source document ↗Export metadata ↓

Abstract

The super-parametric density estimators and its related algorism were suggested by Y. -S. Tsai et al [7]. The number of parameters is unlimited in the super- parametric estimators and it is a general theory in sense of unifying or connecting nonparametric and parametric estimators. Before applying to numerical examples, we can not give any comment of the estimators. In this paper, we will focus on the implementation, the computer programming, of the algorism and strategies of choosing window functions. B-splines, Bezier splines and covering windows are studied as well. According to the criterion of the convergence conditions for Parzen window, the number of the window functions shall be, roughly, proportional to the number of samples and so is the number of the variables. Since the algorism is designed for solving the optimization of likelihood function, there will be a set of nonlinear equations with a large number of variables. The results show that algorism suggested by Y. -S. Tsai is very powerful and effective in the sense of mathematics, that is, the iteration procedures converge and the rates of convergence are very fast. Also, the numerical results of different window functions show that the approach of super-parametric density estimators has ushered a new era of statistics.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yeong-Shyeong Tsai, Ying-Lin Hsu, Mung-Chung Shung. 2008-11-07. On The Density Estimation by Super-Parametric Method. https://arxiv.org/abs/0709.3560

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

KEEP EXPLORING

Related papers

arXiv2026

A General Framework for Importance Sampling with Markov Random Walks

Although stochastic models driven by latent Markov processes are widely used, the classical importance sampling methods based on the exponential tilting for these models suffer from difficulties in computing associated eigenvalues and eigenfunctions and the plausibility of the indirect asymptotic large deviation regime for the variance of the estimator. We propose an importance sampling framework that twists the observable and latent processes separately using a link function that directly minimizes the estimator's variance. An optimal link function is chosen within the locally asymptotically normal family. We show the logarithmic efficiency of the estimator. As applications, we estimate an overflow probability under a pandemic model and the CoVaR, a measurement of the co-dependent financial systemic risk; both are beyond the scope of traditional importance sampling methods due to nonlinear features.

stat.CO↗

arXiv2026

Sequential Monte Carlo Sampling of Feasible Regions Represented by R-Functions

Feasible-region sampling and volume estimation become increasingly inefficient when constraints define only a small fraction of a convenient bounding domain. We combine R-functions, which encode compound feasibility as a continuous signed field, with sequential Monte Carlo (SMC) samplers. The proposed construction exploits not only the sign of the R-function, which determines exact feasibility, but also its continuous negative values outside the feasible set, which provide graded information on constraint violation. Logistic intermediate distributions use this information to guide particles progressively towards feasibility, while the final target distribution remains uniform on the feasible region. Experiments on intersections and unions, including disconnected cases of hyperballs, show substantial variance reductions relative to direct rejection sampling, with the statistical advantage generally increasing as the feasible fraction decreases. For sufficiently small feasible regions, these advantages persist even after accounting for computational cost. To isolate the benefit of continuous R-function information, we also compare the proposed method with an SMC sampler with a region-only (RO) construction that uses the same sequential particle machinery but retains only binary feasible/infeasible information. We demonstrate that the R-function-informed SMC method concentrates particles in the feasible region earlier and produces lower-variance volume estimates than RO.

stat.CO↗

arXiv2026

Computation of Maximum Likelihood Estimates for Multiresponse Generalized Linear Mixed Models with Non-nested, Correlated Random Effects

Estimation of generalized linear mixed models (GLMMs) with non-nested random effects structures requires approximation of high-dimensional integrals. Many existing methods are tailored to the low-dimensional integrals produced by nested designs. We explore the modifications that are required in order to adapt an EM algorithm with first-order and fully exponential Laplace approximations to a non-nested, multiple response model. The equations in the estimation routine are expressed as functions of the first four derivatives of the conditional log likelihood of an arbitrary GLMM, providing a template for future applications. We apply the method to a joint Poisson-binary model for ranking sporting teams, and discuss the estimation of a correlated random effects model designed to evaluate the sensitivity of value-added models for teacher evaluation to assumptions about the missing data process. Source code in R is provided in the online supplementary material.

stat.CO↗