{"id":"https://openalex.org/W4376639560","doi":"https://doi.org/10.1145/3564246.3585100","title":"New Subset Selection Algorithms for Low Rank Approximation: Offline and Online","display_name":"New Subset Selection Algorithms for Low Rank Approximation: Offline and Online","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639560","doi":"https://doi.org/10.1145/3564246.3585100"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585100","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585100","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585100","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585100","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David P. Woodruff","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026075812","display_name":"Taisuke Yasuda","orcid":"https://orcid.org/0000-0002-7003-9934"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Taisuke Yasuda","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102861589"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.6488,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60819848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1802","last_page":"1813"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.998199999332428,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.7876383066177368},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.6537517309188843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5848225951194763},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5755374431610107},{"id":"https://openalex.org/keywords/closing","display_name":"Closing (real estate)","score":0.5628566145896912},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5541667938232422},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5470602512359619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5437700152397156},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5252677798271179},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4949943423271179},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4892306327819824},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.4439452886581421},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.41220271587371826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35197967290878296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24879220128059387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20128896832466125},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.19287094473838806}],"concepts":[{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.7876383066177368},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.6537517309188843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5848225951194763},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5755374431610107},{"id":"https://openalex.org/C2778775528","wikidata":"https://www.wikidata.org/wiki/Q5135432","display_name":"Closing (real estate)","level":2,"score":0.5628566145896912},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5541667938232422},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5470602512359619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5437700152397156},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5252677798271179},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4949943423271179},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4892306327819824},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.4439452886581421},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.41220271587371826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35197967290878296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24879220128059387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20128896832466125},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.19287094473838806},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585100","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585100","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585100","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585100","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585100","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585100","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639560.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1516099340","https://openalex.org/W1531368347","https://openalex.org/W1981773323","https://openalex.org/W1998269045","https://openalex.org/W2003690406","https://openalex.org/W2010371250","https://openalex.org/W2024147052","https://openalex.org/W2166630570","https://openalex.org/W2547958265","https://openalex.org/W2560674852","https://openalex.org/W2592541154","https://openalex.org/W2595840369","https://openalex.org/W2786586993","https://openalex.org/W2888080453","https://openalex.org/W2912973156","https://openalex.org/W2962844620","https://openalex.org/W2963684020","https://openalex.org/W2963798749","https://openalex.org/W3034414685","https://openalex.org/W3035569828","https://openalex.org/W3116092193","https://openalex.org/W3122766110","https://openalex.org/W3171540622","https://openalex.org/W3191037578","https://openalex.org/W4207064254","https://openalex.org/W4210631930","https://openalex.org/W4247692611","https://openalex.org/W4247950230","https://openalex.org/W4255005259","https://openalex.org/W4282010992","https://openalex.org/W4300471124","https://openalex.org/W4313227413"],"related_works":["https://openalex.org/W4306936641","https://openalex.org/W4298330562","https://openalex.org/W2615064437","https://openalex.org/W2534829024","https://openalex.org/W2547958265","https://openalex.org/W2570025454","https://openalex.org/W4376639560","https://openalex.org/W2508866287","https://openalex.org/W2753018644","https://openalex.org/W3128292923"],"abstract_inverted_index":{"Subset":[0],"selection":[1],"for":[2],"the":[3,16,33,37,51,59,64,74,86,98],"rank":[4],"k":[5],"approximation":[6,90],"of":[7,18,25,106],"an":[8,55],"n\u00d7":[9],"d":[10],"matrix":[11,81],"A":[12],"offers":[13],"improvements":[14],"in":[15,46,97],"interpretability":[17],"matrices,":[19],"as":[20,22,50],"well":[21],"a":[23,104],"variety":[24],"computational":[26],"savings.":[27],"This":[28],"problem":[29],"is":[30,36,77],"well-understood":[31],"when":[32,63,73],"error":[34,75],"measure":[35,76],"Frobenius":[38],"norm,":[39],"with":[40],"various":[41],"tight":[42],"algorithms":[43],"known":[44],"even":[45,96],"challenging":[47],"models":[48],"such":[49],"online":[52],"model,":[53],"where":[54],"algorithm":[56],"must":[57],"select":[58],"column":[60],"subset":[61,87],"irrevocably":[62],"columns":[65],"arrive":[66],"one":[67],"by":[68,79],"one.":[69],"In":[70],"sharp":[71],"contrast,":[72],"replaced":[78],"other":[80],"losses,":[82],"optimal":[83],"trade-offs":[84],"between":[85],"size":[88],"and":[89],"quality":[91],"have":[92],"not":[93],"been":[94],"settled,":[95],"standard":[99],"offline":[100],"setting.":[101],"We":[102],"give":[103],"number":[105],"results":[107],"towards":[108],"closing":[109],"these":[110],"gaps.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}