{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:24:07Z","timestamp":1777890247917,"version":"3.51.4"},"reference-count":51,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276038"],"award-info":[{"award-number":["62276038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJZD-M202400603,KJQN202500612"],"award-info":[{"award-number":["KJZD-M202400603,KJQN202500612"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iccv51701.2025.00059","type":"proceedings-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:45:49Z","timestamp":1777491949000},"page":"552-561","source":"Crossref","is-referenced-by-count":0,"title":["Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimization"],"prefix":"10.1109","author":[{"given":"Zuyu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Chongqing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Chongqing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongshan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Chongqing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Zhang","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications,Key Laboratory of Big Data Intelligent Computing"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Chongqing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"3","key":"ref1","first-page":"732","article-title":"Chaos: an introduction to dynamical systems","volume":"40","author":"Alligood","year":"1998","journal-title":"SIAM Review"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00359"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW56347.2022.00461"},{"key":"ref5","article-title":"Improved regularization of convolutional neural networks with cutout","author":"DeVries","year":"2017","journal-title":"arXiv preprint"},{"key":"ref6","article-title":"Optimal machine intelligence at the edge of chaos","author":"Feng","year":"2019","journal-title":"arXiv preprint"},{"key":"ref7","article-title":"Sharpness-aware minimization for efficiently improving generalization","author":"Foret","year":"2020","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.12.041"},{"key":"ref9","first-page":"1225","article-title":"Train faster, generalize better: Stability of stochastic gradient descent","volume-title":"International Conference on Machine Learning","author":"Hardt"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroscience.2024.08.016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref12","article-title":"Augmix: A simple data processing method to improve robustness and uncertainty","author":"Hendrycks","year":"2019","journal-title":"arXiv preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58536-5_8"},{"key":"ref14","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.591"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00029"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/1221"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2019.2907932"},{"key":"ref19","article-title":"Deep learning theory review: An optimal control and dynamical systems perspective","author":"Liu","year":"2019","journal-title":"arXiv preprint"},{"key":"ref20","article-title":"Decoupled weight decay regularization","author":"Loshchilov","year":"2017","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00858"},{"key":"ref22","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate o (1\/k2)","volume-title":"Proceedings of the USSR Academy of Sciences","author":"Nesterov","year":"1983"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00149"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01257"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2330900"},{"key":"ref28","article-title":"Gradient matching for domain generalization","author":"Shi","year":"2021","journal-title":"arXiv preprint"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1063\/5.0016505"},{"key":"ref30","article-title":"Rmsprop: Divide the gradient by a running average of its recent magnitude. coursera: Neural networks for machine learning","volume":"17","author":"Tieleman","year":"2012","journal-title":"COURSERA Neural Networks Mach. Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.572"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2022.818799"},{"key":"ref33","first-page":"5339","article-title":"Generalizing to unseen domains via adversarial data augmentation","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems","author":"Volpi","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00464"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.00367"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00087"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW59228.2023.00508"},{"key":"ref38","article-title":"Robust and generalizable visual represen-tation learning via random convolutions","author":"Xu","year":"2020","journal-title":"arXiv preprint"},{"key":"ref39","article-title":"Improve unsupervised domain adaptation with mixup training","author":"Yan","year":"2020","journal-title":"arXiv preprint"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112269"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671806"},{"key":"ref42","first-page":"5824","article-title":"Gradient surgery for multi-task learning","volume":"33","author":"Yu","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2020.2973595"},{"key":"ref44","article-title":"Edge of chaos as a guiding principle for modern neural network training","author":"Zhang","year":"2021","journal-title":"arXiv preprint"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1142\/S2972335323500011"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.00479"},{"key":"ref47","first-page":"14435","article-title":"Maximum-entropy adversarial data augmentation for improved generalization and robustness","volume":"33","author":"Zhao","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i19.30184"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-023-01913-8"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3004555"},{"key":"ref51","article-title":"Surrogate gap minimization improves sharpness-aware training","author":"Zhuang","year":"2022","journal-title":"arXiv preprint"}],"event":{"name":"2025 IEEE\/CVF International Conference on Computer Vision (ICCV)","location":"Honolulu, HI, USA","start":{"date-parts":[[2025,10,19]]},"end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/CVF International Conference on Computer Vision (ICCV)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11443115\/11443287\/11446270.pdf?arnumber=11446270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:33:39Z","timestamp":1777613619000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11446270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/iccv51701.2025.00059","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}