Adaptive local linear quantile regression

In this paper we propose a new method of local linear adaptive smoothing for nonparametric conditional quantile regression. Some theoretical properties of the procedure are investigated. Then we demonstrate the performance of the method on a simulated example and compare it with other methods. The simulation results demonstrate a reasonable performance of our method proposed especially in situations when the underlying image is piecewise linear or can be approximated by such images. Generally speaking, our method outperforms most other existing methods in the sense of the mean square estimation (MSE) and mean absolute estimation (MAE) criteria. The procedure is very stable with respect to increasing noise level and the algorithm can be easily applied to higher dimensional situations.     

A Self-Adaptive Projection and Contraction Method for Linear Complementarity Problems

In this paper we develop a self-adaptive projection and contraction method for the linear complementarity problem (LCP). This method improves the practical performance of the modified projection and contraction method in [10] by adopting a self-adaptive technique. The global convergence of our new method is proved under mild assumptions. Our numerical tests clearly demonstrate the necessity and effectiveness of our proposed method.     

A block Chebyshev-Davidson method for linear response eigenvalue problems

We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of linear response eigenvalue problems. The method is applicable to more general linear response eigenvalue problems where some purely imaginary eigenvalues may exist. For the Chebyshev filter, a tight upper bound is obtained by a computable bound estimator that is provably correct under a reasonable condition. When the condition fails, the estimated upper bound may not be a true one. To overcome that, we develop an adaptive strategy for updating the estimated upper bound to guarantee the effectiveness of our new Chebyshev-Davidson method. We also obtain an estimate of the rate of convergence for the Ritz values by our algorithm. Finally, we present numerical results to demonstrate the performance of the proposed Chebyshev-Davidson method.     

半参数空间变系数模型的局部线性二阶段估计

针对半参数空间变系数模型,利用二阶段估计方法借助于局部线性拟合技术给出了模型中常值系数估计量的精确表达式;同时给出了实验设计方法,用于验证所提出的估计方法对估计常值系数具有满意的精度和稳定性.     

Local linear regression for data with AR errors

In many statistical applications, data are collected over time, and they are likely correlated. In this paper, we investigate how to incorporate the correlation information into the local linear regression. Under the assumption that the error process is an auto-regressive process, a new estimation procedure is proposed for the nonparametric regression by using local linear regression method and the profile least squares techniques. We further propose the SCAD penalized profile least squares method to determine the order of auto-regressive process. Extensive Monte Carlo simulation studies are conducted to examine the finite sample performance of the proposed procedure, and to compare the performance of the proposed procedures with the existing one. From our empirical studies, the newly proposed procedures can dramatically improve the accuracy of naive local linear regression with working-independent error structure. We illustrate the proposed methodology by an analysis of real data set.     

Interaction Model and Model Selection for Function-on-Function Regression

Regression models with interaction effects have been widely used in multivariate analysis to improve model flexibility and prediction accuracy. In functional data analysis, however, due to the challenges of estimating three-dimensional coefficient functions, interaction effects have not been considered for function-on-function linear regression. In this article, we propose function-on-function regression models with interaction and quadratic effects. For a model with specified main and interaction effects, we propose an efficient estimation method that enjoys a minimum prediction error property and has good predictive performance in practice. Moreover, converting the estimation of three-dimensional coefficient functions of the interaction effects to the estimation of two- and one-dimensional functions separately, our method is computationally efficient. We also propose adaptive penalties to account for varying magnitudes and roughness levels of coefficient functions. In practice, the forms of the models are usually unspecified. We propose a stepwise procedure for model selection based on a predictive criterion. This method is implemented in our R package FRegSigComp. Supplemental materials are available online.     

A bias corrected nonparametric regression estimator

In this article, we propose a new method of bias reduction in nonparametric regression estimation. The proposed new estimator has asymptotic bias order h⁴, where h is a smoothing parameter, in contrast to the usual bias order h² for the local linear regression. In addition, the proposed estimator has the same order of the asymptotic variance as the local linear regression. Our proposed method is closely related to the bias reduction method for kernel density estimation proposed by Chung and Lindsay (2011). However, our method is not a direct extension of their density estimate, but a totally new one based on the bias cancelation result of their proof.     

Estimation and test procedures for composite quantile regression with covariates missing at random

In this paper, we study the weighted composite quantile regression (WCQR) for general linear model with missing covariates. We propose the WCQR estimation and bootstrap test procedures for unknown parameters. Simulation studies and a real data analysis are conducted to examine the finite performance of our proposed methods.     

