{"id":"https://openalex.org/W7171658896","doi":"https://doi.org/10.48550/arxiv.2607.24827","title":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","display_name":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","publication_year":2026,"publication_date":"2026-07-21","ids":{"openalex":"https://openalex.org/W7171658896","doi":"https://doi.org/10.48550/arxiv.2607.24827"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.24827","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24827","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":"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.2607.24827","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090368375","display_name":"Michael Menart","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Menart, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143932825","display_name":"Aleksandar Nikolov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolov, Aleksandar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5143963010","display_name":"Ohad Shamir","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shamir, Ohad","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8309000134468079,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8309000134468079,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07100000232458115,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.019600000232458115,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/oracle","display_name":"Oracle","score":0.8050000071525574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.699999988079071},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4855000078678131},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47780001163482666},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4410000145435333},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4339999854564667},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.41839998960494995}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8050000071525574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.699999988079071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5722000002861023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48660001158714294},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47780001163482666},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.435699999332428},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43369999527931213},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.41839998960494995},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35589998960494995},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.26919999718666077}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.24827","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24827","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":"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.2607.24827","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24827","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":"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":{"We":[0,27],"prove":[1],"two":[2],"lower":[3,65,84,131],"bounds":[4,66],"for":[5,71,86,164],"the":[6,19,61,90,115,123,136,148,165,168],"first":[7,28,91,137],"order":[8],"oracle":[9,39,96,119],"complexity":[10,97,151],"of":[11,25,56,67,117],"minimizing":[12],"a":[13,94,104,111,159],"$d$-dimensional":[14],"$1$-Lipschitz":[15],"convex":[16],"function":[17],"over":[18],"unit":[20],"ball":[21],"with":[22],"$m$":[23],"bits":[24],"memory.":[26],"show":[29,46,93,139],"that":[30,47,140],"any":[31],"such":[32,158],"(possibly":[33],"randomized)":[34],"algorithm":[35],"must":[36],"make":[37],"$\\tilde\u03a9(\\frac{d^2}{\\sqrt{m}})$":[38],"queries.":[40],"For":[41,52],"deterministic":[42,74,87],"optimization":[43],"algorithms,":[44],"we":[45],"$\\tilde\u03a9(\\min\\{d^{1.6},\\frac{d^{8/3}}{m^{2/3}}\\})$":[48],"queries":[49],"are":[50],"required.":[51],"all":[53],"memory":[54,108,142,155],"regimes":[55],"interest,":[57],"these":[58],"improves":[59],"upon":[60],"previous":[62],"best":[63],"known":[64,163],"$\\tilde\u03a9(\\max\\{\\frac{d^{8/3}}{m^{4/3}},\\frac{d^{4/3}}{m^{1/6}}\\})$":[68],"and":[69,73],"$\\tilde\u03a9(\\frac{d^{5/3}}{m^{1/3}})$":[70],"randomized":[72,133],"algorithms":[75,88,134,153],"respectively.":[76],"Notably,":[77],"due":[78],"to":[79,92,110,138,145],"existing":[80],"upper":[81],"bounds,":[82],"our":[83,130],"bound":[85,132],"is":[89,125,135,143,170],"sharp":[95],"phase":[98],"transition":[99],"around":[100],"$m\\approx":[101],"d^2$,":[102],"where":[103,167],"polylogarithmic":[105],"change":[106,113],"in":[107,114,128,173],"leads":[109],"$\\mathsf{poly}(d)$":[112],"number":[116],"required":[118],"calls.":[120],"Further,":[121],"when":[122],"suboptimality":[124,169],"polynomially":[126],"small":[127,172],"$d$,":[129],"$\\tilde\u03a9(d^2)$":[141],"necessary":[144],"nearly":[146],"match":[147],"optimal":[149],"query":[150],"among":[152],"without":[154],"constraints.":[156],"Previously,":[157],"result":[160],"was":[161],"only":[162],"regime":[166],"quasipolynomially":[171],"$d$.":[174]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2026-07-30T00:00:00"}