{"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/gradient-loss","entry":"gradient_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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"ran":4,"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":"2605.17126","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17126","title":"Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness and Safety","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"seokjinkim0428/Multi-task-Linear-Regression","path":"MTL.py","file_url":"https://github.com/seokjinkim0428/Multi-task-Linear-Regression/blob/HEAD/MTL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, seokjinkim0428/Multi-task-Linear-Regression when it was checked","code_sha256":"b59222258d10e33d","code_sha256_prefix":"b59222258d10e33d","mcp_get_code":{"code_sha256":"b59222258d10e33d"}},{"arxiv_id":"2412.04463","arxiv_id_is_arxiv":true,"paper":"/paper/megasam-accurate-fast-and-robust-structure","title":"MegaSaM: Accurate, Fast, and Robust Structure and Motion from Casual Dynamic Videos","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mega-sam/mega-sam","path":"cvd_opt/cvd_opt.py","file_url":"https://github.com/mega-sam/mega-sam/blob/HEAD/cvd_opt/cvd_opt.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":"de454ae3ade5d9ae","code_sha256_prefix":"de454ae3ade5d9ae","mcp_get_code":{"code_sha256":"de454ae3ade5d9ae"}},{"arxiv_id":"2403.06090","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-trained-with-large-data-are","title":"What Matters When Repurposing Diffusion Models for General Dense Perception Tasks?","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/genpercept","path":"genpercept/losses/gradient_loss.py","file_url":"https://github.com/aim-uofa/genpercept/blob/HEAD/genpercept/losses/gradient_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe38b7f1ddcaf1f2","code_sha256_prefix":"fe38b7f1ddcaf1f2","mcp_get_code":{"code_sha256":"fe38b7f1ddcaf1f2"}},{"arxiv_id":"2403.03662","arxiv_id_is_arxiv":true,"paper":"/paper/harnessing-meta-learning-for-improving-full","title":"Harnessing Meta-Learning for Improving Full-Frame Video Stabilization","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkashifali/metavideostab","path":"losses.py","file_url":"https://github.com/mkashifali/metavideostab/blob/HEAD/losses.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, mkashifali/metavideostab when it was checked","code_sha256":"7bafa38f575ae646","code_sha256_prefix":"7bafa38f575ae646","mcp_get_code":{"code_sha256":"7bafa38f575ae646"}},{"arxiv_id":"2202.05250","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-and-robust-multi-task-learning","title":"Adaptive and Robust Multi-Task Learning","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kw2934/armul","path":"MTL.py","file_url":"https://github.com/kw2934/armul/blob/HEAD/MTL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from seokjinkim0428/Multi-task-Linear-Regression, and GitHub detected no licence in that repository when it was checked","code_sha256":"b59222258d10e33d","code_sha256_prefix":"b59222258d10e33d","mcp_get_code":{"code_sha256":"b59222258d10e33d"}},{"arxiv_id":"2010.07110","arxiv_id_is_arxiv":true,"paper":"/paper/online-anomaly-detection-in-surveillance","title":"Online Anomaly Detection in Surveillance Videos with Asymptotic Bounds on False Alarm Rate","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevaldoshi17/Prediction-based-Video-Anomaly-Detection-","path":"loss_functions.py","file_url":"https://github.com/kevaldoshi17/Prediction-based-Video-Anomaly-Detection-/blob/HEAD/loss_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":"695074a0b51574cc","code_sha256_prefix":"695074a0b51574cc","mcp_get_code":{"code_sha256":"695074a0b51574cc"}}],"record_sha256":"4feaf8aef04f5887252224bd057ce4718d62d46c23113946342be866eb6cef8d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}