Differential Evolution Markov Chain with snooker updater and fewer chains

Differential Evolution Markov Chain (DE-MC) is an adaptive MCMC algorithm, in which multiple chains are run in parallel. Standard DE-MC requires at least N=2d chains to be run in parallel, where d is the dimensionality of the posterior. This paper extends DE-MC with a snooker updater and shows by simulation and real examples that DE-MC can work for d up to 50–100 with fewer parallel chains (e.g. N=3) by exploiting information from their past by generating jumps from differences of pairs of past states. This approach extends the practical applicability of DE-MC and is shown to be about 5–26 times more efficient than the optimal Normal random walk Metropolis sampler for the 97.5% point of a variable from a 25–50 dimensional Student t ₃ distribution. In a nonlinear mixed effects model example the approach outperformed a block-updater geared to the specific features of the model.     

Risk Factor Selection in Rate Making: EM Adaptive LASSO for Zero‐Inflated Poisson Regression Models

Risk factor selection is very important in the insurance industry, which helps precise rate making and studying the features of high‐quality insureds. Zero‐inflated data are common in insurance, such as the claim frequency data, and zero‐inflation makes the selection of risk factors quite difficult. In this article, we propose a new risk factor selection approach, EM adaptive LASSO, for a zero‐inflated Poisson regression model, which combines the EM algorithm and adaptive LASSO penalty. Under some regularity conditions, we show that, with probability approaching 1, important factors are selected and the redundant factors are excluded. We investigate the finite sample performance of the proposed method through a simulation study and the analysis of car insurance data from SAS Enterprise Miner database.     

Adaptive designs for selecting drug combinations based on efficacy–toxicity response

We propose a new adaptive procedure for dose-finding in clinical trials with combination of two drugs when both efficacy and toxicity responses are available. We model the distribution of this bivariate binary endpoint using the bivariate probit model. The analytic formulae for the Fisher information matrix are obtained, that form the basis for derivation of the locally optimal, minimax, Bayesian, and adaptive designs in the framework of optimal design theory.     

A Simple Adaptive Procedure Leading to Correlated Equilibrium

We propose a new and simple adaptive procedure for playing a game: ‘regret‐matching.’ In this procedure, players may depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies in the past. It is shown that our adaptive procedure guarantees that, with probability one, the empirical distributions of play converge to the set of correlated equilibria of the game.     

Adaptive Local Polynomial Whittle Estimation of Long‐range Dependence

The local Whittle (or Gaussian semiparametric) estimator of long range dependence, proposed by Künsch (1987) and analyzed by Robinson (1995a), has a relatively slow rate of convergence and a finite sample bias that can be large. In this paper, we generalize the local Whittle estimator to circumvent these problems. Instead of approximating the short‐run component of the spectrum, ϕ(λ) , by a constant in a shrinking neighborhood of frequency zero, we approximate its logarithm by a polynomial. This leads to a “local polynomial Whittle” (LPW) estimator. We specify a data‐dependent adaptive procedure that adjusts the degree of the polynomial to the smoothness of ϕ(λ) at zero and selects the bandwidth. The resulting “adaptive LPW” estimator is shown to achieve the optimal rate of convergence, which depends on the smoothness of ϕ(λ) at zero, up to a logarithmic factor.     

Estimation of generalized exponential distribution based on an adaptive progressively type-II censored sample

In this paper, based on an adaptive Type-II progressively censored sample from the generalized exponential distribution, the maximum likelihood and Bayesian estimators are derived for the unknown parameters as well as the reliability and hazard functions. Also, the approximate confidence intervals of the unknown parameters, and the reliability and hazard functions are calculated. Markov chain Monte Carlo method is applied to carry out a Bayesian estimation procedure and in turn calculate the credible intervals. Moreover, results from simulation studies assessing the performance of our proposed method are included. Finally, an illustrative example using real data set is presented for illustrating all the inferential procedures developed here.     

Adaptive Lasso for generalized linear models with a diverging number of parameters

In this paper, we study the asymptotic properties of the adaptive Lasso estimators in high-dimensional generalized linear models. The consistency of the adaptive Lasso estimator is obtained. We show that, if a reasonable initial estimator is available, under appropriate conditions, the adaptive Lasso correctly selects covariates with non zero coefficients with probability converging to one, and that the estimators of non zero coefficients have the same asymptotic distribution they would have if the zero coefficients were known in advance. Thus, the adaptive Lasso has an Oracle property. The results are examined by some simulations and a real example.     

Adaptive procedure for generalized familywise error rate control

This article considers multiple hypotheses testing with the generalized familywise error rate k-FWER control, which is the probability of at least k false rejections. We first assume the p-values corresponding to the true null hypotheses are independent, and propose adaptive generalized Bonferroni procedure with k-FWER control based on the estimation of the number of true null hypotheses. Then, we assume the p-values are dependent, satisfying block dependence, and propose adaptive procedure with k-FWER control. Extensive simulations compare the performance of the adaptive procedures with different estimators.     

An extension of Horvitz–Thompson estimator used in adaptive cluster sampling to continuous universe

In this paper, an extension of Horvitz–Thompson estimator used in adaptive cluster sampling to continuous universe is developed. Main new results are presented in theorems. The primary notions of discrete population are transferred to continuous population. First and second order inclusion probabilities for networks are delivered. Horvitz–Thompson estimator for adaptive cluster sampling in continuous universe is constructed. The unbiasedness of the estimator is proven. Variance and unbiased variance estimator are delivered. Finally, the theory is illustrated with an example.