{"id":"https://openalex.org/W7225435440","doi":null,"title":"A Minimax Optimization Framework for Robust Deep Learning under Adversarial Perturbations","display_name":"A Minimax Optimization Framework for Robust Deep Learning under Adversarial Perturbations","publication_year":2026,"publication_date":"2026-10-03","ids":{"openalex":"https://openalex.org/W7225435440"},"language":"en","primary_location":{"id":"pmh:oai:ojs2.journalmta.com:article/471","doi":null,"is_oa":true,"landing_page_url":"https://journalmta.com/index.php/jmta/article/view/471","pdf_url":"https://journalmta.com/index.php/jmta/article/download/471/360","source":{"id":"https://openalex.org/S7407065557","display_name":"Minimax Theory and its Applications","issn_l":"2199-1421","issn":["2199-1421","2199-1413"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["dongbi-c","norway-1","poland-70","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2199-1413","raw_type":"info:eu-repo/semantics/article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://journalmta.com/index.php/jmta/article/download/471/360","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5161038606","display_name":"Ali Sert","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sert, Ali","raw_affiliation_strings":["School of Business and Management , University of Sunderland in Hong Kong , Hong Kong , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Business and Management , University of Sunderland in Hong Kong , Hong Kong , China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5161038606"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9994999766349792,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9994999766349792,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":9.999999747378752e-05,"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.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/adversarial-training","display_name":"adversarial training","score":0.8539999723434448},{"id":"https://openalex.org/keywords/min-max-optimization","display_name":"minimax optimization","score":0.8529999852180481},{"id":"https://openalex.org/keywords/robust-deep-learning","display_name":"robust deep learning","score":0.7870000004768372},{"id":"https://openalex.org/keywords/adversarial-perturbations","display_name":"adversarial perturbations","score":0.9330000281333923},{"id":"https://openalex.org/keywords/temperature-parameter","display_name":"temperature parameter","score":0.6129999756813049},{"id":"https://openalex.org/keywords/boltzmann-distribution","display_name":"Boltzmann distribution","score":0.5860000252723694},{"id":"https://openalex.org/keywords/worst-case-loss","display_name":"worst-case loss","score":0.6990000009536743},{"id":"https://openalex.org/keywords/lipschitz-gradient","display_name":"Lipschitz gradient","score":0.675000011920929},{"id":"https://openalex.org/keywords/iteration-complexity","display_name":"iteration complexity","score":0.8230000138282776},{"id":"https://openalex.org/keywords/gradient-projection-method","display_name":"gradient projection","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C190502265","wikidata":"https://www.wikidata.org/wiki/Q17069496","display_name":"MNIST database","level":3,"score":0.8888000249862671},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.833899974822998},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7135000228881836},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6528000235557556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6219000220298767},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5573999881744385},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5099999904632568},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.374099999666214},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2971000075340271},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.29510000348091125},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2702000141143799},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25540000200271606}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:ojs2.journalmta.com:article/471","doi":null,"is_oa":true,"landing_page_url":"https://journalmta.com/index.php/jmta/article/view/471","pdf_url":"https://journalmta.com/index.php/jmta/article/download/471/360","source":{"id":"https://openalex.org/S7407065557","display_name":"Minimax Theory and its Applications","issn_l":"2199-1421","issn":["2199-1421","2199-1413"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["dongbi-c","norway-1","poland-70","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2199-1413","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ojs2.journalmta.com:article/471","doi":null,"is_oa":true,"landing_page_url":"https://journalmta.com/index.php/jmta/article/view/471","pdf_url":"https://journalmta.com/index.php/jmta/article/download/471/360","source":{"id":"https://openalex.org/S7407065557","display_name":"Minimax Theory and its Applications","issn_l":"2199-1421","issn":["2199-1421","2199-1413"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["dongbi-c","norway-1","poland-70","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2199-1413","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225435440.pdf","grobid_xml":"https://content.openalex.org/works/W7225435440.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1551360398","https://openalex.org/W1972010412","https://openalex.org/W1985077192","https://openalex.org/W2112796928","https://openalex.org/W2116775748","https://openalex.org/W2167732364","https://openalex.org/W2516574342","https://openalex.org/W2790417304","https://openalex.org/W2963470657","https://openalex.org/W2991240978","https://openalex.org/W3082548577","https://openalex.org/W4243316134","https://openalex.org/W4415221347"],"related_works":["https://openalex.org/W2970203973","https://openalex.org/W4410950114","https://openalex.org/W2948985530","https://openalex.org/W2966091527","https://openalex.org/W4225977652","https://openalex.org/W3209838601","https://openalex.org/W7047792466","https://openalex.org/W2806695556","https://openalex.org/W2975704539","https://openalex.org/W4378465428"],"abstract_inverted_index":{"Adversarial":[0],"training":[1],"defends":[2],"deep":[3],"networks":[4],"by":[5,222],"solving":[6],"a":[7,41,49,54,99,145,160],"minimax":[8],"problem.":[9],"The":[10,24,43,167,195],"learner":[11],"minimizes":[12],"the":[13,30,35,63,66,69,75,81,84,87,105,119,125,130,138,141,192,199,218,223,233,236],"worst":[14],"loss":[15,26,121],"that":[16,93,101,108,115],"an":[17],"adversary":[18,36,224],"can":[19],"reach":[20],"near":[21],"each":[22],"input.":[23],"worst-case":[25,244],"has":[27,48],"kinks":[28],"in":[29],"network":[31],"weights.":[32],"We":[33,91,113,148],"regularize":[34],"with":[37,98,104,151],"relative":[38],"entropy":[39],"and":[40,65,107,137,156,185],"temperature.":[42],"regularized":[44],"inner":[45],"problem":[46],"then":[47],"closed-form":[50],"Gibbs":[51],"solution":[52],"over":[53],"set":[55],"of":[56,68,86,89,118,163,230],"candidate":[57,70,77],"perturbations.":[58],"Its":[59,72],"value":[60],"lies":[61],"between":[62],"mean":[64],"maximum":[67],"losses.":[71],"distance":[73],"below":[74,232],"best":[76],"is":[78,96,111],"at":[79,159],"most":[80],"temperature":[82,139,200],"times":[83],"logarithm":[85],"number":[88],"candidates.":[90],"prove":[92,114],"its":[94],"gradient":[95,174],"Lipschitz":[97],"constant":[100,110],"grows":[102],"inversely":[103],"temperature,":[106],"this":[109],"attained.":[112],"near-stationary":[116,123],"points":[117],"smoothed":[120],"are":[122,134],"for":[124,181],"original":[126],"min-max":[127],"loss.":[128],"In":[129],"zero-temperature":[131],"limit":[132],"they":[133],"Clarke":[135],"stationary,":[136],"enters":[140],"iteration":[142],"complexity":[143],"through":[144],"logarithmic":[146],"factor.":[147],"compare":[149],"it":[150],"three":[152,226],"defenses":[153],"on":[154,172,183,189,207,213],"MNIST":[155,158,243],"Fashion":[157],"matched":[161],"budget":[162,237],"eight":[164],"ascent":[165],"steps.":[166],"method":[168],"did":[169],"not":[170],"improve":[171],"projected":[173],"adversarial":[175],"training.":[176],"Worst-case":[177],"accuracy":[178,245],"was":[179,225],"58.5%":[180],"both":[182],"Fashion-MNIST,":[184],"32.3%":[186],"against":[187],"34.4%":[188],"MNIST,":[190],"within":[191],"test-sampling":[193],"error.":[194],"theory":[196],"explains":[197],"why":[198],"had":[201],"little":[202],"effect:":[203],"two":[204],"restarts":[205],"ended":[206],"average":[208],"only":[209],"0.047":[210],"nats":[211],"apart":[212],"MNIST.":[214],"On":[215],"trained":[216],"networks,":[217],"measured":[219],"curvature":[220],"added":[221],"to":[227,246],"four":[228,239],"orders":[229],"magnitude":[231],"bound.":[234],"Splitting":[235],"into":[238],"two-step":[240],"chains":[241],"reduced":[242],"5.6%.":[247]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-07T00:00:00"}