随机删失下半参数估计的强相合性

主要讨论了随机删失下的部分线性模型,利用基于分布函数的核估计和最小二乘法,给出了删失情况下参数和非参数部分的估计,并证明了它们的强相合性.     

The quasi-likelihood estimation in regression

I propose a simply method to estimate the regression parameters in quasi-likelihood model My main approach utilizes the dimension reduction technique to first reduce the dimension of the regressor X to one dimension before solving the quasi-likelihood equations. In addition, the real advantage of using dimension reduction technique is that it provides a good initial estimate for one-step estimator of the regression parameters. Under certain design conditions, the estimators are asymptotically multivariate normal and consistent. Moreover, a Monte Carlo simulation is used to study the practical performance of the procedures, and I also assess the cost of CPU time for computing the estimates.This research partially supported by the National Science Council, R.O.C. (Plan No. NSC 82-0208-M-032-023-T).     

A Note on Asymptotic Normality of Kernel Estimation for Linear Random Fields on <Emphasis Type="Italic">Z</Emphasis><Superscript>2</Superscript>

This note considers the kernel estimation of a linear random field on Z ². Instead of imposing certain mixing conditions on the random fields, it is assumed that the weights of the innovations satisfy a summability property. By building a martingale decomposition based on a suitable filtration, asymptotic normality is proven for the kernel estimator of the marginal density of the random field. T.-L. Cheng’s research is supported in part by NSC 94-2118-M-018-001, Taiwan. Also, he is indebted to Department of Mathematics and Statistics, University of Calgary, for their hospitality during his visit. X. Lu’s research is supported in part by NSERC Discovery Grant of Canada.     

Estimation of Kullback–Leibler Divergence by Local Likelihood

Motivated from the bandwidth selection problem in local likelihood density estimation and from the problem of assessing a final model chosen by a certain model selection procedure, we consider estimation of the Kullback–Leibler divergence. It is known that the best bandwidth choice for the local likelihood density estimator depends on the distance between the true density and the ‘vehicle’ parametric model. Also, the Kullback–Leibler divergence may be a useful measure based on which one judges how far the true density is away from a parametric family. We propose two estimators of the Kullback-Leibler divergence. We derive their asymptotic distributions and compare finite sample properties. Research of Young Kyung Lee was supported by the Brain Korea 21 Projects in 2004. Byeong U. Park’s research was supported by KOSEF through Statistical Research Center for Complex Systems at Seoul National University.     

Q-Learning Algorithms with Random Truncation Bounds and Applications to Effective Parallel Computing

Motivated by an important problem of load balancing in parallel computing, this paper examines a modified algorithm to enhance Q-learning methods, especially in asynchronous recursive procedures for self-adaptive load distribution at run-time. Unlike the existing projection method that utilizes a fixed region, our algorithm employs a sequence of growing truncation bounds to ensure the boundedness of the iterates. Convergence and rates of convergence of the proposed algorithm are established. This class of algorithms has broad applications in signal processing, learning, financial engineering, and other related fields. G. Yin’s research was supported in part by the National Science Foundation under Grants DMS-0603287 and DMS-0624849 and in part by the National Security Agency under Grant MSPF-068-029. C.Z. Xu’s research was supported in part by the National Science Foundation under Grants CCF-0611750, DMS-0624849, CNS-0702488, and CRI-0708232. L.Y. Wang’s research was supported in part by the National Science Foundation under Grants ECS-0329597 and DMS-0624849 and by the Michigan Economic Development Council.     

Stability of join-the-shortest-queue networks

This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Furthermore, we allow interarrival and service times to have general distributions. For networks with two stations we derive necessary and sufficient conditions for positive Harris recurrence of the network process. These conditions involve only the mean values of the network primitives. We also provide counterexamples showing that more information on distributions and tie-breaking probabilities is needed for networks with more than two stations, in order to characterize the stability of such systems. However, if the routing probabilities in the network satisfy a certain homogeneity condition, then we show that the stability behavior can be explicitly determined, again using the mean value parameters of the network. A byproduct of our analysis is a new method for using the fluid model of a queueing network to show non-positive recurrence of a process. In previous work, the fluid model was only used to show either positive Harris recurrence or transience of a network process. J.G. Dai’s research supported in part by National Science Foundation grants DMI-0300599, CMMI-0727400 and CNS-0718701, and by an IBM Faculty Award. J.J. Hasenbein’s research supported in part by National Science Foundation grant DMI-0132038. B. Kim’s research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).     

Random weighting method for Cox’s proportional hazards model

Variance of parameter estimate in Cox’s proportional hazards model is based on asymptotic variance. When sample size is small, variance can be estimated by bootstrap method. However, if censoring rate in a survival data set is high, bootstrap method may fail to work properly. This is because bootstrap samples may be even more heavily censored due to repeated sampling of the censored observations. This paper proposes a random weighting method for variance estimation and confidence interval estimation for proportional hazards model. This method, unlike the bootstrap method, does not lead to more severe censoring than the original sample does. Its large sample properties are studied and the consistency and asymptotic normality are proved under mild conditions. Simulation studies show that the random weighting method is not as sensitive to heavy censoring as bootstrap method is and can produce good variance estimates or confidence intervals.     

