{"id":"https://openalex.org/W7155887717","doi":"https://doi.org/10.48550/arxiv.2604.22699","title":"Entrywise Low-Rank Approximation and Matrix $p \\rightarrow q$ Norms via Global Correlation Rounding","display_name":"Entrywise Low-Rank Approximation and Matrix $p \\rightarrow q$ Norms via Global Correlation Rounding","publication_year":2026,"publication_date":"2026-04-24","ids":{"openalex":"https://openalex.org/W7155887717","doi":"https://doi.org/10.48550/arxiv.2604.22699"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.22699","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.22699","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.22699","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134698054","display_name":"Prashanti Anderson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anderson, Prashanti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079598728","display_name":"Ainesh Bakshi","orcid":"https://orcid.org/0009-0001-0225-8588"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bakshi, Ainesh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5127872778","display_name":"Samuel Hopkins","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hopkins, Samuel B.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.840499997138977,"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.840499997138977,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.10130000114440918,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.024399999529123306,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.5942000150680542},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5357000231742859},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4724999964237213},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.45100000500679016},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4465000033378601},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.43290001153945923},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.4325999915599823},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4318999946117401},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.41290000081062317}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7020000219345093},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5942000150680542},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.45100000500679016},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4465000033378601},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.4325999915599823},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.41290000081062317},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C62376455","wikidata":"https://www.wikidata.org/wiki/Q935210","display_name":"Spouge's approximation","level":3,"score":0.40950000286102295},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.39430001378059387},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3330000042915344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32679998874664307},{"id":"https://openalex.org/C109282560","wikidata":"https://www.wikidata.org/wiki/Q4166054","display_name":"Singular value","level":3,"score":0.3082999885082245},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.27810001373291016},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.27079999446868896},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.22699","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.22699","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.22699","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.22699","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,118,149,174],"matrix":[2,182],"$A$,":[3],"the":[4,7,27,41,50,67,77,90,98,123,138,168,201,208],"goal":[5],"of":[6,82,93,102,141,177],"entrywise":[8,28],"low-rank":[9],"approximation":[10,70,81,92,100,120,160,179,205],"problem":[11,37,51],"is":[12,26,38],"to":[13,153,157,172,191],"find":[14],"$\\operatorname{argmin}":[15],"\\|A-B\\|_p$":[16],"over":[17],"all":[18],"rank-$k$":[19],"matrices":[20],"$B$,":[21],"where":[22],"$\\|":[23],"\\cdot":[24],"\\|_p$":[25],"$\\ell_p$":[29],"norm.":[30],"When":[31],"$p":[32,47,58,124,132,183,210],"=":[33],"2$":[34,49,60,126],"this":[35,73],"well-studied":[36],"solved":[39],"by":[40],"singular":[42],"value":[43],"decomposition,":[44],"but":[45],"for":[46,72,151,162,181],"\\neq":[48],"becomes":[52],"computationally":[53],"challenging.":[54],"For":[55],"every":[56,62],"even":[57],">":[59,133],"and":[61,88,95,97,105,113,144,194],"fixed":[63],"$k$,":[64],"we":[65,136,199],"give":[66,173,200],"first":[68,202],"polynomial-time":[69,119,159],"scheme":[71,101,121],"problem,":[74],"improving":[75],"on":[76,111],"$(3":[78],"+":[79],"\\varepsilon)$":[80],"Ban,":[83],"Bhattiprolu,":[84],"Bringmann,":[85],"Kolev,":[86],"Lee,":[87],"Woodruff,":[89],"bi-criteria":[91],"Woodruff":[94],"Yasuda,":[96],"additive":[99,178,204],"Anderson,":[103],"Bakshi,":[104],"Hopkins.":[106],"Prior":[107],"algorithmic":[108,170],"approaches":[109],"based":[110],"sketching":[112],"column":[114],"selection,":[115],"which":[116,187],"yielded":[117],"in":[122,145,207],"<":[125,211,213],"setting,":[127],"face":[128],"concrete":[129],"barriers":[130],"when":[131],"2$.":[134],"Instead,":[135],"use":[137,154,167],"Sherali-Adams":[139],"hierarchy":[140],"convex":[142,155],"programs,":[143],"so":[146],"doing":[147],"establish":[148],"blueprint":[150],"how":[152],"hierarchies":[156],"design":[158],"schemes":[161],"continuous":[163],"optimization":[164],"problems.":[165],"We":[166],"same":[169],"strategy":[171],"new":[175],"family":[176],"algorithms":[180,206],"\\rightarrow":[184],"q$":[185],"norms,":[186],"are":[188],"intimately":[189],"related":[190],"small-set":[192],"expansion":[193],"quantum":[195],"information.":[196],"In":[197],"particular,":[198],"nontrivial":[203],"regime":[209],"2":[212],"q$.":[214]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-28T00:00:00"}