Journal of Statistical Planning and Inference最新文献

This paper considers the joint estimation of the parameters of a first-order fractional autoregressive model. A one-step procedure is considered in order to obtain an asymptotically-efficient estimator with an initial guess estimator with convergence speed lower than $\sqrt{n}$ and singular asymptotic joint distribution. This estimator is computed faster than the maximum likelihood estimator or the Whittle estimator and therefore allows for faster inference on large samples. The paper also illustrates the performance of this method on finite-size samples via Monte Carlo simulations.

High-dimensional additive quantile regression model via penalization provides a powerful tool for analyzing complex data in many contemporary applications. Despite the fast developments, how to combine the strengths of additive quantile regression with total variation penalty with theoretical guarantees still remains unexplored. In this paper, we propose a new methodology for sparse additive quantile regression model over bounded variation function classes via the empirical norm penalty and the total variation penalty for local adaptivity. Theoretically, we prove that the proposed method achieves the optimal convergence rate under mild assumptions. Moreover, an alternating direction method of multipliers (ADMM) based algorithm is developed. Both simulation results and real data analysis confirm the effectiveness of our method.

We investigate the consistency and the rate of convergence of the adaptive Lasso estimator for the parameters of linear AR(p) time series with a white noise which is a strictly stationary and ergodic martingale difference. Roughly speaking, we prove that $\left(i\right)$ If the white noise has a finite second moment, then the adaptive Lasso estimator is almost sure consistent $\left(ii\right)$ If the white noise has a finite fourth moment, then the error estimate converges to zero with the same rate as the regularizing parameters of the adaptive Lasso estimator. Such theoretical findings are applied to estimate the parameters of INAR(p) time series and to estimate the fertility function of Hawkes processes. The results are validated by some numerical simulations, which show that the adaptive Lasso estimator allows for a better balancing between bias and variance with respect to the Conditional Least Square estimator and the classical Lasso estimator.

In this paper we treat statistical inference for a wavelet estimator of curves of symmetric positive definite (SPD) using the log-Euclidean distance. This estimator preserves positive-definiteness and enjoys permutation-equivariance, which is particularly relevant for covariance matrices. Our second-generation wavelet estimator is based on average-interpolation (AI) and allows the same powerful properties, including fast algorithms, known from nonparametric curve estimation with wavelets in standard Euclidean set-ups. The core of our work is the proposition of confidence sets for our AI wavelet estimator in a non-Euclidean geometry. We derive asymptotic normality of this estimator, including explicit expressions of its asymptotic variance. This opens the door for constructing asymptotic confidence regions which we compare with our proposed bootstrap scheme for inference. Detailed numerical simulations confirm the appropriateness of our suggested inference schemes.

A class of tests that are uniformly more powerful than the likelihood ratio test is derived for testing the hypothesis about the means of a subset of the components of a multivariate normal distribution with unknown covariance matrix, when the means of the other subset of the components are known.

In kernel-based learning, the random projection method, also called random sketching, has been successfully used in kernel ridge regression to reduce the computational burden in the big data setting, and at the same time retain the minimax convergence rate. In this work, we consider its use in sparse multiple kernel learning problems where a closed-form optimizer is not available, which poses significant technical challenges, for which the existing results do not carry over directly. Even when random projection is not used, our risk bound improves on the existing results in several aspects. We also illustrate the use of random projection via some numerical examples.

In this paper, we introduce a new first-order mixture integer-valued threshold autoregressive process, based on the binomial and negative binomial thinning operators. Basic probabilistic and statistical properties of this model are discussed. Conditional least squares (CLS) and conditional maximum likelihood (CML) estimators are derived and the asymptotic properties of the estimators are established. The inference for the threshold parameter is obtained based on the CLS and CML score functions. Moreover, the Wald test is applied to detect the existence of the piecewise structure. Simulation studies are considered, along with an application: the number of criminal mischief incidents in the Pittsburgh dataset

In some experiments, the experimental units are all pairs of individuals who have to undertake a given task together. The set of such pairs forms a triangular association scheme. Appropriate randomization then gives two non-trivial strata. The design is said to have commutative orthogonal block structure (COBS) if the best linear unbiased estimators of treatment contrasts do not depend on the stratum variances. There are precisely three ways in which such a design can have COBS. We give a complete description of designs for which all treatment contrasts are in the same stratum. Then we give a very general construction for designs with COBS which have some treatment contrasts in each stratum.

We study the kernel estimators of the transition density of bifurcating Markov chains. Under some ergodic and regularity properties, we prove that these estimators are consistent and asymptotically normal. Next, in the numerical studies, we propose two data-driven methods to choose the bandwidth parameters. These methods, based on the so-called two bandwidths approach, are adaptation for bifurcating Markov chains of the least squares Cross-Validation and the rule of thumb method. Finally, we provide an example with real data.