Robust Simulation-Based Estimation of ARMA Models

This article proposes a new approach to the robust estimation of a mixed autoregressive and moving average (ARMA) model. It is based on the indirect inference method that originally was proposed for models with an intractable likelihood function. The estimation algorithm proposed is based on an auxiliary autoregressive representation whose parameters are first estimated on the observed time series and then on data simulated from the ARMA model. To simulate data the parameters of the ARMA model have to be set. By varying these we can minimize a distance between the simulation-based and the observation-based auxiliary estimate. The argument of the minimum yields then an estimator for the parameterization of the ARMA model. This simulation-based estimation procedure inherits the properties of the auxiliary model estimator. For instance, robustness is achieved with GM estimators. An essential feature of the introduced estimator, compared to existing robust estimators for ARMA models, is its theoretical tractability that allows us to show consistency and asymptotic normality. Moreover, it is possible to characterize the influence function and the breakdown point of the estimator. In a small sample Monte Carlo study it is found that the new estimator performs fairly well when compared with existing procedures. Furthermore, with two real examples, we also compare the proposed inferential method with two different approaches based on outliers detection.     

Mixed effect models for absolute log returns of ultra high frequency data

Considering absolute log returns as a proxy for stochastic volatility, the influence of explanatory variables on absolute log returns of ultra high frequency data is analysed. The irregular time structure and time dependency of the data is captured by utilizing a continuous time ARMA(p,q) process. In particular, we propose a mixed effect model class for the absolute log returns. Explanatory variable information is used to model the fixed effects, whereas the error is decomposed in a non‐negative Lévy driven continuous time ARMA(p,q) process and a market microstructure noise component. The parameters are estimated in a state space approach. In a small simulation study the performance of the estimators is investigated. We apply our model to IBM trade data and quantify the influence of bid‐ask spread and duration on a daily basis. To verify the correlation in irregularly spaced data we use the variogram, known from spatial statistics. Copyright © 2006 John Wiley & Sons, Ltd.     

Identification of Refined ARMA Echelon Form Models for Multivariate Time Series

In the present article, we are interested in the identification of canonical ARMA echelon form models represented in a “refined” form. An identification procedure for such models is given by Tsay (J. Time Ser. Anal.10(1989), 357-372). This procedure is based on the theory of canonical analysis. We propose an alternative procedure which does not rely on this theory. We show initially that an examination of the linear dependency structure of the rows of the Hankel matrix of correlations, with originkin (i.e., with correlation at lagkin position (1, 1)), allows us not only to identify the Kronecker indicesn₁, …, n_d, whenk=1, but also to determine the autoregressive ordersp₁, …, p_d, as well as the moving average ordersq₁, …, q_dof the ARMA echelon form model by settingk>1 andk<1, respectively. Successive test procedures for the identification of the structural parametersn_i,p_i, andq_iare then presented. We show, under the corresponding null hypotheses, that the test statistics employed asymptotically follow chi-square distributions. Furthermore, under the alternative hypothesis, these statistics are unbounded in probability and are of the formNδ{1+o_p(1)}, whereδis a positive constant andNdenotes the number of observations. Finally, the behaviour of the proposed identification procedure is illustrated with a simulated series from a given ARMA model.     

基于蒙特卡洛-马尔科夫链(MCMC)的ARMA模型选择

AIC与SIC等准则函数方法是ARMA模型选择过程中经常使用的方法。但是,当模型的阶数很高时,无法计算并比较每一个备选模型的准则函数值。本文提出了一个基于蒙特卡洛-马尔科夫链方法的随机模型生成方法,以产生准则函数值最小的备选模型。实际应用表明本文的方法在处理拥有大量备选模型的ARMA模型选择问题时有很好的效果。     

ARMA model order and parameter estimation using genetic algorithms

A new method for simultaneously determining the order and the parameters of autoregressive moving average (ARMA) models is presented in this article. Given an ARMA (p, q) model in the absence of any information for the order, the correct order of the model (p, q) as well as the correct parameters will be simultaneously determined using genetic algorithms (GAs). These algorithms simply search the order and the parameter spaces to detect their correct values using the GA operators. The proposed method works on the principle of maximizing the GA fitness value relying on the deviation between the actual plant output, with or without an additive noise, and the estimated plant output. Simulation results show in detail the efficiency of the proposed approach. In addition to that, a practical model identification and parameter estimation is conducted in this article with results obtained as desired. The new method is compared with other well-known methods for ARMA model order and parameter estimation.     