A convergence theorem of Rosen’s gradient projection method

Since Rosen’s gradient projection method was published in 1960, a rigorous convergence proof of his method has remained an open question. A convergence theorem is given in this paper. Part of this author’s work was done while he studied at the Department of Mathematics, University of California at Santa Barbara, and was supported by the National Science Foundation under Grant No. MCS83-14977. Part of this author’s work was done while he visited the Computer Science Department, University of Minnesota, Minneapolis, and was supported by the National Science Foundation under Grant No. MCS81-01214.     

Spectral conditioning and pseudospectral growth

Using the language of pseudospectra, we study the behavior of matrix eigenvalues under two scales of matrix perturbation. First, we relate Lidskii’s analysis of small perturbations to a recent result of Karow on the growth rate of pseudospectra. Then, considering larger perturbations, we follow recent work of Alam and Bora in characterizing the distance from a given matrix to the set of matrices with multiple eigenvalues in terms of the number of connected components of pseudospectra. J. V. Burke’s research was supported in part by National Science Foundation Grant DMS-0505712. A. S. Lewis’s research was supported in part by National Science Foundation Grant DMS-0504032. M. L. Overton’s research was supported in part by National Science Foundation Grant DMS-0412049.     

Simultaneously inpainting in image and transformed domains

In this paper, we focus on the restoration of images that have incomplete data in either the image domain or the transformed domain or in both. The transform used can be any orthonormal or tight frame transforms such as orthonormal wavelets, tight framelets, the discrete Fourier transform, the Gabor transform, the discrete cosine transform, and the discrete local cosine transform. We propose an iterative algorithm that can restore the incomplete data in both domains simultaneously. We prove the convergence of the algorithm and derive the optimal properties of its limit. The algorithm generalizes, unifies, and simplifies the inpainting algorithm in image domains given in Cai et al. (Appl Comput Harmon Anal 24:131–149, 2008) and the inpainting algorithms in the transformed domains given in Cai et al. (SIAM J Sci Comput 30(3):1205–1227, 2008), Chan et al. (SIAM J Sci Comput 24:1408–1432, 2003; Appl Comput Harmon Anal 17:91–115, 2004). Finally, applications of the new algorithm to super-resolution image reconstruction with different zooms are presented. R. H. Chan’s research was supported in part by HKRGC Grant 400505 and CUHK DAG 2060257. L. Shen’s research was supported by the US National Science Foundation under grant DMS-0712827. Z. Shen’s research was supported in part by Grant R-146-000-060-112 at the National University of Singapore.     

Sizer for smoothing splines

Smoothing splines are an attractive method for scatterplot smoothing. The SiZer approach to statistical inference is adapted to this smoothing method, named SiZerSS. This allows quick and sure inference as to “which features in the smooth are really there” as opposed to “which are due to sampling artifacts”, when using smoothing splines for data analysis. Applications of SiZerSS to mode, linearity, quadraticity and monotonicity tests are illustrated using a real data example. Some small scale simulations are presented to demonstrate that the SiZerSS and the SiZerLL (the original local linear version of SiZer) often give similar performance in exploring data structure but they can not replace each other completely. Marron’s research was supported by the Dept. of Stat. and Appl. Prob., National Univ. of Singapore, and by the National Science Foundation Grant DMS-9971649. Zhang’s research was supported by the National Univ. of Singapore Academic Research grant R-155-000-023-112. The Editor, the Associate Editor, and the referees are appreciated for their invaluable comments and suggestions that help improve the article significantly.     

An application of number theory to ergodic theory and the construction of uniquely ergodic models

Using a combinatorial result of N. Hindman one can extend Jewett’s method for proving that a weakly mixing measure preserving transformation has a uniquely ergodic model to the general ergodic case. We sketch a proof of this reviewing the main steps in Jewett’s argument. To the memory of Shlomo Horowitz The research of this author was supported by the National Science Foundation (USA).     

On Controllability of an Elastic Ring

We study the exact controllability problem for a ring under stretching tension that varies in time. We are looking for a couple of forces, which drive the state solution to rest. We show that applying two forces is necessary for controllability and the ring is controllable in the time interval greater than the optical length of the string. We also explain why one force would not be enough to control the ring. We use the method of moments to reduce the controllability problem to a moment problem for the controlling forces. The solution of that problem is based on an auxiliary basis property result. Both method of moments and proof of the basis property are developed for the model with time-dependent parameters. S.A.’s research was supported in part by the NSF, grant ARC–0724860. B.B.’s research was supported in part by University of Tennessee at Chattanooga Faculty Research Grant. S.I.’s research was supported in part by the Russian Foundation for Basic Research, grants 08-01-00595a and 08-01-00676a.     

