{"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/hinge-loss","entry":"hinge_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":21,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":17,"n_papers_ran_instrument_only":2,"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":20,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":16,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":10,"n_places":21,"n_places_pointer_only":5,"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":1,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":14,"unverified":2},"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":"2509.03897","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-03897","title":"SPECS: Specificity-Enhanced CLIPScore for Long Image Caption Evaluation","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"mbzuai-nlp/SPECS","path":"model/model_spec.py","file_url":"https://github.com/mbzuai-nlp/SPECS/blob/HEAD/model/model_spec.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24fc39254981d28c","code_sha256_prefix":"24fc39254981d28c","mcp_get_code":{"code_sha256":"24fc39254981d28c"}},{"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":"dc356855afab271a","code_sha256_prefix":"dc356855afab271a","mcp_get_code":{"code_sha256":"dc356855afab271a"}},{"arxiv_id":"2406.19626","arxiv_id_is_arxiv":true,"paper":"/paper/safety-through-feedback-in-constrained-rl","title":"Safety through feedback in Constrained RL","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shshnkreddy/RLSF","path":"Sources/algo/prefim.py","file_url":"https://github.com/shshnkreddy/RLSF/blob/HEAD/Sources/algo/prefim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shshnkreddy/RLSF when it was checked","code_sha256":"59c2525415607d22","code_sha256_prefix":"59c2525415607d22","mcp_get_code":{"code_sha256":"59c2525415607d22"}},{"arxiv_id":"2402.12789","arxiv_id_is_arxiv":true,"paper":"/paper/fair-classifiers-without-fair-training-an","title":"Fairness Without Harm: An Influence-Guided Active Sampling Approach","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairnesswithoutharm","path":"src/metrics.py","file_url":"https://github.com/ucsc-real/fairnesswithoutharm/blob/HEAD/src/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsc-real/fairnesswithoutharm when it was checked","code_sha256":"89b278308e29baf3","code_sha256_prefix":"89b278308e29baf3","mcp_get_code":{"code_sha256":"89b278308e29baf3"}},{"arxiv_id":"2402.01408","arxiv_id_is_arxiv":true,"paper":"/paper/climbing-the-ladder-of-interpretability-with","title":"Counterfactual Concept Bottleneck Models","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabriele-dominici/counterfactual-cbm","path":"ccbm/models.py","file_url":"https://github.com/gabriele-dominici/counterfactual-cbm/blob/HEAD/ccbm/models.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, gabriele-dominici/counterfactual-cbm when it was checked","code_sha256":"5ca94368a93ee4e7","code_sha256_prefix":"5ca94368a93ee4e7","mcp_get_code":{"code_sha256":"5ca94368a93ee4e7"}},{"arxiv_id":"2306.03065","arxiv_id_is_arxiv":true,"paper":"/paper/libauc-a-deep-learning-library-for-x-risk","title":"LibAUC: A Deep Learning Library for X-Risk Optimization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Optimization-AI/LibAUC","path":"libauc/losses/surrogate.py","file_url":"https://github.com/Optimization-AI/LibAUC/blob/HEAD/libauc/losses/surrogate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bce69fc779a88d80","code_sha256_prefix":"bce69fc779a88d80","mcp_get_code":{"code_sha256":"bce69fc779a88d80"}},{"arxiv_id":"2305.00593","arxiv_id_is_arxiv":true,"paper":"/paper/reliable-gradient-free-and-likelihood-free","title":"Reliable Gradient-free and Likelihood-free Prompt Tuning","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/SBI_LLM","path":"utils.py","file_url":"https://github.com/maohaos2/SBI_LLM/blob/HEAD/utils.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":"7bc8bc9cbcbec1d0","code_sha256_prefix":"7bc8bc9cbcbec1d0","mcp_get_code":{"code_sha256":"7bc8bc9cbcbec1d0"}},{"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":"5fafd665133edec2","code_sha256_prefix":"5fafd665133edec2","mcp_get_code":{"code_sha256":"5fafd665133edec2"}},{"arxiv_id":"2302.02931","arxiv_id_is_arxiv":true,"paper":"/paper/bitrate-constrained-dro-beyond-worst-case","title":"Bitrate-Constrained DRO: Beyond Worst Case Robustness To Unknown Group Shifts","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ars22/bitrate_dro","path":"src/utils.py","file_url":"https://github.com/ars22/bitrate_dro/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05c3cdef091be334","code_sha256_prefix":"05c3cdef091be334","mcp_get_code":{"code_sha256":"05c3cdef091be334"}},{"arxiv_id":"2206.15437","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-instance-level-impact-of","title":"Understanding Instance-Level Impact of Fairness Constraints","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairinfl","path":"scores.py","file_url":"https://github.com/ucsc-real/fairinfl/blob/HEAD/scores.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c68a51000a1bbee","code_sha256_prefix":"5c68a51000a1bbee","mcp_get_code":{"code_sha256":"5c68a51000a1bbee"}},{"arxiv_id":"2202.12002","arxiv_id_is_arxiv":true,"paper":"/paper/rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ksreenivasan/pruning_is_enough","path":"bad_global_minima_2d_brute_force.py","file_url":"https://github.com/ksreenivasan/pruning_is_enough/blob/HEAD/bad_global_minima_2d_brute_force.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e452c2493ffbb3e","code_sha256_prefix":"8e452c2493ffbb3e","mcp_get_code":{"code_sha256":"8e452c2493ffbb3e"}},{"arxiv_id":"2201.03514","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-tuning-for-language-model-as-a","title":"Black-Box Tuning for Language-Model-as-a-Service","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jubgjf/plmtuningcompetition","path":"utils.py","file_url":"https://github.com/jubgjf/plmtuningcompetition/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bc8bc9cbcbec1d0","code_sha256_prefix":"7bc8bc9cbcbec1d0","mcp_get_code":{"code_sha256":"7bc8bc9cbcbec1d0"}},{"arxiv_id":"2111.06628","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-break-deep-perceptual-hashing-the","title":"Learning to Break Deep Perceptual Hashing: The Use Case NeuralHash","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/Learning-to-Break-Deep-Perceptual-Hashing","path":"losses/hinge_loss.py","file_url":"https://github.com/ml-research/Learning-to-Break-Deep-Perceptual-Hashing/blob/HEAD/losses/hinge_loss.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":"a4e251357a69a2a6","code_sha256_prefix":"a4e251357a69a2a6","mcp_get_code":{"code_sha256":"a4e251357a69a2a6"}},{"arxiv_id":"2104.14964","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-with-self-supervision-and","title":"Deep learning with self-supervision and uncertainty regularization to count fish in underwater images","date":"2021-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ptarling/DeepLearningFishCounting","path":"lossfunctions_metrics.py","file_url":"https://github.com/ptarling/DeepLearningFishCounting/blob/HEAD/lossfunctions_metrics.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":"6400df5309b45c25","code_sha256_prefix":"6400df5309b45c25","mcp_get_code":{"code_sha256":"6400df5309b45c25"}},{"arxiv_id":"2010.03159","arxiv_id_is_arxiv":true,"paper":"/paper/where-are-the-facts-searching-for-fact","title":"Where Are the Facts? Searching for Fact-checked Information to Alleviate the Spread of Fake News","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenvo09/EMNLP2020","path":"losses.py","file_url":"https://github.com/nguyenvo09/EMNLP2020/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b674a4fc37ebdad","code_sha256_prefix":"6b674a4fc37ebdad","mcp_get_code":{"code_sha256":"6b674a4fc37ebdad"}},{"arxiv_id":"1912.13457","arxiv_id_is_arxiv":true,"paper":"/paper/faceshifter-towards-high-fidelity-and","title":"FaceShifter: Towards High Fidelity And Occlusion Aware Face Swapping","date":"2019-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taotaonice/FaceShifter","path":"train_AEI.py","file_url":"https://github.com/taotaonice/FaceShifter/blob/HEAD/train_AEI.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, taotaonice/FaceShifter when it was checked","code_sha256":"20857a6f247d89e9","code_sha256_prefix":"20857a6f247d89e9","mcp_get_code":{"code_sha256":"20857a6f247d89e9"}},{"arxiv_id":"1809.03599","arxiv_id_is_arxiv":true,"paper":"/paper/learning-named-entity-tagger-using-domain","title":"Learning Named Entity Tagger using Domain-Specific Dictionary","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shangjingbo1226/AutoNER","path":"model_partial_ner/object.py","file_url":"https://github.com/shangjingbo1226/AutoNER/blob/HEAD/model_partial_ner/object.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":"a1ea6bd1afbd3741","code_sha256_prefix":"a1ea6bd1afbd3741","mcp_get_code":{"code_sha256":"a1ea6bd1afbd3741"}},{"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":"13d6783a3b02acab","code_sha256_prefix":"13d6783a3b02acab","mcp_get_code":{"code_sha256":"13d6783a3b02acab"}},{"arxiv_id":"1605.03795","arxiv_id_is_arxiv":true,"paper":"/paper/exponential-machines","title":"Exponential Machines","date":"2016-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bihaqo/exp-machines","path":"src/objectives/hinge.py","file_url":"https://github.com/Bihaqo/exp-machines/blob/HEAD/src/objectives/hinge.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a91b76d1bba22dd5","code_sha256_prefix":"a91b76d1bba22dd5","mcp_get_code":{"code_sha256":"a91b76d1bba22dd5"}},{"arxiv_id":"1511.06939","arxiv_id_is_arxiv":true,"paper":"/paper/session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maciejkula/spotlight","path":"spotlight/losses.py","file_url":"https://github.com/maciejkula/spotlight/blob/HEAD/spotlight/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":"de44a70b725c8af5","code_sha256_prefix":"de44a70b725c8af5","mcp_get_code":{"code_sha256":"de44a70b725c8af5"}},{"arxiv_id":"1311.2524","arxiv_id_is_arxiv":true,"paper":"/paper/rich-feature-hierarchies-for-accurate-object","title":"Rich feature hierarchies for accurate object detection and semantic segmentation","date":"2013-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjZSTU/R-CNN","path":"py/linear_svm.py","file_url":"https://github.com/zjZSTU/R-CNN/blob/HEAD/py/linear_svm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"71a4ab2e9cafc6f4","code_sha256_prefix":"71a4ab2e9cafc6f4","mcp_get_code":{"code_sha256":"71a4ab2e9cafc6f4"}}],"record_sha256":"1d629af725a78e9e11e68f61044135e9a12c1c0f0d2c47688b1e685d0477958e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}