Demo Data from EDBT 2026 / reviewers in the wild / expert
Satvik Mehul Mashkaria
dblp:322/9281
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021
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 · 64% Generative modeling · 32% Deep learning architectures and training · 5% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
black-box optimization |
1.3 | 2 | 2023 | Generative Pretraining for Black-Box Optimization · ICML 2023 Diffusion Models for Black-Box Optimization · ICML 2023 |
Machine learning › Generative modeling
autoregressive model |
0.7 | 1 | 2023 | Generative Pretraining for Black-Box Optimization · ICML 2023 |
Machine learning › Generative modeling
diffusion model |
0.7 | 1 | 2023 | Diffusion Models for Black-Box Optimization · ICML 2023 |
Machine learning › Optimization for machine learning › black-box optimization
offline black-box optimization |
0.7 | 1 | 2023 | Diffusion Models for Black-Box Optimization · ICML 2023 |
Machine learning › Optimization for machine learning › model-based optimization
offline model-based optimization |
0.7 | 1 | 2023 | Generative Pretraining for Black-Box Optimization · ICML 2023 |
Machine learning › Deep learning architectures and training
transformer |
0.2 | 1 | 2023 | Generative Pretraining for Black-Box Optimization · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
trajectory sampling · 0.7diffusion model · 0.7conditional generative modeling · 0.7classifier-free guidance · 0.7causally masked transformer · 0.7autoregressive modeling · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Diffusion Models for Black-Box OptimizationabstractThe goal of offline black-box optimization (BBO) is to optimize an expensive black-box function using a fixed dataset of function evaluations. Prior works consider forward approaches that learn surrogates to the black-box function and inverse approaches that directly map function values to corresponding points in the input domain of the black-box function. These approaches are limited by the quality of the offline dataset and the difficulty in learning one-to-many mappings in high dimensions, respectively. We propose Denoising Diffusion Optimization Models (DDOM), a new inverse approach for offline black-box optimization based on diffusion models. Given an offline dataset, DDOM learns a conditional generative model over the domain of the black-box function conditioned on the function values. We investigate several design choices in DDOM, such as reweighting the dataset to focus on high function values and the use of classifier-free guidance at test-time to enable generalization to function values that can even exceed the dataset maxima. Empirically, we conduct experiments on the Design-Bench benchmark (Trabucco et al., 2022) and show that DDOM achieves results competitive with state-of-the-art baselines. Siddarth Krishnamoorthy, Satvik Mehul Mashkaria, Aditya Grover |
ICML | 2 |
| 2023 | Generative Pretraining for Black-Box OptimizationabstractMany problems in science and engineering involve optimizing an expensive black-box function over a high-dimensional space. In the offline model-based optimization (MBO) setting, we assume access to a fixed, offline dataset for pretraining and a small budget for online function evaluations. Prior approaches seek to utilize the offline data to approximate the function or its inverse but are not sufficiently accurate far from the data distribution. We propose BONET, a generative framework for pretraining a novel model-based optimizer using offline datasets. In BONET, we train an autoregressive model on fixed-length trajectories derived from an offline dataset. We design a sampling strategy to synthesize trajectories from offline data using a simple heuristic of rolling out monotonic transitions from low-fidelity to high-fidelity samples. Empirically, we instantiate BONET using a causally masked Transformer (Radford et al., 2019) and evaluate it on Design-Bench (Trabucco et al., 2022), where we rank the best on average, outperforming state-of-the-art baselines. Satvik Mehul Mashkaria, Siddarth Krishnamoorthy, Aditya Grover |
ICML | 1 |