On the characterization of strong convergence of an iterative algorithm for a class of multi-valued variational inclusions

This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued variational inclusion problems. Characterization of strong convergence of this iterative method is established. L. C. Ceng’s research partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and the Dawn Program Foundation in Shanghai. S. Schaible’s research partially supported by the National Science Council of Taiwan. This research was partially supported by the grant NSC 96-2628-E-110-014-MY3.     

Iterative Weighted Semiparametric Least Squares Estimation in Repeated Measurement Partially Linear Regression Models

Consider a repeated measurement partially linear regression model with an unknown vector parameter β, an unknown function g(.), and unknown heteroscedastic error variances. In order to improve the semiparametric generalized least squares estimator (SGLSE) of β, we propose an iterative weighted semiparametric least squares estimator (IWSLSE) and show that it improves upon the SGLSE in terms of asymptotic covariance matrix. An adaptive procedure is given to determine the number of iterations. We also show that when the number of replicates is less than or equal to two, the IWSLSE can not improve upon the SGLSE. These results are generalizations of those in [2] to the case of semiparametric regressions.     

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Interest in linear programming has been intensified recently by Karmarkar’s publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review classical barrier-function methods for nonlinear programming based on applying a logarithmic transformation to inequality constraints. For the special case of linear programming, the transformed problem can be solved by a “projected Newton barrier” method. This method is shown to be equivalent to Karmarkar’s projective method for a particular choice of the barrier parameter. We then present details of a specific barrier algorithm and its practical implementation. Numerical results are given for several non-trivial test problems, and the implications for future developments in linear programming are discussed. The research of the Stanford authors was supported by the U.S. Department of Energy Contract DE-AA03-76SF00326, PA No. DE-AS03-76ER72018; National Science Foundation Grants DCR-8413211 and ECS-8312142; the Office of Naval Research Contract N00014-85-K-0343; and the U.S. Army Research Office Contract DAAG29-84-K-0156. The research of J.A. Tomlin was supported by Ketron, Inc. and the Office of Naval Research Contract N00014-85-C-0338.     

Stochastic EM algorithms for parametric and semiparametric mixture models for right-censored lifetime data

Mixture models in reliability bring a useful compromise between parametric and nonparametric models, when several failure modes are suspected. The classical methods for estimation in mixture models rarely handle the additional difficulty coming from the fact that lifetime data are often censored, in a deterministic or random way. We present in this paper several iterative methods based on EM and Stochastic EM methodologies, that allow us to estimate parametric or semiparametric mixture models for randomly right censored lifetime data, provided they are identifiable. We consider different levels of completion for the (incomplete) observed data, and provide genuine or EM-like algorithms for several situations. In particular, we show that simulating the missing data coming from the mixture allows to plug a standard R package for survival data analysis in an EM algorithm’s M-step. Moreover, in censored semiparametric situations, a stochastic step is the only practical solution allowing computation of nonparametric estimates of the unknown survival function. The effectiveness of the new proposed algorithms are demonstrated in simulation studies and an actual dataset example from aeronautic industry.     

The Gaussian approximation for multi-color generalized Friedman’s urn model

The generalized Friedman’s urn model is a popular urn model which is widely used in many disciplines.In particular,it is extensively used in treatment allocation schemes in clinical trials.In this paper,we show that both the urn composition process and the allocation proportion process can be approximated by a multi-dimensional Gaussian process almost surely for a multi-color generalized Friedman’s urn model with both homogeneous and non-homogeneous generating matrices.The Gaussian process is a solution of ...     

Kantorovich’s majorants principle for Newton’s method

We prove Kantorovich’s theorem on Newton’s method using a convergence analysis which makes clear, with respect to Newton’s method, the relationship of the majorant function and the non-linear operator under consideration. This approach enables us to drop out the assumption of existence of a second root for the majorant function, still guaranteeing Q-quadratic convergence rate and to obtain a new estimate of this rate based on a directional derivative of the derivative of the majorant function. Moreover, the majorant function does not have to be defined beyond its first root for obtaining convergence rate results. The research of O.P. Ferreira was supported in part by FUNAPE/UFG, CNPq Grant 475647/2006-8, CNPq Grant 302618/2005-8, PRONEX–Optimization(FAPERJ/CNPq) and IMPA. The research of B.F. Svaiter was supported in part by CNPq Grant 301200/93-9(RN) and by PRONEX–Optimization(FAPERJ/CNPq).     

Solving variational inequalities defined on a domain with infinitely many linear constraints

We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. A discretization method and an analytic center based inexact cutting plane method are proposed. Under proper assumptions, the convergence results for both methods are given. We also provide numerical examples to illustrate the proposed methods. The work of S. Wu was partially supported by the National Science Council, Taiwan, ROC (Grant No. 19731001). S.-C. Fang’s research has been supported by the US Army Research Office (Grant No. W911NF-04-D-0003) and National Science Foundation (Grant No. DMI-0553310).