{"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/lossfunction","entry":"LossFunction","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":8,"n_samples_ran":6,"n_samples_constructed":3,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"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":"2510.10467","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-10467","title":"AnyBCQ: Hardware Efficient Flexible Binary-Coded Quantization for Multi-Precision LLMs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"naver-aics/anybcq","path":"anybcq/quantization/anybcq.py","file_url":"https://github.com/naver-aics/anybcq/blob/HEAD/anybcq/quantization/anybcq.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":"f2815670c1e3ec0e","code_sha256_prefix":"f2815670c1e3ec0e","mcp_get_code":{"code_sha256":"f2815670c1e3ec0e"}},{"arxiv_id":"2504.02508","arxiv_id_is_arxiv":true,"paper":"/paper/aphq-vit-post-training-quantization-with","title":"APHQ-ViT: Post-Training Quantization with Average Perturbation Hessian Based Reconstruction for Vision Transformers","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GoatWu/APHQ-ViT","path":"utils/block_recon.py","file_url":"https://github.com/GoatWu/APHQ-ViT/blob/HEAD/utils/block_recon.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":"fa84db46289995ad","code_sha256_prefix":"fa84db46289995ad","mcp_get_code":{"code_sha256":"fa84db46289995ad"}},{"arxiv_id":"2410.11502","arxiv_id_is_arxiv":true,"paper":"/paper/offline-model-based-optimization-by-learning","title":"Offline Model-Based Optimization by Learning to Rank","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/offline-ram","path":"losses/lambdaRank.py","file_url":"https://github.com/lamda-bbo/offline-ram/blob/HEAD/losses/lambdaRank.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, lamda-bbo/offline-ram when it was checked","code_sha256":"f39d3df3ce16b87c","code_sha256_prefix":"f39d3df3ce16b87c","mcp_get_code":{"code_sha256":"f39d3df3ce16b87c"}},{"arxiv_id":"2410.05210","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-multi-modal-capabilities-of-pre","title":"Preserving Multi-Modal Capabilities of Pre-trained VLMs for Improving Vision-Linguistic Compositionality","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ytaek-oh/fsc-clip","path":"src/training/losses/loss.py","file_url":"https://github.com/ytaek-oh/fsc-clip/blob/HEAD/src/training/losses/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ytaek-oh/fsc-clip (NOASSERTION)","code_sha256":"f5395fcef01546fa","code_sha256_prefix":"f5395fcef01546fa","mcp_get_code":{"code_sha256":"f5395fcef01546fa"}},{"arxiv_id":"2407.20299","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-for-offline","title":"Dataset Distillation for Offline Reinforcement Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggflow123/ddrl","path":"src/data_distillation_training_offline.py","file_url":"https://github.com/ggflow123/ddrl/blob/HEAD/src/data_distillation_training_offline.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":"9fe90b52f58f8c3a","code_sha256_prefix":"9fe90b52f58f8c3a","mcp_get_code":{"code_sha256":"9fe90b52f58f8c3a"}},{"arxiv_id":"2405.16005","arxiv_id_is_arxiv":true,"paper":"/paper/ptq4dit-post-training-quantization-for","title":"PTQ4DiT: Post-training Quantization for Diffusion Transformers","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adreamwu/ptq4dit","path":"quant/layer_recon.py","file_url":"https://github.com/adreamwu/ptq4dit/blob/HEAD/quant/layer_recon.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, adreamwu/ptq4dit when it was checked","code_sha256":"cc1d937a9352676a","code_sha256_prefix":"cc1d937a9352676a","mcp_get_code":{"code_sha256":"cc1d937a9352676a"}},{"arxiv_id":"2205.12006","arxiv_id_is_arxiv":true,"paper":"/paper/neur2sp-neural-two-stage-stochastic","title":"Neur2SP: Neural Two-Stage Stochastic Programming","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lycle/ICNN2SP","path":"nsp/models/pytorch_model.py","file_url":"https://github.com/Lycle/ICNN2SP/blob/HEAD/nsp/models/pytorch_model.py","status":"ran","verification_level":1,"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, Lycle/ICNN2SP when it was checked","code_sha256":"cb36752969868b55","code_sha256_prefix":"cb36752969868b55","mcp_get_code":{"code_sha256":"cb36752969868b55"}},{"arxiv_id":"2203.05740","arxiv_id_is_arxiv":true,"paper":"/paper/qdrop-randomly-dropping-quantization-for-1","title":"QDrop: Randomly Dropping Quantization for Extremely Low-bit Post-Training Quantization","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wimh966/QDrop","path":"qdrop/solver/recon.py","file_url":"https://github.com/wimh966/QDrop/blob/HEAD/qdrop/solver/recon.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":"665e30ed4645891a","code_sha256_prefix":"665e30ed4645891a","mcp_get_code":{"code_sha256":"665e30ed4645891a"}}],"record_sha256":"a4ec7383e3fe3ac241cedda4f94db05a8dd1f1ae1718d3fc446eb0f839501281","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}