Papers › Stochastic Multiple Target Sampling Gradient Descent

Stochastic Multiple Target Sampling Gradient Descent

4 Jun 2022arXiv:2206.01934archive 2025-07-28

Hoang Phan, Ngoc Tran, Trung Le, Toan Tran, Nhat Ho, Dinh Phung

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.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Syntology holds a reference implementation of Stochastic Multiple Target Sampling Gradient Descent, generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Stochastic Multiple Target Sampling Gradient Descent') (how to connect); the free check have('2206.01934') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 2 repositories linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 1 sample from 1 repository, 1 ran (0 with no instrument failure; 1 where Syntology's instrument failed); found in paper text by Syntology: 10 samples from 1 repository, 10 ran (8 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 11 samples that ran has no recorded date.

VietHoang1512/MT-SGD officialmentioned in papermentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran · our draft was wrong
8ran

Licence: 2 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. For 1 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

VietHoang1512/MT-SGD official repository 1 sample, 1 ran (1 instrument-failed) · 0 unverified
expected_calibration_error in 12 papers celeba/multi_task/train_mt_sgd.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 46e47135d4d407b3 · report fixture: signature y_true:ndarray/1/int, y_pred:ndarray/2/float, num_bins:int/0/int · returned float32 · level recorded, date not recorded
isl-org/MultiObjectiveOptimization found in paper text by Syntology 10 samples, 10 ran (2 instrument-failed) · 0 unverified
conv3x3 in 1,376 papers multi_task/models/pspnet.py ran · our draft was wrong MIT (permissive) · dbcb53696bc43ef9 · report fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int, has_bias:bool/0/bool · returned Conv2d · level recorded 2026-09-22
conv3x3 in 1,376 papers multi_task/models/resnet_mit.py ran MIT (permissive) · 90e50bc6f1220bdd · report fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int · returned Conv2d · level recorded 2026-09-25
conv3x3_bn_relu in 11 papers multi_task/models/pspnet.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · fca7e85d958618dd · report fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int · returned Sequential · level recorded 2026-09-22
cross_entropy2d in 12 papers multi_task/losses.py ran MIT (permissive) · 36497fd5247322ab · report fixture: signature input:Tensor/4/float, target:Tensor/3/int, weight:Tensor/1/float, val:bool/0/bool · returned Tensor · level recorded 2026-09-25
get_metrics in 46 papers multi_task/metrics.py ran MIT (permissive) · 7adcc62e674f9a40 · report fixture: signature params:dict/0/? · returned dict · level recorded 2026-09-25
gradient_normalizers in 17 papers multi_task/min_norm_solvers.py ran MIT (permissive) · faa96c0ba935fc57 · report fixture: signature grads:dict/0/?, losses:dict/0/?, normalization_type:str/0/str · returned dict · level recorded 2026-09-25
l1_loss_depth multi_task/losses.py ran fingerprinted MIT (permissive) · e870ff8870d18569 · report fixture: signature input:Tensor/2/float, target:Tensor/2/float, val:bool/0/bool · returned Tensor · level recorded 2026-09-25
nll in 20 papers multi_task/losses.py ran MIT (permissive) · a90eec2e662e141f · report fixture: signature pred:Tensor/2/float, gt:Tensor/1/int, val:bool/0/bool · returned Tensor · level recorded 2026-09-25
resnet101 in 24 papers multi_task/models/resnet_mit.py ran MIT (permissive) · deddf757c7ef17c5 · report fixture: signature pretrained:bool/0/bool · returned ResNet · level recorded 2026-09-25
resnet50 in 121 papers multi_task/models/resnet_mit.py ran MIT (permissive) · db1b66fff0c3985f · report fixture: signature pretrained:bool/0/bool · returned ResNet · level recorded 2026-09-25

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for Stochastic Multiple Target Sampling Gradient Descent (graph method: Stochastic Multiple Target Sampling Gradient Descent), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).

label matches by construction: the code was generated for this method (not judged by a model)

  1. solve_mt_sgd_qp_weights entry · level 2 · ran · 3e72963925fba5247f3148ec931737413aa7df95483ac9aee0e4081df619097a

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2206.01934") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Multi-Task Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections