Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Esther Wang

dblp:56/7056 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 50% Optimization for machine learning · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.112009
Active learning for directed exploration of complex systems · ICML 2009
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
surrogate model
0.112009
Active learning for directed exploration of complex systems · ICML 2009
Computational science and engineering › engineering design
simulation-based design
0.112009
Active learning for directed exploration of complex systems · ICML 2009
Computational science and engineering
parameter space exploration
0.012009
Active learning for directed exploration of complex systems · ICML 2009
Computational science and engineering › computational physics
physics simulation
0.012009
Active learning for directed exploration of complex systems · ICML 2009

Methods — techniques the papers use, named apart from their topics

support vector machine · 0.2kernel density estimation · 0.2information-theoretic active learning · 0.2gaussian process · 0.2
YearPublicationVenuePosition
2009 Active learning for directed exploration of complex systems
abstract
Physics-based simulation codes are widely used in science and engineering to model complex systems that would be infeasible to study otherwise. Such codes provide the highest-fidelity representation of system behavior, but are often so slow to run that insight into the system is limited. For example, conducting an exhaustive sweep over a d-dimensional input parameter space with k-steps along each dimension requires kd simulation trials (translating into kd CPU-days for one of our current simulations). An alternative is directed exploration in which the next simulation trials are cleverly chosen at each step. Given the results of previous trials, supervised learning techniques (SVM, KDE, GP) are applied to build up simplified predictive models of system behavior. These models are then used within an active learning framework to identify the most valuable trials to run next. Several active learning strategies are examined including a recently-proposed information-theoretic approach. Performance is evaluated on a set of thirteen synthetic oracles, which serve as surrogates for the more expensive simulations and enable the experiments to be replicated by other researchers.
Michael C. Burl, Esther Wang
ICML2