{"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/adaptive-piecewise-polynomial-estimation-via","title":"Adaptive piecewise polynomial estimation via trend filtering","arxiv_id":"1304.2986","date":"2013-04-10","proceeding":null,"authors":["Ryan J. Tibshirani"],"abstract":"We study trend filtering, a recently proposed tool of Kim et al. [SIAM Rev.\n51 (2009) 339-360] for nonparametric regression. The trend filtering estimate\nis defined as the minimizer of a penalized least squares criterion, in which\nthe penalty term sums the absolute $k$th order discrete derivatives over the\ninput points. Perhaps not surprisingly, trend filtering estimates appear to\nhave the structure of $k$th degree spline functions, with adaptively chosen\nknot points (we say ``appear'' here as trend filtering estimates are not really\nfunctions over continuous domains, and are only defined over the discrete set\nof inputs). This brings to mind comparisons to other nonparametric regression\ntools that also produce adaptive splines; in particular, we compare trend\nfiltering to smoothing splines, which penalize the sum of squared derivatives\nacross input points, and to locally adaptive regression splines [Ann. Statist.\n25 (1997) 387-413], which penalize the total variation of the $k$th derivative.\nEmpirically, we discover that trend filtering estimates adapt to the local\nlevel of smoothness much better than smoothing splines, and further, they\nexhibit a remarkable similarity to locally adaptive regression splines. We also\nprovide theoretical support for these empirical findings; most notably, we\nprove that (with the right choice of tuning parameter) the trend filtering\nestimate converges to the true underlying function at the minimax rate for\nfunctions whose $k$th derivative is of bounded variation. This is done via an\nasymptotic pairing of trend filtering and locally adaptive regression splines,\nwhich have already been shown to converge at the minimax rate [Ann. Statist. 25\n(1997) 387-413]. At the core of this argument is a new result tying together\nthe fitted values of two lasso problems that share the same outcome vector, but\nhave different predictor matrices.","url_abs":"http://arxiv.org/abs/1304.2986v2","url_pdf":"http://arxiv.org/pdf/1304.2986v2.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":"adaptive-piecewise-polynomial-estimation-via","repo_url":"https://github.com/capolitsch/trendfiltering","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1304.2986","atlas_url":"https://app.syntology.ai/?focus=1304.2986","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":"1304.2986"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1304.2986\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1304.2986"},"call":"get_concepts_for_paper(arxiv_id=\"1304.2986\")"}],"by_repo":[{"repo":"capolitsch/trendfiltering","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":"f78cabf5ad3a647ffb8cc9ea2452287d73704eef13f3b9fd7be671fa99db4d79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}