Entropy
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.
Entropy appears in the code Syntology harvested for 31 papers, as 18 distinct code bodies found in 33 places (a place is one code body under one paper). Of the 31 papers, 29 with a sample that ran: 12 with a run with no instrument failure, 17 where every run was a failure of Syntology's instrument. 15 of the code bodies carry 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 Entropy 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 18 distinct code bodies named Entropy: 16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 2 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:
Licence is a property of each copy, so it is counted per place: 18 of the 33 places are pointer only (Syntology does not serve that copy's text); at 7 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
31 papers shown of 31, newest first; 33 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 2 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.
| Paper | Date | File | Status Syntology | Licence |
|---|---|---|---|---|
| LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation added by Syntology | 2026-07 (from id) | identical code first harvested elsewhere 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | licence of this copy not recorded |
| MU-SHOT-Fi: Self-Supervised Multi-User Wi-Fi Sensing with Source-free Unsupervised Domain Adaptation added by Syntology | 2026-05 (from id) | AhmedRadwan02/mu-shot-fi/WiDAR/SHOT/loss.py 866722884763b224 |
ran · honoured contract fingerprinted | no licence file found · pointer only |
| arXiv:2503.14564 | 2025-03 (from id) | flash1803/EATTA/classification/methods/eatta.py 9e77fe01c3502ba4 |
ran fingerprinted | MIT (permissive) |
| What Has Been Overlooked in Contrastive Source-Free Domain Adaptation: Leveraging Source-Informed Latent Augmentation within Neighborhood Context | 18 Dec 2024 | jingwang18/silan/adaptation_office.py a29c88002bbdc7f5 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective | 5 Jun 2024 | zhangyl660/LERM/UDA/DA/CDAN-LERM/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| LEAD: Learning Decomposition for Source-free Universal Domain Adaptation | 6 Mar 2024 | ispc-lab/glc/utils/net_utils.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| Enhancing Information Maximization with Distance-Aware Contrastive Learning for Source-Free Cross-Domain Few-Shot Learning | 4 Mar 2024 | xuhuali-mxj/im-dcl/adapt_da.py e9f124f4e6ac515e |
ran · honoured contract fingerprinted | no licence file found · pointer only |
| On $f$-Divergence Principled Domain Adaptation: An Improved Framework | 2 Feb 2024 | thuml/CDAN/pytorch/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| Machine Unlearning in Learned Databases: An Experimental Analysis | 2023-11 (from id) | meghdadk/db_unlearning/naru/train_model.py b6c3c093da58e8e3 |
ran; the contract check could not run (RAISES) · metamorphic tier: invariant | Apache-2.0 (permissive) |
| SPA: A Graph Spectral Alignment Perspective for Domain Adaptation | 26 Oct 2023 | CrownX/SPA/code/loss.py 300ab0eab2ed7c3e |
ran fingerprinted | no licence file found · pointer only |
| Reliable Gradient-free and Likelihood-free Prompt Tuning | 30 Apr 2023 | maohaos2/SBI_LLM/utils.py 1e1c05bc5a2f0504 |
ran fingerprinted | MIT (permissive) |
| Fixing Overconfidence in Dynamic Neural Networks | 13 Feb 2023 | aaltoml/calibrated-dnn/adaptive_inference.py 045fc85256f7d946 |
ran fingerprinted | MIT (permissive) |
| Detect, Distill and Update: Learned DB Systems Facing Out of Distribution Data | 11 Oct 2022 | meghdadk/DDUp/Naru/DMV/eval_model.py b6c3c093da58e8e3 |
ran; the contract check could not run (RAISES) · metamorphic tier: invariant | Apache-2.0 (permissive) |
| Entropy-driven Unsupervised Keypoint Representation Learning in Videos | 30 Sep 2022 | irosa-lab/mint/src/mint/entropy_layer/entropy.py d62ce5e00f9ef4c4 |
unverified | Apache-2.0 (permissive) |
| Uncertainty-guided Source-free Domain Adaptation | 16 Aug 2022 | roysubhankar/uncertainty-sfda/cifar/loss.py f3ce545fc143fc83 |
ran fingerprinted | MIT (permissive) |
| Uncertainty-guided Source-free Domain Adaptation | 16 Aug 2022 | roysubhankar/uncertainty-sfda/toy_classification/multiclass_shot.py 618b4bb0ee3cb5eb |
ran fingerprinted | MIT (permissive) |
| Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation | 27 Jul 2022 | albert0147/sfda_neighbors/train_src.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| Prior Knowledge Guided Unsupervised Domain Adaptation | 18 Jul 2022 | tsun/KUDA/DINE/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation | 9 May 2022 | albert0147/aad_sfda/tar_adaptation.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| Source-Free Progressive Graph Learning for Open-Set Domain Adaptation | 13 Feb 2022 | luoyadan/sf-pgl/utils/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptation | 1 Feb 2022 | maohaos2/MSFDA/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| Source Free Unsupervised Graph Domain Adaptation | 2 Dec 2021 | haitaomao/soga/codes/model/model_utilies.py 5a57a71c4462a38e |
ran fingerprinted | MIT (permissive) |
| Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation | 27 Jul 2021 | tntek/N2DCX/object/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| Transporting Causal Mechanisms for Unsupervised Domain Adaptation | 23 Jul 2021 | yue-zhongqi/tcm/dda_model/dda_model.py a4fb3d7d83bd280c |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| DINE: Domain Adaptation from Single and Multiple Black-box Predictors | 4 Apr 2021 | tim-learn/Dis-tune/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | MIT (permissive) here; the stored copy is pointer only |
| DINE: Domain Adaptation from Single and Multiple Black-box Predictors | 4 Apr 2021 | tim-learn/SHOT/digit/loss.py 866722884763b224 |
ran · honoured contract fingerprinted | MIT (permissive) |
| Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation | 1 Apr 2021 | Evgeneus/Graph-Domain-Adaptaion/src/trainer.py ab338e78525a1a07 |
ran · our draft was wrong fingerprinted | no licence file found · pointer only |
| Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer | 14 Dec 2020 | tim-learn/SHOT-plus/code/digit/uda_digit.py 866722884763b224 |
ran · honoured contract fingerprinted | MIT (permissive) |
| Renormalized Mutual Information for Artificial Scientific Discovery | 4 May 2020 | lsarra/rmi/rmi/estimation.py cc92bdd970182d6c |
unverified | MIT (permissive) |
| Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations | 27 Mar 2020 | cuishuhao/BNM/UODR/train_loader.py 54f9f530b53b6db0 |
ran · honoured contract fingerprinted | MIT (permissive) |
| A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation | 5 Mar 2020 | tim-learn/BA3US/my_loss.py 792f32c0291a5af7 |
ran fingerprinted | MIT (permissive) |
| MADE: Masked Autoencoder for Distribution Estimation | 12 Feb 2015 | naru-project/naru/train_model.py b6c3c093da58e8e3 |
ran; the contract check could not run (RAISES) · metamorphic tier: invariant | Apache-2.0 (permissive) |
| CVF open access id Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper | tim-learn/DINE/loss.py 94b5622f0aa7add1 |
ran · our draft was wrong fingerprinted | 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