{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/tensor-decomposition/papers/2","list_of":"/task/tensor-decomposition","task":"Tensor Decomposition","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":7,"rows_per_page":100,"rows":[101,200],"of":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"},"first_page":"/task/tensor-decomposition","prev":"/task/tensor-decomposition","next":"/task/tensor-decomposition/papers/3","papers":[{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-non-binary-constituency-trees","slug":"learning-from-non-binary-constituency-trees","title":"Learning from Non-Binary Constituency Trees via Tensor Decomposition","date":"2020-11-02","arxiv_id":"2011.00860","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-variational-bayesian-training-of","slug":"end-to-end-variational-bayesian-training-of","title":"Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination","date":"2020-10-17","arxiv_id":"2010.08689","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-variational-bayesian-training-of#ran","syntology_url":"https://syntology.ai/paper/2010.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08689"}},"official":{"repos":["colehawkins/bayesian-tensor-rank-determination"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-nonnegative-matrix-and-tensor","slug":"on-nonnegative-matrix-and-tensor","title":"Sparseness-constrained Nonnegative Tensor Factorization for Detecting Topics at Different Time Scales","date":"2020-10-04","arxiv_id":"2010.01600","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-all-way-boolean-tensor","slug":"geometric-all-way-boolean-tensor","title":"Geometric All-Way Boolean Tensor Decomposition","date":"2020-07-31","arxiv_id":"2007.15821","repositories_listed":1,"syntology":null},{"url":"/paper/additive-tensor-decomposition-considering","slug":"additive-tensor-decomposition-considering","title":"Additive Tensor Decomposition Considering Structural Data Information","date":"2020-07-27","arxiv_id":"2007.13860","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-asymptotic-linear-convergence-speed-of","slug":"on-the-asymptotic-linear-convergence-speed-of","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES","date":"2020-07-04","arxiv_id":"2007.01996","repositories_listed":1,"syntology":null},{"url":"/paper/mars-masked-automatic-ranks-selection-in","slug":"mars-masked-automatic-ranks-selection-in","title":"MARS: Masked Automatic Ranks Selection in Tensor Decompositions","date":"2020-06-18","arxiv_id":"2006.10859","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mars-masked-automatic-ranks-selection-in#ran","syntology_url":"https://syntology.ai/paper/2006.10859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10859"}},"official":{"repos":["maxbourdon/mars"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/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","repositories_listed":1,"syntology":null},{"url":"/paper/cpac-conv-cp-decomposition-to-approximately","slug":"cpac-conv-cp-decomposition-to-approximately","title":"Tensor decomposition to Compress Convolutional Layers in Deep Learning","date":"2020-05-28","arxiv_id":"2005.13746","repositories_listed":1,"syntology":null},{"url":"/paper/deep-tensor-cca-for-multi-view-learning","slug":"deep-tensor-cca-for-multi-view-learning","title":"Deep Tensor CCA for Multi-view Learning","date":"2020-05-25","arxiv_id":"2005.11914","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-convolutional-neural-networks-for","slug":"revisiting-convolutional-neural-networks-for","title":"Revisiting Convolutional Neural Networks for Citywide Crowd Flow Analytics","date":"2020-02-28","arxiv_id":"2003.00895","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-completion-for-weakly-dependent-data","slug":"tensor-completion-for-weakly-dependent-data","title":"Tensor Completion for Weakly-dependent Data on Graph for Metro Passenger Flow Prediction","date":"2019-12-11","arxiv_id":"1912.05693","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-unexplored-tensor-network","slug":"exploring-unexplored-tensor-network","title":"Exploring Unexplored Tensor Network Decompositions for Convolutional Neural Networks","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/conditional-hierarchical-bayesian-tucker","slug":"conditional-hierarchical-bayesian-tucker","title":"Conditional Hierarchical Bayesian Tucker Decomposition for Genetic Data Analysis","date":"2019-11-27","arxiv_id":"1911.12426","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-streaming-tensor-decomposition-1","slug":"probabilistic-streaming-tensor-decomposition-1","title":"Probabilistic Streaming Tensor Decomposition with Side Information","date":"2019-11-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/predicting-microrna-disease-associations-from","slug":"predicting-microrna-disease-associations-from","title":"Tensor Decomposition with Relational Constraints for Predicting Multiple Types of MicroRNA-disease Associations","date":"2019-11-13","arxiv_id":"1911.05584","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-training-using-tensor","slug":"accelerating-training-using-tensor","title":"Accelerating Training using Tensor Decomposition","date":"2019-09-10","arxiv_id":"1909.05675","repositories_listed":1,"syntology":null},{"url":"/paper/einconv-exploring-unexplored-tensor","slug":"einconv-exploring-unexplored-tensor","title":"Einconv: Exploring Unexplored Tensor Network Decompositions for Convolutional Neural Networks","date":"2019-08-13","arxiv_id":"1908.04471","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/einconv-exploring-unexplored-tensor#ran","syntology_url":"https://syntology.ai/paper/1908.04471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04471"}},"official":{"repos":["pfnet-research/einconv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-tensorized-transformer-for-language","slug":"a-tensorized-transformer-for-language","title":"A Tensorized Transformer for Language Modeling","date":"2019-06-24","arxiv_id":"1906.09777","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/a-tensorized-transformer-for-language#ran","syntology_url":"https://syntology.ai/paper/1906.09777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09777"}},"official":{"repos":["szhangtju/The-compression-of-Transformer"],"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/tensor-canonical-correlation-analysis","slug":"tensor-canonical-correlation-analysis","title":"Tensor Canonical Correlation Analysis with Convergence and Statistical Guarantees","date":"2019-06-12","arxiv_id":"1906.05358","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-tensorized-neural-networks-with","slug":"bayesian-tensorized-neural-networks-with","title":"Bayesian Tensorized Neural Networks with Automatic Rank Selection","date":"2019-05-24","arxiv_id":"1905.10478","repositories_listed":1,"syntology":null},{"url":"/paper/190512568","slug":"190512568","title":"Predicting Sparse Clients' Actions with CPOPT-Net in the Banking Environment","date":"2019-05-23","arxiv_id":"1905.12568","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-fact-prediction-via-knowledge","slug":"knowledge-graph-fact-prediction-via-knowledge","title":"Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization","date":"2019-02-08","arxiv_id":"1902.03077","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-language-model-in-tensor-space","slug":"a-generalized-language-model-in-tensor-space","title":"A Generalized Language Model in Tensor Space","date":"2019-01-31","arxiv_id":"1901.11167","repositories_listed":1,"syntology":null},{"url":"/paper/block-bilinear-superdiagonal-fusion-for","slug":"block-bilinear-superdiagonal-fusion-for","title":"BLOCK: Bilinear Superdiagonal Fusion for Visual Question Answering and Visual Relationship Detection","date":"2019-01-31","arxiv_id":"1902.00038","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/block-bilinear-superdiagonal-fusion-for#ran","syntology_url":"https://syntology.ai/paper/1902.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00038"}},"official":{"repos":["Cadene/block.bootstrap.pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-streaming-tensor-decomposition","slug":"probabilistic-streaming-tensor-decomposition","title":"Probabilistic Streaming Tensor Decomposition","date":"2018-12-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-distillation-from-few-samples","slug":"knowledge-distillation-from-few-samples","title":"Few Sample Knowledge Distillation for Efficient Network Compression","date":"2018-12-05","arxiv_id":"1812.01839","repositories_listed":1,"syntology":null},{"url":"/paper/compressing-recurrent-neural-networks-with","slug":"compressing-recurrent-neural-networks-with","title":"Compressing Recurrent Neural Networks with Tensor Ring for Action Recognition","date":"2018-11-19","arxiv_id":"1811.07503","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-binary-multiway-data","slug":"learning-from-binary-multiway-data","title":"Learning from Binary Multiway Data: Probabilistic Tensor Decomposition and its Statistical Optimality","date":"2018-11-13","arxiv_id":"1811.05076","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-mechanics-of-low-rank-tensor","slug":"statistical-mechanics-of-low-rank-tensor","title":"Statistical mechanics of low-rank tensor decomposition","date":"2018-10-23","arxiv_id":"1810.10065","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-methods-of-moments","slug":"hierarchical-methods-of-moments","title":"Hierarchical Methods of Moments","date":"2018-10-17","arxiv_id":"1810.07468","repositories_listed":1,"syntology":null},{"url":"/paper/nesterov-acceleration-of-alternating-least","slug":"nesterov-acceleration-of-alternating-least","title":"Nesterov Acceleration of Alternating Least Squares for Canonical Tensor Decomposition: Momentum Step Size Selection and Restart Mechanisms","date":"2018-10-13","arxiv_id":"1810.05846","repositories_listed":1,"syntology":null},{"url":"/paper/visualization-of-high-dimensional-scalar","slug":"visualization-of-high-dimensional-scalar","title":"Visualization of High-dimensional Scalar Functions Using Principal Parameterizations","date":"2018-09-11","arxiv_id":"1809.03618","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-boolean-tensor-decomposition","slug":"probabilistic-boolean-tensor-decomposition","title":"Probabilistic Boolean Tensor Decomposition","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tensormachine-probabilistic-boolean-tensor","slug":"tensormachine-probabilistic-boolean-tensor","title":"TensOrMachine: Probabilistic Boolean Tensor Decomposition","date":"2018-05-11","arxiv_id":"1805.04582","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-and-alleviating-concept-drift-in","slug":"identifying-and-alleviating-concept-drift-in","title":"Identifying and Alleviating Concept Drift in Streaming Tensor Decomposition","date":"2018-04-25","arxiv_id":"1804.09619","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-decomposition-for-compressing","slug":"tensor-decomposition-for-compressing","title":"Tensor Decomposition for Compressing Recurrent Neural Network","date":"2018-02-28","arxiv_id":"1802.10410","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tensor-decomposition-for-compressing#ran","syntology_url":"https://syntology.ai/paper/1802.10410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10410"}},"official":{"repos":["androstj/tensor_rnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-binary-latent-variable-models-a","slug":"learning-binary-latent-variable-models-a","title":"Learning Binary Latent Variable Models: A Tensor Eigenpair Approach","date":"2018-02-27","arxiv_id":"1802.09656","repositories_listed":1,"syntology":null},{"url":"/paper/cover-learning-covariate-specific-vector","slug":"cover-learning-covariate-specific-vector","title":"CoVeR: Learning Covariate-Specific Vector Representations with Tensor Decompositions","date":"2018-02-21","arxiv_id":"1802.07839","repositories_listed":1,"syntology":null},{"url":"/paper/legendre-decomposition-for-tensors","slug":"legendre-decomposition-for-tensors","title":"Legendre Decomposition for Tensors","date":"2018-02-13","arxiv_id":"1802.04502","repositories_listed":1,"syntology":null},{"url":"/paper/fitting-low-rank-tensors-in-constant-time","slug":"fitting-low-rank-tensors-in-constant-time","title":"Fitting Low-Rank Tensors in Constant Time","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/introduction-to-tensor-decompositions-and","slug":"introduction-to-tensor-decompositions-and","title":"Introduction to Tensor Decompositions and their Applications in Machine Learning","date":"2017-11-29","arxiv_id":"1711.10781","repositories_listed":1,"syntology":null},{"url":"/paper/sublinear-time-orthogonal-tensor","slug":"sublinear-time-orthogonal-tensor","title":"Sublinear Time Orthogonal Tensor Decomposition","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/shape-constrained-tensor-decompositions-using","slug":"shape-constrained-tensor-decompositions-using","title":"Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries","date":"2016-08-16","arxiv_id":"1608.04674","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-ring-decomposition","slug":"tensor-ring-decomposition","title":"Tensor Ring Decomposition","date":"2016-06-17","arxiv_id":"1606.05535","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-sparse-tucker-models-for-dimension","slug":"bayesian-sparse-tucker-models-for-dimension","title":"Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completion","date":"2015-05-10","arxiv_id":"1505.02343","repositories_listed":1,"syntology":null},{"url":"/paper/escaping-from-saddle-points-online-stochastic","slug":"escaping-from-saddle-points-online-stochastic","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","date":"2015-03-06","arxiv_id":"1503.02101","repositories_listed":1,"syntology":null},{"url":"/paper/online-tensor-methods-for-learning-latent","slug":"online-tensor-methods-for-learning-latent","title":"Online Tensor Methods for Learning Latent Variable Models","date":"2013-09-03","arxiv_id":"1309.0787","repositories_listed":1,"syntology":null},{"url":"/paper/fourier-pca-and-robust-tensor-decomposition","slug":"fourier-pca-and-robust-tensor-decomposition","title":"Fourier PCA and Robust Tensor Decomposition","date":"2013-06-25","arxiv_id":"1306.5825","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-link-prediction-using-matrix-and","slug":"temporal-link-prediction-using-matrix-and","title":"Temporal Link Prediction using Matrix and Tensor Factorizations","date":"2010-05-21","arxiv_id":"1005.4006","repositories_listed":1,"syntology":null},{"url":"/paper/empirical-evaluation-of-four-tensor","slug":"empirical-evaluation-of-four-tensor","title":"Empirical Evaluation of Four Tensor Decomposition Algorithms","date":"2007-11-13","arxiv_id":"0711.2023","repositories_listed":1,"syntology":null},{"url":null,"slug":"flow-through-tensors-a-unified-computational","title":"Flow-Through Tensors: A Unified Computational Graph Architecture for Multi-Layer Transportation Network Optimization","date":"2025-06-30","arxiv_id":"2507.02961","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-bistatic-isac-systems-for-low","title":"Cooperative Bistatic ISAC Systems for Low-Altitude Economy","date":"2025-06-22","arxiv_id":"2506.18067","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"dmrs-based-uplink-channel-estimation-for-mu","title":"DMRS-Based Uplink Channel Estimation for MU-MIMO Systems with Location-Specific SCSI Acquisition","date":"2025-06-13","arxiv_id":"2506.11899","repositories_listed":0,"syntology":null},{"url":null,"slug":"lrslam-low-rank-representation-of-signed","title":"LRSLAM: Low-rank Representation of Signed Distance Fields in Dense Visual SLAM System","date":"2025-06-12","arxiv_id":"2506.10567","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-08670","title":"sparseGeoHOPCA: A Geometric Solution to Sparse Higher-Order PCA Without Covariance Estimation","date":"2025-06-10","arxiv_id":"2506.08670","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-signal-aware-decomposition-of-dynamic","title":"Graph signal aware decomposition of dynamic networks via latent graphs","date":"2025-06-10","arxiv_id":"2506.08519","repositories_listed":0,"syntology":null},{"url":null,"slug":"metatt-a-global-tensor-train-adapter-for","title":"MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning","date":"2025-06-10","arxiv_id":"2506.09105","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-low-rank-4d-tensor-decomposition-for","title":"Double Low-Rank 4D Tensor Decomposition for Circular RIS-Aided mmWave MIMO-NOMA System Channel Estimation in Mobility Scenarios","date":"2025-06-09","arxiv_id":"2506.07909","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-channel-and-symbol-estimation-for","title":"Joint Channel and Symbol Estimation for Communication Systems with Movable Antennas","date":"2025-06-08","arxiv_id":"2506.07183","repositories_listed":0,"syntology":null},{"url":null,"slug":"patch-based-reconstruction-for-unsupervised","title":"Patch-based Reconstruction for Unsupervised Dynamic MRI using Learnable Tensor Function with Implicit Neural Representation","date":"2025-05-28","arxiv_id":"2505.21894","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-deep-neural-networks-work-for-medical","title":"Making deep neural networks work for medical audio: representation, compression and domain adaptation","date":"2025-05-24","arxiv_id":"2506.13970","repositories_listed":0,"syntology":null},{"url":null,"slug":"latentllm-attention-aware-joint-tensor","title":"LatentLLM: Attention-Aware Joint Tensor Compression","date":"2025-05-23","arxiv_id":"2505.18413","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifiability-of-nonnegative-tucker","title":"Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory","date":"2025-05-19","arxiv_id":"2505.12713","repositories_listed":0,"syntology":null},{"url":null,"slug":"auto-tensor-singular-value-thresholding-a-non","title":"Auto Tensor Singular Value Thresholding: A Non-Iterative and Rank-Free Framework for Tensor Denoising","date":"2025-05-09","arxiv_id":"2505.06203","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-double-norm-aggregated-tensor-latent","title":"A Double-Norm Aggregated Tensor Latent Factorization Model for Temporal-Aware Traffic Speed Imputation","date":"2025-04-24","arxiv_id":"2504.17196","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-frequency-implicit-neural","title":"Cross-Frequency Implicit Neural Representation with Self-Evolving Parameters","date":"2025-04-15","arxiv_id":"2504.10929","repositories_listed":0,"syntology":null},{"url":null,"slug":"under-sampled-high-dimensional-data-recovery","title":"Under-Sampled High-Dimensional Data Recovery via Symbiotic Multi-Prior Tensor Reconstruction","date":"2025-04-08","arxiv_id":"2504.05992","repositories_listed":0,"syntology":null},{"url":null,"slug":"least-squares-khatri-rao-factorization-of-a","title":"Least-Squares Khatri-Rao Factorization of a Polynomial Matrix","date":"2025-03-29","arxiv_id":"2503.23187","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-term-electricity-demand-prediction-using","title":"Long-Term Electricity Demand Prediction Using Non-negative Tensor Factorization and Genetic Algorithm-Driven Temporal Modeling","date":"2025-03-28","arxiv_id":"2503.22132","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-and-local-structure-learning-for","title":"Global and Local Structure Learning for Sparse Tensor Completion","date":"2025-03-26","arxiv_id":"2503.20929","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-tensor-decompositions-for-context","title":"Weighted Tensor Decompositions for Context-aware Collaborative Filtering","date":"2025-03-11","arxiv_id":"2503.08393","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-spatial-extraction-through-layered","title":"Spectral-Spatial Extraction through Layered Tensor Decomposition for Hyperspectral Anomaly Detection","date":"2025-03-07","arxiv_id":"2503.05183","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-algorithms-for-verifying-kruskal","title":"Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications","date":"2025-03-06","arxiv_id":"2503.04986","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-of-large-language","title":"Uncertainty Quantification of Large Language Models through Multi-Dimensional Responses","date":"2025-02-24","arxiv_id":"2502.16820","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-quantum-tensor-decomposition-in","title":"Towards Quantum Tensor Decomposition in Biomedical Applications","date":"2025-02-18","arxiv_id":"2502.13140","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-tensor-completion-via-approximate","title":"Fast Tensor Completion via Approximate Richardson Iteration","date":"2025-02-13","arxiv_id":"2502.09534","repositories_listed":0,"syntology":null},{"url":null,"slug":"functional-complexity-adaptive-temporal","title":"Functional Complexity-adaptive Temporal Tensor Decomposition","date":"2025-02-10","arxiv_id":"2502.06164","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parametric-non-negative-coupled-canonical","title":"A parametric non-negative coupled canonical polyadic decomposition algorithm for hyperspectral super-resolution","date":"2025-01-25","arxiv_id":"2501.15197","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-accelerating-edge-ai-optimizing-resource","title":"On Accelerating Edge AI: Optimizing Resource-Constrained Environments","date":"2025-01-25","arxiv_id":"2501.15014","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformed-low-rank-adaptation-via-tensor","title":"Transformed Low-rank Adaptation via Tensor Decomposition and Its Applications to Text-to-image Models","date":"2025-01-15","arxiv_id":"2501.08727","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-galore-memory-efficient-training-via","title":"Tensor-GaLore: Memory-Efficient Training via Gradient Tensor Decomposition","date":"2025-01-04","arxiv_id":"2501.02379","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relational-context-perception-for","title":"Efficient Relational Context Perception for Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00397","repositories_listed":0,"syntology":null},{"url":null,"slug":"dota-weight-decomposed-tensor-adaptation-for","title":"DoTA: Weight-Decomposed Tensor Adaptation for Large Language Models","date":"2024-12-30","arxiv_id":"2412.20891","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-isac-empowered-low-altitude","title":"Cooperative ISAC-empowered Low-Altitude Economy","date":"2024-12-29","arxiv_id":"2412.20371","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-network-predictions-of-solid","title":"Graph-neural-network predictions of solid-state NMR parameters from spherical tensor decomposition","date":"2024-12-19","arxiv_id":"2412.15063","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-sample-analysis-of-tensor","title":"Finite Sample Analysis of Tensor Decomposition for Learning Mixtures of Linear Systems","date":"2024-12-13","arxiv_id":"2412.10615","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-channel-estimation-for-double-ris","title":"Enhanced channel estimation for double RIS-aided MIMO systems using coupled tensor decomposition","date":"2024-12-07","arxiv_id":"2412.05743","repositories_listed":0,"syntology":null},{"url":null,"slug":"ris-assisted-sensing-a-nested-tensor","title":"RIS-Assisted Sensing: A Nested Tensor Decomposition-Based Approach","date":"2024-12-03","arxiv_id":"2412.02778","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-coupled-tensor-decomposition-for","title":"Personalized Coupled Tensor Decomposition for Multimodal Data Fusion: Uniqueness and Algorithms","date":"2024-12-02","arxiv_id":"2412.01102","repositories_listed":0,"syntology":null},{"url":null,"slug":"overcomplete-tensor-decomposition-via-koszul","title":"Overcomplete Tensor Decomposition via Koszul-Young Flattenings","date":"2024-11-21","arxiv_id":"2411.14344","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-language-models-with-better-multi","title":"Faster Language Models with Better Multi-Token Prediction Using Tensor Decomposition","date":"2024-10-23","arxiv_id":"2410.17765","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-uncertainty-quantification-for","title":"Conditional Uncertainty Quantification for Tensorized Topological Neural Networks","date":"2024-10-20","arxiv_id":"2410.15241","repositories_listed":0,"syntology":null}],"record_sha256":"6c21a58b2ab6a2a41d9abf6d1b0da6c5f7c6d5258c79646c2a659fe27d527e54","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}