Removing noise in on-line search using adaptive batch sizes

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 232-238

  Orr, Genevieve B ^a  

^a WILLAMETTE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; STOCHASTIC SYSTEMS;

BATCH LEARNING; BATCH SIZES; CONVERGENCE RATES; LEARNING RATES; MEAN SQUARE; RATE OF CONVERGENCE; REMOVING NOISE; WEIGHT UPDATE;

SCHEDULING ALGORITHMS;

EID: 57949092133     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Larry Goldstein. Mean square optimality in the continuous time Robbing Monro procedure. Technical Report DRB-306, Dept. of Mathematics, University of Southern California, LA, 1987.
2. Simon Haykin. Adaptive Filter Theory. Prentice Hall, New Jersey, 1991.
3. Todd K. Leen and Genevieve B. Orr. Momentum and optimal stochastic search. In Advances in Neural Information Processing Systems, vol. 6, 1993. to appear.
4. Martin Moller. Supervised learning on large redundant training sets. International Journal of Neural Systems, 4(l):15-25, 1993.
5. Genevieve B. Orr. Dynamics and Algorithms for Stochastic learning. PhD thesis, Oregon Graduate Institute, 1995.
6. Mark Plutowski and Halbert White. Selecting concise training sets from clean data. IEEE Transactions on Neural Networks, 4:305-318, 1993.