{"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/6","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":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"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/papers/5","next":"/task/tensor-decomposition/papers/7","papers":[{"url":null,"slug":"learning-paths-from-signature-tensors","title":"Learning Paths from Signature Tensors","date":"2018-09-05","arxiv_id":"1809.01588","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-ica-understanding-global-dynamics-of","title":"Online ICA: Understanding Global Dynamics of Nonconvex Optimization via Diffusion Processes","date":"2018-08-29","arxiv_id":"1808.09642","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-canonical-polyadic-tensor","title":"Generalized Canonical Polyadic Tensor Decomposition","date":"2018-08-22","arxiv_id":"1808.07452","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-hidden-structure-of-signals-in","title":"Modelling hidden structure of signals in group data analysis with modified (Lr, 1) and block-term decompositions","date":"2018-08-07","arxiv_id":"1808.02316","repositories_listed":0,"syntology":null},{"url":null,"slug":"octen-online-compression-based-tensor","title":"OCTen: Online Compression-based Tensor Decomposition","date":"2018-07-03","arxiv_id":"1807.01350","repositories_listed":0,"syntology":null},{"url":null,"slug":"extension-of-pca-to-higher-order-data","title":"Extension of PCA to Higher Order Data Structures: An Introduction to Tensors, Tensor Decompositions, and Tensor PCA","date":"2018-06-26","arxiv_id":"1803.00704","repositories_listed":0,"syntology":null},{"url":null,"slug":"brain-computer-interface-with-corrupted-eeg","title":"Brain-Computer Interface with Corrupted EEG Data: A Tensor Completion Approach","date":"2018-06-13","arxiv_id":"1806.05017","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-simultaneous-asymmetric-tensor","title":"Guaranteed Simultaneous Asymmetric Tensor Decomposition via Orthogonalized Alternating Least Squares","date":"2018-05-25","arxiv_id":"1805.10348","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensorial-neural-networks-generalization-of","title":"Tensorial Neural Networks: Generalization of Neural Networks and Application to Model Compression","date":"2018-05-25","arxiv_id":"1805.10352","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-syntax-and-semantics-of","title":"Embedding Syntax and Semantics of Prepositions via Tensor Decomposition","date":"2018-05-23","arxiv_id":"1805.09389","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-recovery-of-low-rank-tensor","title":"Beyond Unfolding: Exact Recovery of Latent Convex Tensor Decomposition under Reshuffling","date":"2018-05-22","arxiv_id":"1805.08465","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-minimization-on-tensor-ring-a-new","title":"Rank Minimization on Tensor Ring: A New Paradigm in Scalable Tensor Decomposition and Completion","date":"2018-05-22","arxiv_id":"1805.08468","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tensor-based-sub-mode-coordinate-algorithm","title":"A Tensor-Based Sub-Mode Coordinate Algorithm for Stock Prediction","date":"2018-05-21","arxiv_id":"1805.07979","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-learning-of-a-convolutional-neural","title":"End-to-end Learning of a Convolutional Neural Network via Deep Tensor Decomposition","date":"2018-05-16","arxiv_id":"1805.06523","repositories_listed":0,"syntology":null},{"url":null,"slug":"reciprocal-attention-fusion-for-visual","title":"Reciprocal Attention Fusion for Visual Question Answering","date":"2018-05-11","arxiv_id":"1805.04247","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-differentially-private-algorithms","title":"Distributed Differentially-Private Algorithms for Matrix and Tensor Factorization","date":"2018-04-26","arxiv_id":"1804.10299","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-content-based-detection-of","title":"Semi-supervised Content-based Detection of Misinformation via Tensor Embeddings","date":"2018-04-24","arxiv_id":"1804.09088","repositories_listed":0,"syntology":null},{"url":null,"slug":"e-commerce-anomaly-detection-a-bayesian-semi","title":"E-commerce Anomaly Detection: A Bayesian Semi-Supervised Tensor Decomposition Approach using Natural Gradients","date":"2018-04-11","arxiv_id":"1804.03836","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiresolution-tensor-decomposition-for","title":"Multiresolution Tensor Decomposition for Multiple Spatial Passing Networks","date":"2018-03-03","arxiv_id":"1803.01203","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-connection-between-learning-two-layers","title":"On the Connection Between Learning Two-Layers Neural Networks and Tensor Decomposition","date":"2018-02-20","arxiv_id":"1802.07301","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonnegative-parafac2-a-flexible-coupling","title":"Nonnegative PARAFAC2: a flexible coupling approach","date":"2018-02-14","arxiv_id":"1802.05035","repositories_listed":0,"syntology":null},{"url":null,"slug":"curve-registered-coupled-low-rank","title":"Curve Registered Coupled Low Rank Factorization","date":"2018-02-09","arxiv_id":"1802.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-learning-of-binomial-hmms-for-dna","title":"Spectral Learning of Binomial HMMs for DNA Methylation Data","date":"2018-02-07","arxiv_id":"1802.02498","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-and-low-rank-tensor-estimation-via","title":"Sparse and Low-rank Tensor Estimation via Cubic Sketchings","date":"2018-01-29","arxiv_id":"1801.09326","repositories_listed":0,"syntology":null},{"url":null,"slug":"object-based-multipass-insar-via-robust-low","title":"Object-based Multipass InSAR via Robust Low Rank Tensor Decomposition","date":"2018-01-23","arxiv_id":"1801.07499","repositories_listed":0,"syntology":null},{"url":null,"slug":"baseline-corrected-space-by-time-non-negative","title":"Baseline-corrected space-by-time non-negative matrix factorization for decoding single trial population spike trains","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-covariate-specific-embeddings-with","title":"Learning Covariate-Specific Embeddings with Tensor Decompositions","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-knowledge-base-embedding-as-tensor","title":"Revisiting Knowledge Base Embedding as Tensor Decomposition","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-compact-recurrent-neural-networks-1","title":"Learning Compact Recurrent Neural Networks with Block-Term Tensor Decomposition","date":"2017-12-14","arxiv_id":"1712.05134","repositories_listed":0,"syntology":null},{"url":null,"slug":"thoops-a-multi-aspect-analytical-framework","title":"tHoops: A Multi-Aspect Analytical Framework Spatio-Temporal Basketball Data","date":"2017-12-04","arxiv_id":"1712.01199","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-representation-of-tractography-and","title":"Unified representation of tractography and diffusion-weighted MRI data using sparse multidimensional arrays","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decompositions-for-modeling-inverse","title":"Tensor Decompositions for Modeling Inverse Dynamics","date":"2017-11-13","arxiv_id":"1711.04683","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-tensor-decomposition-for-learning","title":"Weighted Tensor Decomposition for Learning Latent Variables with Partial Data","date":"2017-10-18","arxiv_id":"1710.06818","repositories_listed":0,"syntology":null},{"url":null,"slug":"ctd-fast-accurate-and-interpretable-method","title":"CTD: Fast, Accurate, and Interpretable Method for Static and Dynamic Tensor Decompositions","date":"2017-10-09","arxiv_id":"1710.03608","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-estimation-from-few-samples","title":"Bayesian estimation from few samples: community detection and related problems","date":"2017-09-30","arxiv_id":"1710.00264","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-interpretability-and-predictive","title":"Balancing Interpretability and Predictive Accuracy for Unsupervised Tensor Mining","date":"2017-09-04","arxiv_id":"1709.01147","repositories_listed":0,"syntology":null},{"url":null,"slug":"sambaten-sampling-based-batch-incremental","title":"SamBaTen: Sampling-based Batch Incremental Tensor Decomposition","date":"2017-09-03","arxiv_id":"1709.00668","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-patients-with-tensor-decomposition","title":"Clustering Patients with Tensor Decomposition","date":"2017-08-29","arxiv_id":"1708.08994","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-via-simultaneous-power","title":"Tensor Decomposition via Simultaneous Power Iteration","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-with-smoothness","title":"Tensor Decomposition with Smoothness","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperspectral-image-restoration-via-total","title":"Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decomposition","date":"2017-07-08","arxiv_id":"1707.02477","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-multilinear-structure-of-visual","title":"Learning the Multilinear Structure of Visual Data","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-visual-data-completion-and","title":"Simultaneous Visual Data Completion and Denoising Based on Tensor Rank and Total Variation Minimization and Its Primal-Dual Splitting Algorithm","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-based-approach-to-accelerate","title":"Tensor-based approach to accelerate deformable part models","date":"2017-06-29","arxiv_id":"1707.03268","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-robust-tensor-decomposition-with","title":"Fast and robust tensor decomposition with applications to dictionary learning","date":"2017-06-27","arxiv_id":"1706.08672","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-matrix-hilbert-space-and-its-application","title":"The Matrix Hilbert Space and Its Application to Matrix Learning","date":"2017-06-25","arxiv_id":"1706.08110","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-optimization-landscape-of-tensor","title":"On the Optimization Landscape of Tensor Decompositions","date":"2017-06-18","arxiv_id":"1706.05598","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-state-recurrent-neural-networks","title":"Predictive State Recurrent Neural Networks","date":"2017-05-25","arxiv_id":"1705.09353","repositories_listed":0,"syntology":null},{"url":null,"slug":"dictionary-based-tensor-canonical-polyadic","title":"Dictionary-based Tensor Canonical Polyadic Decomposition","date":"2017-04-03","arxiv_id":"1704.00541","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonalized-als-a-theoretically-principled","title":"Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use","date":"2017-03-06","arxiv_id":"1703.01804","repositories_listed":0,"syntology":null},{"url":null,"slug":"strongly-typed-agents-are-guaranteed-to","title":"Strongly-Typed Agents are Guaranteed to Interact Safely","date":"2017-02-24","arxiv_id":"1702.07450","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-negative-tensor-factorization-for-human","title":"Non-negative Tensor Factorization for Human Behavioral Pattern Mining in Online Games","date":"2017-02-19","arxiv_id":"1702.05695","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-learning-of-noisy-or-networks","title":"Provable learning of Noisy-or Networks","date":"2016-12-28","arxiv_id":"1612.08795","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decompositions-via-two-mode-higher","title":"Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD)","date":"2016-12-12","arxiv_id":"1612.03839","repositories_listed":0,"syntology":null},{"url":null,"slug":"reweighted-low-rank-tensor-decomposition","title":"Reweighted Low-Rank Tensor Decomposition based on t-SVD and its Applications in Video Denoising","date":"2016-11-18","arxiv_id":"1611.05963","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-normalization-faster-evasion-of","title":"The Power of Normalization: Faster Evasion of Saddle Points","date":"2016-11-15","arxiv_id":"1611.04831","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-via-variational-auto","title":"Tensor Decomposition via Variational Auto-Encoder","date":"2016-11-03","arxiv_id":"1611.00866","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-represent-review-with-tensor","title":"Learning to Represent Review with Tensor Decomposition for Spam Detection","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decompositions-for-identifying","title":"Tensor Decompositions for Identifying Directed Graph Topologies and Tracking Dynamic Networks","date":"2016-10-26","arxiv_id":"1610.08189","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-time-tensor-decompositions-with","title":"Polynomial-time Tensor Decompositions with Sum-of-Squares","date":"2016-10-06","arxiv_id":"1610.01980","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-a-mixture-of-many-random-linear","title":"Solving a Mixture of Many Random Linear Equations by Tensor Decomposition and Alternating Minimization","date":"2016-08-19","arxiv_id":"1608.05749","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-for-signal-processing","title":"Tensor Decomposition for Signal Processing and Machine Learning","date":"2016-07-06","arxiv_id":"1607.01668","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-joint-matrix-triangularization","title":"Approximate Joint Matrix Triangularization","date":"2016-07-02","arxiv_id":"1607.00514","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-and-differentially-private-tensor","title":"Online and Differentially-Private Tensor Decomposition","date":"2016-06-20","arxiv_id":"1606.06237","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovery-of-latent-factors-in-high","title":"Discovery of Latent Factors in High-dimensional Data Using Tensor Methods","date":"2016-06-10","arxiv_id":"1606.03212","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-word-sequence","title":"Unsupervised Learning of Word-Sequence Representations from Scratch via Convolutional Tensor Decomposition","date":"2016-06-10","arxiv_id":"1606.03153","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-top-k-ranking","title":"Adversarial Top-$K$ Ranking","date":"2016-02-15","arxiv_id":"1602.04567","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-feature-based-robust-video","title":"Comprehensive Feature-based Robust Video Fingerprinting Using Tensor Model","date":"2016-01-27","arxiv_id":"1601.07270","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-spectral-algorithms-from-sum-of-squares","title":"Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors","date":"2015-12-08","arxiv_id":"1512.02337","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-and-low-rank-tensor-decomposition","title":"Sparse and Low-Rank Tensor Decomposition","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-vs-matrix-methods-robust-tensor","title":"Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations","date":"2015-10-15","arxiv_id":"1510.04747","repositories_listed":0,"syntology":null},{"url":null,"slug":"linked-component-analysis-from-matrices-to","title":"Linked Component Analysis from Matrices to High Order Tensors: Applications to Biomedical Data","date":"2015-08-29","arxiv_id":"1508.07416","repositories_listed":0,"syntology":null},{"url":null,"slug":"beating-the-perils-of-non-convexity","title":"Beating the Perils of Non-Convexity: Guaranteed Training of Neural Networks using Tensor Methods","date":"2015-06-28","arxiv_id":"1506.08473","repositories_listed":0,"syntology":null},{"url":null,"slug":"doubly-decomposing-nonparametric-tensor","title":"Doubly Decomposing Nonparametric Tensor Regression","date":"2015-06-19","arxiv_id":"1506.05967","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-guaranteed-tensor-decomposition-via","title":"Fast and Guaranteed Tensor Decomposition via Sketching","date":"2015-06-14","arxiv_id":"1506.04448","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-dictionary-learning-through","title":"Convolutional Dictionary Learning through Tensor Factorization","date":"2015-06-10","arxiv_id":"1506.03509","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-independent-context-estimation-for","title":"Feature-Independent Context Estimation for Automatic Image Annotation","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-low-rank-tensor-recovery-from","title":"Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions Suffice","date":"2015-05-15","arxiv_id":"1505.04085","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-and-continuous-representations","title":"Deep Learning and Continuous Representations for Natural Language Processing","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposing-overcomplete-3rd-order-tensors","title":"Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms","date":"2015-04-21","arxiv_id":"1504.05287","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-tensor-decomposition-for","title":"Heterogeneous Tensor Decomposition for Clustering via Manifold Optimization","date":"2015-04-07","arxiv_id":"1504.01777","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-analysis-of-tensor","title":"A Comparative Analysis of Tensor Decomposition Models Using Hyper Spectral Image","date":"2015-03-23","arxiv_id":"1503.06561","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixed-membership-community-models-in","title":"Learning Mixed Membership Community Models in Social Tagging Networks through Tensor Methods","date":"2015-03-16","arxiv_id":"1503.04567","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-unsupervised-tensor-mining-with","title":"Automatic Unsupervised Tensor Mining with Quality Assessment","date":"2015-03-11","arxiv_id":"1503.03355","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-with-generalized-lasso","title":"Tensor decomposition with generalized lasso penalties","date":"2015-02-24","arxiv_id":"1502.06930","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-sparse-tensor-decomposition","title":"Provable Sparse Tensor Decomposition","date":"2015-02-05","arxiv_id":"1502.01425","repositories_listed":0,"syntology":null},{"url":null,"slug":"per-block-convex-data-modeling-by-accelerated","title":"Per-Block-Convex Data Modeling by Accelerated Stochastic Approximation","date":"2015-01-29","arxiv_id":"1501.07315","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-vs-min-tensor-decomposition-and-ica-with","title":"Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity","date":"2014-12-09","arxiv_id":"1412.2954","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-tensor-methods-for-learning-mixtures","title":"Provable Tensor Methods for Learning Mixtures of Generalized Linear Models","date":"2014-12-09","arxiv_id":"1412.3046","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-higher-order-orthogonal-iteration","title":"Generalized Higher-Order Orthogonal Iteration for Tensor Decomposition and Completion","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-approximation-and-completion-of","title":"Low-Rank Approximation and Completion of Positive Tensors","date":"2014-12-01","arxiv_id":"1412.0620","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-tensor-decomposition-with-gross","title":"Robust Tensor Decomposition with Gross Corruption","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-realization-problems-for-hidden","title":"Minimal Realization Problems for Hidden Markov Models","date":"2014-11-13","arxiv_id":"1411.3698","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixed-multinomial-logit-model-from","title":"Learning Mixed Multinomial Logit Model from Ordinal Data","date":"2014-11-01","arxiv_id":"1411.0073","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixtures-of-ranking-models","title":"Learning Mixtures of Ranking Models","date":"2014-10-31","arxiv_id":"1410.8750","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-online-algorithm-for-learning-selectivity","title":"An Online Algorithm for Learning Selectivity to Mixture Means","date":"2014-10-30","arxiv_id":"1410.8580","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-for-topic-models-via-spectral","title":"Model Selection for Topic Models via Spectral Decomposition","date":"2014-10-23","arxiv_id":"1410.6466","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-orbit-optimization-a-unified-approach","title":"Group Orbit Optimization: A Unified Approach to Data Normalization","date":"2014-10-03","arxiv_id":"1410.0868","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-dynamic-functional-brain","title":"Identification of Dynamic functional brain network states Through Tensor Decomposition","date":"2014-10-02","arxiv_id":"1410.0446","repositories_listed":0,"syntology":null},{"url":null,"slug":"typed-tensor-decomposition-of-knowledge-bases","title":"Typed Tensor Decomposition of Knowledge Bases for Relation Extraction","date":"2014-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"2be7becc5fe5feb37fef4aac6b35516aa936802007ec94f4ccc8c074e38b8d71","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}