Demo Data from SIGIR 2026 / reviewers in the wild / expert
David Rubin de Celis Leal
dblp:227/2767
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers |
Optimization for machine learning · 58% Probabilistic and Bayesian machine learning · 35% Deep learning architectures and training · 6% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 7 heaviest of 8, 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 |
0.7 | 2 | 2019 | Bayesian Functional Optimisation with Shape Prior · AAAI 2019 Accelerating Experimental Design by Incorporating Experimenter Hunches · ICDM 2018 |
Machine learning › Optimization for machine learning › optimization
functional optimization |
0.4 | 1 | 2019 | Bayesian Functional Optimisation with Shape Prior · AAAI 2019 |
Mathematical optimization
bayesian optimization |
0.4 | 1 | 2019 | Bayesian Functional Optimisation with Shape Prior · AAAI 2019 |
Mathematical optimization
black-box optimization |
0.4 | 1 | 2019 | Bayesian Functional Optimisation with Shape Prior · AAAI 2019 |
Machine learning › Probabilistic and Bayesian machine learning
experimental design |
0.3 | 1 | 2018 | Accelerating Experimental Design by Incorporating Experimenter Hunches · ICDM 2018 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process |
0.3 | 1 | 2018 | Accelerating Experimental Design by Incorporating Experimenter Hunches · ICDM 2018 |
Computational science and engineering › materials science
materials design |
0.1 | 1 | 2018 | Accelerating Experimental Design by Incorporating Experimenter Hunches · ICDM 2018 |
Methods — techniques the papers use, named apart from their topics
gaussian process · 1.4shape prior · 0.8bernstein polynomial basis · 0.8two-stage modeling · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Bayesian Functional Optimisation with Shape PriorabstractReal world experiments are expensive, and thus it is important to reach a target in a minimum number of experiments. Experimental processes often involve control variables that change over time. Such problems can be formulated as functional optimisation problem. We develop a novel Bayesian optimisation framework for such functional optimisation of expensive black-box processes. We represent the control function using Bernstein polynomial basis and optimise in the coefficient space. We derive the theory and practice required to dynamically adjust the order of the polynomial degree, and show how prior information about shape can be integrated. We demonstrate the effectiveness of our approach for short polymer fibre design and optimising learning rate schedules for deep networks. Pratibha Vellanki, Santu Rana, Sunil Gupta 0001, David Rubin de Celis Leal, Alessandra Sutti, Murray Height, Svetha Venkatesh |
AAAI | 4 |
| 2018 | Accelerating Experimental Design by Incorporating Experimenter HunchesabstractExperimental design is a process of obtaining a product with target property via experimentation. Bayesian optimization offers a sample-efficient tool for experimental design when experiments are expensive. Often, expert experimenters have 'hunches' about the behavior of the experimental system, offering potentials to further improve the efficiency. In this paper, we consider per-variable monotonic trend in the underlying property that results in a unimodal trend in those variables for a target value optimization. For example, sweetness of a candy is monotonic to the sugar content. However, to obtain a target sweetness, the utility of the sugar content becomes a unimodal function, which peaks at the value giving the target sweetness and falls off both ways. In this paper, we propose a novel method to solve such problems that achieves two main objectives: (a) the monotonicity information is used to the fullest extent possible, whilst ensuring that (b) the convergence guarantee remains intact. This is achieved by a two-stage Gaussian process modeling, where the first stage uses the monotonicity trend to model the underlying property, and the second stage uses 'virtual' samples, sampled from the first, to model the target value optimization function. The process is made theoretically consistent by adding appropriate adjustment factor in the posterior computation, necessitated because of using the 'virtual' samples. The proposed method is evaluated through both simulations and real world experimental design problems of (a) new short polymer fiber with the target length, and (b) designing of a new three dimensional porous scaffolding with a target porosity. In all scenarios our method demonstrates faster convergence than the basic Bayesian optimization approach not using such 'hunches'. Cheng Li 0003, Santu Rana, Sunil Gupta 0001, Vu Nguyen 0001, Svetha Venkatesh, Alessandra Sutti, David Rubin de Celis Leal, Teo Slezak, Murray Height, Mazher Mohammed, Ian Gibson |
ICDM | 7 |