Abstract Markowitz (1952, 1959) laid down the ground-breaking work on mean-variance analysis without gross exposure constraints. Under this framework, the theoretical optimal allocation vector can be different from the estimated one due to intrinsic difficulty of estimating a large covariance matrix and return vector. This can result in adverse performance in portfolio selected based on empirical data due to noise accumulation on estimation errors (Jagannathan and Ma, 2003; Fan, Fan and Lv, 2008). We address this problem by introducing the gross-exposure constrained mean-variance portfolio selection. We show that with gross-exposure constraint the theoretical optimal portfolios have similar performance as empirically selected ones based on estimated covariance matrices and there is no noise accumulation effect from estimation of covariance matrices. This gives theoretical justification to the empirical results

We propose several modifications to the grid based particle method (GBPM) [21] for moving interface modeling. There are several nice features of the proposed algorithm. The new method can significantly improve the distribution of sampling particles on the evolving interface. Unlike the original GBPM where footpoints (sampling points) tend to cluster to each other, the sampling points in the new method tend to be better separated on the interface. Moreover, by replacing the grid-based discretization using the cell-based discretization, we naturally decompose the interface into segments so that we can easily approximate surface integrals. As a possible alternative to the local polynomial least square approximation, we also study a geometric basis for local reconstruction in the resampling step. We will show that such modification can simplify the overall implementations. Numerical examples in two- and three

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

We propose to model multivariate volatility processes on the basis of the newly defined conditionally uncorrelated components (CUCs). This model represents a parsimonious representation for matrixvalued processes. It is flexible in the sense that each CUC may be fitted separately with any appropriate univariate volatility model. Computationally it splits one high dimensional optimization problem into several lower dimensional subproblems. Consistency for the estimated CUCs has been established. A bootstrap method is proposed for testing the existence of CUCs. The methodology proposed is illustrated with both simulated and real data sets.

Multiple hypothesis testing is a fundamental problem in high dimensional inference, with wide applications in many scientific fields. In genome-wide association studies, tens of thousands of tests are performed simultaneously to find if any genes are associated with some traits and those tests are correlated. When test statistics are correlated, false discovery control becomes very challenging under arbitrary dependence. In the current paper, we propose a new methodology based on principal factor approximation, which successfully substracts the common dependence and weakens significantly the correlation structure, to deal with an arbitrary dependence structure. We derive the theoretical distribution for false discovery proportion (FDP) in large scale multiple testing when a common threshold is used and provide a consistent FDP. This result has important applications in controlling FDR and FDP. Our estimate of FDP compares favorably with Efron (2007)'s approach, as demonstrated by in the simulated examples. Our approach is further illustrated by some real data applications.