{"id":"https://openalex.org/W6924339255","doi":"https://doi.org/10.15167/denevi-giulia_phd2019-12-18","title":"Efficient Lifelong Learning Algorithms: Regret Bounds and Statistical Guarantees","display_name":"Efficient Lifelong Learning Algorithms: Regret Bounds and Statistical Guarantees","publication_year":2019,"publication_date":"2019-12-18","ids":{"openalex":"https://openalex.org/W6924339255","doi":"https://doi.org/10.15167/denevi-giulia_phd2019-12-18"},"language":"en","primary_location":{"id":"pmh:oai:iris.unige.it:11567/986813","is_oa":true,"landing_page_url":"http://hdl.handle.net/11567/986813","pdf_url":"http://hdl.handle.net/11567/986813","source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11567/986813","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"DENEVI, GIULIA","orcid":"https://orcid.org/0000-0001-7181-9660"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"DENEVI, GIULIA","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7181-9660","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40624832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.8680999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.8680999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0284000001847744,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.007199999876320362,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6434000134468079},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5913000106811523},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5249999761581421},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.4675999879837036},{"id":"https://openalex.org/keywords/lifelong-learning","display_name":"Lifelong learning","score":0.4537999927997589},{"id":"https://openalex.org/keywords/empirical-research","display_name":"Empirical research","score":0.4219000041484833},{"id":"https://openalex.org/keywords/empirical-risk-minimization","display_name":"Empirical risk minimization","score":0.3797999918460846},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.361299991607666}],"concepts":[{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6434000134468079},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5913000106811523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598000288009644},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5249999761581421},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.4675999879837036},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.46470001339912415},{"id":"https://openalex.org/C108771440","wikidata":"https://www.wikidata.org/wiki/Q368475","display_name":"Lifelong learning","level":2,"score":0.4537999927997589},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4523000121116638},{"id":"https://openalex.org/C120936955","wikidata":"https://www.wikidata.org/wiki/Q2155640","display_name":"Empirical research","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C107321475","wikidata":"https://www.wikidata.org/wiki/Q5374254","display_name":"Empirical risk minimization","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34139999747276306},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3260999917984009},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28519999980926514},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.2770000100135803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2711000144481659}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:iris.unige.it:11567/986813","is_oa":true,"landing_page_url":"http://hdl.handle.net/11567/986813","pdf_url":"http://hdl.handle.net/11567/986813","source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"pmh:doi:10.15167/denevi-giulia_phd2019-12-18","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"doi:10.15167/denevi-giulia_phd2019-12-18","is_oa":true,"landing_page_url":"https://doi.org/10.15167/denevi-giulia_phd2019-12-18","pdf_url":null,"source":{"id":"https://openalex.org/S7407050993","display_name":"Universit\u00e0 degli Studi di Genova","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:iris.unige.it:11567/986813","is_oa":true,"landing_page_url":"http://hdl.handle.net/11567/986813","pdf_url":"http://hdl.handle.net/11567/986813","source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6924339255.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,90,320],"study":[1],"the":[2,6,78,94,106,109,116,120,123,131,136,143,153,160,164,211,230,249,256,262,268,274,278,302,311,324,341,348,352],"Meta-Learning":[3,96,157,180],"paradigm":[4],"where":[5,340],"goal":[7],"is":[8,27,51,81,189,194,241,345],"to":[9,29,53,65,72,84,130,158,196,260,272,284,295,310,333,361],"select":[10],"an":[11,178,286],"algorithm":[12,24,76,118,145,237,271,344],"in":[13,70,77,93,133,162,169,238,293],"a":[14,31,46,59,68,74,86,170,218,245,297,370,374],"prescribed":[15],"family":[16,212],"?":[17,25],"usually":[18],"denoted":[19],"as":[20,100,122,146,255],"inner":[21,117,144,214,236,270,342],"or":[22,373],"within-task":[23,75,137,165,250],"that":[26,50,80],"appropriate":[28],"address":[30],"class":[32,79,240],"of":[33,61,200,213,221,351,365],"learning":[34,204,366],"problems":[35],"(tasks),":[36],"sharing":[37],"specific":[38],"similarities.":[39],"More":[40,206],"precisely,":[41,207],"we":[42,128,151,176,208,266,281,357],"aim":[43],"at":[44,228],"designing":[45],"procedure,":[47],"called":[48],"meta-algorithm,":[49],"able":[52,195],"infer":[54],"this":[55,104,174,239,290],"tasks?":[56,201],"relatedness":[57,202],"from":[58],"sequence":[60],"observed":[62],"tasks":[63,110,124],"and":[64,112,192,203,280],"exploit":[66,285],"such":[67],"knowledge":[69],"order":[71,259,294],"return":[73],"best":[82],"suited":[83],"solve":[85],"new":[87],"similar":[88],"task.":[89],"are":[91,139,167],"interested":[92],"online":[95,269,343],"setting,":[97],"also":[98,135,321],"known":[99],"Lifelong":[101],"Learning.":[102,186],"In":[103,126,173,258],"scenario":[105],"meta-algorithm":[107,247,279],"receives":[108],"sequentially":[111,141],"it":[113,193],"incrementally":[114,242],"adapts":[115],"on":[119,183,210,289],"fly":[121],"arrive.":[125],"particular,":[127],"refer":[129],"framework":[132],"which":[134,163],"data":[138,166],"processed":[140,168],"by":[142,217,244,277,314,347,369],"Online-Within-Online":[147],"(OWO)":[148],"Meta-Learning,":[149],"while,":[150],"use":[152,267],"term":[154],"Online-Within-Batch":[155],"(OWB)":[156],"denote":[159],"setting":[161,313],"single":[171],"batch.":[172],"work":[175],"propose":[177],"OWO":[179,326],"method":[181,188,327,360],"based":[182],"primal-dual":[184],"Online":[185],"Our":[187,305],"theoretically":[190],"grounded":[191],"cover":[197],"various":[198],"types":[199],"algorithms.":[205],"focus":[209],"algorithms":[215,367],"given":[216],"parametrized":[219,368],"variant":[220],"Follow":[222],"The":[223,235],"Regularized":[224],"Leader":[225],"(FTRL)":[226],"aiming":[227],"minimizing":[229],"withintask":[231],"regularized":[232,252,353],"empirical":[233,253,354],"risk.":[234,355],"adapted":[243,309],"FTRL":[246],"using":[248],"minimum":[251],"risk":[254],"meta-loss.":[257],"keep":[261],"process":[263],"fully":[264],"online,":[265],"approximate":[273],"subgradients":[275],"used":[276],"show":[282,322],"how":[283,323],"upper":[287],"bound":[288,300],"approximation":[291],"error":[292,299],"derive":[296],"cumulative":[298],"for":[301],"proposed":[303,325],"method.":[304],"analysis":[306],"can":[307,328],"be":[308],"statistical":[312,330],"two":[315,362],"nested":[316],"online-to-batch":[317],"conversion":[318],"steps.":[319],"provide":[329],"guarantees":[331],"comparable":[332],"its":[334],"natural":[335],"more":[336],"expensive":[337],"OWB":[338],"variant,":[339],"substituted":[346],"batch":[349],"minimizer":[350],"Finally,":[356],"apply":[358],"our":[359],"important":[363],"families":[364],"bias":[371],"vector":[372],"linear":[375],"feature":[376],"map.":[377]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}