{"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","name":"Tensor Decomposition","slug":"tensor-decomposition","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":618,"papers_with_code":154,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":7,"rows_per_page":100,"shown":100,"of":618,"of_with_code":154,"tagged_in_all":618,"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"},"items":[{"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}},{"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/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/when-are-nonconvex-problems-not-scary","slug":"when-are-nonconvex-problems-not-scary","title":"When Are Nonconvex Problems Not Scary?","date":"2015-10-21","arxiv_id":"1510.06096","repositories_listed":3,"syntology":null},{"url":"/paper/multihu-td-multifeature-hyperspectral","slug":"multihu-td-multifeature-hyperspectral","title":"MultiHU-TD: Multifeature Hyperspectral Unmixing Based on Tensor Decomposition","date":"2023-10-05","arxiv_id":"2310.03860","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-tensor-graph-neural-networks","slug":"multi-view-tensor-graph-neural-networks","title":"Multi-view Tensor Graph Neural Networks Through Reinforced Aggregation","date":"2023-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/kge-cl-contrastive-learning-of-knowledge","slug":"kge-cl-contrastive-learning-of-knowledge","title":"KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings","date":"2021-12-09","arxiv_id":"2112.04871","repositories_listed":2,"syntology":null},{"url":"/paper/dimensionality-reduction-of-longitudinal","slug":"dimensionality-reduction-of-longitudinal","title":"Dimensionality Reduction of Longitudinal 'Omics Data using Modern Tensor Factorization","date":"2021-11-28","arxiv_id":"2111.14159","repositories_listed":2,"syntology":null},{"url":"/paper/nonnegative-tucker-decomposition-with-beta","slug":"nonnegative-tucker-decomposition-with-beta","title":"Nonnegative Tucker Decomposition with Beta-divergence for Music Structure Analysis of Audio Signals","date":"2021-10-27","arxiv_id":"2110.14434","repositories_listed":2,"syntology":null},{"url":"/paper/binarized-knowledge-graph-embeddings","slug":"binarized-knowledge-graph-embeddings","title":"Binarized Knowledge Graph Embeddings","date":"2019-02-08","arxiv_id":"1902.02970","repositories_listed":2,"syntology":null},{"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/learning-a-wavelet-like-auto-encoder-to","slug":"learning-a-wavelet-like-auto-encoder-to","title":"Learning a Wavelet-like Auto-Encoder to Accelerate Deep Neural Networks","date":"2017-12-20","arxiv_id":"1712.07493","repositories_listed":2,"syntology":null},{"url":"/paper/expressive-power-of-recurrent-neural-networks","slug":"expressive-power-of-recurrent-neural-networks","title":"Expressive power of recurrent neural networks","date":"2017-11-02","arxiv_id":"1711.00811","repositories_listed":2,"syntology":null},{"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/revisit-cp-tensor-decomposition-statistical","slug":"revisit-cp-tensor-decomposition-statistical","title":"Revisit CP Tensor Decomposition: Statistical Optimality and Fast Convergence","date":"2025-05-29","arxiv_id":"2505.23046","repositories_listed":1,"syntology":null},{"url":"/paper/d-tracker-modeling-interest-diffusion-in","slug":"d-tracker-modeling-interest-diffusion-in","title":"D-Tracker: Modeling Interest Diffusion in Social Activity Tensor Data Streams","date":"2025-05-01","arxiv_id":"2505.00242","repositories_listed":1,"syntology":null},{"url":"/paper/multiscale-tensor-summation-factorization-as","slug":"multiscale-tensor-summation-factorization-as","title":"Multiscale Tensor Summation Factorization as a New Neural Network Layer (MTS Layer) for Multidimensional Data Processing","date":"2025-04-17","arxiv_id":"2504.13975","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-with-mixed","slug":"knowledge-graph-completion-with-mixed","title":"Knowledge Graph Completion with Mixed Geometry Tensor Factorization","date":"2025-04-03","arxiv_id":"2504.02589","repositories_listed":1,"syntology":null},{"url":"/paper/coeff-tuning-a-graph-filter-subspace-view-for","slug":"coeff-tuning-a-graph-filter-subspace-view-for","title":"Coeff-Tuning: A Graph Filter Subspace View for Tuning Attention-Based Large Models","date":"2025-03-24","arxiv_id":"2503.18337","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/coeff-tuning-a-graph-filter-subspace-view-for#ran","syntology_url":"https://syntology.ai/paper/2503.18337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.18337"}},"official":{"repos":["ZichenMiao/Coeff_Tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/guaranteed-multidimensional-time-series","slug":"guaranteed-multidimensional-time-series","title":"Guaranteed Multidimensional Time Series Prediction via Deterministic Tensor Completion Theory","date":"2025-01-26","arxiv_id":"2501.15388","repositories_listed":1,"syntology":null},{"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/higher-order-transformers-enhancing-stock","slug":"higher-order-transformers-enhancing-stock","title":"Higher Order Transformers: Enhancing Stock Movement Prediction On Multimodal Time-Series Data","date":"2024-12-13","arxiv_id":"2412.10540","repositories_listed":1,"syntology":null},{"url":"/paper/learning-parameter-sharing-with-tensor","slug":"learning-parameter-sharing-with-tensor","title":"Learning Parameter Sharing with Tensor Decompositions and Sparsity","date":"2024-11-14","arxiv_id":"2411.09816","repositories_listed":1,"syntology":null},{"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":3,"n_instrument":5,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 5 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":3,"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/low-rank-tensors-for-multi-dimensional-markov","slug":"low-rank-tensors-for-multi-dimensional-markov","title":"Low-Rank Tensors for Multi-Dimensional Markov Models","date":"2024-11-04","arxiv_id":"2411.02098","repositories_listed":1,"syntology":null},{"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/enhanced-mri-brain-tumor-detection-and","slug":"enhanced-mri-brain-tumor-detection-and","title":"Enhanced MRI brain tumor detection and classification via topological data analysis and low-rank tensor decomposition","date":"2024-10-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-anomaly-detection-in-network-flows","slug":"adaptive-anomaly-detection-in-network-flows","title":"Adaptive Anomaly Detection in Network Flows with Low-Rank Tensor Decompositions and Deep Unrolling","date":"2024-09-17","arxiv_id":"2409.11529","repositories_listed":1,"syntology":null},{"url":"/paper/functional-tensor-decompositions-for-physics","slug":"functional-tensor-decompositions-for-physics","title":"Functional Tensor Decompositions for Physics-Informed Neural Networks","date":"2024-08-23","arxiv_id":"2408.13101","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-tensor-pca-via-tensor-decomposition","slug":"sparse-tensor-pca-via-tensor-decomposition","title":"Sparse Tensor PCA via Tensor Decomposition for Unsupervised Feature Selection","date":"2024-07-24","arxiv_id":"2407.16985","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-prior-is-not-all-you-need-when","slug":"sparse-prior-is-not-all-you-need-when","title":"Sparse Prior Is Not All You Need: When Differential Directionality Meets Saliency Coherence for Infrared Small Target Detection","date":"2024-07-22","arxiv_id":"2407.15369","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-independent-component-analysis","slug":"contrastive-independent-component-analysis","title":"Contrastive independent component analysis","date":"2024-07-02","arxiv_id":"2407.02357","repositories_listed":1,"syntology":null},{"url":"/paper/trawl-tensor-reduced-and-approximated-weights","slug":"trawl-tensor-reduced-and-approximated-weights","title":"TRAWL: Tensor Reduced and Approximated Weights for Large Language Models","date":"2024-06-25","arxiv_id":"2406.17261","repositories_listed":1,"syntology":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/unified-low-rank-compression-framework-for","slug":"unified-low-rank-compression-framework-for","title":"Unified Low-rank Compression Framework for Click-through Rate Prediction","date":"2024-05-28","arxiv_id":"2405.18146","repositories_listed":1,"syntology":null},{"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":1,"n_instrument":5,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"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) · 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":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/engineering-software-2-0-by-interpolating","slug":"engineering-software-2-0-by-interpolating","title":"Interpolating neural network: A novel unification of machine learning and interpolation theory","date":"2024-04-16","arxiv_id":"2404.10296","repositories_listed":1,"syntology":null},{"url":"/paper/post-training-network-compression-for-3d","slug":"post-training-network-compression-for-3d","title":"Post-Training Network Compression for 3D Medical Image Segmentation: Reducing Computational Efforts via Tucker Decomposition","date":"2024-04-15","arxiv_id":"2404.09683","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-heterogeneity-among-factor-tensors","slug":"mitigating-heterogeneity-among-factor-tensors","title":"Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding","date":"2024-04-14","arxiv_id":"2404.09155","repositories_listed":1,"syntology":null},{"url":"/paper/the-all0core-tensor-decomposition-for-sparse","slug":"the-all0core-tensor-decomposition-for-sparse","title":"The AL$\\ell_0$CORE Tensor Decomposition for Sparse Count Data","date":"2024-03-10","arxiv_id":"2403.06153","repositories_listed":1,"syntology":null},{"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":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 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":1,"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/fast-gradient-free-activation-maximization","slug":"fast-gradient-free-activation-maximization","title":"Fast gradient-free activation maximization for neurons in spiking neural networks","date":"2023-12-28","arxiv_id":"2401.10748","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-decomposition-based-attention-module","slug":"tensor-decomposition-based-attention-module","title":"Tensor Decomposition Based Attention Module for Spiking Neural Networks","date":"2023-10-23","arxiv_id":"2310.14576","repositories_listed":1,"syntology":null},{"url":"/paper/joint-projection-learning-and-tensor","slug":"joint-projection-learning-and-tensor","title":"Joint Projection Learning and Tensor Decomposition Based Incomplete Multi-view Clustering","date":"2023-10-06","arxiv_id":"2310.04038","repositories_listed":1,"syntology":null},{"url":"/paper/swotted-an-extension-of-tensor-decomposition","slug":"swotted-an-extension-of-tensor-decomposition","title":"SWoTTeD: An Extension of Tensor Decomposition to Temporal Phenotyping","date":"2023-10-02","arxiv_id":"2310.01201","repositories_listed":1,"syntology":null},{"url":"/paper/multi-dictionary-tensor-decomposition","slug":"multi-dictionary-tensor-decomposition","title":"Multi-Dictionary Tensor Decomposition","date":"2023-09-18","arxiv_id":"2309.09717","repositories_listed":1,"syntology":null},{"url":"/paper/an-accelerated-block-proximal-framework-with","slug":"an-accelerated-block-proximal-framework-with","title":"An Accelerated Block Proximal Framework with Adaptive Momentum for Nonconvex and Nonsmooth Optimization","date":"2023-08-23","arxiv_id":"2308.12126","repositories_listed":1,"syntology":null},{"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":6,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 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":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixed-td-efficient-neural-network-accelerator","slug":"mixed-td-efficient-neural-network-accelerator","title":"Mixed-TD: Efficient Neural Network Accelerator with Layer-Specific Tensor Decomposition","date":"2023-06-08","arxiv_id":"2306.05021","repositories_listed":1,"syntology":null},{"url":"/paper/provable-convergence-of-tensor-decomposition","slug":"provable-convergence-of-tensor-decomposition","title":"On Model Compression for Neural Networks: Framework, Algorithm, and Convergence Guarantee","date":"2023-03-13","arxiv_id":"2303.06815","repositories_listed":1,"syntology":null},{"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":6,"n_instrument":12,"n_unverified":4,"n_honours":1,"n_violates":2,"n_no_contract":3,"n_pointer_only":7,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 2 violated, 3 with no contract checked; 12 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":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/quantized-radio-map-estimation-using-tensor","slug":"quantized-radio-map-estimation-using-tensor","title":"Quantized Radio Map Estimation Using Tensor and Deep Generative Models","date":"2023-03-03","arxiv_id":"2303.01770","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-based-on-tensor","slug":"knowledge-graph-completion-based-on-tensor","title":"Knowledge Graph Completion based on Tensor Decomposition for Disease Gene Prediction","date":"2023-02-18","arxiv_id":"2302.09335","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-tensor-completion-with-generalized","slug":"low-rank-tensor-completion-with-generalized","title":"A generalizable framework for low-rank tensor completion with numerical priors","date":"2023-02-12","arxiv_id":"2302.05881","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discontinuous-constituency","slug":"unsupervised-discontinuous-constituency","title":"Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars","date":"2022-12-18","arxiv_id":"2212.09140","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-relation-aware-neighborhood","slug":"efficient-relation-aware-neighborhood","title":"Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition","date":"2022-12-11","arxiv_id":"2212.05581","repositories_listed":1,"syntology":null},{"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/tensor-decomposition-of-large-scale-clinical","slug":"tensor-decomposition-of-large-scale-clinical","title":"Tensor Decomposition of Large-scale Clinical EEGs Reveals Interpretable Patterns of Brain Physiology","date":"2022-11-24","arxiv_id":"2211.13793","repositories_listed":1,"syntology":null},{"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/moment-estimation-for-nonparametric-mixture","slug":"moment-estimation-for-nonparametric-mixture","title":"Moment Estimation for Nonparametric Mixture Models Through Implicit Tensor Decomposition","date":"2022-10-25","arxiv_id":"2210.14386","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-performance-modeling-via","slug":"high-dimensional-performance-modeling-via","title":"Application Performance Modeling via Tensor Completion","date":"2022-10-18","arxiv_id":"2210.10184","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-based-decomposition-algorithms-for","slug":"sampling-based-decomposition-algorithms-for","title":"Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks","date":"2022-10-07","arxiv_id":"2210.03828","repositories_listed":1,"syntology":null},{"url":"/paper/behind-the-scenes-of-gradient-descent-a","slug":"behind-the-scenes-of-gradient-descent-a","title":"Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition","date":"2022-10-01","arxiv_id":"2210.00346","repositories_listed":1,"syntology":null},{"url":"/paper/serialized-interacting-mixed-membership","slug":"serialized-interacting-mixed-membership","title":"Serialized Interacting Mixed Membership Stochastic Block Model","date":"2022-09-16","arxiv_id":"2209.07813","repositories_listed":1,"syntology":null},{"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/std-net-search-of-image-steganalytic-deep","slug":"std-net-search-of-image-steganalytic-deep","title":"STD-NET: Search of Image Steganalytic Deep-learning Architecture via Hierarchical Tensor Decomposition","date":"2022-06-12","arxiv_id":"2206.05651","repositories_listed":1,"syntology":null},{"url":"/paper/canonical-convolutional-neural-networks","slug":"canonical-convolutional-neural-networks","title":"Canonical convolutional neural networks","date":"2022-06-03","arxiv_id":"2206.01509","repositories_listed":1,"syntology":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/exploring-extreme-parameter-compression-for-1","slug":"exploring-extreme-parameter-compression-for-1","title":"Exploring Extreme Parameter Compression for Pre-trained Language Models","date":"2022-05-20","arxiv_id":"2205.10036","repositories_listed":1,"syntology":null},{"url":"/paper/on-device-next-item-recommendation-with-self","slug":"on-device-next-item-recommendation-with-self","title":"On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillation","date":"2022-04-23","arxiv_id":"2204.11091","repositories_listed":1,"syntology":null},{"url":"/paper/polynomial-time-sparse-measure-recovery","slug":"polynomial-time-sparse-measure-recovery","title":"Polynomial-time Sparse Measure Recovery: From Mean Field Theory to Algorithm Design","date":"2022-04-16","arxiv_id":"2204.07879","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-reasoning-with-low","slug":"temporal-knowledge-graph-reasoning-with-low","title":"Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations","date":"2022-04-10","arxiv_id":"2204.04783","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-moments-of-gaussian-mixture-models","slug":"tensor-moments-of-gaussian-mixture-models","title":"Tensor Moments of Gaussian Mixture Models: Theory and Applications","date":"2022-02-14","arxiv_id":"2202.06930","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-collaborative-filtering-via-tensor","slug":"consistent-collaborative-filtering-via-tensor","title":"Consistent Collaborative Filtering via Tensor Decomposition","date":"2022-01-28","arxiv_id":"2201.11936","repositories_listed":1,"syntology":null},{"url":"/paper/convergence-and-complexity-of-stochastic","slug":"convergence-and-complexity-of-stochastic","title":"Stochastic regularized majorization-minimization with weakly convex and multi-convex surrogates","date":"2022-01-05","arxiv_id":"2201.01652","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-tensor-decomposition-of-neural","slug":"probabilistic-tensor-decomposition-of-neural","title":"Probabilistic Tensor Decomposition of Neural Population Spiking Activity","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/streaming-generalized-canonical-polyadic","slug":"streaming-generalized-canonical-polyadic","title":"Streaming Generalized Canonical Polyadic Tensor Decompositions","date":"2021-10-27","arxiv_id":"2110.14514","repositories_listed":1,"syntology":null},{"url":"/paper/more-efficient-sampling-for-tensor","slug":"more-efficient-sampling-for-tensor","title":"More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees","date":"2021-10-14","arxiv_id":"2110.07631","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-hierarchical-nonnegative-tensor","slug":"a-generalized-hierarchical-nonnegative-tensor","title":"A Generalized Hierarchical Nonnegative Tensor Decomposition","date":"2021-09-30","arxiv_id":"2109.14820","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-learning-with-fourier-features","slug":"large-scale-learning-with-fourier-features","title":"Large-Scale Learning with Fourier Features and Tensor Decompositions","date":"2021-09-03","arxiv_id":"2109.01545","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multidimensional-functional-data","slug":"efficient-multidimensional-functional-data","title":"Efficient Multidimensional Functional Data Analysis Using Marginal Product Basis Systems","date":"2021-07-30","arxiv_id":"2107.14728","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-decomposition-of-higher-order","slug":"tensor-decomposition-of-higher-order","title":"Tensor decomposition of higher-order correlations by nonlinear Hebbian plasticity","date":"2021-06-29","arxiv_id":"2106.15685","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/tensor-decomposition-of-higher-order#ran","syntology_url":"https://syntology.ai/paper/2106.15685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15685"}},"official":{"repos":["gocker/tensorhebb"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/augmented-tensor-decomposition-with","slug":"augmented-tensor-decomposition-with","title":"ATD: Augmenting CP Tensor Decomposition by Self Supervision","date":"2021-06-15","arxiv_id":"2106.07900","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/augmented-tensor-decomposition-with#ran","syntology_url":"https://syntology.ai/paper/2106.07900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07900"}},"official":{"repos":["ycq091044/atd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/towards-compact-cnns-via-collaborative","slug":"towards-compact-cnns-via-collaborative","title":"Towards Compact CNNs via Collaborative Compression","date":"2021-05-24","arxiv_id":"2105.11228","repositories_listed":1,"syntology":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/searching-to-sparsify-tensor-decomposition","slug":"searching-to-sparsify-tensor-decomposition","title":"Searching to Sparsify Tensor Decomposition for N-ary Relational Data","date":"2021-04-21","arxiv_id":"2104.10625","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-audio-patterns-in-music-with","slug":"uncovering-audio-patterns-in-music-with","title":"Uncovering audio patterns in music with Nonnegative Tucker Decomposition for structural segmentation","date":"2021-04-17","arxiv_id":"2104.08580","repositories_listed":1,"syntology":null},{"url":"/paper/tednet-a-pytorch-toolkit-for-tensor","slug":"tednet-a-pytorch-toolkit-for-tensor","title":"TedNet: A Pytorch Toolkit for Tensor Decomposition Networks","date":"2021-04-11","arxiv_id":"2104.05018","repositories_listed":1,"syntology":null},{"url":"/paper/a-closed-form-solution-to-best-rank-1-tensor","slug":"a-closed-form-solution-to-best-rank-1-tensor","title":"Fast Tucker Rank Reduction for Non-Negative Tensors Using Mean-Field Approximation","date":"2021-03-04","arxiv_id":"2103.02898","repositories_listed":1,"syntology":null},{"url":"/paper/cp-mdp-a-candecomp-parafac-decomposition","slug":"cp-mdp-a-candecomp-parafac-decomposition","title":"CP-MDP: A CANDECOMP-PARAFAC Decomposition Approach to Solve a Markov Decision Process Multidimensional Problem","date":"2021-02-27","arxiv_id":"2103.00331","repositories_listed":1,"syntology":null},{"url":"/paper/network-of-tensor-time-series","slug":"network-of-tensor-time-series","title":"Network of Tensor Time Series","date":"2021-02-15","arxiv_id":"2102.07736","repositories_listed":1,"syntology":null},{"url":"/paper/convergence-of-block-coordinate-descent-with","slug":"convergence-of-block-coordinate-descent-with","title":"Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization","date":"2020-12-07","arxiv_id":"2012.03503","repositories_listed":1,"syntology":null},{"url":"/paper/deep-convolutional-neural-network-compression","slug":"deep-convolutional-neural-network-compression","title":"Deep convolutional neural network compression via coupled tensor decomposition","date":"2020-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":28,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":32,"papers_where_code_ran_first_page":"/task/tensor-decomposition/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":7,"url":"/task/tensor-decomposition/papers/2","json":"/task/tensor-decomposition/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/tensor-decomposition/papers/3","json":"/task/tensor-decomposition/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/tensor-decomposition/papers/4","json":"/task/tensor-decomposition/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/tensor-decomposition/papers/5","json":"/task/tensor-decomposition/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/tensor-decomposition/papers/6","json":"/task/tensor-decomposition/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/tensor-decomposition/papers/7","json":"/task/tensor-decomposition/papers/7.json","rows":18},{"order":"ran","page":1,"of":1,"url":"/task/tensor-decomposition/papers/ran/1","json":"/task/tensor-decomposition/papers/ran/1.json","rows":32}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"ad8bee4f5c8b69582832dcee3d4de79ed0c652e827f700529b57d88e19b531ad","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}