Stochastic Multiple Target Sampling Gradient Descent
Hoang Phan, Ngoc Tran, Trung Le, Toan Tran, Nhat Ho, Dinh Phung
Abstract
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.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 10d645cf-be9a-4eb0-a28e-662724fbbe42Cited by top-tier papers9
- Enhancing Domain Adaptation through Prompt Gradient AlignmentViet Hoang Phan, Tung Lam Tran, Quyen Tran, Trung LeNeurIPS 2024 · 18 citations
- Controllable Prompt Tuning For Balancing Group Distributional RobustnessHoang Phan, Andrew Gordon Wilson, Qi LeiICML 2024 · 12 citations
- FERERO: A Flexible Framework for Preference-Guided Multi-Objective LearningLisha Chen, A F M Saif, Yanning Shen, Tianyi ChenNeurIPS 2024 · 12 citations
- Diffusion Models for Multi-Task Generative ModelingChangyou Chen, Han Ding, Bunyamin Sisman, Yi Xu et al.ICLR 2024 · 11 citations
- Optimal Transport Model Distributional RobustnessVan-Anh Nguyen, Trung Le, Anh Tuan Bui, Thanh-Toan Do et al.NeurIPS 2023 · 8 citations
Builds on6
- Learning the Pareto Front with HypernetworksAviv Navon, Aviv Shamsian, Ethan Fetaya, Gal ChechikICLR 2021 · 189 citations
- Multi-Task Learning with User Preferences: Gradient Descent with Controlled Ascent in Pareto OptimizationDebabrata Mahapatra, Vaibhav RajanICML 2020 · 182 citations
- Agree to Disagree: Adaptive Ensemble Knowledge Distillation in Gradient SpaceShangchen Du, Shan You, Xiaojie Li, Jianlong Wu et al.NeurIPS 2020 · 144 citations
- Multi-Objective Meta LearningFeiyang Ye, Baijiong Lin, Zhixiong Yue, Pengxin Guo et al.NeurIPS 2021 · 71 citations
- Profiling Pareto Front With Multi-Objective Stein Variational Gradient DescentXingchao Liu, Xin Tong, Qiang LiuNeurIPS 2021 · 64 citations
Related papers
- Long-time asymptotics of noisy SVGD outside the population limitVictor Priser, Pascal Bianchi, Adil SalimICLR 2025
- Stein Variational Goal Generation for adaptive Exploration in Multi-Goal Reinforcement LearningNicolas Castanet, Olivier Sigaud, Sylvain LamprierICML 2023 · 6 citations
- A Convergence Theory for SVGD in the Population Limit under Talagrand's Inequality T1Adil Salim, Lukang Sun, Peter RichtárikICML 2022 · 28 citations
- A Non-Asymptotic Analysis for Stein Variational Gradient DescentAnna Korba, Adil Salim, Michael Arbel, Giulia Luise et al.NeurIPS 2020 · 102 citations
- Understanding the Variance Collapse of SVGD in High DimensionsJimmy Ba, Murat A. Erdogdu, Marzyeh Ghassemi, Shengyang Sun et al.ICLR 2022 · 35 citations
