Conservative objective models are a special kind of contrastive divergence-based energy model
Not on the map. Why?
Abstract (arXiv)
In this work we theoretically show that conservative objective models (COMs) for offline model-based optimisation (MBO) are a special kind of contrastive divergence-based energy model, one where the energy function represents both the unconditional probability of the input and the conditional probability of the reward variable. While the initial formulation only samples modes from its learned distribution, we propose a simple fix that replaces its gradient ascent sampler with a Langevin MCMC sampler. This gives rise to a special probabilistic model where the probability of sampling an input is proportional to its predicted reward. Lastly, we show that better samples can be obtained if the model is decoupled so that the unconditional and conditional probabilities are modelled separately.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 24 references that are in the map. First posted on arXiv 7 Apr 2023.
Builds on
14 of 24 references.
References · 14
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,255
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
- 2022Classifier-Free Diffusion Guidancecited by 5,847
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
- 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
- 2021How to Train Your Energy-Based Modelscited by 274
- 2019Conditioning by adaptive sampling for robust designcited by 111
- 2021Conservative Objective Models for Effective Offline Model-Based Optimizationcited by 88
- 2019Model Inversion Networks for Model-Based Optimizationcited by 83
- 2020Autofocused oracles for model-based designcited by 50
2 more
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.