A structured variational learning approach for switching latent factor models

A data-driven approach for modeling volatility dynamics and co-movements in financial markets is introduced. Special emphasis is given to multivariate conditionally heteroscedastic factor models in which the volatilities of the latent factors depend on their past values, and the parameters are driven by regime switching in a latent state variable. We propose an innovative indirect estimation method based on the generalized EM algorithm principle combined with a structured variational approach that can handle models with large cross-sectional dimensions. Extensive Monte Carlo simulations and preliminary experiments with financial data show promising results.     

Estimation of parameters in incomplete data models defined by dynamical systems

Parametric incomplete data models defined by ordinary differential equations (ODEs) are widely used in biostatistics to describe biological processes accurately. Their parameters are estimated on approximate models, whose regression functions are evaluated by a numerical integration method. Accurate and efficient estimations of these parameters are critical issues. This paper proposes parameter estimation methods involving either a stochastic approximation EM algorithm (SAEM) in the maximum likelihood estimation, or a Gibbs sampler in the Bayesian approach. Both algorithms involve the simulation of non-observed data with conditional distributions using Hastings–Metropolis (H–M) algorithms. A modified H–M algorithm, including an original local linearization scheme to solve the ODEs, is proposed to reduce the computational time significantly. The convergence on the approximate model of all these algorithms is proved. The errors induced by the numerical solving method on the conditional distribution, the likelihood and the posterior distribution are bounded. The Bayesian and maximum likelihood estimation methods are illustrated on a simulated pharmacokinetic nonlinear mixed-effects model defined by an ODE. Simulation results illustrate the ability of these algorithms to provide accurate estimates.     

互连网络拓扑优化设计

论述了互连网络拓扑优化设计问题,建立了必要的数学模型,该数学模型是一个非线性组合优化问题,它属于NP—完备类问题。采取拉格朗日松弛法、次梯度迭代算法和启发式算法,得出最优下确界和结论。     

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

A fully odd K₄ is a subdivision of K₄ such that each of the six edges of the K₄ is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K₄ can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.     

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time

We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan.Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes fully known at the arrival of the job, while inthe non-clairvoyant on-line model, this processing requirement is notknown until the job is processed and completed.In both models, scheduling of a job is irrevocable.We study the two-machine open shop problem for both models in the preemptive and in the non-preemptive version. For each of the four variants, we provide an algorithm that is best possible with respect to the worst-case performance. In the clairvoyant on-line model, the best worst-case performance ratios are 5/4 (preemptive) and 3/2 (non-preemptive), and in the non-clairvoyant on-line model, they are 3/2 (preemptive and non-preemptive).     

A Note on Inconsistency of NPMLE of the Distribution Function from Left Truncated and Case I Interval Censored Data

We show that under reasonable conditions the nonparametric maximum likelihood estimate (NPMLE) of the distribution function from left-truncated and case 1 interval-censored data is inconsistent, in contrast to the consistency properties of the NPMLE from only left-truncated data or only interval-censored data. However, the conditional NPMLE is shown to be consistent. Numerical examples are provided to illustrate their finite sample properties.     

Identifiable finite mixtures of location models for clustering mixed-mode data

For clustering mixed categorical and continuous data, Lawrence and Krzanowski (1996) proposed a finite mixture model in which component densities conform to the location model. In the graphical models literature the location model is known as the homogeneous Conditional Gaussian model. In this paper it is shown that their model is not identifiable without imposing additional restrictions. Specifically, for g groups and m locations, (g!)m–1 distinct sets of parameter values (not including permutations of the group mixing parameters) produce the same likelihood function. Excessive shrinkage of parameter estimates in a simulation experiment reported by Lawrence and Krzanowski (1996) is shown to be an artifact of the model's non-identifiability. Identifiable finite mixture models can be obtained by imposing restrictions on the conditional means of the continuous variables. These new identified models are assessed in simulation experiments. The conditional mean structure of the continuous variables in the restricted location mixture models is similar to that in the underlying variable mixture models proposed by Everitt (1988), but the restricted location mixture models are more computationally tractable.     

Modelling Variability in the Branching Structure of Strawberry Inflorescences

The branching structure of inflorescences of the cultivated strawberry ( Fragaria × ananassa Duch.) is very variable. This paper demonstrates that some aspects of this variability are well described by a simple stochastic model of branching that has two adjustable parameters. The model is shown to provide a good fit to data from a set of almost 700 inflorescences of the cultivar Elsanta, collected over two successive years. For one parameter the maximum likelihood estimator is a moment estimator which is fully efficient even if the detailed branching structure of the inflorescences is not recorded. This parameter provides a convenient summary of branching vigour. The maximum likelihood estimator of the second parameter must be determined iteratively and can be quite inefficient unless the full branching structure is recorded. The model demonstrates that branching structure is affected by the order in which inflorescences emerge on the plant.     

Book Reviews

Books reviewed:
David Griffiths, W. Douglas Stirling, and K. Laurence Weldon, Understanding Data: Principles and Practice of Statistics
Ingwer Borg and Patrick Groenen, Modern Multidimensional Scaling: Theory and Applications
Jeffrey H. Dorfman, Bayesian Economics Through Numerical Methods: A Guide to Econometrics and Decision-making with Prior Information
Marek Musiela and Marek Rutkowski, Martingale Methods in Financial Modelling: Theory and Applications
Aad W. van der Vaart and Jon A. Wellner, Weak Convergence and Empirical Processes     

货物运输车辆的调度算法

本文以上海煤炭公司为例,讨论了运煤车辆的计算机调度问题,提出一个数学模型及有效的近似算法。在算法实现中,采用了一些较为先进的数据结构,使运算速度及存储需求均有较大的改善。对实际算例计算结果表明,采用本算法进行运输车辆调度,经济效益比人工调度有明显的提高。