Home › Code › gradient_normalizers

gradient_normalizers

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

gradient_normalizers appears in the code Syntology harvested for 17 papers, as 11 distinct code bodies found in 17 places (a place is one code body under one paper). Of the 17 papers, 9 with a sample that ran: 8 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument. 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named gradient_normalizers do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 11 distinct code bodies named gradient_normalizers: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
1ran; the contract check could not run
7ran
3unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 9 of the 17 places are pointer only (Syntology does not serve that copy's text); at 2 of those this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

17 papers shown of 17, newest first; 17 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 1 papers added by Syntology; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's 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.

PaperDateFileStatus SyntologyLicence
Rethinking Loss Reweighting for Imbalance Learning as an Inverse Problem: A Neural Collapse Point of View added by Syntology 2026-05 (from id) tongzixin716716/Inverse-Loss-Reweighting/min_norm_solvers.py 9c12115c283ca5af ran no licence file found · pointer only
FERERO: A Flexible Framework for Preference-Guided Multi-Objective Learning 2 Dec 2024 lisha-chen/ferero/multiMNIST/ferero_solvers.py fe93d608f889f824 unverified no licence file found · pointer only
ConFIG: Towards Conflict-free Training of Physics Informed Neural Networks 20 Aug 2024 tum-pbs/ConFIG/experiments/MTL/methods/min_norm_solvers.py 2d5ff72859c98459 unverified MIT (permissive)
DMTG: One-Shot Differentiable Multi-Task Grouping 6 Jul 2024 ethanygao/DMTG/models/ozan_min_norm_solvers.py fe93d608f889f824 unverified no licence file found · pointer only
PROUD: PaRetO-gUided Diffusion Model for Multi-objective Generation 5 Jul 2024 EvaFlower/Pareto-guided-diffusion-model/CIFAR10/models/min_norm_solver.py 736b65e3f76a3dfd ran no licence file found · pointer only
Fair Resource Allocation in Multi-Task Learning 23 Feb 2024 optmn-lab/fairgrad/methods/min_norm_solvers.py 2d5ff72859c98459 unverified MIT (permissive)
On Diversified Preferences of Large Language Model Alignment 12 Dec 2023 dunzeng/more/min_norm_solvers.py 1b7ba4d146c226aa ran no licence file found · pointer only
arXiv:2310.00800 2023-10 (from id) jumxglhf/ParetoGNN/src/min_norm_solvers.py 31d9547f7a6e800c ran CC0-1.0 (permissive)
Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms 28 May 2023 ml-opt-lab/sdmgrad/methods/min_norm_solvers.py 2d5ff72859c98459 unverified MIT (permissive)
Exploring Example Influence in Continual Learning 25 Sep 2022 sssunqing/example_influence_cl/min_norm_solvers.py f776c4e34e34039d ran; the contract check could not run (RAISES) · metamorphic tier: well formed fingerprinted no licence file found · pointer only
Stochastic Multiple Target Sampling Gradient Descent 4 Jun 2022 isl-org/MultiObjectiveOptimization/multi_task/min_norm_solvers.py faa96c0ba935fc57 ran MIT (permissive)
Multi-Task Learning as a Bargaining Game 2 Feb 2022 AvivNavon/nash-mtl/methods/min_norm_solvers.py def129ab34b9f0f8 unverified no licence file found · pointer only
Scalable Pareto Front Approximation for Deep Multi-Objective Learning 24 Mar 2021 ruchtem/cosmos/multi_objective/min_norm_solvers.py 466422ddd5626f12 ran MIT (permissive)
Knowledge Distillation for Multi-task Learning 14 Jul 2020 VICO-UoE/KD4MTL/mgda/min_norm_solvers.py f7316cdac3b90bc6 ran MIT (permissive)
Pareto Multi-Task Learning 30 Dec 2019 Xi-L/ParetoMTL/multiMNIST/min_norm_solvers.py fe93d608f889f824 unverified MIT (permissive) here; the stored copy is pointer only
Multi-Task Learning as Multi-Objective Optimization 10 Oct 2018 IntelVCL/MultiObjectiveOptimization/multi_task/min_norm_solvers.py faa96c0ba935fc57 ran MIT (permissive)
AAAI id aaai_33460 persai-lab/2025-NANSKoBeM/utils/min_norm_solvers.py fe93d608f889f824 unverified MIT (permissive) here; the stored copy is pointer only

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the 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 under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. 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 cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

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