{"id":"https://openalex.org/W7152377793","doi":"https://doi.org/10.48550/arxiv.2604.06492","title":"Optimal Rates for Pure $\\varepsilon$-Differentially Private Stochastic Convex Optimization with Heavy Tails","display_name":"Optimal Rates for Pure $\\varepsilon$-Differentially Private Stochastic Convex Optimization with Heavy Tails","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7152377793","doi":"https://doi.org/10.48550/arxiv.2604.06492"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.06492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06492","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.06492","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133242691","display_name":"Andrew Lowy","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lowy, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5133242691"],"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.7875000238418579,"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.7875000238418579,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.15000000596046448,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.014700000174343586,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.755299985408783},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.692799985408783},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5625},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5072000026702881},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4916999936103821},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4812999963760376},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46720001101493835},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4496000111103058},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.44940000772476196}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7692000269889832},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.755299985408783},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.692799985408783},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5625},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4916999936103821},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.462799996137619},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4528000056743622},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.44940000772476196},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4171999990940094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4129999876022339},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.32580000162124634},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3005000054836273},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2720000147819519},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.2653999924659729},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.06492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06492","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":"doi:10.48550/arxiv.2604.06492","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.06492","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":"article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.46281179785728455}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,76,166],"study":[1],"stochastic":[2,40],"convex":[3],"optimization":[4],"(SCO)":[5],"with":[6,100,171],"heavy-tailed":[7,39,86],"gradients":[8],"under":[9],"pure":[10,70,84],"$\\varepsilon$-differential":[11],"privacy":[12],"(DP).":[13],"Instead":[14],"of":[15,24,162],"assuming":[16],"a":[17,30,154,172],"bound":[18,170],"on":[19,129,153],"the":[20,25,53,69,78,111,143,163],"worst-case":[21,112,144],"Lipschitz":[22,113,145,160],"parameter":[23,114,146],"loss,":[26],"we":[27,136],"assume":[28],"only":[29],"bounded":[31],"$k$-th":[32],"moment.":[33],"This":[34],"assumption":[35],"allows":[36],"for":[37,57,83,157],"unbounded,":[38],"gradient":[41],"distributions,":[42],"and":[43,126,133],"can":[44],"yield":[45],"sharper":[46],"excess":[47],"risk":[48],"bounds.":[49],"Prior":[50],"work":[51],"characterized":[52],"minimax":[54,79],"optimal":[55,80],"rate":[56,82,96],"$\u03c1$-zero-concentrated":[58],"DP":[59],"SCO":[60,87],"up":[61,88],"to":[62,89],"logarithmic":[63,90],"factors":[64],"in":[65,97,106],"this":[66,95],"setting,":[67],"but":[68],"$\\varepsilon$-DP":[71,85],"case":[72],"has":[73],"remained":[74],"open.":[75],"characterize":[77],"excess-risk":[81],"factors.":[91],"Our":[92,149],"algorithm":[93],"achieves":[94],"polynomial":[98,108,139],"time":[99,109,140],"high":[101],"probability.":[102],"Moreover,":[103],"it":[104],"runs":[105],"deterministic":[107,138],"when":[110,142],"is":[115,147,151],"polynomially":[116],"bounded.":[117],"For":[118],"important":[119],"structured":[120],"problem":[121],"classes":[122],"--":[123,135],"including":[124],"hinge/ReLU-type":[125],"absolute-value":[127],"losses":[128],"Euclidean":[130],"balls,":[131],"ellipsoids,":[132],"polytopes":[134],"achieve":[137],"even":[141],"infinite.":[148],"approach":[150],"based":[152],"novel":[155],"framework":[156],"privately":[158],"optimizing":[159],"extensions":[161],"empirical":[164],"loss.":[165],"complement":[167],"our":[168],"upper":[169],"nearly":[173],"matching":[174],"high-probability":[175],"lower":[176],"bound.":[177]},"counts_by_year":[],"updated_date":"2026-05-07T06:04:25.777469","created_date":"2026-04-10T00:00:00"}