mlsanityData to 7 Oct 2026

Stochastic Multiple Target Sampling Gradient Descent

arXiv 2206.01934 ↗First posted 4 Jun 2022cs.LG cs.AI stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Sampling from an unnormalized target distribution is an essential problem with many applications in probabilistic inference. Stein Variational Gradient Descent (SVGD) has been shown to be a powerful method that iteratively updates a set of particles to approximate the distribution of interest. Furthermore, when analysing its asymptotic properties, SVGD reduces exactly to a single-objective optimization problem and can be viewed as a probabilistic version of this single-objective optimization problem. A natural question then arises: "Can we derive a probabilistic version of the multi-objective optimization?". To answer this question, we propose Stochastic Multiple Target Sampling Gradient Descent (MT-SGD), enabling us to sample from multiple unnormalized target distributions. Specifically, our MT-SGD conducts a flow of intermediate distributions gradually orienting to multiple target distributions, which allows the sampled particles to move to the joint high-likelihood region of the target distributions. Interestingly, the asymptotic analysis shows that our approach reduces exactly to the multiple-gradient descent algorithm for multi-objective optimization, as expected. Finally, we conduct comprehensive experiments to demonstrate the merit of our approach to multi-task learning.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 16 of its 42 references that are in the map. First posted on arXiv 4 Jun 2022.

Builds on

16 of 42 references.

References · 16

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  5. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,345
  6. 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
  7. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
  8. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  9. 2017Dynamic Routing Between Capsulescited by 689
  10. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  11. 2019Pareto Multi-Task Learningcited by 224
  12. 2020Learning the Pareto Front with Hypernetworkscited by 122
4 more
  1. 2021Pareto Self-Supervised Training for Few-Shot Learningcited by 52
  2. 2021Multi-Objective Meta Learningcited by 39
  3. 2021A Modest Pareto Optimisation Analysis of Dependency Parsers in 2021cited by 9
  4. 2021Adaptive Distillation: Aggregating Knowledge from Multiple Paths for Efficient Distillationcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 7; 2025: 3; 2026: 1.

14 papers.

Sort:

By area: