Name
Abstract | ||
|---|---|---|
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">We study active learning (AL) based on gaussian processes (GPs) for efficiently enumerating all of the local minimum solutions of a black-box function. This problem is challenging because local solutions are characterized by their zero gradient and positive-definite Hessian properties, but those derivatives cannot be directly observed. We propose a new AL method in which the input points are sequentially selected such that the confidence intervals of the GP derivatives are effectively updated for enumerating local minimum solutions. We theoretically analyze the proposed method and demonstrate its usefulness through numerical experiments.</para> |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1162/neco_a_01307 | Neural Computation |
DocType | Volume | Issue |
Journal | 32 | 10 |
ISSN | Citations | PageRank |
0899-7667 | 0 | 0.34 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Inatsu | 1 | 0 | 3.04 |
| Daisuke Sugita | 2 | 0 | 0.34 |
| Kazuaki Toyoura | 3 | 0 | 0.34 |
| Ichiro Takeuchi | 4 | 132 | 23.25 |