{"list":"other","total":52,"rows":[{"id":"2006.11239","title":"Denoising Diffusion Probabilistic Models","created":"2020-06-19","cited_by_count":21076},{"id":"2112.10752","title":"High-Resolution Image Synthesis with Latent Diffusion Models","created":"2021-12-20","cited_by_count":18863},{"id":"2011.13456","title":"Score-Based Generative Modeling through Stochastic Differential Equations","created":"2020-11-26","cited_by_count":9122},{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"2303.01469","title":"Consistency Models","created":"2023-03-02","cited_by_count":1822},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1710.10571","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","created":"2017-10-29","cited_by_count":337},{"id":"1505.05116","title":"Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations","created":"2015-05-19","cited_by_count":291},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1604.02199","title":"Distributionally Robust Stochastic Optimization with Wasserstein Distance","created":"2016-04-08","cited_by_count":185},{"id":"1704.07520","title":"Stein Variational Gradient Descent as Gradient Flow","created":"2017-04-25","cited_by_count":152},{"id":"1902.08297","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","created":"2019-02-21","cited_by_count":148},{"id":"2101.06549","title":"AdvSim: Generating Safety-Critical Scenarios for Self-Driving Vehicles","created":"2021-01-16","cited_by_count":137},{"id":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1805.07894","title":"Constructing Unrestricted Adversarial Examples with Generative Models","created":"2018-05-21","cited_by_count":135},{"id":"1710.11606","title":"Lower Bounds for Finding Stationary Points I","created":"2017-10-31","cited_by_count":126},{"id":"1802.08089","title":"Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem","created":"2018-02-22","cited_by_count":123},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"2002.05999","title":"Adversarial Distributional Training for Robust Deep Learning","created":"2020-02-14","cited_by_count":79},{"id":"1908.05659","title":"Distributionally Robust Optimization: A Review","created":"2019-08-13","cited_by_count":76},{"id":"2305.16494","title":"Diffusion-Based Adversarial Sample Generation for Improved Stealthiness and Controllability","created":"2023-05-25","cited_by_count":66},{"id":"1904.08598","title":"Reducing Noise in GAN Training with Variance Reduced Extragradient","created":"2019-04-18","cited_by_count":62},{"id":"2010.15768","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","created":"2020-10-29","cited_by_count":58},{"id":"2006.02032","title":"A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems","created":"2020-06-03","cited_by_count":57},{"id":"1902.08294","title":"Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications","created":"2019-02-21","cited_by_count":55},{"id":"2201.10469","title":"Convex Analysis of the Mean Field Langevin Dynamics","created":"2022-01-25","cited_by_count":55},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"2310.17582","title":"Convergence of flow-based generative models via proximal gradient descent in Wasserstein space","created":"2023-10-26","cited_by_count":34},{"id":"1810.02403","title":"Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes","created":"2018-10-04","cited_by_count":30},{"id":"2103.10282","title":"Modeling the Second Player in Distributionally Robust Optimization","created":"2021-03-18","cited_by_count":29},{"id":"1912.07481","title":"On Lower Iteration Complexity Bounds for the Saddle Point Problems","created":"2019-12-16","cited_by_count":28},{"id":"2002.06277","title":"A mean-field analysis of two-player zero-sum games","created":"2020-02-14","cited_by_count":28},{"id":"2201.12247","title":"Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions","created":"2022-01-28","cited_by_count":27},{"id":"2001.04341","title":"Information Newton's flow: second-order optimization method in probability space","created":"2020-01-13","cited_by_count":24},{"id":"2004.07162","title":"On Linear Optimization over Wasserstein Balls","created":"2020-04-15","cited_by_count":24},{"id":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20},{"id":"1307.6279","title":"Likelihood Robust Optimization for Data-driven Problems","created":"2013-07-24","cited_by_count":13},{"id":"2310.19253","title":"Flow-based Distributionally Robust Optimization","created":"2023-10-30","cited_by_count":13},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","cited_by_count":12},{"id":"2212.12978","title":"Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization","created":"2022-12-26","cited_by_count":12},{"id":"2406.08938","title":"Mirror and Preconditioned Gradient Descent in Wasserstein Space","created":"2024-06-13","cited_by_count":12},{"id":"2102.07244","title":"Resilient Machine Learning for Networked Cyber Physical Systems: A Survey for Machine Learning Security to Securing Machine Learning for CPS","created":"2021-02-14","cited_by_count":10},{"id":"2112.09579","title":"Convergence Rates of Two-Time-Scale Gradient Descent-Ascent Dynamics for Solving Nonconvex Min-Max Problems","created":"2021-12-17","cited_by_count":10},{"id":"2201.06167","title":"On the Linear Convergence of Extra-Gradient Methods for Nonconvex-Nonconcave Minimax Problems","created":"2022-01-17","cited_by_count":8},{"id":"2412.20556","title":"Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces","created":"2024-12-29","cited_by_count":8},{"id":"2505.23565","title":"DRO: A Python Library for Distributionally Robust Optimization in Machine Learning","created":"2025-05-29","cited_by_count":5},{"id":"2510.22757","title":"Distributionally Robust Optimization via Diffusion Ambiguity Modeling","created":"2025-10-26","cited_by_count":4}],"next_cursor":null}