A Robbins--Monro Sequence That Can Exploit Prior Information For Faster Convergence
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917560350408704 |
|---|---|
| author | Liu, Siwei Ma, Ke Goetz, Stephan M. |
| author_facet | Liu, Siwei Ma, Ke Goetz, Stephan M. |
| contents | We propose a new method to improve the convergence speed of the Robbins-Monro algorithm by introducing prior information about the target point into the Robbins-Monro iteration. We achieve the incorporation of prior information without the need of a -- potentially wrong -- regression model, which would also entail additional constraints. We show that this prior-information Robbins-Monro sequence is convergent for a wide range of prior distributions, even wrong ones, such as Gaussian, weighted sum of Gaussians, e.g., in a kernel density estimate, as well as bounded arbitrary distribution functions greater than zero. We furthermore analyse the sequence numerically to understand its performance and the influence of parameters. The results demonstrate that the prior-information Robbins-Monro sequence converges faster than the standard one, especially during the first steps, which are particularly important for applications where the number of function measurements is limited, and when the noise of observing the underlying function is large. We finally propose a rule to select the parameters of the sequence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03206 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Robbins--Monro Sequence That Can Exploit Prior Information For Faster Convergence Liu, Siwei Ma, Ke Goetz, Stephan M. Machine Learning Numerical Analysis Optimization and Control Probability Statistics Theory Methodology 62L20, 62L05, 62L10, 60G99, 60-08, 65B99, 65C99, 90C15 We propose a new method to improve the convergence speed of the Robbins-Monro algorithm by introducing prior information about the target point into the Robbins-Monro iteration. We achieve the incorporation of prior information without the need of a -- potentially wrong -- regression model, which would also entail additional constraints. We show that this prior-information Robbins-Monro sequence is convergent for a wide range of prior distributions, even wrong ones, such as Gaussian, weighted sum of Gaussians, e.g., in a kernel density estimate, as well as bounded arbitrary distribution functions greater than zero. We furthermore analyse the sequence numerically to understand its performance and the influence of parameters. The results demonstrate that the prior-information Robbins-Monro sequence converges faster than the standard one, especially during the first steps, which are particularly important for applications where the number of function measurements is limited, and when the noise of observing the underlying function is large. We finally propose a rule to select the parameters of the sequence. |
| title | A Robbins--Monro Sequence That Can Exploit Prior Information For Faster Convergence |
| topic | Machine Learning Numerical Analysis Optimization and Control Probability Statistics Theory Methodology 62L20, 62L05, 62L10, 60G99, 60-08, 65B99, 65C99, 90C15 |
| url | https://arxiv.org/abs/2401.03206 |