Milad Sefidgaran, Abdellatif Zaidi : ∤, Piotr Krasnowski
2 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2402.03254.json · badge: /api/ran/2402.03254.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning | canonical (classifier label) classifier basis: census |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| cuda | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning/utils.py code served (permissive licence) · get_code("558fdb5c17a3a411") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| str2bool | Ran ran, violated the contract we drafted |
piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning/utils.py code served (permissive licence) · get_code("e379ac8503ee2660") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned bool, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| return_data | Not yet run unverified (harvested, no recorded run) |
piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning/datasets.py code served (permissive licence) · get_code("05d0b6602a883bd3") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 1 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| str2bool | 82 other papers 72 dated earlier, 1 the same month, 9 later |
1510.03055 (2015-10) A Diversity-Promoting Objective Function for Neural Conversation Models |
1703.06490 (2017-03) Generating Multi-label Discrete Patient Records using Generative Adversarial Networks 1710.10467 (2017-10) Generalized End-to-End Loss for Speaker Verification and 79 more not named here |
| cuda | 2 other papers 2 dated earlier |
1612.00410 (2016-12) Deep Variational Information Bottleneck |
2108.10252 (2021-08) Federated Multi-Task Learning under a Mixture of Distributions |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A major challenge in designing efficient statistical supervised learning algorithms is finding representations that perform well not only on available training samples but also on unseen data. While the study of representation learning has spurred much interest, most existing such approaches are heuristic; and very little is known about theoretical generalization guarantees. For example, the information bottleneck method seeks a good generalization by finding a minimal description of the input that is maximally informative about the label variable, where minimality and informativeness are both measured by Shannon's mutual information. In this paper, we establish a compressibility framework that allows us to derive upper bounds on the generalization error of a representation learning algorithm in terms of the "Minimum Description Length" (MDL) of the labels or the latent variables (representations). Rather than the mutual information between the encoder's input and the representation, which is often believed to reflect the algorithm's generalization capability in the related literature but in fact, falls short of doing so, our new bounds involve the "multi-letter" relative entropy between the distribution of the representations (or labels) of the training and test sets and a fixed prior. In particular, these new bounds reflect the structure of the encoder and are not vacuous for deterministic algorithms. Our compressibility approach, which is information-theoretic in nature, builds upon that of Blum-Langford for PAC-MDL bounds and introduces two essential ingredients: block-coding and lossy-compression. The latter allows our approach to subsume the so-called geometrical compressibility as a special case. To the best knowledge of the authors, the established generalization bounds are the first of their kind for Information Bottleneck (IB) type encoders and representation learning. Finally, we partly exploit the theoretical results by introducing a new data-dependent prior. Numerical simulations illustrate the advantages of well-chosen such priors over classical priors used in IB. Information Bottleneck. Several approaches have attempted to formalize the concept of a "good representation" [
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.03254")
get_code_for_paper("2402.03254")
have("2402.03254")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.03254.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.03254)
Connect an agent — have() is free.