Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization
Hedda Cohen Indelman, Tamir Hazan
Abstract
Direct loss minimization is a popular approach for learning predictors over structured label spaces. This approach is computationally appealing as it replaces integration with optimization and allows to propagate gradients in a deep net using loss-perturbed prediction. Recently, this technique was extended to generative models, while introducing a randomized predictor that samples a structure from a randomly perturbed score function. In this work, we learn the variance of these randomized structured predictors and show that it balances better between the learned score function and the randomized noise in structured prediction. We demonstrate empirically the effectiveness of learning the balance between the signal and the random noise in structured discrete spaces.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Layer Collaboration in the Forward-Forward AlgorithmGuy Lorberbom, Itai Gat, Yossi Adi, Alexander G. Schwing et al.AAAI 2024 · 22 citations
- Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable ApproachAhmed Abbas, Paul SwobodaNeurIPS 2021 · 16 citations
- Indirectly Parameterized Concrete AutoencodersAlfred Nilsson, Klas Wijk, Sai Bharath Chandra Gutha, Erik Englesson et al.ICML 2024 · 4 citations
Builds on5
- Hierarchical Generation of Molecular Graphs using Structural MotifsWengong Jin, Regina Barzilay, Tommi S. JaakkolaICML 2020 · 356 citations
- Differentiation of Blackbox Combinatorial SolversMarin Vlastelica Pogancic, Anselm Paulus, Vít Musil, Georg Martius et al.ICLR 2020 · 341 citations
- Fast Differentiable Sorting and RankingMathieu Blondel, Olivier Teboul, Quentin Berthet, Josip DjolongaICML 2020 · 285 citations
- Gradient Estimation with Stochastic Softmax TricksMax B. Paulus, Dami Choi, Daniel Tarlow, Andreas Krause et al.NeurIPS 2020 · 104 citations
- Direct Policy Gradients: Direct Optimization of Policies in Discrete Action SpacesGuy Lorberbom, Chris J. Maddison, Nicolas Heess, Tamir Hazan et al.NeurIPS 2020 · 8 citations
Related papers
- Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial SpacesKirill Struminsky, Artyom Gadetsky, Denis Rakitin, Danil Karpushkin et al.NeurIPS 2021 · 11 citations
- Low-Variance Black-Box Gradient Estimates for the Plackett-Luce DistributionArtyom Gadetsky, Kirill Struminsky, Christopher Robinson, Novi Quadrianto et al.AAAI 2020 · 11 citations
- Training Discrete Deep Generative Models via Gapped Straight-Through EstimatorTing-Han Fan, Ta-Chung Chi, Alexander I. Rudnicky, Peter J. RamadgeICML 2022 · 9 citations
- Estimating Gradients for Discrete Random Variables by Sampling without ReplacementWouter Kool, Herke van Hoof, Max WellingICLR 2020 · 59 citations
- Unbiased learning of deep generative models with structured discrete representationsHenry C. Bendekgey, Gabe Hope, Erik B. SudderthNeurIPS 2023 · 2 citations
