We discuss the difficulties of estimating quadratic functionals based on observations Y (t) from the white noise model Y (t) where Y (t) is a standard Wiener process on Y (t) . The optimal rates of convergence (as Y (t) ) for estimating quadratic functionals under certain geometric constraints are found. Specifically, the optimal rates of estimating Y (t) under hyperrectangular constraints Y (t) and weighted Y (t) -body constraints Y (t) are computed explicitly, where Y (t) is the Y (t) th Fourier-Bessel coefficient of the unknown function Y (t) . We develop lower bounds based on testing two highly composite hypercubes and address their advantages. The attainable lower bounds are found by applying the hardest one-dimensional approach as well as the hypercube method. We demonstrate that for estimating regular quadratic functionals [ie, the functionals which can be estimated

Variable selection in high-dimensional space characterizes many contemporary problems in scientific discovery and decision making. Many frequently-used techniques are based on independence screening; examples include correlation ranking (Fan & Lv, 2008) or feature selection using a two-sample t-test in high-dimensional classification (Tibshirani et al., 2003). Within the context of the linear model, Fan & Lv (2008) showed that this simple correlation ranking possesses a sure independence screening property under certain conditions and that its revision, called iteratively sure independent screening (ISIS), is needed when the features are marginally unrelated but jointly related to the response variable. In this paper, we extend ISIS, without explicit definition of residuals, to a general pseudo-likelihood framework, which includes generalized linear models as a special case. Even in the least-squares setting, the new method improves ISIS by allowing feature deletion in the iterative process. Our technique allows us to select important features in high-dimensional classification where the popularly used two-sample t-method fails. A new technique is introduced to reduce the false selection rate in the feature screening stage. Several simulated and two real data examples are presented to illustrate the methodology.

Variable selection in high-dimensional space characterizes many contemporary problems in scientific discovery and decision making. Many frequently-used techniques are based on independence screening; examples include correlation ranking (Fan and Lv, 2008) or feature selection using a two-sample t-test in high-dimensional classification (Tibshirani et al., 2003). Within the context of the linear model, Fan and Lv (2008) showed that this simple correlation ranking possesses a sure independence screening property under certain conditions and that its revision, called iteratively sure independent screening (ISIS), is needed when the features are marginally unrelated but jointly related to the response variable. In this paper, we extend ISIS, without explicit definition of residuals, to a general pseudo-likelihood framework, which includes generalized linear models as a special case. Even in the least-squares setting, the new method improves ISIS by allowing variable deletion in the iterative process. Our technique allows us to select important features in high-dimensional classification where the popularly used two-sample t-method fails. A new technique is introduced to reduce the false discovery rate in the feature screening stage. Several simulated and two real data examples are presented to illustrate the methodology.

Time- and state-domain methods are two common approaches to nonparametric prediction. Whereas the former uses data predominantly from recent history, the latter relies mainly on historical information. Combining these two pieces of valuable information is an interesting challenge in statistics. We surmount this problem by dynamically integrating information from both the time and state domains. The estimators from these two domains are optimally combined based on a data-driven weighting strategy, which provides a more efficient estimator of volatility. Asymptotic normality is separately established for the time domain, the state domain, and the integrated estimators. By comparing the efficiency of the estimators, we demonstrate that the proposed integrated estimator uniformly dominates the other two estimators. The proposed dynamic integration approach is also applicable to other estimation problems in time

Recent proposals for implementation of kernel-based nonparametric curve estimators are seen to be faster than naive direct implementations by factors up into the hundreds. The main ideas behind the two different approaches are made clear. Careful speed comparisons in a variety of settings and using a variety of machines and software are done. Various issues on computational accuracy and stability are also discussed. Our speed tests show that the fast methods are as fast or somewhat faster than methods traditionally considered very fast, such as LOWESS and smoothing splines.