{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/logistic-loss","entry":"logistic_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2411.02023","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-classification-under-performative","title":"Optimal Classification under Performative Distribution Shift","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"totilas/PerfOpti","path":"learner.py","file_url":"https://github.com/totilas/PerfOpti/blob/HEAD/learner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, totilas/PerfOpti when it was checked","code_sha256":"5587a2592ccfe33a","code_sha256_prefix":"5587a2592ccfe33a","mcp_get_code":{"code_sha256":"5587a2592ccfe33a"}},{"arxiv_id":"2311.18817","arxiv_id_is_arxiv":true,"paper":"/paper/dichotomy-of-early-and-late-phase-implicit","title":"Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vfleaking/grokking-dichotomy","path":"train_diag_cls.py","file_url":"https://github.com/vfleaking/grokking-dichotomy/blob/HEAD/train_diag_cls.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84b0e4fd98457360","code_sha256_prefix":"84b0e4fd98457360","mcp_get_code":{"code_sha256":"84b0e4fd98457360"}},{"arxiv_id":"2311.15502","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-complementary-labels-revisited","title":"Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwangwitsel/scarce","path":"utils_algo.py","file_url":"https://github.com/wwangwitsel/scarce/blob/HEAD/utils_algo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wwangwitsel/scarce when it was checked","code_sha256":"818a2ecedf0e443c","code_sha256_prefix":"818a2ecedf0e443c","mcp_get_code":{"code_sha256":"818a2ecedf0e443c"}},{"arxiv_id":"2311.15502","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-complementary-labels-revisited","title":"Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwangwitsel/scarce","path":"utils_algo.py","file_url":"https://github.com/wwangwitsel/scarce/blob/HEAD/utils_algo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wwangwitsel/scarce when it was checked","code_sha256":"b10d7e0d8c6b027a","code_sha256_prefix":"b10d7e0d8c6b027a","mcp_get_code":{"code_sha256":"b10d7e0d8c6b027a"}},{"arxiv_id":"2308.06912","arxiv_id_is_arxiv":true,"paper":"/paper/causallm-is-not-optimal-for-in-context","title":"CausalLM is not optimal for in-context learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/causallm_icl","path":"predictor_flax.py","file_url":"https://github.com/google-research/causallm_icl/blob/HEAD/predictor_flax.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52590a86263d6fbf","code_sha256_prefix":"52590a86263d6fbf","mcp_get_code":{"code_sha256":"52590a86263d6fbf"}},{"arxiv_id":"2308.00279","arxiv_id_is_arxiv":true,"paper":"/paper/robust-positive-unlabeled-learning-via-noise","title":"Robust Positive-Unlabeled Learning via Noise Negative Sample Self-correction","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woriazzc/robust-pu","path":"lossFunc.py","file_url":"https://github.com/woriazzc/robust-pu/blob/HEAD/lossFunc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, woriazzc/robust-pu when it was checked","code_sha256":"1c4f69034a53732d","code_sha256_prefix":"1c4f69034a53732d","mcp_get_code":{"code_sha256":"1c4f69034a53732d"}},{"arxiv_id":"2305.00121","arxiv_id_is_arxiv":true,"paper":"/paper/learning-locally-editable-virtual-humans","title":"Learning Locally Editable Virtual Humans","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"custom-humans/editable-humans","path":"lib/models/losses.py","file_url":"https://github.com/custom-humans/editable-humans/blob/HEAD/lib/models/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dfcc654710de6df9","code_sha256_prefix":"dfcc654710de6df9","mcp_get_code":{"code_sha256":"dfcc654710de6df9"}},{"arxiv_id":"2106.09779","arxiv_id_is_arxiv":true,"paper":"/paper/locally-differentially-private-federated","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lowya/private-federated-learning-without-a-trusted-server","path":"DP_FL_MNIST_logistic_FINAL.py","file_url":"https://github.com/lowya/private-federated-learning-without-a-trusted-server/blob/HEAD/DP_FL_MNIST_logistic_FINAL.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aac4a4211640b600","code_sha256_prefix":"aac4a4211640b600","mcp_get_code":{"code_sha256":"aac4a4211640b600"}},{"arxiv_id":"1912.10824","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-reasoning-on-large-knowledge","title":"Differentiable Reasoning on Large Knowledge Bases and Natural Language","date":"2019-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclnlp/gntp","path":"gntp/losses.py","file_url":"https://github.com/uclnlp/gntp/blob/HEAD/gntp/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23981ea194ca5abd","code_sha256_prefix":"23981ea194ca5abd","mcp_get_code":{"code_sha256":"23981ea194ca5abd"}},{"arxiv_id":"1910.06939","arxiv_id_is_arxiv":true,"paper":"/paper/learning-sample-specific-models-with-low-rank","title":"Learning Sample-Specific Models with Low-Rank Personalized Regression","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blengerich/personalized_regression","path":"functions.py","file_url":"https://github.com/blengerich/personalized_regression/blob/HEAD/functions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f7dcfaf8595264b","code_sha256_prefix":"2f7dcfaf8595264b","mcp_get_code":{"code_sha256":"2f7dcfaf8595264b"}},{"arxiv_id":"1804.00891","arxiv_id_is_arxiv":true,"paper":"/paper/hyperspherical-variational-auto-encoders","title":"Hyperspherical Variational Auto-Encoders","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acr42/Neural-Variational-Knowledge-Graphs","path":"vkge/training/losses.py","file_url":"https://github.com/acr42/Neural-Variational-Knowledge-Graphs/blob/HEAD/vkge/training/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"965d80dff3c0ea12","code_sha256_prefix":"965d80dff3c0ea12","mcp_get_code":{"code_sha256":"965d80dff3c0ea12"}}],"record_sha256":"5b8c8551dbb8562f3638ec393236645072210ad6cad79eb588669c02759faaa0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}