We present a novel modification to the well-known infomax algorithm of blind source separation. Under natural gradient descent, the infomax algorithm converges to a stationary point of a limiting ordinary differential equation. However, due to the presence of saddle points or local minima of the corresponding likelihood function, the algorithm may be trapped around these bad stationary points for a long time, especially if the initial data are near them. To speed up convergence, we propose to add a sequence of random perturbations to the infomax algorithm to shake the iterating sequence so that it is captured by a path descending to a more stable stationary point. We analyze the convergence of the randomly perturbed algorithm, and illustrate its fast convergence through numerical examples on blind demixing of stochastic signals. The examples have analytical structures so that saddle points or local minima of

We briefly survey our recent results about the Mumford goodness of several canonical metrics on the moduli spaces of Riemann surfaces, including the Weil-Petersson metric, the Ricci metric, the Perturbed Ricci metric and the Kahler-Einstein metric. We prove the dual Nakano negativity of the Weil-Petersson metric. As applications of these results we deduce certain important results about the <i>L</i> ²-cohomology groups of the logarithmic tangent bundle over the compactified moduli spaces.

Varyingcoefficient linear models arise from multivariate nonparametric regression, nonlinear time series modelling and forecasting, functional data analysis, longitudinal data analysis and others. It has been a common practice to assume that the varying coefficients are functions of a given variable, which is often called an <i>index</i>. To enlarge the modelling capacity substantially, this paper explores a class of varyingcoefficient linear models in which the index is unknown and is estimated as a linear combination of regressors and/or other variables. We search for the index such that the derived varyingcoefficient model provides the least squares approximation to the underlying unknown multidimensional regression function. The search is implemented through a newly proposed hybrid backfitting algorithm. The core of the algorithm is the alternating iteration between estimating the index through a onestep scheme

The non-Gaussian maximum likelihood estimator is frequently used in GARCH models with the intention of capturing heavy-tailed returns. However, unless the parametric likelihood family contains the true likelihood, the estimator is inconsistent due to density misspecification. To correct this bias, we identify an unknown scale parameter _<i>f</i> that is critical to the identification for consistency and propose a three-step quasi-maximum likelihood procedure with non-Gaussian likelihood functions. This novel approach is consistent and asymptotically normal under weak moment conditions. Moreover, it achieves better efficiency than the Gaussian alternative, particularly when the innovation error has heavy tails. We also summarize and compare the values of the scale parameter and the asymptotic efficiency for estimators based on different choices of likelihood functions with an increasing level of heaviness in the

Can you capture the motion of a smile in 3-D? This paper presents a video acquisition system that measures 3-D geometry accurately. The data acquisition speed is 90 fps and over one quarter million points per frame. Acquisition, reconstruction, and display are simultaneously realized at 30 fps.