{"id":"https://openalex.org/W7130555594","doi":"https://doi.org/10.48550/arxiv.2602.16155","title":"Differentially Private Non-convex Distributionally Robust Optimization","display_name":"Differentially Private Non-convex Distributionally Robust Optimization","publication_year":2026,"publication_date":"2026-02-18","ids":{"openalex":"https://openalex.org/W7130555594","doi":"https://doi.org/10.48550/arxiv.2602.16155"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.16155","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042101947","display_name":"Difei Xu","orcid":"https://orcid.org/0000-0002-4634-0639"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Difei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126403423","display_name":"Meng Ding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding, Meng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126409657","display_name":"Zebin Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Zebin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102697870","display_name":"Huanyi Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Huanyi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126374304","display_name":"Youming Tao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao, Youming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126441165","display_name":"Aicha Slaitane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Slaitane, Aicha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126384385","display_name":"Di Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Di","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":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.5807999968528748,"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.5807999968528748,"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.10809999704360962,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.0706000030040741,"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/robust-optimization","display_name":"Robust optimization","score":0.7670999765396118},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7628999948501587},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.5335999727249146},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5260000228881836},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49900001287460327},{"id":"https://openalex.org/keywords/empirical-risk-minimization","display_name":"Empirical risk minimization","score":0.4814999997615814},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.4447999894618988},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.40220001339912415}],"concepts":[{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.7670999765396118},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7628999948501587},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6460999846458435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.603600025177002},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.5335999727249146},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5260000228881836},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49900001287460327},{"id":"https://openalex.org/C107321475","wikidata":"https://www.wikidata.org/wiki/Q5374254","display_name":"Empirical risk minimization","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.40220001339912415},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37439998984336853},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3569999933242798},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.34360000491142273},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.16155","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.16155","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16155","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:doi:10.48550/arxiv.2602.16155","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":null,"raw_type":"Article"},"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":{"Real-world":[0],"deployments":[1],"routinely":[2],"face":[3],"distribution":[4],"shifts,":[5],"group":[6],"imbalances,":[7],"and":[8,101,118,162,199],"adversarial":[9],"perturbations,":[10],"under":[11,62],"which":[12],"the":[13,32,90,153,159,165,171,185,212],"traditional":[14],"Empirical":[15],"Risk":[16],"Minimization":[17],"(ERM)":[18],"framework":[19],"can":[20],"degrade":[21],"severely.":[22],"Distributionally":[23],"Robust":[24],"Optimization":[25],"(DRO)":[26],"addresses":[27],"this":[28,131],"issue":[29],"by":[30,111,183],"optimizing":[31],"worst-case":[33],"expected":[34],"loss":[35],"over":[36],"an":[37],"uncertainty":[38,86],"set":[39],"of":[40,97,144,152,207],"distributions,":[41],"offering":[42],"a":[43,94,115,120,141,188,195,204],"principled":[44],"approach":[45],"to":[46,70,80,130],"robustness.":[47],"Meanwhile,":[48],"as":[49,114],"training":[50],"data":[51,160],"in":[52,150],"DRO":[53,107],"always":[54],"involves":[55],"sensitive":[56],"information,":[57],"safeguarding":[58],"it":[59,113,139,202],"against":[60],"leakage":[61],"Differential":[63],"Privacy":[64],"(DP)":[65],"is":[66],"essential.":[67],"In":[68,177],"contrast":[69],"classical":[71],"DP-ERM,":[72],"DP-DRO":[73,180],"has":[74],"received":[75],"much":[76],"less":[77],"attention":[78],"due":[79],"its":[81],"minimax":[82,230],"optimization":[83,124,191],"structure":[84],"with":[85,99,108,181],"constraint.":[87],"To":[88],"bridge":[89],"gap,":[91],"we":[92,105,136,193,219],"provide":[93],"comprehensive":[95],"study":[96,106],"DP-(finite-sum)-DRO":[98],"$\u03c8$-divergence":[100,110],"non-convex":[102,216],"loss.":[103],"First,":[104],"general":[109],"reformulating":[112],"minimization":[116],"problem,":[117,192],"develop":[119,194],"novel":[121],"$(\\varepsilon,":[122],"\u03b4)$-DP":[123],"method,":[125],"called":[126],"DP":[127,196,229],"Double-Spider,":[128],"tailored":[129],"structure.":[132],"Under":[133],"mild":[134],"assumptions,":[135],"show":[137,200],"that":[138,201,221],"achieves":[140,203],"utility":[142,172,205],"bound":[143,206],"$\\mathcal{O}(\\frac{1}{\\sqrt{n}}+":[145],"(\\frac{\\sqrt{d":[146],"\\log":[147],"(1/\u03b4)}}{n":[148],"\\varepsilon})^{2/3})$":[149],"terms":[151],"gradient":[154],"norm,":[155],"where":[156],"$n$":[157],"denotes":[158,164],"size":[161],"$d$":[163],"model":[166],"dimension.":[167],"We":[168],"further":[169],"improve":[170],"rate":[173],"for":[174,179,215,228],"specific":[175],"divergences.":[176],"particular,":[178],"KL-divergence,":[182],"transforming":[184],"problem":[186],"into":[187],"compositional":[189],"finite-sum":[190],"Recursive-Spider":[197],"method":[198],"$\\mathcal{O}((\\frac{\\sqrt{d":[208],"\\log(1/\u03b4)}}{n\\varepsilon})^{2/3}":[209],")$,":[210],"matching":[211],"best-known":[213],"result":[214],"DP-ERM.":[217],"Experimentally,":[218],"demonstrate":[220],"our":[222],"proposed":[223],"methods":[224],"outperform":[225],"existing":[226],"approaches":[227],"optimization.":[231]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-20T00:00:00"}