Combined Method of Datum Transformation Between Different Coordinate Systems

The similarity transformation model between different coordinate systems is not accurate enough to describe the discrepancy of them.Therefore,the coordinate transformation from the coordinate frame with poor accuracy to that with high accuracy cannot guarantee a high precision of transformation.In this paper,a combined method of similarity transformation and regressive approximating is presented.The local error accumulation and distortion are taken into consideration and the precision of coordinate system is improved by using the recommended method

Two-stage Local Walsh Average Estimation of Generalized Varying Coefficient Models

In this paper we investigate the robust estimation of generalized varying coefficient models in which the unknown regression coefficients may change with different explanatory variables. Based on the B-spline series approximation and Walsh-average technique we develop an initial estimator for the unknown regression coefficient functions. By virtue of the initial estimator, the generalized varying coefficient model is reduced to a univariate nonparametric regression model. Then combining the local linear smooth and Walsh average technique we further propose a two-stage local linear Walsh-average estimator for the unknown regression coefficient functions. Under mild assumptions, we establish the large sample theory of the proposed estimators by utilizing the results of U-statistics and shows that the two-stage local linear Walsh-average estimator own an oracle property, namely the asymptotic normality of the two-stage local linear Walsh-average estimator of each coefficient function is not affected by other unknown coefficient functions. Extensive simulation studies are conducted to assess the finite sample performance, and a real example is analyzed to illustrate the proposed method.

Degrees of freedom in low rank matrix estimation

The objective of this paper is to quantify the complexity of rank and nuclear norm constrained methods for low rank matrix estimation problems. Specifically, we derive analytic forms of the degrees of freedom for these types of estimators in several common settings. These results provide efficient ways of comparing different estimators and eliciting tuning parameters. Moreover, our analyses reveal new insights on the behavior of these low rank matrix estimators. These observations are of great theoretical and practical importance. In particular, they suggest that, contrary to conventional wisdom, for rank constrained estimators the total number of free parameters underestimates the degrees of freedom, whereas for nuclear norm penalization, it overestimates the degrees of freedom. In addition, when using most model selection criteria to choose the tuning parameter for nuclear norm penalization, it oftentimes suffices to entertain a finite number of candidates as opposed to a continuum of choices. Numerical examples are also presented to illustrate the practical implications of our results.