Semiparametric Sieve-Type Generalized Least Squares Inference

This article considers the problem of statistical inference in linear regression models with dependent errors. A sieve-type generalized least squares (GLS) procedure is proposed based on an autoregressive approximation to the generating mechanism of the errors. The asymptotic properties of the sieve-type GLS estimator are established under general conditions, including mixingale-type conditions as well as conditions which allow for long-range dependence in the stochastic regressors and/or the errors. A Monte Carlo study examines the finite-sample properties of the method for testing regression hypotheses.     

Generalized modified slash distribution with applications

Abstract

In this article a generalization of the modified slash distribution is introduced. This model is based on the quotient of two independent random variables, whose distributions are a normal and a one-parameter gamma, respectively. The resulting distribution is a new model whose kurtosis is greater than other slash distributions. The probability density function, its properties, moments, and kurtosis coefficient are obtained. Inference based on moment and maximum likelihood methods is carried out. The multivariate version is also introduced. Two real data sets are considered in which it is shown that the new model fits better to symmetric data with heavy tails than other slash extensions previously introduced in literature.     

MARS as an alternative approach of Gaussian graphical model for biochemical networks

The Gaussian graphical model (GGM) is one of the well-known modelling approaches to describe biological networks under the steady-state condition via the precision matrix of data. In literature there are different methods to infer model parameters based on GGM. The neighbourhood selection with the lasso regression and the graphical lasso method are the most common techniques among these alternative estimation methods. But they can be computationally demanding when the system's dimension increases. Here, we suggest a non-parametric statistical approach, called the multivariate adaptive regression splines (MARS) as an alternative of GGM. To compare the performance of both models, we evaluate the findings of normal and non-normal data via the specificity, precision, F-measures and their computational costs. From the outputs, we see that MARS performs well, resulting in, a plausible alternative approach with respect to GGM in the construction of complex biological systems.     

Robust Bayesian estimation of a two-parameter exponential distribution under generalized Type-I progressive hybrid censoring

A generalized Type-I progressive hybrid censoring scheme was proposed recently to overcome the limitations of the progressive hybrid censoring scheme. In this article, we provide a robust Bayesian method to estimate the unknown parameters of the two-parameter exponential distribution of a generalized Type-I progressive hybrid censored sample. For each parameter, we derive the marginal posterior density functions and the corresponding Bayesian estimators under the squared error loss function. To assess the proposed method, Monte Carlo simulations are performed using a real dataset.     

Structure Learning of Contextual Markov Networks using Marginal Pseudo‐likelihood

Markov networks are popular models for discrete multivariate systems where the dependence structure of the variables is specified by an undirected graph. To allow for more expressive dependence structures, several generalizations of Markov networks have been proposed. Here, we consider the class of contextual Markov networks which takes into account possible context‐specific independences among pairs of variables. Structure learning of contextual Markov networks is very challenging due to the extremely large number of possible structures. One of the main challenges has been to design a score, by which a structure can be assessed in terms of model fit related to complexity, without assuming chordality. Here, we introduce the marginal pseudo‐likelihood as an analytically tractable criterion for general contextual Markov networks. Our criterion is shown to yield a consistent structure estimator. Experiments demonstrate the favourable properties of our method in terms of predictive accuracy of the inferred models.     

Robust estimators and robust tests for the slightly contaminated stochastic logistic population models

This article introduces the robust indirect technique for the slightly contaminated stochastic logistic population models. Based on discrete sampled data with a fixed unit of time between two consecutive observations, we not only construct the robust indirect inference generalized method of moments (GMM) estimator for the model parameters, but also propose a likelihood-ratio-type indirect statistic and a robust indirect GMM saddle-point statistic for testing the parameters of interest. In addition, we develop the robust exponential tilting estimator and the robust exponential tilting test to improve their small sample performances. Finally, their finite-sample properties are studied through Monte Carlo experiments.     

Bayesian inference for random coefficient dynamic panel data models

We develop a hierarchical Bayesian approach for inference in random coefficient dynamic panel data models. Our approach allows for the initial values of each unit's process to be correlated with the unit-specific coefficients. We impose a stationarity assumption for each unit's process by assuming that the unit-specific autoregressive coefficient is drawn from a logitnormal distribution. Our method is shown to have favorable properties compared to the mean group estimator in a Monte Carlo study. We apply our approach to analyze energy and protein intakes among individuals from the Philippines.     

Diagnostic tools for approximate Bayesian computation using the coverage property

Approximate Bayesian computation (ABC) is an approach to sampling from an approximate posterior distribution in the presence of a computationally intractable likelihood function. A common implementation is based on simulating model, parameter and dataset triples from the prior, and then accepting as samples from the approximate posterior, those model and parameter pairs for which the corresponding dataset, or a summary of that dataset, is ‘close’ to the observed data. Closeness is typically determined though a distance measure and a kernel scale parameter. Appropriate choice of that parameter is important in producing a good quality approximation. This paper proposes diagnostic tools for the choice of the kernel scale parameter based on assessing the coverage property, which asserts that credible intervals have the correct coverage levels in appropriately designed simulation settings. We provide theoretical results on coverage for both model and parameter inference, and adapt these into diagnostics for the ABC context. We re‐analyse a study on human demographic history to determine whether the adopted posterior approximation was appropriate. Code implementing the proposed methodology is freely available in the R package abctools .     

Marginal Nested Interactions for Contingency Tables

We introduce a new definition of generalized marginal interactions, called marginal nested interactions, which includes baseline, local, continuation and reverse continuation logits and odds ratios as special cases. The significant aspect of this definition is the inclusion of new types of logits and odds ratios that can handle non-ordinal, ordinal and partially ordered categorical variables in a flexible and appropriate way. It is proved also that the marginal nested interactions define a saturated model of a multi-way contingency table.     

One-step local quasi-likelihood estimation

Local quasi-likelihood estimation is a useful extension of local least squares methods, but its computational cost and algorithmic convergence problems make the procedure less appealing, particularly when it is iteratively used in methods such as the back-fitting algorithm, cross-validation and bootstrapping. A one-step local quasi-likelihood estimator is introduced to overcome the computational drawbacks of the local quasi-likelihood method. We demonstrate that as long as the initial estimators are reasonably good, the one-step estimator has the same asymptotic behaviour as the local quasi-likelihood method. Our simulation shows that the one-step estimator performs at least as well as the local quasi-likelihood method for a wide range of choices of bandwidths. A data-driven bandwidth selector is proposed for the one-step estimator based on the pre-asymptotic substitution method of Fan and Gijbels. It is then demonstrated that the data-driven one-step local quasi-likelihood estimator performs as well as the maximum local quasi-likelihood estimator by using the ideal optimal bandwidth.