Demo Data from SIGIR 2026 / reviewers in the wild / expert
David Rubin
dblp:199/7419
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2
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 |
Optimization for machine learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
batch bayesian optimization |
0.3 | 1 | 2017 | Process-constrained batch Bayesian optimisation · NIPS 2017 |
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization |
0.3 | 1 | 2017 | Process-constrained batch Bayesian optimisation · NIPS 2017 |
Methods — techniques the papers use, named apart from their topics
regret analysis · 0.3gaussian process · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Accelerated Bayesian Optimisation through Weight-Prior TuningabstractBayesian optimization (BO) is a widely-used method for optimizing expensive (to evaluate) problems. At the core of most BO methods is the modeling of the objective function using a Gaussian Process (GP) whose covariance is selected from a set of standard covariance functions. From a weight-space view, this models the objective as a linear function in a feature space implied by the given covariance $K$, with an arbitrary Gaussian weight prior ${\bf w} \sim ormdist ({\bf 0},{\bf I})$. In many practical applications there is data available that has a similar (covariance) structure to the objective, but which, having different form, cannot be used directly in standard transfer learning. In this paper we show how such auxiliary data may be used to construct a GP covariance corresponding to a more appropriate weight prior for the objective function. Building on this, we show that we may accelerate BO by modeling the objective function using this (learned) weight prior, which we demonstrate on both test functions and a practical application to short-polymer fibre manufacture. Alistair Shilton, Sunil Gupta 0001, Santu Rana, Pratibha Vellanki, Cheng Li 0003, Svetha Venkatesh, Laurence Anthony F. Park, Alessandra Sutti, David Rubin, Thomas Dorin, Alireza Vahid, Murray Height, Teo Slezak |
AISTATS | 9 |
| 2017 | Process-constrained batch Bayesian optimisationabstractAbstract Prevailing batch Bayesian optimisation methods allow all control variables to be freely altered at each iteration. Real-world experiments, however, often have physical limitations making it time-consuming to alter all settings for each recommendation in a batch. This gives rise to a unique problem in BO: in a recommended batch, a set of variables that are expensive to experimentally change need to be fixed, while the remaining control variables can be varied. We formulate this as a process-constrained batch Bayesian optimisation problem. We propose two algorithms, pc-BO(basic) and pc-BO(nested). pc-BO(basic) is simpler but lacks convergence guarantee. In contrast pc-BO(nested) is slightly more complex, but admits convergence analysis. We show that the regret of pc-BO(nested) is sublinear. We demonstrate the performance of both pc-BO(basic) and pc-BO(nested) by optimising benchmark test functions, tuning hyper-parameters of the SVM classifier, optimising the heat-treatment process for an Al-Sc alloy to achieve target hardness, and optimising the short polymer fibre production process. Pratibha Vellanki, Santu Rana, Sunil Gupta 0001, David Rubin, Alessandra Sutti, Thomas Dorin, Murray Height, Paul G. Sanders, Svetha Venkatesh |
NIPS | 4 |