Sequential and non-sequential acceptance sampling plans for autocorrelated processes using ARMA(p,q) models

This paper presents variable acceptance sampling plans based on the assumption that consecutive observations on a quality characteristic(X) are autocorrelated and are governed by a stationary autoregressive moving average (ARMA) process. The sampling plans are obtained under the assumption that an adequate ARMA model can be identified based on historical data from the process. Two types of acceptance sampling plans are presented: (1) Non-sequential acceptance sampling: In this case historical data is available based on which an ARMA model is identified. Parameter estimates are used to determine the action limit (k) and the sample size(n). A decision regarding acceptance of a process is made after a complete sample of size n is selected. (2) Sequential acceptance sampling: Here too historical data is available based on which an ARMA model is identified. A decision regarding whether or not to accept a process is made after each individual sample observation becomes available. The concept of Sequential Probability Ratio Test (SPRT) is used to derive the sampling plans. Simulation studies are used to assess the effect of uncertainties in parameter estimates and the effect of model misidentification (based on historical data) on sample size for the sampling plans. Macros for computing the required sample size using both methods based on several ARMA models can be found on the author’s web page .     

Self-weighted generalized empirical likelihood methods for hypothesis testing in infinite variance ARMA models

This paper develops the generalized empirical likelihood (GEL) method for infinite variance ARMA models, and constructs a robust testing procedure for general linear hypotheses. In particular, we use the GEL method based on the least absolute deviations and self-weighting, and construct a natural class of statistics including the empirical likelihood and the continuous updating-generalized method of moments for infinite variance ARMA models. The self-weighted GEL test statistic is shown to converge to a \(\chi ^2\)-distribution, although the model may have infinite variance. Therefore, we can make inference without estimating any unknown quantity of the model such as the tail index or the density function of unobserved innovation processes. We also compare the finite sample performance of the proposed test with the Wald-type test by Pan et al. (Econom Theory 23:852–879, 2007) via some simulation experiments.     

Influence asymptotique de la correction par la moyenne sur l'estimation d'un modèle AR(1) périodique

This Note studies asymptotic influence of mean-correction on the parameter least squares estimation for a periodic AR(1) model. Unlike the stationary ARMA case, we show that fitting a periodic ARMA model with intercepts to the observed series can provide substantial gains in terms of asymptotic accuracy for the parameter least squares estimators compared with fitting a periodic ARMA model without intercepts to the mean-corrected series. To cite this article: A. Gautier, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

ARMA identification

