{"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/online-within-online-meta-learning","title":"Online-Within-Online Meta-Learning","arxiv_id":null,"date":"2019-12-01","proceeding":"NeurIPS 2019 12","authors":["Giulia Denevi","Dimitris Stamos","Carlo Ciliberto","Massimiliano Pontil"],"abstract":"We study the problem of learning a series of tasks in a fully online Meta-Learning\nsetting. The goal is to exploit similarities among the tasks to incrementally adapt\nan inner online algorithm in order to incur a low averaged cumulative error over\nthe tasks. We focus on a family of inner algorithms based on a parametrized\nvariant of online Mirror Descent. The inner algorithm is incrementally adapted\nby an online Mirror Descent meta-algorithm using the corresponding within-task\nminimum regularized empirical risk as the meta-loss. In order to keep the process\nfully online, we approximate the meta-subgradients by the online inner algorithm.\nAn upper bound on the approximation error allows us to derive a cumulative\nerror bound for the proposed method. Our analysis can also be converted to the\nstatistical setting by online-to-batch arguments. We instantiate two examples of the\nframework in which the meta-parameter is either a common bias vector or feature\nmap. Finally, preliminary numerical experiments confirm our theoretical findings.","url_abs":"http://papers.nips.cc/paper/9468-online-within-online-meta-learning","url_pdf":"http://papers.nips.cc/paper/9468-online-within-online-meta-learning.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":"online-within-online-meta-learning","repo_url":"https://github.com/dstamos/Adversarial-LTL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"dstamos/Adversarial-LTL","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":"7bcdbe27ecd0744ca6fcc2878ba907c2d2782ef8fc25d5ffe3fb1f09123b72a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}