{"id":"https://openalex.org/W7116356610","doi":"https://doi.org/10.48550/arxiv.2512.15929","title":"Make the most of what you have: Resource-efficient randomized algorithms for matrix computations","display_name":"Make the most of what you have: Resource-efficient randomized algorithms for matrix computations","publication_year":2025,"publication_date":"2025-12-17","ids":{"openalex":"https://openalex.org/W7116356610","doi":"https://doi.org/10.48550/arxiv.2512.15929"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.15929","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.15929","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"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.2512.15929","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062942875","display_name":"Ethan N. Epperly","orcid":"https://orcid.org/0000-0003-0712-8296"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Epperly, Ethan N.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5062942875"],"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.8910999894142151,"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.8910999894142151,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.015799999237060547,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.012900000438094139,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5663999915122986},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.5490999817848206},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5235999822616577},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5174999833106995},{"id":"https://openalex.org/keywords/overdetermined-system","display_name":"Overdetermined system","score":0.5117999911308289},{"id":"https://openalex.org/keywords/eight-point-algorithm","display_name":"Eight-point algorithm","score":0.5110999941825867},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.37540000677108765},{"id":"https://openalex.org/keywords/fundamental-matrix","display_name":"Fundamental matrix (linear differential equation)","score":0.3677000105381012}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5914999842643738},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5663999915122986},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.5490999817848206},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5235999822616577},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5174999833106995},{"id":"https://openalex.org/C81901731","wikidata":"https://www.wikidata.org/wiki/Q331348","display_name":"Overdetermined system","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C56275529","wikidata":"https://www.wikidata.org/wiki/Q5348937","display_name":"Eight-point algorithm","level":5,"score":0.5110999941825867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5016000270843506},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C2780427248","wikidata":"https://www.wikidata.org/wiki/Q17014996","display_name":"Fundamental matrix (linear differential equation)","level":2,"score":0.3677000105381012},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3578999936580658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35010001063346863},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C58663186","wikidata":"https://www.wikidata.org/wiki/Q6553462","display_name":"Linear least squares","level":3,"score":0.3073999881744385},{"id":"https://openalex.org/C4033963","wikidata":"https://www.wikidata.org/wiki/Q786970","display_name":"Autocorrelation matrix","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.2962000072002411},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.28679999709129333},{"id":"https://openalex.org/C163834973","wikidata":"https://www.wikidata.org/wiki/Q2004891","display_name":"Numerical linear algebra","level":3,"score":0.2854999899864197},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.2784999907016754},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26420000195503235},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.15929","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.15929","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.15929","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.15929","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.4458710849285126,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"recent":[1,218],"years,":[2],"randomized":[3,27,195,243],"algorithms":[4,29,58,178,196,204],"have":[5],"established":[6],"themselves":[7],"as":[8,63,65,107,113],"fundamental":[9],"tools":[10],"in":[11,17,229],"computational":[12,46],"linear":[13,199],"algebra,":[14],"with":[15],"applications":[16],"scientific":[18],"computing,":[19],"machine":[20],"learning,":[21],"and":[22,38,73,136,179,184],"quantum":[23],"information":[24,34,62],"science.":[25],"Many":[26],"matrix":[28,37,104,112,161,175],"proceed":[30],"by":[31,164,240],"first":[32,81],"collecting":[33],"about":[35,223],"a":[36,76,103,132,254],"then":[39],"processing":[40],"that":[41,59],"data":[42,78],"to":[43,97,102,173],"perform":[44],"some":[45],"task.":[47],"This":[48,115,167,233],"thesis":[49,85,119,151,168,193,234],"addresses":[50],"the":[51,69,94,111,118,121,143,153,170,224,249],"following":[52],"question:":[53],"How":[54],"can":[55],"one":[56],"design":[57],"use":[60],"this":[61,84,128,150,192],"efficiently":[64],"possible,":[66],"reliably":[67],"achieving":[68,246],"greatest":[70],"possible":[71],"speed":[72,135],"accuracy":[74,225],"for":[75,90,127,142,197,205,253],"limited":[77],"budget?":[79],"The":[80,146,188],"part":[82,116,148,190],"of":[83,110,117,134,149,155,158,191,226],"focuses":[86],"on":[87],"low-rank":[88],"approximation":[89,101],"positive-semidefinite":[91],"matrices.":[92],"Here,":[93],"goal":[95],"is":[96],"compute":[98],"an":[99,159],"accurate":[100],"after":[105],"accessing":[106],"few":[108],"entries":[109],"possible.":[114],"explores":[120],"randomly":[122],"pivoted":[123],"Cholesky":[124],"(RPCholesky)":[125],"algorithm":[126],"task,":[129],"which":[130],"achieves":[131],"level":[133],"reliability":[137],"greater":[138],"than":[139,212],"other":[140],"methods":[141,228],"same":[144],"problem.":[145],"second":[147],"considers":[152,194],"task":[154],"estimating":[156],"attributes":[157],"implicit":[160],"accessible":[162],"only":[163],"matrix-vector":[165],"products.":[166],"describes":[169],"leave-one-out":[171],"approach":[172],"developing":[174,241],"attribute":[176],"estimation":[177,186],"develops":[180],"optimized":[181],"trace,":[182],"diagonal,":[183],"row-norm":[185],"algorithms.":[187],"third":[189],"overdetermined":[198],"least":[200],"squares":[201,207],"problems.":[202],"Randomized":[203],"linear-least":[206],"problems":[208],"are":[209,238],"asymptotically":[210],"faster":[211],"any":[213],"known":[214],"deterministic":[215],"algorithm,":[216],"but":[217],"work":[219],"has":[220],"raised":[221],"questions":[222],"these":[227,236],"floating":[230],"point":[231],"arithmetic.":[232],"shows":[235],"issues":[237],"resolvable":[239],"fast":[242],"least-squares":[244],"problem":[245],"backward":[247],"stability,":[248],"gold-standard":[250],"stability":[251],"guarantee":[252],"numerical":[255],"algorithm.":[256]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-12-21T00:00:00"}