{"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/7","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":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,618],"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/6","next":null,"papers":[{"url":null,"slug":"sample-complexity-analysis-for-learning","title":"Sample Complexity Analysis for Learning Overcomplete Latent Variable Models through Tensor Methods","date":"2014-08-03","arxiv_id":"1408.0553","repositories_listed":0,"syntology":null},{"url":null,"slug":"dictionary-learning-and-tensor-decomposition","title":"Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method","date":"2014-07-06","arxiv_id":"1407.1543","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-higher-order-tensor-decomposition","title":"Generalized Higher-Order Tensor Decomposition via Parallel ADMM","date":"2014-07-05","arxiv_id":"1407.1399","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-eigenvector-based-hotspot-detection","title":"An eigenvector-based hotspot detection","date":"2014-06-12","arxiv_id":"1406.3191","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-mobility-synthesis-using-matrix-and","title":"Human mobility synthesis using matrix and tensor factorizations","date":"2014-06-12","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-non-orthogonal-tensor","title":"Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-$1$ Updates","date":"2014-02-21","arxiv_id":"1402.5180","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-coordinate-descent-for-orthogonal","title":"Efficient coordinate-descent for orthogonal matrices through Givens rotations","date":"2013-12-02","arxiv_id":"1312.0624","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-hidden-markov-models-from-non","title":"Learning Hidden Markov Models from Non-sequence Data via Tensor Decomposition","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-analysis-of-tensor-decompositions","title":"Smoothed Analysis of Tensor Decompositions","date":"2013-11-14","arxiv_id":"1311.3651","repositories_listed":0,"syntology":null},{"url":null,"slug":"dintucker-scaling-up-gaussian-process-models","title":"DinTucker: Scaling up Gaussian process models on multidimensional arrays with billions of elements","date":"2013-11-12","arxiv_id":"1311.2663","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-orthogonal-tensor-decomposition","title":"Efficient Orthogonal Tensor Decomposition, with an Application to Latent Variable Model Learning","date":"2013-09-12","arxiv_id":"1309.3233","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-factorization-strategies-for-higher","title":"Novel Factorization Strategies for Higher Order Tensors: Implications for Compression and Recovery of Multi-linear Data","date":"2013-07-02","arxiv_id":"1307.0805","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-pcfg-parsing-using-tensor","title":"Approximate PCFG Parsing Using Tensor Decomposition","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-based-human-body-modeling","title":"Tensor-Based Human Body Modeling","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-tensor-decomposition-via-structured","title":"Convex Tensor Decomposition via Structured Schatten Norm Regularization","date":"2013-03-26","arxiv_id":"1303.6370","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relational-learning-using-weighted","title":"Multi-relational Learning Using Weighted Tensor Decomposition with Modular Loss","date":"2013-03-07","arxiv_id":"1303.1733","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-for-fast-parsing-with","title":"Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-performance-of-convex-tensor","title":"Statistical Performance of Convex Tensor Decomposition","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"a6ec6875e7df52f877ed704149e965e48d531a164aa856e780f3a994fae2fd3c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}