Learning Energy Networks with Generalized Fenchel-Young Losses
Not on the map. Why?
Abstract (arXiv)
Energy-based models, a.k.a. energy networks, perform inference by optimizing an energy function, typically parametrized by a neural network. This allows one to capture potentially complex relationships between inputs and outputs. To learn the parameters of the energy function, the solution to that optimization problem is typically fed into a loss function. The key challenge for training energy networks lies in computing loss gradients, as this typically requires argmin/argmax differentiation. In this paper, building upon a generalized notion of conjugate function, which replaces the usual bilinear pairing with a general energy function, we propose generalized Fenchel-Young losses, a natural loss construction for learning energy networks. Our losses enjoy many desirable properties and their gradients can be computed efficiently without argmin/argmax differentiation. We also prove the calibration of their excess risk in the case of linear-concave energies. We demonstrate our losses on multilabel classification and imitation learning tasks.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 27 of its 87 references that are in the map. First posted on arXiv 19 May 2022.
Builds on
27 of 87 references.
References · 27
- 2021Convex optimizationcited by 2,479
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2016Input Convex Neural Networkscited by 407
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
- 2021How to Train Your Energy-Based Modelscited by 271
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 266
- 2018Approximation Methods for Bilevel Programmingcited by 231
- 2021Efficient and Modular Implicit Differentiationcited by 199
- 2013Maxout Networkscited by 186
- 2020Primal Wasserstein Imitation Learningcited by 120
- 2019Learning with Fenchel-Young Lossescited by 117
15 more
- 2021What Matters for Adversarial Imitation Learning?cited by 70
- 2020No MCMC for me: Amortized sampling for fast and stable training of energy-based modelscited by 64
- 2018SparseMAP: Differentiable Sparse Structured Inferencecited by 62
- 2015Structured Prediction Energy Networkscited by 59
- 2018On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradientcited by 42
- 2016A Consistent Regularization Approach for Structured Predictioncited by 33
- 2017End-to-End Learning for Structured Prediction Energy Networkscited by 33
- 2020Super-efficiency of automatic differentiation for functions defined as a minimumcited by 24
- 2017On Structured Prediction Theory with Calibrated Convex Surrogate Lossescited by 23
- 2019Autoregressive Energy Machinescited by 23
- 2019Structured Prediction with Projection Oraclescited by 21
- 2019A General Theory for Structured Prediction with Smooth Convex Surrogatescited by 14
- 2015Barrier Frank-Wolfe for Marginal Inferencecited by 10
- 2017Geometrical Insights for Implicit Generative Modelingcited by 7
- 2018Fenchel-Moreau Conjugation Inequalities with Three Couplings and Application to Stochastic Bellman Equationcited by 1
Built on by
Citing papers per year: 2024: 3; 2025: 4; 2026: 1.
8 papers.
- 2024Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problemscited by 7
- 2024LPGD: A General Framework for Backpropagation through Embedded Optimization Layerscited by 6
- 2024Learning with Fitzpatrick Lossescited by 3
- 2025Joint Learning of Energy-based Models and their Partition Functioncited by 3
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
- 2025A Fenchel-Young Loss Approach to Data-Driven Inverse Optimizationcited by 0
- 2025Non-Stationary Online Structured Prediction with Surrogate Lossescited by 0
- 2026Analyzing and Improving Diffusion Models for Time-Series Data Imputation: A Proximal Recursion Perspectivecited by 0
- 2026Analyzing and Improving Diffusion Models for Time-Series Data Imputation: A Proximal Recursion Perspective1 Feb 2026
- 2025Non-Stationary Online Structured Prediction with Surrogate Losses8 Oct 2025
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses14 May 2025
- 2025A Fenchel-Young Loss Approach to Data-Driven Inverse Optimization22 Feb 2025
- 2025Joint Learning of Energy-based Models and their Partition Function30 Jan 2025
- 2024LPGD: A General Framework for Backpropagation through Embedded Optimization Layers8 Jul 2024
- 2024Learning with Fitzpatrick Losses23 May 2024
- 2024Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems5 Mar 2024
Similar, not cited
Close in wording, no citation either way
- 2025Energy-Based Transformers are Scalable Learners and Thinkers
- 2024Transformers from Diffusion: A Unified Framework for Neural Message Passing
- 2026Manifold-Constrained Energy-Based Transition Models for Offline Reinforcement Learning
- 2023Revisiting Energy Based Models as Policies: Ranking Noise Contrastive Estimation and Interpolating Energy Models
- 2025Generalizable Reasoning through Compositional Energy Minimization
- 2025Learning normalized image densities via dual score matching
- 2025Analytic Energy-Guided Policy Optimization for Offline Reinforcement Learning
- 2026Reasoning as Energy Minimization over Structured Latent Trajectories