{"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/papers/2","list_of":"/method/tucker","method":"TuckER","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,183],"of":183,"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"},"first_page":"/method/tucker","prev":"/method/tucker","next":null,"papers":[{"paper":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","n_code_links":1,"syntology":null},{"paper":null,"slug":"applying-differential-privacy-to-tensor","title":"Applying Differential Privacy to Tensor Completion","date":"2021-10-01","arxiv_id":"2110.00539","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-tensor-product-based-tensordecomposition","title":"Semi-tensor Product-based TensorDecomposition for Neural Network Compression","date":"2021-09-30","arxiv_id":"2109.15200","n_code_links":0,"syntology":null},{"paper":null,"slug":"tuformer-data-driven-design-of-expressive","title":"Tuformer: Data-Driven Design of Expressive Transformer by Tucker Tensor Representation","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"tensor-full-feature-measure-and-its-nonconvex","title":"Tensor Full Feature Measure and Its Nonconvex Relaxation Applications to Tensor Recovery","date":"2021-09-25","arxiv_id":"2109.12257","n_code_links":0,"syntology":null},{"paper":null,"slug":"provable-tensor-train-format-tensor","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","date":"2021-08-27","arxiv_id":"2108.12163","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-low-rank-tensor-decomposition-by-ridge","title":"Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling","date":"2021-07-22","arxiv_id":"2107.10654","n_code_links":0,"syntology":null},{"paper":null,"slug":"implicit-regularization-in-deep-tensor","title":"Implicit Regularization in Deep Tensor Factorization","date":"2021-05-04","arxiv_id":"2105.01346","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-tensor-independent-component","title":"Higher-order tensor independent component analysis to realize MIMO remote sensing of respiration and heartbeat signals","date":"2021-05-03","arxiv_id":"2105.00723","n_code_links":0,"syntology":null},{"paper":"/paper/scaling-and-scalability-provable-nonconvex","slug":"scaling-and-scalability-provable-nonconvex","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","date":"2021-04-29","arxiv_id":"2104.14526","n_code_links":1,"syntology":null},{"paper":"/paper/low-rank-tensor-estimation-via-riemannian","slug":"low-rank-tensor-estimation-via-riemannian","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","date":"2021-04-24","arxiv_id":"2104.12031","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-extremely-compact-rnns-for-video","title":"Towards Extremely Compact RNNs for Video Recognition with Fully Decomposed Hierarchical Tucker Structure","date":"2021-04-12","arxiv_id":"2104.05758","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-novel-unified-model-for-multi-exposure","title":"A Novel Unified Model for Multi-exposure Stereo Coding Based on Low Rank Tucker-ALS and 3D-HEVC","date":"2021-04-10","arxiv_id":"2104.04726","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-accurate-randomized-algorithms-for","title":"Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions","date":"2021-04-02","arxiv_id":"2104.01101","n_code_links":0,"syntology":null},{"paper":"/paper/spatial-temporal-tensor-graph-convolutional","slug":"spatial-temporal-tensor-graph-convolutional","title":"Spatial-Temporal Tensor Graph Convolutional Network for Traffic Prediction","date":"2021-03-10","arxiv_id":"2103.06126","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"beyond-the-signs-nonparametric-tensor","title":"Beyond the Signs: Nonparametric Tensor Completion via Sign Series","date":"2021-01-31","arxiv_id":"2102.00384","n_code_links":0,"syntology":null},{"paper":"/paper/compressive-spectral-image-reconstruction","slug":"compressive-spectral-image-reconstruction","title":"Compressive Spectral Image Reconstruction using Deep Prior and Low-Rank Tensor Representation","date":"2021-01-19","arxiv_id":"2101.07424","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-compressed-convolution-neural","title":"Rethinking Compressed Convolution Neural Network from a Statistical Perspective","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"ultra-high-definition-image-hdr","title":"Ultra-High-Definition Image HDR Reconstruction via Collaborative Bilateral Learning","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"inference-for-low-rank-tensors-no-need-to","title":"Inference for Low-rank Tensors -- No Need to Debias","date":"2020-12-29","arxiv_id":"2012.14844","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-mode-core-tensor-factorization-based","title":"Multi-mode Core Tensor Factorization based Low-Rankness and Its Applications to Tensor Completion","date":"2020-12-03","arxiv_id":"2012.01918","n_code_links":0,"syntology":null},{"paper":"/paper/tucker-decomposition-based-temporal-knowledge","slug":"tucker-decomposition-based-temporal-knowledge","title":"Tucker decomposition-based Temporal Knowledge Graph Completion","date":"2020-11-16","arxiv_id":"2011.07751","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-physical-common-sense-as-knowledge","title":"Learning Physical Common Sense as Knowledge Graph Completion via BERT Data Augmentation and Constrained Tucker Factorization","date":"2020-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"tensor-completion-via-tensor-networks-with-a","title":"Tensor Completion via Tensor Networks with a Tucker Wrapper","date":"2020-10-29","arxiv_id":"2010.15819","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-symmetric-tensor-regression-for","title":"Sparse Symmetric Tensor Regression for Functional Connectivity Analysis","date":"2020-10-28","arxiv_id":"2010.14700","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-tucker-input-adaptive-and-matricization","title":"a-Tucker: Input-Adaptive and Matricization-Free Tucker Decomposition for Dense Tensors on CPUs and GPUs","date":"2020-10-20","arxiv_id":"2010.10131","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-nonparametric-density-estimation","title":"Improving Nonparametric Density Estimation with Tensor Decompositions","date":"2020-10-06","arxiv_id":"2010.02425","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-rank-and-sparse-enhanced-tucker","title":"Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion","date":"2020-10-01","arxiv_id":"2010.00359","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-compression-of-translation-operator","title":"On the Compression of Translation Operator Tensors in FMM-FFT-Accelerated SIE Simulators via Tensor Decompositions","date":"2020-09-25","arxiv_id":"2010.00520","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-synergy-between-nonconvex-extensions","title":"On The Synergy Between Nonconvex Extensions of The Tensor Nuclear Norm for Tensor Recovery","date":"2020-09-08","arxiv_id":"2009.03503","n_code_links":0,"syntology":null},{"paper":"/paper/lowfer-low-rank-bilinear-pooling-for-link","slug":"lowfer-low-rank-bilinear-pooling-for-link","title":"LowFER: Low-rank Bilinear Pooling for Link Prediction","date":"2020-08-25","arxiv_id":"2008.10858","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"0 ran · 3 unverified","official":{"repos":["suamin/LowFER"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":null,"slug":"kronecker-cp-decomposition-with-fast","title":"Kronecker CP Decomposition with Fast Multiplication for Compressing RNNs","date":"2020-08-21","arxiv_id":"2008.09342","n_code_links":0,"syntology":null},{"paper":"/paper/convolutional-complex-knowledge-graph","slug":"convolutional-complex-knowledge-graph","title":"Convolutional Complex Knowledge Graph Embeddings","date":"2020-08-07","arxiv_id":"2008.03130","n_code_links":2,"syntology":null},{"paper":null,"slug":"nonnegative-low-rank-tensor-approximation-and","title":"Nonnegative Low Rank Tensor Approximation and its Application to Multi-dimensional Images","date":"2020-07-28","arxiv_id":"2007.14137","n_code_links":0,"syntology":null},{"paper":"/paper/generalizing-tensor-decomposition-for-n-ary","slug":"generalizing-tensor-decomposition-for-n-ary","title":"Generalizing Tensor Decomposition for N-ary Relational Knowledge Bases","date":"2020-07-08","arxiv_id":"2007.03988","n_code_links":1,"syntology":null},{"paper":null,"slug":"consistency-of-muscle-synergies-extracted-via","title":"Consistency of Muscle Synergies Extracted via Higher-Order Tensor Decomposition Towards Myoelectric Control","date":"2020-07-03","arxiv_id":"2007.01944","n_code_links":0,"syntology":null},{"paper":null,"slug":"coupled-tensor-decomposition-for","title":"Coupled Tensor Decomposition for Hyperspectral and Multispectral Image Fusion with Inter-Image Variability","date":"2020-06-30","arxiv_id":"2006.16968","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-tensor-decomposition-in-neural-network","title":"Hybrid Tensor Decomposition in Neural Network Compression","date":"2020-06-29","arxiv_id":"2006.15938","n_code_links":0,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","n_code_links":2,"syntology":null},{"paper":null,"slug":"optimization-landscape-of-tucker","title":"Optimization Landscape of Tucker Decomposition","date":"2020-06-29","arxiv_id":"2006.16297","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperspectral-super-resolution-via","title":"Hyperspectral Super-Resolution via Interpretable Block-Term Tensor Modeling","date":"2020-06-18","arxiv_id":"2006.10248","n_code_links":0,"syntology":null},{"paper":"/paper/generalising-recursive-neural-models-by","slug":"generalising-recursive-neural-models-by","title":"Generalising Recursive Neural Models by Tensor Decomposition","date":"2020-06-17","arxiv_id":"2006.10021","n_code_links":1,"syntology":null},{"paper":null,"slug":"cnn-acceleration-by-low-rank-approximation","title":"CNN Acceleration by Low-rank Approximation with Quantized Factors","date":"2020-06-16","arxiv_id":"2006.08878","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressing-recurrent-neural-networks-using","title":"Compressing Recurrent Neural Networks Using Hierarchical Tucker Tensor Decomposition","date":"2020-05-09","arxiv_id":"2005.04366","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-multilayer-network-construction-via","title":"A new multilayer network construction via Tensor learning","date":"2020-04-11","arxiv_id":"2004.05367","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-alternating-least-squares","title":"Efficient Alternating Least Squares Algorithms for Low Multilinear Rank Approximation of Tensors","date":"2020-04-06","arxiv_id":"2004.02583","n_code_links":0,"syntology":null},{"paper":null,"slug":"hotcake-higher-order-tucker-articulated","title":"HOTCAKE: Higher Order Tucker Articulated Kernels for Deeper CNN Compression","date":"2020-02-28","arxiv_id":"2002.12663","n_code_links":0,"syntology":null},{"paper":"/paper/block-hankel-tensor-arima-for-multiple-short","slug":"block-hankel-tensor-arima-for-multiple-short","title":"Block Hankel Tensor ARIMA for Multiple Short Time Series Forecasting","date":"2020-02-25","arxiv_id":"2002.12135","n_code_links":1,"syntology":null},{"paper":null,"slug":"predicting-multidimensional-data-via-tensor","title":"Predicting Multidimensional Data via Tensor Learning","date":"2020-02-11","arxiv_id":"2002.04328","n_code_links":0,"syntology":null},{"paper":null,"slug":"compression-of-convolutional-neural-networks","title":"Compression of descriptor models for mobile applications","date":"2020-01-09","arxiv_id":"2001.03102","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperspectral-super-resolution-via-coupled","title":"Hyperspectral Super-Resolution via Coupled Tensor Ring Factorization","date":"2020-01-06","arxiv_id":"2001.01547","n_code_links":0,"syntology":null},{"paper":null,"slug":"singleshot-a-scalable-tucker-tensor","title":"Singleshot : a scalable Tucker tensor decomposition","date":"2019-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"unveil-stock-correlation-via-a-new-tensor","title":"Unveil stock correlation via a new tensor-based decomposition method","date":"2019-11-14","arxiv_id":"1911.06126","n_code_links":0,"syntology":null},{"paper":null,"slug":"islet-fast-and-optimal-low-rank-tensor","title":"ISLET: Fast and Optimal Low-rank Tensor Regression via Importance Sketching","date":"2019-11-09","arxiv_id":"1911.03804","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-deep-neural-networks-via-low-rank-1","slug":"scalable-deep-neural-networks-via-low-rank-1","title":"Decomposable-Net: Scalable Low-Rank Compression for Neural Networks","date":"2019-10-29","arxiv_id":"1910.13141","n_code_links":1,"syntology":null},{"paper":null,"slug":"orthogonal-nonnegative-tucker-decomposition","title":"Orthogonal Nonnegative Tucker Decomposition","date":"2019-10-21","arxiv_id":"1910.09979","n_code_links":0,"syntology":null},{"paper":null,"slug":"compact-autoregressive-network","title":"Compact Autoregressive Network","date":"2019-09-06","arxiv_id":"1909.03830","n_code_links":0,"syntology":null},{"paper":"/paper/recovery-of-future-data-via-convolution","slug":"recovery-of-future-data-via-convolution","title":"Recovery of Future Data via Convolution Nuclear Norm Minimization","date":"2019-09-06","arxiv_id":"1909.03889","n_code_links":1,"syntology":null},{"paper":null,"slug":"tensor-oriented-no-reference-light-field","title":"Tensor Oriented No-Reference Light Field Image Quality Assessment","date":"2019-09-05","arxiv_id":"1909.02358","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-tensor-recovery-with-fiber-outliers","title":"Robust Tensor Recovery with Fiber Outliers for Traffic Events","date":"2019-08-27","arxiv_id":"1908.10198","n_code_links":0,"syntology":null},{"paper":null,"slug":"iterative-hard-thresholding-for-low-cp-rank","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","date":"2019-08-22","arxiv_id":"1908.08479","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-relationship-between-variational","title":"On importance-weighted autoencoders","date":"2019-07-24","arxiv_id":"1907.10477","n_code_links":0,"syntology":null},{"paper":null,"slug":"ada-tucker-compressing-deep-neural-networks","title":"ADA-Tucker: Compressing Deep Neural Networks via Adaptive Dimension Adjustment Tucker Decomposition","date":"2019-06-18","arxiv_id":"1906.07671","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-low-rank-tensor-recovery","title":"Optimal low rank tensor recovery","date":"2019-06-12","arxiv_id":"1906.05346","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-tensor-factorisation-for-bottom-up","title":"Bayesian Tensor Factorisation for Bottom-up Hidden Tree Markov Models","date":"2019-05-31","arxiv_id":"1905.13528","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-low-rank-approximation-for-cnns","title":"Learning Low-Rank Approximation for CNNs","date":"2019-05-24","arxiv_id":"1905.10145","n_code_links":0,"syntology":null},{"paper":null,"slug":"tucker-decomposition-network-expressive-power","title":"Tucker Decomposition Network: Expressive Power and Comparison","date":"2019-05-23","arxiv_id":"1905.09635","n_code_links":0,"syntology":null},{"paper":null,"slug":"misc-mixed-strategies-crowdsourcing","title":"MiSC: Mixed Strategies Crowdsourcing","date":"2019-05-17","arxiv_id":"1905.07394","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-the-linear-fascicle-evaluation","title":"Optimizing the Linear Fascicle Evaluation Algorithm for Multi-Core and Many-Core Systems","date":"2019-05-14","arxiv_id":"1905.06234","n_code_links":0,"syntology":null},{"paper":null,"slug":"190500702","title":"Understanding Urban Dynamics via Context-aware Tensor Factorization with Neighboring Regularization","date":"2019-04-25","arxiv_id":"1905.00702","n_code_links":0,"syntology":null},{"paper":"/paper/low-rank-tucker-approximation-of-a-tensor","slug":"low-rank-tucker-approximation-of-a-tensor","title":"Low-Rank Tucker Approximation of a Tensor From Streaming Data","date":"2019-04-24","arxiv_id":"1904.10951","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tensorsketch/tensorsketch"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/multi-branch-tensor-network-structure-for","slug":"multi-branch-tensor-network-structure-for","title":"Multi-Branch Tensor Network Structure for Tensor-Train Discriminant Analysis","date":"2019-04-15","arxiv_id":"1904.06788","n_code_links":1,"syntology":null},{"paper":null,"slug":"incremental-multi-domain-learning-with","title":"Incremental multi-domain learning with network latent tensor factorization","date":"2019-04-12","arxiv_id":"1904.06345","n_code_links":0,"syntology":null},{"paper":null,"slug":"muscle-activity-analysis-using-higher-order","title":"Muscle Activity Analysis using Higher-Order Tensor Models: Application to Muscle Synergy Identification","date":"2019-03-23","arxiv_id":"1806.01783","n_code_links":0,"syntology":null},{"paper":null,"slug":"tucker-tensor-layer-in-fully-connected-neural","title":"Compression and Interpretability of Deep Neural Networks via Tucker Tensor Layer: From First Principles to Tensor Valued Back-Propagation","date":"2019-03-14","arxiv_id":"1903.06133","n_code_links":0,"syntology":null},{"paper":null,"slug":"point-cloud-denoising-based-on-tensor-tucker","title":"Point cloud denoising based on tensor Tucker decomposition","date":"2019-02-20","arxiv_id":"1902.07602","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"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":{"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"]}}},{"paper":null,"slug":"multi-dimensional-tensor-sketch","title":"Higher-order Count Sketch: Dimensionality Reduction That Retains Efficient Tensor Operations","date":"2019-01-31","arxiv_id":"1901.11261","n_code_links":0,"syntology":null},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","n_code_links":5,"syntology":null}],"record_sha256":"e131bc23fdc321ef4c9180dd04af947de790819293072ad5f93a9579642e616a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}