MathSciDoc: An Archive for Mathematician ∫

We propose a computational framework named iterative local adaptive majorize-minimization (I-LAMM) to simultaneously control algorithmic complexity and statistical error when fitting high dimensional models. I-LAMM is a two-stage algorithmic implementation of the local linear approximation to a family of folded concave penalized quasi-likelihood. The first stage solves a convex program with a crude precision tolerance to obtain a coarse initial estimator, which is further refined in the second stage by iteratively solving a sequence of convex programs with smaller precision tolerances. Theoretically, we establish a phase transition: the first stage has a sublinear iteration complexity, while the second stage achieves an improved linear rate of convergence. Though this framework is completely algorithmic, it provides solutions with optimal statistical performances and controlled algorithmic complexity for a large family

Long term prediction such as multi-step time series prediction is a challenging prognostics problem. This paper proposes an improved AR time series model called ND-AR model (Nonlinear Degradation AutoRegression) for Remaining Useful Life (RUL) estimation of lithium-ion batteries. The nonlinear degradation feature of the lithiumion battery capacity degradation is analyzed and then the non-linear accelerated degradation factor is extracted to improve the linear AR model. In this model, the nonlinear degradation factor can be obtained with curve fitting, and then the ND-AR model can be applied as an adaptive datadriven prognostics method to monitor degradation time series data. Experimental results with CALCE battery data set show that the proposed nonlinear degradation AR model can realize satisfied prognostics for various lithium-ion batteries with low computing complexity.

Parametric option pricing models are widely used in finance. These models capture several features of asset price dynamics; however, their pricing performance can be significantly enhanced when they are combined with nonparametric learning approaches that learn and correct empirically the pricing errors. In this article we propose a new nonparametric method for pricing derivatives assets. Our method relies on the state price distribution instead of the state price density, because the former is easier to estimate nonparametrically than the latter. A parametric model is used as an initial estimate of the state price distribution. Then the pricing errors induced by the parametric model are fitted nonparametrically. This model-guided method, called automatic correction of errors (ACE), estimates the state price distribution nonparametrically. The method is easy to implement and can be combined with any model-based

In statistics and machine learning, people are often interested in the eigenvectors (or singular vectors) of certain matrices (eg covariance matrices, data matrices, etc). However, those matrices are usually perturbed by noises or statistical errors, either from random sampling or structural patterns. One usually employs Davis-Kahan \sin theorem to bound the difference between the eigenvectors of a matrix \sin and those of a perturbed matrix \sin , in terms of \sin norm. In this paper, we prove that when \sin is a low-rank and incoherent matrix, the \sin norm perturbation bound of singular vectors (or eigenvectors in the symmetric case) is smaller by a factor of \sin or \sin for left and right vectors, where \sin and \sin are the matrix dimensions. The power of this new perturbation result is shown in robust covariance estimation, particularly when random variables have heavy tails. There, we propose new robust covariance estimators and establish their asymptotic properties using the newly developed perturbation bound. Our theoretical results are verified through extensive numerical experiments.

Generalized linear models and quasi-likelihood method extend the ordinary regression models to accommodate more general conditional distributions of the response. Nonparametric methods need no explicit parametric specification and the resulting model is completely determined by the data themselves. However nonparametric estimation schemes generally have a slower convergence rate such as the local polynomial smoothing estimation of nonparametric generalized linear models studied in Fan, Heckman and Wand (1995). In this work, we propose two parametrically guided nonparametric estimation schemes by incorporating prior shape information on the link transformation of the response variables conditional mean in terms of the predictor variable. Asymptotic results and numerical simulations demonstrate the improvement of our new estimation schemes over the original nonparametric counterpart.

A semilinear in-slide model is introduced to remove the intensity effect in the scanning process. It is demonstrated that the intensity effect can be estimated accurately and removed effectively. This normalization step is vital for Affymetrix arrays to reveal relevant biological results when comparing gene expression in multiple arrays. The normalized expression ratios are analyzed further by a modified two-sample <i>t</i> test along with a sieved permutation scheme for computing <i>P</i> values. The improved specificity and sensitivity are demonstrated by using a study on the impact of macrophage migration inhibitory factor (MIF) reduction in neuroblastoma cells. With semilinear in-slide model analysis, expression of 166 genes was altered with a <i>P</i> value no greater than 0.001. Among those genes, 44 were altered &gt;2-fold. MIF-regulated genes associated with tumor development including IL-8 and <i>C</i>-<i>met</i>, which are overexpressed

Quadratic regression functionals are important for bandwidth selection of nonparametric regression techniques and for nonparametric goodness-of-fit test. Based on local polynomial regression, we propose estimators for weighted integrals of squared derivatives of regression functions. The rates of convergence in mean square error are calculated under various degrees of smoothness and appropriate values of the smoothing parameter. Asymptotic distributions of the proposed quadratic estimators are considered with the Gaussian noise assumption. It is shown that when the estimators are pseudo-quadratic (linear components dominate quadratic components), asymptotic normality with rate n-1/2 can be achieved.

We propose a novel Rayleigh quotient based sparse quadratic dimension reduction methodnamed QUADRO (Qua dratic D imension R eduction via Rayleigh O ptimization)for analyzing high-dimensional data. Unlike in the linear setting where Rayleigh quotient optimization coincides with classification, these two problems are very different under nonlinear settings. In this paper, we clarify this difference and show that Rayleigh quotient optimization may be of independent scientific interests. One major challenge of Rayleigh quotient optimization is that the variance of quadratic statistics involves all fourth cross-moments of predictors, which are infeasible to compute for high-dimensional applications and may accumulate too many stochastic errors. This issue is resolved by considering a family of elliptical models. Moreover, for heavy-tail distributions, robust estimates of mean vectors and covariance matrices are

We study the estimation of the additive components in additive regression models, based on the weighted sample average of regression surface, for stationary <i></i>-mixing processes. Explicit expression of this method makes possible a fast computation and allows an asymptotic analysis. The estimation procedure is especially useful for additive modeling. In this paper, it is shown that the average surface estimator shares the same optimality as the ideal estimator and has the same ability to estimate the additive component as the ideal case where other components are known. Formulas for the asymptotic bias and normality of the estimator are established. A small simulation study is carried out to illustrate the performance of the estimation and a real example is also used to demonstrate our methodology.

We consider forecasting a single time series when there is a large number of predictors and a possible nonlinear effect. The dimensionality was first reduced via a high-dimensional factor model implemented by the principal component analysis. Using the extracted factors, we develop a novel forecasting method called the sufficient forecasting, which provides a set of sufficient predictive indices, inferred from high-dimensional predictors, to deliver additional predictive power. The projected principal component analysis will be employed to enhance the accuracy of inferred factors when a semi-parametric factor model is assumed. Our method is also applicable to cross-sectional sufficient regression using extracted factors. The connection between the sufficient forecasting and the deep learning architecture is explicitly stated. The sufficient forecasting correctly estimates projection indices of the underlying factors even