Skip to main content

Advertisement

Log in

How Online Learning Approaches Ornstein Uhlenbeck Processes

  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

We show that under reasonable conditions, online learning near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that the parameter state oscillates randomly around the minimum point, with a Gaussian limiting distribution. We also develop a simple hypothesis test that detects Ornstein Uhlenbeck properties without storing the history of the learning process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Hassoun, M. H.: Fundamentals of Artificial Neural Networks. MIT Press, 1995

  2. B. Widrow M. E. Hoff (1960) ArticleTitleAdaptive switching circuits IRE WESCON Convention Record 4 94–104

    Google Scholar 

  3. Ripley, B. D.: Pattern Recognition and Neural Networks. Cambridge University Press, 1996.

  4. G. Tesauro (1992) ArticleTitlePractical issues in temporal difference learning Machine Learning 8 257–277 Occurrence Handle0772.68075

    MATH  Google Scholar 

  5. Hastie T., Tibshirani R., Friedman J.: The Elements of Statistical Learning. Springer, 2001.

  6. Øksendal, B.: Stochastic Differential Equations, an Introduction with Applications. Springer, 1998.

  7. S. Schach (1971) ArticleTitleWeak convergence results for a class of multivariate markov processes The Annals of Mathematical Statistics 42 IssueID2 451–465 Occurrence Handle0215.53403 Occurrence Handle45 #4507

    MATH  MathSciNet  Google Scholar 

  8. Protter P.: Stochastic Integration and Differential Equations, a New Approach. Springer, 1990

  9. I. I. Gikhman A. V. Skorokhod (1969) Introduction to the Theory of Stochastic Processes Saunders Philadelphia

    Google Scholar 

  10. H.J. Kushner (1974) ArticleTitleOn the weak convergence of interpolated Markov chains to a diffusion The Annals of Probability 2 IssueID1 40–50 Occurrence Handle0285.60064 Occurrence Handle50 #14869

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fredrik A. Dahl.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dahl, F.A. How Online Learning Approaches Ornstein Uhlenbeck Processes. Neural Process Lett 23, 121–131 (2006). https://doi.org/10.1007/s11063-005-3669-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11063-005-3669-5

Keywords

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy