{"id":"https://openalex.org/W4407638473","doi":"https://doi.org/10.1109/lsp.2025.3542965","title":"Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation","display_name":"Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4407638473","doi":"https://doi.org/10.1109/lsp.2025.3542965"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2025.3542965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2025.3542965","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006331313","display_name":"Samrat Mukhopadhyay","orcid":"https://orcid.org/0000-0002-6389-5185"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Samrat Mukhopadhyay","raw_affiliation_strings":["Dept. of Electronics Engineering, IIT (ISM) Dhanbad, Jharkhand, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electronics Engineering, IIT (ISM) Dhanbad, Jharkhand, India","institution_ids":["https://openalex.org/I189109744"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061811026","display_name":"Debasmita Mukherjee","orcid":"https://orcid.org/0000-0003-4950-0631"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debasmita Mukherjee","raw_affiliation_strings":["Dept. of Electronics Engineering, IIT (ISM) Dhanbad, Jharkhand, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electronics Engineering, IIT (ISM) Dhanbad, Jharkhand, India","institution_ids":["https://openalex.org/I189109744"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189109744"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00958691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9962999820709229,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9962999820709229,"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.9932000041007996,"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/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.713678777217865},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5860750079154968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523384690284729},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.451199471950531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38909897208213806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3473902940750122},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34130311012268066},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.19820556044578552}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.713678777217865},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5860750079154968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523384690284729},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.451199471950531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38909897208213806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3473902940750122},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34130311012268066},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.19820556044578552},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2025.3542965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2025.3542965","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7075743665","display_name":null,"funder_award_id":"SRG/2022/001781","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2091883426","https://openalex.org/W3173235360","https://openalex.org/W2174948646","https://openalex.org/W2024017047","https://openalex.org/W4318256793","https://openalex.org/W2051410394","https://openalex.org/W2594370889","https://openalex.org/W2390720471","https://openalex.org/W1600789676","https://openalex.org/W2134327945"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,13,45,78,81,91,108,113,116],"problem":[3,47],"ofonline":[4],"sparse":[5,15,42],"linear":[6,16],"approximation,":[7],"where":[8],"a":[9,29,33,67,85],"learner":[10],"sequentially":[11],"predicts":[12],"best":[14],"approximations":[17],"of":[18,24,28,32,40,115],"an":[19,57],"as":[20,49],"yet":[21],"unobserved":[22],"sequence":[23],"measurements":[25],"in":[26],"terms":[27],"few":[30],"columns":[31],"given":[34],"measurement":[35,79],"matrix.":[36],"The":[37],"inherent":[38],"difficulty":[39],"offline":[41],"recovery":[43],"makes":[44],"online":[46,59,64,118],"challenging":[48],"well.":[50],"In":[51],"this":[52,63],"letter,":[53],"we":[54,71],"propose":[55],"Follow-The-Approximate-Sparse-Leader,":[56],"efficient":[58],"meta-policy":[60],"to":[61,99,106],"address":[62],"problem.":[65],"Through":[66],"detailed":[68],"theoretical":[69,109],"analysis,":[70],"prove":[72],"that":[73],"under":[74],"certain":[75],"assumptions":[76],"on":[77,90],"sequence,":[80],"proposed":[82,117],"policy":[83],"enjoys":[84],"data-dependent":[86],"sublinear":[87],"upper":[88],"bound":[89],"static":[92],"regret,":[93],"which":[94],"can":[95],"range":[96],"from":[97],"logarithmic":[98],"square-root.":[100],"Extensive":[101],"numerical":[102],"simulations":[103],"are":[104],"performed":[105],"corroborate":[107],"findings":[110],"and":[111],"demonstrate":[112],"efficacy":[114],"policy.":[119]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}