{"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/weighted-mse-loss","entry":"weighted_mse_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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":14,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":9,"unverified":0},"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":"2412.03177","arxiv_id_is_arxiv":true,"paper":"/paper/patchdpo-patch-level-dpo-for-finetuning-free","title":"PatchDPO: Patch-level DPO for Finetuning-free Personalized Image Generation","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqhqaq/patchdpo","path":"train_patchdpo.py","file_url":"https://github.com/hqhqaq/patchdpo/blob/HEAD/train_patchdpo.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, hqhqaq/patchdpo when it was checked","code_sha256":"3cd17d530dca63a5","code_sha256_prefix":"3cd17d530dca63a5","mcp_get_code":{"code_sha256":"3cd17d530dca63a5"}},{"arxiv_id":"2404.13904","arxiv_id_is_arxiv":true,"paper":"/paper/deep-regression-representation-learning-with","title":"Deep Regression Representation Learning with Topology","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"needylove/PH-Reg","path":"agedb-dir/loss.py","file_url":"https://github.com/needylove/PH-Reg/blob/HEAD/agedb-dir/loss.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, needylove/PH-Reg when it was checked","code_sha256":"1da83cb2ed411cd0","code_sha256_prefix":"1da83cb2ed411cd0","mcp_get_code":{"code_sha256":"1da83cb2ed411cd0"}},{"arxiv_id":"2308.10603","arxiv_id_is_arxiv":true,"paper":"/paper/a-step-towards-understanding-why","title":"A step towards understanding why classification helps regression","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silvialaurapintea/reg-cls","path":"images/imdb-wiki-dir/loss.py","file_url":"https://github.com/silvialaurapintea/reg-cls/blob/HEAD/images/imdb-wiki-dir/loss.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, silvialaurapintea/reg-cls when it was checked","code_sha256":"1da83cb2ed411cd0","code_sha256_prefix":"1da83cb2ed411cd0","mcp_get_code":{"code_sha256":"1da83cb2ed411cd0"}},{"arxiv_id":"2306.06955","arxiv_id_is_arxiv":true,"paper":"/paper/a-brief-review-of-hypernetworks-in-deep","title":"A Brief Review of Hypernetworks in Deep Learning","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmdvinodjmd/HyperITE","path":"src/utils.py","file_url":"https://github.com/jmdvinodjmd/HyperITE/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":"39cfd19e3f57f2b0","code_sha256_prefix":"39cfd19e3f57f2b0","mcp_get_code":{"code_sha256":"39cfd19e3f57f2b0"}},{"arxiv_id":"2211.16887","arxiv_id_is_arxiv":true,"paper":"/paper/t2g-former-organizing-tabular-features-into","title":"T2G-Former: Organizing Tabular Features into Relation Graphs Promotes Heterogeneous Feature Interaction","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyansir/t2g-former","path":"lib/loss.py","file_url":"https://github.com/jyansir/t2g-former/blob/HEAD/lib/loss.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":"c2715046735f422e","code_sha256_prefix":"c2715046735f422e","mcp_get_code":{"code_sha256":"c2715046735f422e"}},{"arxiv_id":"2205.00943","arxiv_id_is_arxiv":true,"paper":"/paper/cclf-a-contrastive-curiosity-driven-learning","title":"CCLF: A Contrastive-Curiosity-Driven Learning Framework for Sample-Efficient Reinforcement Learning","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csun001/CCLF","path":"CCLF_sac.py","file_url":"https://github.com/csun001/CCLF/blob/HEAD/CCLF_sac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce8a0bbbd3e12d2","code_sha256_prefix":"3ce8a0bbbd3e12d2","mcp_get_code":{"code_sha256":"3ce8a0bbbd3e12d2"}},{"arxiv_id":"2007.08202","arxiv_id_is_arxiv":true,"paper":"/paper/provably-good-batch-reinforcement-learning","title":"Provably Good Batch Reinforcement Learning Without Great Exploration","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoliucs/PQL","path":"BEAR.py","file_url":"https://github.com/yaoliucs/PQL/blob/HEAD/BEAR.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":"f3fe6057e846da8c","code_sha256_prefix":"f3fe6057e846da8c","mcp_get_code":{"code_sha256":"f3fe6057e846da8c"}},{"arxiv_id":"2006.13169","arxiv_id_is_arxiv":true,"paper":"/paper/experience-replay-with-likelihood-free","title":"Experience Replay with Likelihood-free Importance Weights","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIDefender/MyDiscor","path":"discor/algorithm/rlkit/torch/iwq/iwq.py","file_url":"https://github.com/AIDefender/MyDiscor/blob/HEAD/discor/algorithm/rlkit/torch/iwq/iwq.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"362aea1c56de9240","code_sha256_prefix":"362aea1c56de9240","mcp_get_code":{"code_sha256":"362aea1c56de9240"}},{"arxiv_id":"2004.15021","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-video-depth-estimation","title":"Consistent Video Depth Estimation","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/consistent_depth","path":"loss/consistency_loss.py","file_url":"https://github.com/facebookresearch/consistent_depth/blob/HEAD/loss/consistency_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/consistent_depth, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c9e2024f0fb8eb34","code_sha256_prefix":"c9e2024f0fb8eb34","mcp_get_code":{"code_sha256":"c9e2024f0fb8eb34"}},{"arxiv_id":"1904.05967","arxiv_id_is_arxiv":true,"paper":"/paper/tafe-net-task-aware-feature-embeddings-for-1","title":"TAFE-Net: Task-Aware Feature Embeddings for Low Shot Learning","date":"2019-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucbdrive/tafe-net","path":"compositional-zs/train_compose.py","file_url":"https://github.com/ucbdrive/tafe-net/blob/HEAD/compositional-zs/train_compose.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":"7e1973afe2913297","code_sha256_prefix":"7e1973afe2913297","mcp_get_code":{"code_sha256":"7e1973afe2913297"}},{"arxiv_id":"1904.02882","arxiv_id_is_arxiv":true,"paper":"/paper/libritts-a-corpus-derived-from-librispeech","title":"LibriTTS: A Corpus Derived from LibriSpeech for Text-to-Speech","date":null,"month_inferred_from_arxiv_id":"2019-04","title_source":"archive","repo":"zooeygirl/waveletProsody","path":"main2.py","file_url":"https://github.com/zooeygirl/waveletProsody/blob/HEAD/main2.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":"3ef7a35a2729d0a8","code_sha256_prefix":"3ef7a35a2729d0a8","mcp_get_code":{"code_sha256":"3ef7a35a2729d0a8"}},{"arxiv_id":"1902.10107","arxiv_id_is_arxiv":true,"paper":"/paper/utterance-level-aggregation-for-speaker","title":"Utterance-level Aggregation For Speaker Recognition In The Wild","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taylorlu/Speaker-Diarization","path":"uisrnn/loss_func.py","file_url":"https://github.com/taylorlu/Speaker-Diarization/blob/HEAD/uisrnn/loss_func.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":"720fd03354ee7041","code_sha256_prefix":"720fd03354ee7041","mcp_get_code":{"code_sha256":"720fd03354ee7041"}},{"arxiv_id":"1807.09937","arxiv_id_is_arxiv":true,"paper":"/paper/hidden-hiding-data-with-deep-networks","title":"HiDDeN: Hiding Data With Deep Networks","date":"2018-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dungpham98/Hidden_Blocking_Artifact_Reduction","path":"model/hidden.py","file_url":"https://github.com/dungpham98/Hidden_Blocking_Artifact_Reduction/blob/HEAD/model/hidden.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":"4cb7480b48bada32","code_sha256_prefix":"4cb7480b48bada32","mcp_get_code":{"code_sha256":"4cb7480b48bada32"}},{"arxiv_id":"1710.10467","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-end-to-end-loss-for-speaker","title":"Generalized End-to-End Loss for Speaker Verification","date":"2017-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangmin4215/PyTorch_Speaker_Verification","path":"uis-rnn/uisrnn/loss_func.py","file_url":"https://github.com/zhangmin4215/PyTorch_Speaker_Verification/blob/HEAD/uis-rnn/uisrnn/loss_func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720fd03354ee7041","code_sha256_prefix":"720fd03354ee7041","mcp_get_code":{"code_sha256":"720fd03354ee7041"}}],"record_sha256":"e87e6dc9f587cf874fed3677d4e66efcbd691edc5d3ed9b9aaf372017c9ca67e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}