{"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":"/task/tensor-decomposition/papers/ran/1","list_of":"/task/tensor-decomposition","task":"Tensor Decomposition","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,32],"of":32,"counts":{"archive_papers_tagged":618,"with_a_code_link":154,"where_syntology_ran_a_sample":32,"not_listed_spam_title":0,"listed":618,"listed_where_code_ran":32,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":28,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":28,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/tensor-decomposition/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/free-the-design-space-of-equivariant-graph","slug":"free-the-design-space-of-equivariant-graph","title":"High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces","date":"2024-12-24","arxiv_id":"2412.18263","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/free-the-design-space-of-equivariant-graph#ran","syntology_url":"https://syntology.ai/paper/2412.18263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.18263"}},"official":{"repos":["shihaoshao-gh/ict-decomposition-and-equivariant-bases"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/activation-map-compression-through-tensor","slug":"activation-map-compression-through-tensor","title":"Activation Map Compression through Tensor Decomposition for Deep Learning","date":"2024-11-10","arxiv_id":"2411.06346","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/activation-map-compression-through-tensor#ran","syntology_url":"https://syntology.ai/paper/2411.06346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06346"}},"official":{"repos":["le-trungnguyen/neurips2024-activationcompression"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/over-parameterized-student-model-via-tensor","slug":"over-parameterized-student-model-via-tensor","title":"Over-parameterized Student Model via Tensor Decomposition Boosted Knowledge Distillation","date":"2024-11-10","arxiv_id":"2411.06448","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/over-parameterized-student-model-via-tensor#ran","syntology_url":"https://syntology.ai/paper/2411.06448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06448"}},"official":{"repos":["intell-sci-comput/opdf"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/qianets-quantum-integrated-adaptive-networks","slug":"qianets-quantum-integrated-adaptive-networks","title":"QIANets: Quantum-Integrated Adaptive Networks for Reduced Latency and Improved Inference Times in CNN Models","date":"2024-10-14","arxiv_id":"2410.10318","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/qianets-quantum-integrated-adaptive-networks#ran","syntology_url":"https://syntology.ai/paper/2410.10318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10318"}},"official":{"repos":["edwardmagongo/quantum-inspired-model-compression"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/broadcast-product-shape-aligned-element-wise","slug":"broadcast-product-shape-aligned-element-wise","title":"Broadcast Product: Shape-aligned Element-wise Multiplication and Beyond","date":"2024-09-26","arxiv_id":"2409.17502","repositories_listed":0,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/broadcast-product-shape-aligned-element-wise#ran","syntology_url":"https://syntology.ai/paper/2409.17502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17502"}},"official":null}},{"url":"/paper/a-tensor-decomposition-perspective-on-second","slug":"a-tensor-decomposition-perspective-on-second","title":"A Tensor Decomposition Perspective on Second-order RNNs","date":"2024-06-07","arxiv_id":"2406.05045","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-tensor-decomposition-perspective-on-second#ran","syntology_url":"https://syntology.ai/paper/2406.05045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05045"}},"official":{"repos":["MaudeLiz/cprnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/flora-low-rank-core-space-for-n-dimension","slug":"flora-low-rank-core-space-for-n-dimension","title":"FLoRA: Low-Rank Core Space for N-dimension","date":"2024-05-23","arxiv_id":"2405.14739","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/flora-low-rank-core-space-for-n-dimension#ran","syntology_url":"https://syntology.ai/paper/2405.14739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14739"}},"official":{"repos":["sjtu-deepvisionlab/flora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unlocking-data-free-low-bit-quantization-with","slug":"unlocking-data-free-low-bit-quantization-with","title":"Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression","date":"2024-05-21","arxiv_id":"2405.12591","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unlocking-data-free-low-bit-quantization-with#ran","syntology_url":"https://syntology.ai/paper/2405.12591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12591"}},"official":{"repos":["lpyhdzx/DecoQuant_code"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/tqcompressor-improving-tensor-decomposition","slug":"tqcompressor-improving-tensor-decomposition","title":"TQCompressor: improving tensor decomposition methods in neural networks via permutations","date":"2024-01-29","arxiv_id":"2401.16367","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tqcompressor-improving-tensor-decomposition#ran","syntology_url":"https://syntology.ai/paper/2401.16367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16367"}},"official":{"repos":["terra-quantum-public/tqcompressedgpt2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-nonparametric-tensor-decomposition","slug":"efficient-nonparametric-tensor-decomposition","title":"Efficient Nonparametric Tensor Decomposition for Binary and Count Data","date":"2024-01-15","arxiv_id":"2401.07711","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-nonparametric-tensor-decomposition#ran","syntology_url":"https://syntology.ai/paper/2401.07711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.07711"}},"official":{"repos":["taozerui/gptd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/strivec-sparse-tri-vector-radiance-fields","slug":"strivec-sparse-tri-vector-radiance-fields","title":"Strivec: Sparse Tri-Vector Radiance Fields","date":"2023-07-25","arxiv_id":"2307.13226","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/strivec-sparse-tri-vector-radiance-fields#ran","syntology_url":"https://syntology.ai/paper/2307.13226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13226"}},"official":{"repos":["zerg-overmind/strivec"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multiscale-tensor-decomposition-and-rendering","slug":"multiscale-tensor-decomposition-and-rendering","title":"Multiscale Tensor Decomposition and Rendering Equation Encoding for View Synthesis","date":"2023-03-07","arxiv_id":"2303.03808","repositories_listed":1,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":16,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":7,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multiscale-tensor-decomposition-and-rendering#ran","syntology_url":"https://syntology.ai/paper/2303.03808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.03808"}},"official":{"repos":["imkanghan/nrff"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dynagan-dynamic-few-shot-adaptation-of-gans","slug":"dynagan-dynamic-few-shot-adaptation-of-gans","title":"DynaGAN: Dynamic Few-shot Adaptation of GANs to Multiple Domains","date":"2022-11-26","arxiv_id":"2211.14554","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynagan-dynamic-few-shot-adaptation-of-gans#ran","syntology_url":"https://syntology.ai/paper/2211.14554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14554"}},"official":{"repos":["blueGorae/DynaGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor4d-efficient-neural-4d-decomposition","slug":"tensor4d-efficient-neural-4d-decomposition","title":"Tensor4D : Efficient Neural 4D Decomposition for High-fidelity Dynamic Reconstruction and Rendering","date":"2022-11-21","arxiv_id":"2211.11610","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tensor4d-efficient-neural-4d-decomposition#ran","syntology_url":"https://syntology.ai/paper/2211.11610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11610"}},"official":{"repos":["dsaurus/tensor4d"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}},"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/subquadratic-kronecker-regression-with","slug":"subquadratic-kronecker-regression-with","title":"Subquadratic Kronecker Regression with Applications to Tensor Decomposition","date":"2022-09-11","arxiv_id":"2209.04876","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/subquadratic-kronecker-regression-with#ran","syntology_url":"https://syntology.ai/paper/2209.04876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04876"}},"official":{"repos":["fahrbach/subquadratic-kronecker-regression"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/disenhcn-disentangled-hypergraph","slug":"disenhcn-disentangled-hypergraph","title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","date":"2022-08-14","arxiv_id":"2208.06794","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disenhcn-disentangled-hypergraph#ran","syntology_url":"https://syntology.ai/paper/2208.06794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06794"}},"official":{"repos":["yf-li15/DisenHCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nonparametric-factor-trajectory-learning-for","slug":"nonparametric-factor-trajectory-learning-for","title":"Nonparametric Factor Trajectory Learning for Dynamic Tensor Decomposition","date":"2022-07-06","arxiv_id":"2207.02446","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nonparametric-factor-trajectory-learning-for#ran","syntology_url":"https://syntology.ai/paper/2207.02446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02446"}},"official":null}},{"url":"/paper/a-unified-weight-initialization-paradigm-for","slug":"a-unified-weight-initialization-paradigm-for","title":"A Unified Weight Initialization Paradigm for Tensorial Convolutional Neural Networks","date":"2022-05-28","arxiv_id":"2205.15307","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-unified-weight-initialization-paradigm-for#ran","syntology_url":"https://syntology.ai/paper/2205.15307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15307"}},"official":{"repos":["tnbar/tednet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pie-a-parameter-and-inference-efficient","slug":"pie-a-parameter-and-inference-efficient","title":"PIE: a Parameter and Inference Efficient Solution for Large Scale Knowledge Graph Embedding Reasoning","date":"2022-04-29","arxiv_id":"2204.13957","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pie-a-parameter-and-inference-efficient#ran","syntology_url":"https://syntology.ai/paper/2204.13957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13957"}},"official":{"repos":["alipay/parameter_inference_efficient_pie"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-efficient-mixture-of-experts","slug":"parameter-efficient-mixture-of-experts","title":"Parameter-Efficient Mixture-of-Experts Architecture for Pre-trained Language Models","date":"2022-03-02","arxiv_id":"2203.01104","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parameter-efficient-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2203.01104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01104"}},"official":{"repos":["rucaibox/mpo","rucaibox/mpoe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/landscape-analysis-of-an-improved-power","slug":"landscape-analysis-of-an-improved-power","title":"Landscape analysis of an improved power method for tensor decomposition","date":"2021-10-29","arxiv_id":"2110.15821","repositories_listed":0,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/landscape-analysis-of-an-improved-power#ran","syntology_url":"https://syntology.ai/paper/2110.15821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15821"}},"official":null}},{"url":"/paper/initialization-and-regularization-of-1","slug":"initialization-and-regularization-of-1","title":"Initialization and Regularization of Factorized Neural Layers","date":"2021-05-03","arxiv_id":"2105.01029","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/initialization-and-regularization-of-1#ran","syntology_url":"https://syntology.ai/paper/2105.01029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01029"}},"official":{"repos":["microsoft/fnl_paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-variational-bayesian-training-of","slug":"end-to-end-variational-bayesian-training-of","title":"Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination","date":"2020-10-17","arxiv_id":"2010.08689","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-variational-bayesian-training-of#ran","syntology_url":"https://syntology.ai/paper/2010.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08689"}},"official":{"repos":["colehawkins/bayesian-tensor-rank-determination"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mars-masked-automatic-ranks-selection-in","slug":"mars-masked-automatic-ranks-selection-in","title":"MARS: Masked Automatic Ranks Selection in Tensor Decompositions","date":"2020-06-18","arxiv_id":"2006.10859","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mars-masked-automatic-ranks-selection-in#ran","syntology_url":"https://syntology.ai/paper/2006.10859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10859"}},"official":{"repos":["maxbourdon/mars"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/einconv-exploring-unexplored-tensor","slug":"einconv-exploring-unexplored-tensor","title":"Einconv: Exploring Unexplored Tensor Network Decompositions for Convolutional Neural Networks","date":"2019-08-13","arxiv_id":"1908.04471","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/einconv-exploring-unexplored-tensor#ran","syntology_url":"https://syntology.ai/paper/1908.04471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04471"}},"official":{"repos":["pfnet-research/einconv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-composition-of-word-embeddings","slug":"understanding-composition-of-word-embeddings","title":"Understanding Composition of Word Embeddings via Tensor Decomposition","date":"2019-02-02","arxiv_id":"1902.00613","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-composition-of-word-embeddings#ran","syntology_url":"https://syntology.ai/paper/1902.00613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00613"}},"official":{"repos":["abefrandsen/syntactic-rand-walk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/block-bilinear-superdiagonal-fusion-for","slug":"block-bilinear-superdiagonal-fusion-for","title":"BLOCK: Bilinear Superdiagonal Fusion for Visual Question Answering and Visual Relationship Detection","date":"2019-01-31","arxiv_id":"1902.00038","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/block-bilinear-superdiagonal-fusion-for#ran","syntology_url":"https://syntology.ai/paper/1902.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00038"}},"official":{"repos":["Cadene/block.bootstrap.pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tensor-decomposition-for-compressing","slug":"tensor-decomposition-for-compressing","title":"Tensor Decomposition for Compressing Recurrent Neural Network","date":"2018-02-28","arxiv_id":"1802.10410","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tensor-decomposition-for-compressing#ran","syntology_url":"https://syntology.ai/paper/1802.10410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10410"}},"official":{"repos":["androstj/tensor_rnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/convolutional-neural-networks-with-low-rank","slug":"convolutional-neural-networks-with-low-rank","title":"Convolutional neural networks with low-rank regularization","date":"2015-11-19","arxiv_id":"1511.06067","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convolutional-neural-networks-with-low-rank#ran","syntology_url":"https://syntology.ai/paper/1511.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06067"}},"official":{"repos":["chengtaipu/lowrankcnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/speeding-up-convolutional-neural-networks","slug":"speeding-up-convolutional-neural-networks","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","date":"2014-12-19","arxiv_id":"1412.6553","repositories_listed":10,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/speeding-up-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1412.6553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6553"}},"official":null}}],"record_sha256":"2963a682bff638b9c88b744397bc7153179c4c5cf2e3019c98f2c5e5a184d553","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}