{"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/efficient-first-order-algorithms-for-adaptive","title":"Efficient First-Order Algorithms for Adaptive Signal Denoising","arxiv_id":"1803.11262","date":"2018-03-29","proceeding":"ICML 2018 7","authors":["Dmitrii Ostrovskii","Zaid Harchaoui"],"abstract":"We consider the problem of discrete-time signal denoising, focusing on a\nspecific family of non-linear convolution-type estimators. Each such estimator\nis associated with a time-invariant filter which is obtained adaptively, by\nsolving a certain convex optimization problem. Adaptive convolution-type\nestimators were demonstrated to have favorable statistical properties. However,\nthe question of their computational complexity remains largely unexplored, and\nin fact we are not aware of any publicly available implementation of these\nestimators. Our first contribution is an efficient implementation of these\nestimators via some known first-order proximal algorithms. Our second\ncontribution is a computational complexity analysis of the proposed procedures,\nwhich takes into account their statistical nature and the related notion of\nstatistical accuracy. The proposed procedures and their analysis are\nillustrated on a simulated data benchmark.","url_abs":"http://arxiv.org/abs/1803.11262v3","url_pdf":"http://arxiv.org/pdf/1803.11262v3.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":"efficient-first-order-algorithms-for-adaptive","repo_url":"https://github.com/ostrodmit/AlgoRec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.11262","atlas_url":"https://app.syntology.ai/?focus=1803.11262","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":"1803.11262"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.11262\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.11262"},"call":"get_concepts_for_paper(arxiv_id=\"1803.11262\")"}],"by_repo":[{"repo":"ostrodmit/AlgoRec","kind":"official","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":"8ed027220ae13b66c2e1f15204f82e3938457cd08f420f5b9ae7ea2516512512","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}