Performance analysis of the AM-SG parameter estimation for multivariable systems

The auxiliary model based stochastic gradient (AM-SG) parameter estimation method is an important identification one. This paper analyzes the performances of the AM-SG estimation algorithm for multiple-input single-output systems (i.e., multivariable systems) under the strong persistent excitation condition. The analysis and simulation results indicate that the parameter estimation errors converge to zero.     

Multi-innovation stochastic gradient algorithm for multiple-input single-output systems using the auxiliary model

In order to reduce computational burden and improve the convergence rate of identification algorithms, an auxiliary model based multi-innovation stochastic gradient (AM-MISG) algorithm is derived for the multiple-input single-output systems by means of the auxiliary model identification idea and multi-innovation identification theory. The basic idea is to replace the unknown outputs of the fictitious subsystems in the information vector with the outputs of the auxiliary models and to present an auxiliary model based stochastic gradient algorithm, and then to derive the AM-MISG algorithm by expanding the scalar innovation to innovation vector and introducing the innovation length. The simulation example shows that the proposed algorithms work quite well.     

经济时间序列的连续参数小波网络预测模型

本文利用连续小波变换方法,给出一种连续参数小波网络。网络参数的学习采用一种类似神经网络的后向传播学习算法的随机梯度算法。另外,提出了一种借助小波分析理论指导网络参数赋初值的方法。进一步,通过对中国进出口贸易额时间序列预测建模的研究和仿真预测,提出了用连续参数小波网络建立经济时间序列预测模型的一般步骤和方法。预测结果表明,此模型具有较好的泛化、学习能力,可以有效地在数值上逼近时间序列难以定量描述的相互关系,所以利用连续参数小波网络建立的时间序列预测模型有较高的预测精度。     

Stochastic gradient with changing forgetting factor-based parameter identification for Wiener systems

The parameter estimation problem is considered for a class Wiener systems. First, the effect of the forgetting factor on the stochastic gradient algorithm is analyzed. Then, a Wiener system stochastic gradient with a changing forgetting factor algorithm is presented which makes full use of the forgetting factor. Finally, an example is provided to test and verify the effectiveness of the proposed algorithms.     

Two-stage least squares based iterative estimation algorithm for CARARMA system modeling

For stochastic systems described by the controlled autoregressive autoregressive moving average (CARARMA) models, a new-type two-stage least squares based iterative algorithm is proposed for identifying the system model parameters and the noise model parameters. The basic idea is based on the interactive estimation theory and to estimate the parameter vectors of the system model and the noise model, respectively. The simulation results indicate that the proposed algorithm is effective.     

求解阵列天线自适应滤波问题的一种调比随机逼近算法

提出了求解阵列天线自适应滤波问题的一种调比随机逼近算法.每一步迭代中,算法选取调比的带噪负梯度方向作为新的迭代方向.相比已有的其他随机逼近算法,这个算法不需要调整稳定性常数,在一定程度上解决了稳定性常数选取难的问题.数值仿真实验表明,算法优于已有的滤波算法,且比经典Robbins-Monro （RM）算法具有更好的稳定性.     

Liquidity Costs: A New Numerical Methodology and an Empirical Study

We consider rate swaps which pay a fixed rate against a floating rate in the presence of bid-ask spread costs. Even for simple models of bid-ask spread costs, there is no explicit strategy optimizing an expected function of the hedging error. We here propose an efficient algorithm based on the stochastic gradient method to compute an approximate optimal strategy without solving a stochastic control problem. We validate our algorithm by numerical experiments. We also develop several variants of the algorithm and discuss their performances in terms of the numerical parameters and the liquidity cost.     

Parameter estimation in stochastic differential equations with Markov chain Monte Carlo and non-linear Kalman filtering

This paper is concerned with parameter estimation in linear and non-linear Itô type stochastic differential equations using Markov chain Monte Carlo (MCMC) methods. The MCMC methods studied in this paper are the Metropolis–Hastings and Hamiltonian Monte Carlo (HMC) algorithms. In these kind of models, the computation of the energy function gradient needed by HMC and gradient based optimization methods is non-trivial, and here we show how the gradient can be computed with a linear or non-linear Kalman filter-like recursion. We shall also show how in the linear case the differential equations in the gradient recursion equations can be solved using the matrix fraction decomposition. Numerical results for simulated examples are presented and discussed in detail.     

Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models

We present a stochastic trust-region model-based framework in which its radius is related to the probabilistic models. Especially, we propose a specific algorithm termed STRME, in which the trust-region radius depends linearly on the gradient used to define the latest model. The complexity results of the STRME method in nonconvex, convex and strongly convex settings are presented, which match those of the existing algorithms based on probabilistic properties. In addition, several numerical experiments are carried out to reveal the benefits of the proposed methods compared to the existing stochastic trust-region methods and other relevant stochastic gradient methods.     

A sparsity preserving stochastic gradient methods for sparse regression

We propose a new stochastic first-order algorithm for solving sparse regression problems. In each iteration, our algorithm utilizes a stochastic oracle of the subgradient of the objective function. Our algorithm is based on a stochastic version of the estimate sequence technique introduced by Nesterov (Introductory lectures on convex optimization: a basic course, Kluwer, Amsterdam, 2003). The convergence rate of our algorithm depends continuously on the noise level of the gradient. In particular, in the limiting case of noiseless gradient, the convergence rate of our algorithm is the same as that of optimal deterministic gradient algorithms. We also establish some large deviation properties of our algorithm. Unlike existing stochastic gradient methods with optimal convergence rates, our algorithm has the advantage of readily enforcing sparsity at all iterations, which is a critical property for applications of sparse regressions.     

