Home › Code › calculate_entropy

calculate_entropy

Syntologyentry name in harvested coderead from the graph 2026-09-24

calculate_entropy appears in the code Syntology harvested for 22 papers, as 22 distinct code bodies found in 23 places (a place is one code body under one paper). At least one of them ran in 7 of the papers; 4 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 calculate_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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 7 of the 22 distinct code bodies named calculate_entropy; 15 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
1ran · violated contract
1ran · our draft was wrong
0ran · fixture could not drive it
4ran
15unverified
4fingerprinted

Licence is a property of each copy, so it is counted per place: 8 of the 23 places are pointer only (Syntology does not serve that copy's text). 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 “fixture could not drive it” 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.

Papers

22 papers shown of 22, newest first; 23 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 4 papers added by Syntology; 2 papers have no page here and are shown by arXiv id only. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Improving Sparse Autoencoder with Dynamic Attention added by Syntology 2026-04 (from id) qyj-bkjx/Sparsemax-SAE/analysis/utils.py c0113839c1642005 unverified MIT (permissive)
RETLLM: Training and Data-Free MLLMs for Multimodal Information Retrieval added by Syntology 2026-02 (from id) alivecat05/RETLLM/Codes/Qwen_vl.py 76755f6879d57a39 unverified Apache-2.0 (permissive)
Why Attention Patterns Exist: A Unifying Temporal Perspective Analysis added by Syntology 2026-01 (from id) MIRALab-USTC/LLM-TAPPA/KVCache/tappa/model/llama_forward.py 518b8a174b0afc4e ran · our draft was wrong fingerprinted MIT (permissive)
GMM-COMET: Continual Source-Free Universal Domain Adaptation via a Mean Teacher and Gaussian Mixture Model-Based Pseudo-Labeling added by Syntology 2026-01 (from id) pascalschlachter/GMM-COMET/adaptation.py 3a14e072b8171e33 ran · violated contract fingerprinted no licence file found · pointer only
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition 21 Jun 2025 labrai/cega/attacks/attack_0_cega.py 90eef8ab7e8c113f unverified MIT (permissive)
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition 21 Jun 2025 labrai/cega/attacks/attack_0_age.py f77dc13db482d1e3 unverified MIT (permissive)
CALM: Consensus-Aware Localized Merging for Multi-Task Learning 16 Jun 2025 yankd22/calm/src/logits_extraction.py 818a9b04389c065d unverified no licence file found · pointer only
Entropy-Based Adaptive Weighting for Self-Training 31 Mar 2025 mandyyyyii/east/data_generation/util.py bf4fc86ee78e60ce unverified MIT (permissive)
UAlign: Leveraging Uncertainty Estimations for Factuality Alignment on Large Language Models 16 Dec 2024 amourwaltz/ualign/code/uncertainty.py 23b0e66b13795f6e unverified no licence file found · pointer only
Sparse autoencoders reveal selective remapping of visual concepts during adaptation 6 Dec 2024 dynamical-inference/patchsae/analysis/utils.py c0113839c1642005 unverified MIT (permissive)
Value Residual Learning For Alleviating Attention Concentration In Transformers 23 Oct 2024 Zcchill/Value-Residual-Learning/analyze/get_entropy.py ed28cdaf289e0435 unverified MIT (permissive)
From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression 5 Oct 2024 eunseongc/r2c/compress.py 011fa22b8040e461 ran fingerprinted no licence file found · pointer only
ConflictBank: A Benchmark for Evaluating the Influence of Knowledge Conflicts in LLM 22 Aug 2024 zhaochen0110/conflictbank/evaluate.py 68dfae5ca75de5c4 ran fingerprinted no licence file found · pointer only
Improving Weak-to-Strong Generalization with Reliability-Aware Alignment 27 Jun 2024 irenehere/reliablealignment/ETHICS/commonsense/our_method_uncertainty_filtering.py 3a2bf35d401300c4 ran · honoured contract no licence file found · pointer only
Failures Are Fated, But Can Be Faded: Characterizing and Mitigating Unwanted Behaviors in Large-Scale Vision and Language Models 11 Jun 2024 somsagar07/FailureShiftRL/Utils/plots.py 4c3d4d72af55afa2 ran MIT (permissive)
Token-Specific Watermarking with Enhanced Detectability and Semantic Coherence for Large Language Models 28 Feb 2024 mignonjia/ts_watermark/utils/generation.py 6f3e19b647ed821b ran no licence file found · pointer only
CoAnnotating: Uncertainty-Guided Work Allocation between Human and Large Language Models for Data Annotation 24 Oct 2023 SALT-NLP/CoAnnotating/Expertise_Estimation.py 5cb041415ae2ab05 unverified no licence file found · pointer only
Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraints 28 Sep 2023 alecwangcq/f-divergence-dpo/generation.py 194f8dc522933267 unverified Apache-2.0 (permissive)
Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric 26 Sep 2022 PengxinZeng/2023-CVPR-FCMI/evaluate.py 4f0406f99019587b unverified Apache-2.0 (permissive)
FCOS3D: Fully Convolutional One-Stage Monocular 3D Object Detection 22 Apr 2021 Discover304/MMDetection3D-Eloss/mmdet3d/models/losses/eloss.py 356e77e178d28771 unverified Apache-2.0 (permissive)
Exploring BERT's Sensitivity to Lexical Cues using Tests from Semantic Priming 6 Oct 2020 kanishkamisra/emnlp-bert-priming/python/entropy_constraint.py 0f24935725a6bbf1 unverified MIT (permissive)
arXiv:ijcai2025_0850 Hongyi-Lyu-MQ/SULI/methods/unlearning.py 8081b8874aeff47c unverified MIT (permissive)
arXiv:2024.findings-naacl.117 qqplot/dcpmi/utils/text_utils.py 0ee95ddca5554890 unverified MIT (permissive)

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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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