High Confidence Sets for Trajectories of Stochastic Time-Varying Nonlinear Systems

We analyze stochastic differential equations and their discretizations to derive novel high probability tracking bounds for exponentially stable time varying systems which are corrupted by process noise. The bounds have an explicit dependence on the rate of convergence for the unperturbed system and the dimension of the state space. The magnitude of the stochastic deviations have a simple intuitive form, and our perturbation bounds also allow us to derive tighter high probability bounds on the tracking of reference trajectories than the state of the art. The resulting bounds can be used in analyzing many tracking control schemes.

[1]  H. Kushner,et al.  Asymptotic Properties of Stochastic Approximations with Constant Coefficients. , 1981 .

[2]  A. Benveniste,et al.  A measure of the tracking capability of recursive stochastic algorithms with constant gains , 1982 .

[3]  G. Pflug.  Stochastic minimization with constant step-size: asymptotic laws , 1986 .

[4]  G. Roberts,et al.  Langevin Diffusions and Metropolis-Hastings Algorithms , 2002 .

[5]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[6]  Yaofeng Ren.  On the Burkholder-Davis-Gundy inequalities for continuous martingales , 2008 .

[7]  V. Borkar.  Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

[8]  Hong-ke Wang,et al.  On the Exponential Stability of Stochastic Differential Equations , 2009, ICFIE.

[9]  P. Olver.  Nonlinear Systems , 2013 .

[10]  É. Moulines,et al.  Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm , 2015, 1507.05021.

[11]  É. Moulines,et al.  Sampling from a strongly log-concave distribution with the Unadjusted Langevin Algorithm , 2016 .

[12]  F. Bach,et al.  Bridging the gap between constant step size stochastic gradient descent and Markov chains , 2017, The Annals of Statistics.

[13]  Mo Chen,et al.  FaSTrack: A modular framework for fast and guaranteed safe motion planning , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[14]  Csaba Szepesvári,et al.  Linear Stochastic Approximation: How Far Does Constant Step-Size and Iterate Averaging Go? , 2018, AISTATS.

[15]  Arnak S. Dalalyan,et al.  On sampling from a log-concave density using kinetic Langevin diffusions , 2018, Bernoulli.

[16]  R. Srikant,et al.  Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learning , 2019, COLT.

[17]  Martin J. Wainwright,et al.  An Efficient Sampling Algorithm for Non-smooth Composite Potentials , 2019, J. Mach. Learn. Res..

[18]  Akhil Shetty,et al.  Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents , 2018, Mathematics of Control, Signals, and Systems.

[19]  Michael I. Jordan,et al.  A Diffusion Process Perspective on Posterior Contraction Rates for Parameters , 2019, 1909.00966.

[20]  Michael I. Jordan,et al.  A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm , 2019, ArXiv.

[21]  Michael I. Jordan,et al.  On Thompson Sampling with Langevin Algorithms , 2020, ICML 2020.