{"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/kronecker-product","entry":"kronecker_product","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":9,"n_papers_ran":8,"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":4,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":1},"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.10189","paper":"/paper/arxiv-2605-10189","title":"ProteinOPD: Towards Effective and Efficient Preference Alignment for Protein Design","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ibmm-unibe-ch/TemBERTure","path":"dev/training/modeling.py","file_url":"https://github.com/ibmm-unibe-ch/TemBERTure/blob/HEAD/dev/training/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54fa343f001c7cff","mcp_get_code":{"code_sha256":"54fa343f001c7cff"}},{"arxiv_id":"2407.01320","paper":"/paper/increasing-model-capacity-for-free-a-simple","title":"Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/capaboost","path":"src/transformers/adapters/modeling.py","file_url":"https://github.com/lins-lab/capaboost/blob/HEAD/src/transformers/adapters/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54fa343f001c7cff","mcp_get_code":{"code_sha256":"54fa343f001c7cff"}},{"arxiv_id":"2310.20150","paper":"/paper/unlearn-what-you-want-to-forget-efficient","title":"Unlearn What You Want to Forget: Efficient Unlearning for LLMs","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SALT-NLP/Efficient_Unlearning","path":"src/models/transformers/parameter-efficient-finetuning/modeling.py","file_url":"https://github.com/SALT-NLP/Efficient_Unlearning/blob/HEAD/src/models/transformers/parameter-efficient-finetuning/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54fa343f001c7cff","mcp_get_code":{"code_sha256":"54fa343f001c7cff"}},{"arxiv_id":"2305.17682","paper":"/paper/one-network-many-masks-towards-more-parameter","title":"One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"54fa343f001c7cff","mcp_get_code":{"code_sha256":"54fa343f001c7cff"}},{"arxiv_id":"2301.12132","paper":"/paper/autopeft-automatic-configuration-search-for","title":"AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuning","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"54fa343f001c7cff","mcp_get_code":{"code_sha256":"54fa343f001c7cff"}},{"arxiv_id":"2212.11972","paper":"/paper/scalable-adaptive-computation-for-iterative","title":"Scalable Adaptive Computation for Iterative Generation","date":"2022-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pix2seq","path":"architectures/transformers.py","file_url":"https://github.com/google-research/pix2seq/blob/HEAD/architectures/transformers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e37890b1d73b280c","mcp_get_code":{"code_sha256":"e37890b1d73b280c"}},{"arxiv_id":"2209.04876","paper":"/paper/subquadratic-kronecker-regression-with","title":"Subquadratic Kronecker Regression with Applications to Tensor Decomposition","date":"2022-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fahrbach/subquadratic-kronecker-regression","path":"kronecker_regression_main.py","file_url":"https://github.com/fahrbach/subquadratic-kronecker-regression/blob/HEAD/kronecker_regression_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2bbf21749cd13578","mcp_get_code":{"code_sha256":"2bbf21749cd13578"}},{"arxiv_id":"2106.04647","paper":"/paper/compacter-efficient-low-rank-hypercomplex","title":"Compacter: Efficient Low-Rank Hypercomplex Adapter Layers","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rabeehk/compacter","path":"seq2seq/hypercomplex/layers.py","file_url":"https://github.com/rabeehk/compacter/blob/HEAD/seq2seq/hypercomplex/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5540414829f19945","mcp_get_code":{"code_sha256":"5540414829f19945"}},{"arxiv_id":"1503.05671","paper":"/paper/optimizing-neural-networks-with-kronecker","title":"Optimizing Neural Networks with Kronecker-factored Approximate Curvature","date":"2015-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gd-zhang/noisy-K-FAC","path":"ops/fisher_blocks.py","file_url":"https://github.com/gd-zhang/noisy-K-FAC/blob/HEAD/ops/fisher_blocks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7222c121f3477ba0","mcp_get_code":{"code_sha256":"7222c121f3477ba0"}}]}