{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/l1-regularization","entry":"l1_regularization","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":6,"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_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2503.10091","paper":"/paper/g-2-sf-miad-geometry-guided-score-fusion-for","title":"G$^{2}$SF-MIAD: Geometry-Guided Score Fusion for Multimodal Industrial Anomaly Detection","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctaoaa/G2SF","path":"G2SF_GITHUB/Fusion/fusion_engine_v2.py","file_url":"https://github.com/ctaoaa/G2SF/blob/HEAD/G2SF_GITHUB/Fusion/fusion_engine_v2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16199d8c3e9c8b3a","mcp_get_code":{"code_sha256":"16199d8c3e9c8b3a"}},{"arxiv_id":"2411.15537","paper":"/paper/munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2411.15537","paper":"/paper/munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWu321/MUNBa","path":"CLIP/unlearn/MUNBa.py","file_url":"https://github.com/JingWu321/MUNBa/blob/HEAD/CLIP/unlearn/MUNBa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11a09839091159b2","mcp_get_code":{"code_sha256":"11a09839091159b2"}},{"arxiv_id":"2403.07362","paper":"/paper/challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OPTML-Group/Unlearn-WorstCase","path":"data-wise/unlearn/FT.py","file_url":"https://github.com/OPTML-Group/Unlearn-WorstCase/blob/HEAD/data-wise/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2403.07362","paper":"/paper/challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-worstcase","path":"data-wise/main_selmu.py","file_url":"https://github.com/optml-group/unlearn-worstcase/blob/HEAD/data-wise/main_selmu.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e891e24b7f24953","mcp_get_code":{"code_sha256":"1e891e24b7f24953"}},{"arxiv_id":"2310.12508","paper":"/paper/salun-empowering-machine-unlearning-via","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-saliency","path":"Classification/unlearn/FT.py","file_url":"https://github.com/optml-group/unlearn-saliency/blob/HEAD/Classification/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2309.05973","paper":"/paper/2309-05973","title":"Circuit Breaking: Removing Model Behaviors with Targeted Ablation","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xanderdavies/circuit-breaking","path":"mnist/mlp_model.py","file_url":"https://github.com/xanderdavies/circuit-breaking/blob/HEAD/mnist/mlp_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7a90d9617759fa76","mcp_get_code":{"code_sha256":"7a90d9617759fa76"}},{"arxiv_id":"2304.04934","paper":"/paper/model-sparsity-can-simplify-machine-1","title":"Model Sparsity Can Simplify Machine Unlearning","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-sparse","path":"src/optim/unlearn/FT.py","file_url":"https://github.com/optml-group/unlearn-sparse/blob/HEAD/src/optim/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}}]}