{"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":"/paper/boosted-sparse-and-low-rank-tensor-regression","title":"Boosted Sparse and Low-Rank Tensor Regression","arxiv_id":"1811.01158","date":"2018-11-03","proceeding":"NeurIPS 2018 12","authors":["Lifang He","Kun Chen","Wanwan Xu","Jiayu Zhou","Fei Wang"],"abstract":"We propose a sparse and low-rank tensor regression model to relate a\nunivariate outcome to a feature tensor, in which each unit-rank tensor from the\nCP decomposition of the coefficient tensor is assumed to be sparse. This\nstructure is both parsimonious and highly interpretable, as it implies that the\noutcome is related to the features through a few distinct pathways, each of\nwhich may only involve subsets of feature dimensions. We take a\ndivide-and-conquer strategy to simplify the task into a set of sparse unit-rank\ntensor regression problems. To make the computation efficient and scalable, for\nthe unit-rank tensor regression, we propose a stagewise estimation procedure to\nefficiently trace out its entire solution path. We show that as the step size\ngoes to zero, the stagewise solution paths converge exactly to those of the\ncorresponding regularized regression. The superior performance of our approach\nis demonstrated on various real-world and synthetic examples.","url_abs":"http://arxiv.org/abs/1811.01158v1","url_pdf":"http://arxiv.org/pdf/1811.01158v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"boosted-sparse-and-low-rank-tensor-regression","repo_url":"https://github.com/LifangHe/SURF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"boosted-sparse-and-low-rank-tensor-regression","repo_url":"https://github.com/LifangHe/NeurIPS18_SURF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.01158","atlas_url":"https://app.syntology.ai/?focus=1811.01158","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1811.01158"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.01158\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.01158"},"call":"get_concepts_for_paper(arxiv_id=\"1811.01158\")"}],"by_repo":[{"repo":"LifangHe/SURF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LifangHe/NeurIPS18_SURF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"af118dbf32790830824dd54e83fec04d0a31ce25b746b068b903833dea520997","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}