无交叉多指标分位数回归模型中的估计与推断

在过去的30年中分位数回归模型的研究已十分深入.然而在实际的应用场景中,由传统估计方法所得到的分位数回归估计量,经常会在不同分位数水平上出现互相交叉的现象,这给分位数回归模型的实际应用造成了解释和预测上的困难.为解决这个问题,本文提出一种带单调约束的半参数多指标分位数回归模型的研究框架.首先将半参数多指标分位数回归模型...     

Robust empirical likelihood inference for generalized partial linear models with longitudinal data

In this paper, we propose a robust empirical likelihood (REL) inference for the parametric component in a generalized partial linear model (GPLM) with longitudinal data. We make use of bounded scores and leverage-based weights in the auxiliary random vectors to achieve robustness against outliers in both the response and covariates. Simulation studies demonstrate the good performance of our proposed REL method, which is more accurate and efficient than the robust generalized estimating equation (GEE) method (X. He, W.K. Fung, Z.Y. Zhu, Robust estimation in generalized partial linear models for clustered data, Journal of the American Statistical Association 100 (2005) 1176-1184). The proposed robust method is also illustrated by analyzing a real data set.     

基于LPRE和LASSO方法的股指追踪研究

将最小化乘积相对误差(LPRE)和最小绝对压缩选择算子(LASSO)方法应用到乘积回归模型,结合BIC信息准则实现股票指数的追踪,成功选取了26支对上证50指数影响较大的成分股,并比较了所提方法与线性模型下LASSO方法的表现,验证了所提方法的有效性.     

基于神经网络分位数回归的多期CVaR风险测度

与VaR金融风险测度相比,CVaR具有更好的数理性质,其计算方法成为关注的焦点。相对于单期CVaR而言,多期CVaR风险测度具有较强的非线性特征,其建模过程更加复杂。在神经网络分位数回归基础上,建立了一种新的多期CVaR风险测度方法;基于似然比检验,建立了多期CVaR风险测度返回测试评价准则。将该新方法应用于沪深300指数的多期CVaR风险测度,并将其与传统的测度方法进行了对比,返回测试结果表明:第一,该新方法具有较强的稳健性,各期平均绝对误差大小基本不变,特别适合于多期CVaR风险测度;第二,基于神经网络分位数回归的多期CVaR风险测度效果优于传统测度方法,表现为似然比检验拒绝次数最少和平均绝对误差最小。     

Controlling chaotic Chua''s circuit based on piecewise quadratic Lyapunov functions method

In this paper, we present a linear feedback controller design method for controlling chaotic Chua's circuit based on piecewise quadratic Lyapunov functions. Firstly, we get the piecewise linear differential inclusions (pwLDIs) model of tracking error dynamics, then we design a linear state feedback controller to stabilize it based on the piecewise quadratic Laypunov functions. Finally, we give some numerical simulations to demonstrate the effectiveness of our theoretical results.     

Chebyshev center based column generation

The classical column generation approach often shows a very slow convergence. Many different acceleration techniques have been proposed recently to improve the convergence. Here, we briefly survey these methods and propose a novel algorithm based on the Chebyshev center of the dual polyhedron. The Chebyshev center can be obtained by solving a linear program; consequently, the proposed method can be applied with small modifications on the classical column generation procedure. We also show that the performance of our algorithm can be enhanced by introducing proximity parameters which enable the position of the Chebyshev center to be adjusted. Numerical experiments are conducted on the binpacking, vehicle routing problem with time windows, and the generalized assignment problem. The computational results of these experiments demonstrate the effectiveness of our proposed method.     

Pyramid Quantile Regression

We describe a Bayesian model for simultaneous linear quantile regression at several specified quantile levels. More specifically, we propose to model the conditional distributions by using random probability measures, known as quantile pyramids, introduced by Hjort and Walker. Unlike many existing approaches, this framework allows us to specify meaningful priors on the conditional distributions, while retaining the flexibility afforded by the nonparametric error distribution formulation. Simulation studies demonstrate the flexibility of the proposed approach in estimating diverse scenarios, generally outperforming other competitive methods. We also provide conditions for posterior consistency. The method is particularly promising for modeling the extremal quantiles. Applications to extreme value analysis and in higher dimensions are also explored through data examples. Supplemental material for this article is available online.     

