{"id":"https://openalex.org/W7165369697","doi":"https://doi.org/10.48550/arxiv.2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","display_name":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","publication_year":2026,"publication_date":"2026-06-18","ids":{"openalex":"https://openalex.org/W7165369697","doi":"https://doi.org/10.48550/arxiv.2606.20082"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.20082","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20082","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.2606.20082","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138993995","display_name":"Xiaoyu Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xiaoyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107877612","display_name":"J. Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Junwei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139014435","display_name":"Jiaojiao Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Jiaojiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112625169","display_name":"Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Junbin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031625303","display_name":"Andi Han","orcid":"https://orcid.org/0000-0003-4655-655X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Han, Andi","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/T11435","display_name":"Polynomial and algebraic computation","score":0.27250000834465027,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.27250000834465027,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.12720000743865967,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.09989999979734421,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/oracle","display_name":"Oracle","score":0.6783999800682068},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.6657999753952026},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5687000155448914},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5580000281333923},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.5415999889373779},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5056999921798706},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.476500004529953},{"id":"https://openalex.org/keywords/ellipse","display_name":"Ellipse","score":0.4381999969482422},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6783999800682068},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.6657999753952026},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5687000155448914},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5580000281333923},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.5415999889373779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5397999882698059},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5056999921798706},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46860000491142273},{"id":"https://openalex.org/C74261601","wikidata":"https://www.wikidata.org/wiki/Q40112","display_name":"Ellipse","level":2,"score":0.4381999969482422},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.4250999987125397},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C74050887","wikidata":"https://www.wikidata.org/wiki/Q848368","display_name":"Rotation (mathematics)","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33390000462532043},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2847000062465668},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2694000005722046},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.20082","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20082","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.2606.20082","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20082","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":{"The":[0,94,182],"John":[1],"ellipsoid":[2],"of":[3,16,103,179],"a":[4,13,34,97,133,177],"symmetric":[5],"polytope":[6],"$P=\\{\\mathbf{x}\\in\\mathbb{R}^d:\\|\\mathbf{A}\\mathbf{x}\\|_\\infty\\le1\\}$,":[7],"$\\mathbf{A}\\in\\mathbb{R}^{n\\times":[8],"d}$,":[9],"is":[10,73,96,120,131,153,158,185,197,214],"computed":[11],"by":[12],"long":[14],"line":[15,48],"leverage-score":[17,71],"algorithms,":[18],"from":[19],"Cohen,":[20],"Cousins,":[21],"Lee":[22],"and":[23,52,54,78,148,210],"Yang":[24],"(COLT":[25],"2019)":[26],"to":[27],"its":[28],"successors":[29],"[WY24,":[30],"CLS+25],":[31],"all":[32],"reaching":[33,206],"$(1+\\varepsilon)$-approximation":[35],"in":[36,59,140],"$\u0398(\\varepsilon^{-1}\\log(n/d))$":[37],"iterations.":[38],"We":[39],"separate":[40],"this":[41,88],"complexity":[42],"into":[43],"three":[44],"costs":[45,91],"the":[46,56,60,64,70,75,79,82,90,100,104,106,110,125,128,138,150,155,165,194,198,207,216],"modern":[47],"conflates":[49],"(certification,":[50],"identification,":[51],"accuracy)":[53],"locate":[55],"historical":[57],"$\\varepsilon^{-1}$":[58,95],"first":[61],"alone.":[62],"In":[63],"equivalent":[65],"D-optimal-design":[66],"form":[67],"$\\min_{\\mathbf{p}\\in\u0394_n}-\\log\\det(\\sum_i":[68],"p_i\\mathbf{a}_i\\mathbf{a}_i^\\top)$,":[69],"oracle":[72,77,130,166],"exactly":[74,114],"first-order":[76],"$(1+\\varepsilon)$-John":[80],"guarantee":[81,139],"Frank-Wolfe":[83],"gap":[84,113],"$g(\\mathbf{p})\\le\\varepsilon":[85],"d$;":[86],"through":[87],"dictionary":[89],"come":[92],"apart.":[93],"certification":[98],"artifact:":[99],"uniform":[101],"average":[102],"iterates,":[105],"certificate":[107],"used":[108],"throughout":[109],"line,":[111],"has":[112],"$\u0398(1/T)$,":[115],"however":[116],"cheap":[117],"each":[118],"iteration":[119],"made.":[121],"Pointed":[122],"instead":[123],"at":[124],"last":[126],"iterate":[127],"same":[129],"fast:":[132],"warm-started":[134],"accelerated":[135],"method":[136],"reaches":[137],"$C(\\mathbf{A})+O(\\sqrt\u03ba\\log(1/\\varepsilon))$":[141],"queries":[142],"after":[143,189],"an":[144,159,190],"$\\varepsilon$-independent":[145],"setup":[146],"$C(\\mathbf{A})$,":[147],"once":[149],"optimal":[151,208],"face":[152],"identified":[154],"facial":[156],"problem":[157,196],"unconstrained":[160],"self-concordant":[161],"minimization":[162],"whose":[163],"Hessian":[164],"recovers":[167],"exactly,":[168],"so":[169],"damped":[170],"Newton":[171],"needs":[172],"only":[173],"$O(\\log\\log(1/\\varepsilon))$":[174],"steps,":[175],"for":[176],"total":[178],"$C(\\mathbf{A})+O(d^2\\log\\log(1/\\varepsilon))$":[180],"queries.":[181],"accuracy":[183],"dependence":[184],"thus":[186],"doubly":[187],"logarithmic":[188],"$\\varepsilon$-independent,":[191],"condition-dependent":[192],"setup;":[193],"open":[195],"remaining":[199],"identification":[200],"cost":[201],"(a":[202],"condition-free":[203],"bound":[204],"on":[205],"face)":[209],"lower":[211],"bounds.":[212],"Accuracy":[213],"not":[215],"obstruction.":[217]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-20T00:00:00"}