In view of recent results on the asymptotic behavior of the prediction error covariance for a state variable system (see Ref. 1), an identification scheme for autoregressive moving average (ARMA) processes is proposed. The coefficients of thed-step predictor determine asymptotically the system momentsU ₀,...,U _d–1. These moments are also nonlinear functions of the coefficients of the successive 1-step predictors. Here, we estimate the state variable parameters by the following scheme. First, we use the Burg technique (see Ref. 2) to find the estimates of the coefficients of the successive 1-step predictors. Second, we compute the moments by substitution of the estimates provided by the Burg technique for the coefficients in the nonlinear functions relating the moments with the 1-step predictor coefficients. Finally, the Hankel matrix of moment estimates is used to determine the coefficients of the characteristic polynomial of the state transition matrix (see Refs. 3 and 4).A number of examples for the state variable systems corresponding to ARMA(2, 1) processes are given which show the efficiency of this technique when the zeros and poles are separated. Some of these examples are also studied with an alternative technique (see Ref. 5) which exploits the linear dependence between successive 1-step predictors and the coefficients of the transfer function numerator and denominator polynomials.In this paper, the problems of order determination are not considered; we assumed the order of the underlying system. We remark that the Burg algorithm is a robust statistical procedure. With the notable exception of Ref. 6 that uses canonical correlation methods, most identification procedures in control are based on a deterministic analysis and consequently are quite sensitive to errors. In general, spectral identification based on the windowing of data lacks the resolving power of the Burg technique, which is a super resolution method.This work was supported by NATO Research Grant No. 585/83, by University of Nice, by Thomson CSF-DTAS, by Instituto Nacional de Investigação Científica, and by CIRIT (Comissió Interdepartmental de Recerca i Innovació Technológica de Catalunya). The work of the third author was also partially supported by Army Research Office Contract DAAG-29-84-k-005.Simple ARMA(2, 1) Basic language analysis programs to construct random data were written by the second author and Dr. K. D. Senne, MIT Lincoln Laboratory. Lack of stability of the direct estimation was observed at TRW with the help of Dr. G. Butler. Analysis programs in FORTRAN for ARMA(p, q) were written and debugged at CAPS by the fifth author. The research was helped by access to VAXs at Thomson CSF-DTAS, Valbonne, France, at CAPS, Instituto Superior Técnico, and at Universitat Politécnica de Catalunya. In particular, the authors explicitly acknowledge Thomson CSF-DTAS and Dr. H. Gautier for extending the use of their facilities to the authors from September 1983 until June 1984, when the examples presented were simulated.on leave from University of Southern California, Los Angeles, California.formerly visiting at Massachusetts Institute of Technology and Laboratory for Information and Decision Systems, while on leave from Instituto Superior Técnico, Lisbon, Portugal.     

Variable selection in censored quantile regression with high dimensional data

We propose a two-step variable selection procedure for censored quantile regression with high dimensional predictors. To account for censoring data in high dimensional case, we employ effective dimension reduction and the ideas of informative subset idea. Under some regularity conditions, we show that our procedure enjoys the model selection consistency. Simulation study and real data analysis are conducted to evaluate the finite sample performance of the proposed approach.     

Post selection shrinkage estimation for high‐dimensional data analysis

In high‐dimensional data settings where p  ? n , many penalized regularization approaches were studied for simultaneous variable selection and estimation. However, with the existence of covariates with weak effect, many existing variable selection methods, including Lasso and its generations, cannot distinguish covariates with weak and no contribution. Thus, prediction based on a subset model of selected covariates only can be inefficient. In this paper, we propose a post selection shrinkage estimation strategy to improve the prediction performance of a selected subset model. Such a post selection shrinkage estimator (PSE) is data adaptive and constructed by shrinking a post selection weighted ridge estimator in the direction of a selected candidate subset. Under an asymptotic distributional quadratic risk criterion, its prediction performance is explored analytically. We show that the proposed post selection PSE performs better than the post selection weighted ridge estimator. More importantly, it improves the prediction performance of any candidate subset model selected from most existing Lasso‐type variable selection methods significantly. The relative performance of the post selection PSE is demonstrated by both simulation studies and real‐data analysis. Copyright © 2016 John Wiley & Sons, Ltd.     

基于三类模型的四大银行股票收益率预测研究

运用时间序列分析的预测方法,对四大银行的股票日对数收益率序列进行拟合与预测分析,分别构建ARMA模型、GARCH模型以及ARMA-GARCH组合模型,通过模型比较,实证分析表明:在拟合效果上,ARMA-GARCH模型的拟合优度优于ARMA模型和GARCH模型;在预测效果上,ARMA模型的预测效果最优,ARMA-GARCH模型次之.     

Global stability of a multistrain SIS model with superinfection and patch structure

We study the global stability of a multistrain SIS model with superinfection and patch structure. We establish an iterative procedure to obtain a sequence of threshold parameters. By a repeated application of a result by Takeuchi et al. [Nonlinear Anal Real World Appl. 2006;7:235–247], we show that these parameters completely determine the global dynamics of the system: for any number of patches and strains with different infectivities, any subset of the strains can stably coexist depending on the particular choice of the parameters.     

基于ARMA模型的股价分析与预测的实证研究

利用ARMA模型对招商银行(600036)的股票日开盘价(2010/10/13-2011/4/8)数据进行分析,并预测出未来3天(2011/4/11-2011/4/13)的股票开盘价数据.与实际数据相对照,模型预测误差小,说明ARMA模型非常适合于短期预测.     