Numerical solution of linear Volterra integral equations of the second kind with sharp gradients

Collocation methods are a well-developed approach for the numerical solution of smooth and weakly singular Volterra integral equations. In this paper, we extend these methods through the use of partitioned quadrature based on the qualocation framework, to allow the efficient numerical solution of linear, scalar Volterra integral equations of the second kind with smooth kernels containing sharp gradients. In this case, the standard collocation methods may lose computational efficiency despite the smoothness of the kernel. We illustrate how the qualocation framework can allow one to focus computational effort where necessary through improved quadrature approximations, while keeping the solution approximation fixed. The computational performance improvement introduced by our new method is examined through several test examples. The final example we consider is the original problem that motivated this work: the problem of calculating the probability density associated with a continuous-time random walk in three dimensions that may be killed at a fixed lattice site. To demonstrate how separating the solution approximation from quadrature approximation may improve computational performance, we also compare our new method to several existing Gregory, Sinc, and global spectral methods, where quadrature approximation and solution approximation are coupled.     

����ά��������ģ�͵�PGFR����ɸѡ

In this paper, we consider the ultra-high dimensional partially linear model, where the dimensionality p of linear component is much larger than the sample size n, and p can be as large as an exponential of the sample size n. Firstly, we transform the ultra-high dimensional partially linear model into the ultra-high dimensional linear model based the profile technique used in the semiparametric regression. Secondly, in order to finish the variable screening for high-dimensional linear component, we propose a variable screening method called as the profile greedy forward regression (PGFR) by combining the greedy algorithm with the forward regression (FR) method. The proposed PGFR method not only considers the correlation between the covariates, but also identifies all relevant predictors consistently and possesses the screening consistency property under the some regularity conditions. We further propose the BIC criterion to determine whether the selected model contains the true model with probability tending to one. Finally, some simulation studies and a real application are conducted to examine the finite sample performance of the proposed PGFR procedure.     

����Adaptive-Lasso�ı��Ƴɼ�ͳ�Ʒ���

??In this paper, the multivariate linear statistical method is applied to research the undergraduate grades of students from the school of mathematics in Hefei University of Technology, and explore the impact on the later achievement by the early stage of achievement from all undergraduate courses. First, we get the main components from the previous courses by principal component analysis, then construct a linear regression model between the later achievement and main components by the stepwise regression method. Next, a linear regression model between the later achievement and the early stage of achievement from all undergraduate courses is constructed by Adaptive-Lasso method. Finally, comparative analysis is performed for the result of the above models. The research shows that the principal component regression model based on the Adaptive-Lasso method can well fit the later achievement, and give a reasonable explanation for the later academic performance.     

Modeling clustered binary data with nonparametric unobserved heterogeneity: An application to stock crash analysis

Various random effects models have been developed for clustered binary data; however, traditional approaches to these models generally rely heavily on the specification of a continuous random effect distribution such as Gaussian or beta distribution. In this article, we introduce a new model that incorporates nonparametric unobserved random effects on unit interval (0,1) into logistic regression multiplicatively with fixed effects. This new multiplicative model setup facilitates prediction of our nonparametric random effects and corresponding model interpretations. A distinctive feature of our approach is that a closed-form expression has been derived for the predictor of nonparametric random effects on unit interval (0,1) in terms of known covariates and responses. A quasi-likelihood approach has been developed in the estimation of our model. Our results are robust against random effects distributions from very discrete binary to continuous beta distributions. We illustrate our method by analyzing recent large stock crash data in China. The performance of our method is also evaluated through simulation studies.     

Efficient estimation of a varying-coefficient partially linear binary regression model

This article considers a semiparametric varying-coefficient partially linear binary regression model. The semiparametric varying-coefficient partially linear regression binary model which is a generalization of binary regression model and varying-coefficient regression model that allows one to explore the possibly nonlinear effect of a certain covariate on the response variable. A Sieve maximum likelihood estimation method is proposed and the asymptotic properties of the proposed estimators are discussed. One of our main objects is to estimate nonparametric component and the unknowen parameters simultaneously. It is easier to compute, and the required computation burden is much less than that of the existing two-stage estimation method. Under some mild conditions, the estimators are shown to be strongly consistent. The convergence rate of the estimator for the unknown smooth function is obtained, and the estimator for the unknown parameter is shown to be asymptotically efficient and normally distributed. Simulation studies are carried out to investigate the performance of the proposed method.