Identification of ground water flow patterns using particle models

Particle models are often used to simulate transport processes in ground water. The ground water flow pattern is one of the driving parameters of the transport model. In this paper a parameter identification algorithm is developed for particle type models to identify the underlying flow pattern from concentration measurements. The estimation problem is solved with a gradient based algorithm. For each generated particle track, the adjoint track is determined to efficiently compute gradient of the criterion.     

Stochastic Accelerated Alternating Direction Method of Multipliers with Importance Sampling

In this paper, we incorporate importance sampling strategy into accelerated framework of stochastic alternating direction method of multipliers for solving a class of stochastic composite problems with linear equality constraint. The rates of convergence for primal residual and feasibility violation are established. Moreover, the estimation of variance of stochastic gradient is improved due to the use of important sampling. The proposed algorithm is capable of dealing with the situation, where the feasible set is unbounded. The experimental results indicate the effectiveness of the proposed method.     

A hybrid optimization approach for automated parameter estimation problems

We present a hybrid optimization approach for solving automated parameter estimation models. The hybrid approach is based on the coupling of the Simultaneous Perturbation Stochastic Approximation (SPSA) [1] and a Newton-Krylov Interior-Point method (NKIP) [2] via a surrogate model. The global method SPSA performs a stochastic search to find target regions with low function values. Next, we generate a surrogate model based on the points of regions on which the local method NKIP algorithm is applied for finding an optimal solution. We illustrate the behavior of the hybrid optimization algorithm on one testcase. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

随机梯度下降法的收敛速度(英文)

本文研究了正则化格式下随机梯度下降法的收敛速度.利用线性迭代的方法,并通过参数选择,得到了随机梯度下降法的收敛速度.     

A combined direction stochastic approximation algorithm

The stochastic approximation problem is to find some root or minimum of a nonlinear function in the presence of noisy measurements. The classical algorithm for stochastic approximation problem is the Robbins-Monro (RM) algorithm, which uses the noisy negative gradient direction as the iterative direction. In order to accelerate the classical RM algorithm, this paper gives a new combined direction stochastic approximation algorithm which employs a weighted combination of the current noisy negative gradient and some former noisy negative gradient as iterative direction. Both the almost sure convergence and the asymptotic rate of convergence of the new algorithm are established. Numerical experiments show that the new algorithm outperforms the classical RM algorithm.     

An algorithm for approximating piecewise linear concave functions from sample gradients

An effective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and fleet management. These algorithms require the adaptive estimation of the approximations of the recourse function that maintain concavity at every iteration. In this paper, we prove convergence for a particular version of an algorithm that produces approximations from stochastic gradient information while maintaining concavity.     

Bayesian Inference via Filtering for a Class of Counting Processes: Application to the Micromovement of Asset Price

This paper highlights recent developments in a rich class of counting process models for the micromovement of asset price and in the Bayesian inference (estimation and model selection) via filtering for the class of models. A specific micromovement model built upon linear Brownian motion with jumping stochastic volatility is used to demonstrate the procedure to develop a micromovement model with specific tick-level sample characteristics. The model is further used to demonstrate the procedure to implement Bayes estimation via filtering, namely, to construct a recursive algorithm for computing the trade-by-trade Bayes parameter estimates, especially for the stochastic volatility. The consistency of the recursive algorithm model is proven. Simulation and real-data examples are provided as well as a brief example of Bayesian model selection via filtering.     

Sparse approximate solutions to stochastic Galerkin equations

In this Note, we formulate a sparse Krylov-based algorithm for solving large-scale linear systems of algebraic equations arising from the discretization of randomly parametrized (or stochastic) elliptic partial differential equations (SPDEs). We analyze the proposed sparse conjugate gradient (CG) algorithm within the framework of inexact Krylov subspace methods, prove its convergence and study its abstract computational cost. Numerical studies conducted on stochastic diffusion models show that the proposed sparse CG algorithm outperforms the classical CG method when the sought solutions admit a sparse representation in a polynomial chaos basis. In such cases, the sparse CG algorithm recovers almost exactly the sparsity pattern of the exact solutions, which enables accelerated convergence. In the case when the SPDE solution does not admit a sparse representation, the convergence of the proposed algorithm is very similar to the classical CG method.     

Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis

Discrete-event systems to which the technique of infinitesimal perturbation analysis (IPA) is applicable are natural candidates for optimization via a Robbins-Monro type stochastic approximation algorithm. We establish a simple framework for single-run optimization of systems with regenerative structure. The main idea is to convert the original problem into one in which unbiased estimators can be derived from strongly consistent IPA gradient estimators. Standard stochastic approximation results can then be applied. In particular, we consider the GI/G/1 queue, for which IPA gives strongly consistent estimators for the derivative of the mean system time. Convergence (w.p.1) proofs for the problem of minimizing the mean system time with respect to a scalar service time parameter are presented.     

Convergence properties of the least squares estimation algorithm for multivariable systems

This paper focuses on the convergence properties of the least squares parameter estimation algorithm for multivariable systems that can be parameterized into a class of multivariate linear regression models. The performance analysis of the algorithm by using the stochastic process theory and the martingale convergence theorem indicates that the parameter estimation errors converge to zero under weak conditions. The simulation results validate the proposed theorem.