Identifying predictive hubs to condense the training set of k-nearest neighbour classifiers

The $k$ -Nearest Neighbour classifier is widely used and popular due to its inherent simplicity and the avoidance of model assumptions. Although the approach has been shown to yield a near-optimal classification performance for an infinite number of samples, a selection of the most decisive data points can improve the classification accuracy considerably in real settings with a limited number of samples. At the same time, a selection of a subset of representative training samples reduces the required amount of storage and computational resources. We devised a new approach that selects a representative training subset on the basis of an evolutionary optimization procedure. This method chooses those training samples that have a strong influence on the correct prediction of other training samples, in particular those that have uncertain labels. The performance of the algorithm is evaluated on different data sets. Additionally, we provide graphical examples of the selection procedure.     

On the stability of linear systems with fractional-order elements

Linear integer-order circuits are a narrow subset of rational-order circuits which are in turn a subset of fractional-order. Here, we study the stability of circuits having one fractional element, two fractional elements of the same order or two fractional elements of different order. A general procedure for studying the stability of a system with many fractional elements is also given. It is worth noting that a fractional element is one whose impedance in the complex frequency s-domain is proportional to s^α and α is a positive or negative fractional-order. Different transformations and methods will be illustrated via examples.     

Using ARMA models to forecast workpiece roundness error in a turning operation

The paper describes the methodology for developing autoregressive moving average (ARMA) models to represent the workpiece roundness error in the machine taper turning process. The method employs a two stage approach in the determination of the AR and MA parameters of the ARMA model. It first calculates the parameters of the equivalent autoregressive model of the process, and then derives the AR and MA parameters of the ARMA model. Akaike's Information Criterion (AIC) is used to find the appropriate orders m and n of the AR and MA polynomials respectively. Recursive algorithms are developed for the on-line implementation on a laboratory turning machine. Evaluation of the effectiveness of using ARMA models in error forecasting is made using three time series obtained from the experimental machine. Analysis shows that ARMA(3,2) with forgetting factor of 0.95 gives acceptable results for this lathe turning machine.     

Some autoregressive moving average processes with generalized Poisson marginal distributions

Some simple models are introduced which may be used for modelling or generating sequences of dependent discrete random variables with generalized Poisson marginal distribution. Our approach for building these models is similar to that of the Poisson ARMA processes considered by Al-Osh and Alzaid (1987,J. Time Ser. Anal.,8, 261–275; 1988,Statist. Hefte,29, 281–300) and McKenzie (1988,Adv. in Appl. Probab.,20, 822–835). The models have the same autocorrelation structure as their counterparts of standard ARMA models. Various properties, such as joint distribution, time reversibility and regression behavior, for each model are investigated.     

基于Gibbs抽样的贝叶斯稳健ARMA模型研究

针对ARMA模型建模过程中模型识别和参数估计易受观测值异常点影响问题,构建了同时考虑加性异常点和更新性异常点的ARMA模型．运用基于Gibbs抽样的Markov Chain Monte Carlo贝叶斯方法,估计稳健ARMA模型参数,同步确定观测值中异常点的位置,辨别异常点类型．并利用我国人口自然增长数据进行仿真分析,研究结果表明：贝叶斯方法能够有效地识别ARMA序列的异常点．     

Mixing mixed-integer inequalities

Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities.?Given a mixed-integer region S and a collection of valid “base” mixed-integer inequalities, we develop a procedure for generating new valid inequalities for S. The starting point of our procedure is to consider the MIR inequalities related with the base inequalities. For any subset of these MIR inequalities, we generate two new inequalities by combining or “mixing” them. We show that the new inequalities are strong in the sense that they fully describe the convex hull of a special mixed-integer region associated with the base inequalities.?We discuss how the mixing procedure can be used to obtain new classes of strong valid inequalities for various mixed-integer programming problems. In particular, we present examples for production planning, capacitated facility location, capacitated network design, and multiple knapsack problems. We also present preliminary computational results using the mixing procedure to tighten the formulation of some difficult integer programs. Finally we study some extensions of this mixing procedure. Received: April 1998 / Accepted: January 2001?Published online April 12, 2001