{"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":"/method/tucker","slug":"tucker","name":"TuckER","full_name":"TuckER","full_name_withheld":false,"description_markdown":"TuckER","description_state":"present","introduced_year":null,"introduced_by":{"title":"TuckER: Tensor Factorization for Knowledge Graph Completion","paper":"/paper/tucker-tensor-factorization-for-knowledge","first_author":"Ivana Balažević","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/tucker-tensor-factorization-for-knowledge"},"source":{"url":"https://arxiv.org/abs/1901.09590v2","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":183,"archive_num_papers":183,"papers_newest_first":[{"paper":null,"slug":"score-based-model-for-low-rank-tensor","title":"Score-Based Model for Low-Rank Tensor Recovery","date":"2025-06-27","arxiv_id":"2506.22295","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-scalable-factorization-approach-for-high","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","date":"2025-06-19","arxiv_id":"2506.16032","n_code_links":0,"syntology":null},{"paper":null,"slug":"fieldformer-self-supervised-reconstruction-of","title":"FieldFormer: Self-supervised Reconstruction of Physical Fields via Tensor Attention Prior","date":"2025-06-13","arxiv_id":"2506.11629","n_code_links":0,"syntology":null},{"paper":null,"slug":"tensvd-algorithm-for-compression","title":"tenSVD algorithm for compression","date":"2025-05-27","arxiv_id":"2505.21686","n_code_links":0,"syntology":null},{"paper":"/paper/word-length-predicts-word-order-min-max-ing","slug":"word-length-predicts-word-order-min-max-ing","title":"Word length predicts word order: \"Min-max\"-ing drives language evolution","date":"2025-05-20","arxiv_id":"2505.13913","n_code_links":1,"syntology":null},{"paper":null,"slug":"identifiability-of-nonnegative-tucker","title":"Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory","date":"2025-05-19","arxiv_id":"2505.12713","n_code_links":0,"syntology":null},{"paper":null,"slug":"generating-full-field-evolution-of-physical","title":"Generating Full-field Evolution of Physical Dynamics from Irregular Sparse Observations","date":"2025-05-14","arxiv_id":"2505.09284","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"f-inr-functional-tensor-decomposition-for","title":"F-INR: Functional Tensor Decomposition for Implicit Neural Representations","date":"2025-03-27","arxiv_id":"2503.21507","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-reduced-rank-regression","title":"Higher Order Reduced Rank Regression","date":"2025-03-09","arxiv_id":"2503.06528","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-anomaly-detection-via-tensor-chidori","title":"Robust Anomaly Detection via Tensor Chidori Pseudoskeleton Decomposition","date":"2025-02-14","arxiv_id":"2502.09926","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-tensor-rank-adaptation-of-kolmogorov","title":"Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks","date":"2025-02-10","arxiv_id":"2502.06153","n_code_links":0,"syntology":null},{"paper":"/paper/td3-tucker-decomposition-based-dataset","slug":"td3-tucker-decomposition-based-dataset","title":"TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation","date":"2025-02-05","arxiv_id":"2502.02854","n_code_links":1,"syntology":null},{"paper":null,"slug":"federated-low-rank-tensor-estimation-for","title":"Federated Low-Rank Tensor Estimation for Multimodal Image Reconstruction","date":"2025-02-04","arxiv_id":"2502.02761","n_code_links":0,"syntology":null},{"paper":"/paper/tensorllm-tensorising-multi-head-attention","slug":"tensorllm-tensorising-multi-head-attention","title":"TensorLLM: Tensorising Multi-Head Attention for Enhanced Reasoning and Compression in LLMs","date":"2025-01-26","arxiv_id":"2501.15674","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-head-self-attending-neural-tucker","title":"Multi-Head Self-Attending Neural Tucker Factorization","date":"2025-01-16","arxiv_id":"2501.09776","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-downlink-uplink-channel-estimation-for","title":"Joint Downlink-Uplink Channel Estimation for Non-Reciprocal RIS-Assisted Communications","date":"2024-12-20","arxiv_id":"2412.16301","n_code_links":0,"syntology":null},{"paper":null,"slug":"cnn-explainability-with-multivector-tucker","title":"CNN Explainability with Multivector Tucker Saliency Maps for Self-Supervised Models","date":"2024-10-30","arxiv_id":"2410.23072","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-limits-of-transfer-reinforcement-learning","title":"The Limits of Transfer Reinforcement Learning with Latent Low-rank Structure","date":"2024-10-28","arxiv_id":"2410.21601","n_code_links":0,"syntology":null},{"paper":null,"slug":"doubly-non-central-beta-matrix-factorization-1","title":"Doubly Non-Central Beta Matrix Factorization for Stable Dimensionality Reduction of Bounded Support Matrix Data","date":"2024-10-24","arxiv_id":"2410.18425","n_code_links":0,"syntology":null},{"paper":null,"slug":"statistical-inference-in-tensor-completion","title":"Statistical Inference in Tensor Completion: Optimal Uncertainty Quantification and Statistical-to-Computational Gaps","date":"2024-10-15","arxiv_id":"2410.11225","n_code_links":0,"syntology":null},{"paper":"/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,"n_code_links":1,"syntology":null},{"paper":null,"slug":"emf-aware-waveform-for-dual-functional-radar","title":"EMF-Aware Waveform for Dual-functional Radar Communication Systems","date":"2024-09-24","arxiv_id":"2409.15956","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-hyperspectral-and-multispectral-1","slug":"unsupervised-hyperspectral-and-multispectral-1","title":"Unsupervised Hyperspectral and Multispectral Image Blind Fusion Based on Deep Tucker Decomposition Network with Spatial-Spectral Manifold Learning","date":"2024-09-15","arxiv_id":"2409.09670","n_code_links":1,"syntology":null},{"paper":"/paper/tensor-based-synchronization-and-the-low","slug":"tensor-based-synchronization-and-the-low","title":"Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor","date":"2024-09-14","arxiv_id":"2409.09313","n_code_links":1,"syntology":null},{"paper":null,"slug":"lorid-low-rank-iterative-diffusion-for","title":"LoRID: Low-Rank Iterative Diffusion for Adversarial Purification","date":"2024-09-12","arxiv_id":"2409.08255","n_code_links":0,"syntology":null},{"paper":null,"slug":"revisiting-trace-norm-minimization-for-tensor","title":"Revisiting Trace Norm Minimization for Tensor Tucker Completion: A Direct Multilinear Rank Learning Approach","date":"2024-09-08","arxiv_id":"2409.05139","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"channel-estimation-for-beyond-diagonal-ris","title":"Channel Estimation for Beyond Diagonal RIS via Tensor Decomposition","date":"2024-07-29","arxiv_id":"2407.20402","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"spiking-tucker-fusion-transformer-for-audio","title":"Spiking Tucker Fusion Transformer for Audio-Visual Zero-Shot Learning","date":"2024-07-11","arxiv_id":"2407.08130","n_code_links":0,"syntology":null},{"paper":null,"slug":"oblivious-subspace-embeddings-for-compressed","title":"Oblivious subspace embeddings for compressed Tucker decompositions","date":"2024-06-13","arxiv_id":"2406.09387","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-multi-resolution-low-rank-tensor","title":"A Multi-resolution Low-rank Tensor Decomposition","date":"2024-05-27","arxiv_id":"2406.18560","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":4,"n_instrument":0,"unverified":4,"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","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"]}}},{"paper":null,"slug":"characterizing-the-accuracy-efficiency-trade","title":"Characterizing the Accuracy -- Efficiency Trade-off of Low-rank Decomposition in Language Models","date":"2024-05-10","arxiv_id":"2405.06626","n_code_links":0,"syntology":null},{"paper":"/paper/coefficient-decomposition-for-spectral-graph","slug":"coefficient-decomposition-for-spectral-graph","title":"Coefficient Decomposition for Spectral Graph Convolution","date":"2024-05-06","arxiv_id":"2405.03296","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"low-rank-robust-subspace-tensor-clustering","title":"Low-Rank Robust Subspace Tensor Clustering for Metro Passenger Flow Modeling","date":"2024-04-05","arxiv_id":"2404.04403","n_code_links":0,"syntology":null},{"paper":null,"slug":"functional-edged-network-modeling","title":"Functional-Edged Network Modeling","date":"2024-03-30","arxiv_id":"2404.00218","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-algorithms-for-regularized","slug":"efficient-algorithms-for-regularized","title":"Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models","date":"2024-03-27","arxiv_id":"2403.18517","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"black-box-approximation-and-optimization-with","title":"Black-Box Approximation and Optimization with Hierarchical Tucker Decomposition","date":"2024-02-05","arxiv_id":"2402.02890","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"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","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"]}}},{"paper":"/paper/dynamic-collaborative-filtering-for-matrix","slug":"dynamic-collaborative-filtering-for-matrix","title":"Dynamic Collaborative Filtering for Matrix- and Tensor-based Recommender Systems","date":"2023-12-04","arxiv_id":"2312.10064","n_code_links":1,"syntology":null},{"paper":"/paper/functional-bayesian-tucker-decomposition-for","slug":"functional-bayesian-tucker-decomposition-for","title":"Functional Bayesian Tucker Decomposition for Continuous-indexed Tensor Data","date":"2023-11-08","arxiv_id":"2311.04829","n_code_links":1,"syntology":null},{"paper":null,"slug":"probabilistic-block-term-decomposition-for","title":"Probabilistic Block Term Decomposition for the Modelling of Higher-Order Arrays","date":"2023-10-04","arxiv_id":"2310.02694","n_code_links":0,"syntology":null},{"paper":null,"slug":"nonconvex-third-order-tensor-recovery-based","title":"Low-rank tensor completion via tensor joint rank with logarithmic composite norm","date":"2023-09-28","arxiv_id":"2309.16208","n_code_links":0,"syntology":null},{"paper":"/paper/multi-dictionary-tensor-decomposition","slug":"multi-dictionary-tensor-decomposition","title":"Multi-Dictionary Tensor Decomposition","date":"2023-09-18","arxiv_id":"2309.09717","n_code_links":1,"syntology":null},{"paper":null,"slug":"personalized-tucker-decomposition-modeling","title":"Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data","date":"2023-09-07","arxiv_id":"2309.03439","n_code_links":0,"syntology":null},{"paper":null,"slug":"computation-and-communication-efficient","title":"Adaptive Model Pruning and Personalization for Federated Learning over Wireless Networks","date":"2023-09-04","arxiv_id":"2309.01816","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-low-rank-tensors-for-generalized","title":"Structured Low-Rank Tensors for Generalized Linear Models","date":"2023-08-05","arxiv_id":"2308.02922","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-tensor-decomposition-of-arbitrary","title":"Multidimensional Data Analysis Based on Block Convolutional Tensor Decomposition","date":"2023-08-03","arxiv_id":"2308.01768","n_code_links":0,"syntology":null},{"paper":"/paper/tuckerdncaching-high-quality-negative","slug":"tuckerdncaching-high-quality-negative","title":"TuckerDNCaching: high-quality negative sampling with tucker decomposition","date":"2023-06-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"tensor-decomposition-for-minimization-of-e2e","title":"Tensor decomposition for minimization of E2E SLU model toward on-device processing","date":"2023-06-02","arxiv_id":"2306.01247","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-adaptive-spectral-pruning-of","title":"Geometry-aware training of factorized layers in tensor Tucker format","date":"2023-05-30","arxiv_id":"2305.19059","n_code_links":0,"syntology":null},{"paper":"/paper/how-to-turn-your-knowledge-graph-embeddings-1","slug":"how-to-turn-your-knowledge-graph-embeddings-1","title":"How to Turn Your Knowledge Graph Embeddings into Generative Models","date":"2023-05-25","arxiv_id":"2305.15944","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-federated-pruning-in-hierarchical","title":"Adaptive Federated Pruning in Hierarchical Wireless Networks","date":"2023-05-15","arxiv_id":"2305.09042","n_code_links":0,"syntology":null},{"paper":null,"slug":"manifold-regularized-tucker-decomposition","title":"Spatiotemporal Regularized Tucker Decomposition Approach for Traffic Data Imputation","date":"2023-05-11","arxiv_id":"2305.06563","n_code_links":0,"syntology":null},{"paper":"/paper/robust-tensor-cur-decompositions-rapid-low","slug":"robust-tensor-cur-decompositions-rapid-low","title":"Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption","date":"2023-05-06","arxiv_id":"2305.04080","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-incomplete-tensor-tucker-decomposition","title":"An Incomplete Tensor Tucker decomposition based Traffic Speed Prediction Method","date":"2023-04-21","arxiv_id":"2304.10961","n_code_links":0,"syntology":null},{"paper":null,"slug":"salsa-a-sequential-alternating-least-squares","title":"SALSA: A Sequential Alternating Least Squares Approximation Method For MIMO Channel Estimation","date":"2023-04-13","arxiv_id":"2304.06643","n_code_links":0,"syntology":null},{"paper":null,"slug":"solving-tensor-low-cycle-rank-approximation","title":"Solving Tensor Low Cycle Rank Approximation","date":"2023-04-13","arxiv_id":"2304.06594","n_code_links":0,"syntology":null},{"paper":null,"slug":"statistical-and-computational-rates-in-high","title":"Statistical and computational rates in high rank tensor estimation","date":"2023-04-08","arxiv_id":"2304.04043","n_code_links":0,"syntology":null},{"paper":null,"slug":"tucker-bilinear-attention-network-for-multi","title":"Tucker Bilinear Attention Network for Multi-scale Remote Sensing Object Detection","date":"2023-03-09","arxiv_id":"2303.05329","n_code_links":0,"syntology":null},{"paper":null,"slug":"noise-augmented-ell-0-regularization-of","title":"Noise-Augmented $\\ell_0$ Regularization of Tensor Regression with Tucker Decomposition","date":"2023-02-19","arxiv_id":"2302.10775","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-weighted-subspace-exponential-kernel-for","title":"A weighted subspace exponential kernel for support tensor machines","date":"2023-02-16","arxiv_id":"2302.08134","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-architecture-search-with-multimodal","title":"Neural Architecture Search with Multimodal Fusion Methods for Diagnosing Dementia","date":"2023-02-12","arxiv_id":"2302.05894","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximately-optimal-core-shapes-for-tensor","title":"Approximately Optimal Core Shapes for Tensor Decompositions","date":"2023-02-08","arxiv_id":"2302.03886","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-pre-training-framework-for-knowledge-graph","title":"A Pre-training Framework for Knowledge Graph Completion","date":"2023-02-06","arxiv_id":"2302.02614","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatial-temporal-traffic-modeling-with-a","title":"Spatial-temporal traffic modeling with a fusion graph reconstructed by tensor decomposition","date":"2022-12-12","arxiv_id":"2212.05653","n_code_links":0,"syntology":null},{"paper":"/paper/the-ordered-matrix-dirichlet-for-modeling","slug":"the-ordered-matrix-dirichlet-for-modeling","title":"The Ordered Matrix Dirichlet for State-Space Models","date":"2022-12-08","arxiv_id":"2212.04130","n_code_links":1,"syntology":null},{"paper":null,"slug":"algorithm-and-hardware-co-design-of-energy","title":"Algorithm and Hardware Co-Design of Energy-Efficient LSTM Networks for Video Recognition with Hierarchical Tucker Tensor Decomposition","date":"2022-12-05","arxiv_id":"2212.02046","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-efficient-and-accurate-approximation","title":"Towards Efficient and Accurate Approximation: Tensor Decomposition Based on Randomized Block Krylov Iteration","date":"2022-11-27","arxiv_id":"2211.14828","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-manifold-nonnegative-tucker","title":"Robust Manifold Nonnegative Tucker Factorization for Tensor Data Representation","date":"2022-11-08","arxiv_id":"2211.03934","n_code_links":0,"syntology":null},{"paper":null,"slug":"tucker-o-minus-decomposition-for-multi-view","title":"Tucker-O-Minus Decomposition for Multi-view Tensor Subspace Clustering","date":"2022-10-23","arxiv_id":"2210.12638","n_code_links":0,"syntology":null},{"paper":null,"slug":"sekron-a-decomposition-method-supporting-many","title":"SeKron: A Decomposition Method Supporting Many Factorization Structures","date":"2022-10-12","arxiv_id":"2210.06299","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-supervised-denoising-via-low-rank-tensor","title":"Enhancing convolutional neural network generalizability via low-rank weight approximation","date":"2022-09-26","arxiv_id":"2209.12715","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":16,"of":17,"n_ran_checked":16,"n_instrument":0,"unverified":1,"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","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"]}}},{"paper":null,"slug":"learning-generative-embeddings-using-an","title":"Sample Efficient Learning of Factored Embeddings of Tensor Fields","date":"2022-09-01","arxiv_id":"2209.00372","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-nonnegative-tucker-decomposition-and","title":"Noisy Nonnegative Tucker Decomposition with Sparse Factors and Missing Data","date":"2022-08-17","arxiv_id":"2208.08287","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-estimation-for-binary-latent","title":"Gradient Estimation for Binary Latent Variables via Gradient Variance Clipping","date":"2022-08-12","arxiv_id":"2208.06124","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-rank-approximation-for-general-tensor","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","date":"2022-07-15","arxiv_id":"2207.07417","n_code_links":0,"syntology":null},{"paper":null,"slug":"information-compression-and-performance","title":"Information Compression and Performance Evaluation of Tic-Tac-Toe's Evaluation Function Using Singular Value Decomposition","date":"2022-07-06","arxiv_id":"2207.02449","n_code_links":0,"syntology":null},{"paper":"/paper/fast-and-provable-tensor-robust-principal","slug":"fast-and-provable-tensor-robust-principal","title":"Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descent","date":"2022-06-18","arxiv_id":"2206.09109","n_code_links":1,"syntology":null},{"paper":"/paper/tensor-on-tensor-regression-riemannian","slug":"tensor-on-tensor-regression-riemannian","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","date":"2022-06-17","arxiv_id":"2206.08756","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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","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"]}}},{"paper":null,"slug":"high-order-multilinear-discriminant-analysis","title":"High-Order Multilinear Discriminant Analysis via Order-$\\textit{n}$ Tensor Eigendecomposition","date":"2022-05-18","arxiv_id":"2205.09191","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-smoothness-incorporating-low-rank-1","title":"Beyond Smoothness: Incorporating Low-Rank Analysis into Nonparametric Density Estimation","date":"2022-04-02","arxiv_id":"2204.00930","n_code_links":0,"syntology":null},{"paper":null,"slug":"smooth-robust-tensor-completion-for","title":"Smooth Robust Tensor Completion for Background/Foreground Separation with Missing Pixels: Novel Algorithm with Convergence Guarantee","date":"2022-03-29","arxiv_id":"2203.16328","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-framework-for-rank-based-evaluation","slug":"a-unified-framework-for-rank-based-evaluation","title":"A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs","date":"2022-03-14","arxiv_id":"2203.07544","n_code_links":2,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["pykeen/pykeen","pykeen/ranking-metrics-manuscript"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"how-to-train-unstable-looped-tensor-network","title":"How to Train Unstable Looped Tensor Network","date":"2022-03-05","arxiv_id":"2203.02617","n_code_links":0,"syntology":null},{"paper":"/paper/single-uhd-image-dehazing-via-interpretable","slug":"single-uhd-image-dehazing-via-interpretable","title":"Single UHD Image Dehazing via Interpretable Pyramid Network","date":"2022-02-17","arxiv_id":"2202.08589","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":null}},{"paper":null,"slug":"low-rank-phase-retrieval-with-structured","title":"Low-Rank Phase Retrieval with Structured Tensor Models","date":"2022-02-15","arxiv_id":"2202.08260","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-representations-of-entities-and","title":"Learning Representations of Entities and Relations","date":"2022-01-31","arxiv_id":"2201.13073","n_code_links":0,"syntology":null},{"paper":null,"slug":"2d-3d-facial-expression-recognition-via-1","title":"2D+3D facial expression recognition via embedded tensor manifold regularization","date":"2022-01-29","arxiv_id":"2201.12506","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-joint-morphological-profiles-and-patch","title":"A Joint Morphological Profiles and Patch Tensor Change Detection for Hyperspectral Imagery","date":"2022-01-20","arxiv_id":"2201.08027","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-algorithm-for-low-rank-tensor-completion","title":"Fast Algorithm for Low-Rank Tensor Completion in Delay-Embedded Space","date":"2022-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-rank-adaptive-higher-order-orthogonal","title":"A rank-adaptive higher-order orthogonal iteration algorithm for truncated Tucker decomposition","date":"2021-10-25","arxiv_id":"2110.12564","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":183,"with_a_code_link":51,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":183,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":4,"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"},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/method/tucker/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":2,"url":"/method/tucker/papers/2","json":"/method/tucker/papers/2.json","rows":83},{"order":"ran","page":1,"of":1,"url":"/method/tucker/papers/ran/1","json":"/method/tucker/papers/ran/1.json","rows":8}],"tasks":[{"task":"/task/tensor-decomposition","name":"Tensor Decomposition","papers":62},{"task":"/task/link-prediction","name":"Link Prediction","papers":13},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":10},{"task":"/task/regression-1","name":"regression","papers":10},{"task":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","papers":9},{"task":"/task/denoising","name":"Denoising","papers":8},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":8},{"task":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding","papers":6},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":5},{"task":"/task/image-classification","name":"Image Classification","papers":5},{"task":"/task/prediction","name":"Prediction","papers":5},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":5},{"task":"/task/tensor-networks","name":"Tensor Networks","papers":5},{"task":"/task/model-compression","name":"Model Compression","papers":4},{"task":"/task/riemannian-optimization","name":"Riemannian optimization","papers":4},{"task":"/task/clustering","name":"Clustering","papers":3},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":3},{"task":"/task/federated-learning","name":"Federated Learning","papers":3},{"task":null,"name":"GPU","papers":3},{"task":"/task/classification","name":"General Classification","papers":3}],"tasks_shown":20,"n_tasks":137,"usage_by_year":[{"year":"2019","papers":28},{"year":"2020","papers":32},{"year":"2021","papers":25},{"year":"2022","papers":28},{"year":"2023","papers":26},{"year":"2024","papers":28},{"year":"2025","papers":16}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/tucker"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=TuckER","read_at":"2026-10-05T01:03:16+00:00","query":"TuckER","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1901.09590"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1901.09590","repositories":{"listed":5,"in_graph":5,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1901.09590","citations":908},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'TuckER'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1901.09590","page":"/paper/tucker-tensor-factorization-for-knowledge","syntology_url":"https://syntology.ai/paper/1901.09590","in_graph_layer":false,"samples":0},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 5 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:1901.09590, not a method entry. This answer is about arXiv:1901.09590, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"8c1f4be948871b35e507603ebb6a248ec6fa52524ce788ec16911479664d1a1d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}