{"id":"https://openalex.org/W7140186211","doi":"https://doi.org/10.48550/arxiv.2603.20966","title":"Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices","display_name":"Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices","publication_year":2026,"publication_date":"2026-03-21","ids":{"openalex":"https://openalex.org/W7140186211","doi":"https://doi.org/10.48550/arxiv.2603.20966"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05564651v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05564651","pdf_url":"https://inria.hal.science/hal-05564651v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-05564651v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Daas, Hussam Al","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daas, Hussam Al","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ballard, Grey","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ballard, Grey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Grigori, Laura","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grigori, Laura","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Hussain, Md Taufique","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hussain, Md Taufique","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Kumar, Suraj","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kumar, Suraj","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Rahman, Mohammad Marufur","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rahman, Mohammad Marufur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Rouse, Kathryn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rouse, Kathryn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9722999930381775,"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.9722999930381775,"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.007899999618530273,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/bottleneck","display_name":"Bottleneck","score":0.7192999720573425},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5921000242233276},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5440999865531921},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5374000072479248},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.5037999749183655},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.491100013256073},{"id":"https://openalex.org/keywords/numerical-linear-algebra","display_name":"Numerical linear algebra","score":0.48820000886917114},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4307999908924103},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3783999979496002}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7192999720573425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6955999732017517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5942000150680542},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5921000242233276},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5440999865531921},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5374000072479248},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.5037999749183655},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C163834973","wikidata":"https://www.wikidata.org/wiki/Q2004891","display_name":"Numerical linear algebra","level":3,"score":0.48820000886917114},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4307999908924103},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4275999963283539},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33090001344680786},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.28119999170303345},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C3019722297","wikidata":"https://www.wikidata.org/wiki/Q4440864","display_name":"High dimensional","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05564651v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05564651","pdf_url":"https://inria.hal.science/hal-05564651v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},{"id":"doi:10.48550/arxiv.2603.20966","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.20966","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":"article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05564651v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05564651","pdf_url":"https://inria.hal.science/hal-05564651v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},"sustainable_development_goals":[{"score":0.6315041184425354,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7140186211.pdf","grobid_xml":"https://content.openalex.org/works/W7140186211.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Sketching":[0],"is":[1,80,94,98,136],"widely":[2],"used":[3],"in":[4,25,85],"randomized":[5],"linear":[6],"algebra":[7],"for":[8,56,69,100,129],"low-rank":[9],"matrix":[10],"approximation,":[11],"column":[12],"subset":[13],"selection,":[14],"and":[15,19,168,171],"many":[16],"other":[17],"problems,":[18],"it":[20,84],"has":[21],"gained":[22],"significant":[23],"traction":[24],"machine":[26],"learning":[27],"applications.":[28],"However,":[29],"sketching":[30,57,70,135],"large":[31],"matrices":[32,73],"often":[33],"necessitates":[34],"distributed":[35],"memory":[36],"algorithms,":[37],"where":[38,134],"communication":[39,66,97,116,126,146],"overhead":[40],"becomes":[41],"a":[42,101],"critical":[43],"bottleneck":[44],"on":[45,159],"modern":[46,160],"supercomputing":[47,162],"clusters.":[48],"Despite":[49],"its":[50],"growing":[51],"relevance,":[52],"distributed-memory":[53],"parallel":[54,143,174],"strategies":[55],"remain":[58],"largely":[59],"unexplored.":[60],"In":[61],"this":[62],"work,":[63],"we":[64,120,155],"establish":[65],"lower":[67,92,110,127,152],"bounds":[68,93,111,128],"using":[71],"dense":[72],"that":[74,95,108],"determine":[75,125],"how":[76],"much":[77],"data":[78],"movement":[79],"required":[81,99],"to":[82,124,150],"perform":[83],"parallel.":[86],"One":[87],"important":[88],"observation":[89],"of":[90,104,131],"our":[91,109,122,157],"no":[96],"small":[102],"number":[103],"processors.":[105],"We":[106,139],"show":[107],"are":[112,148],"tight":[113],"by":[114],"presenting":[115],"optimal":[117],"algorithms.":[118],"Furthermore,":[119],"extend":[121],"approach":[123],"computations":[130],"Nystr\u00f6m":[132],"approximation":[133],"applied":[137],"twice.":[138],"also":[140],"introduce":[141],"novel":[142],"algorithms":[144,158],"whose":[145],"costs":[147],"close":[149],"the":[151],"bounds.":[153],"Finally,":[154],"implement":[156],"state-of-the-art":[161],"infrastructures":[163],"which":[164],"have":[165],"both":[166],"CPU-":[167],"GPU-equipped":[169],"systems":[170],"demonstrate":[172],"their":[173],"scalability.":[175]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2026-03-25T00:00:00"}