Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Solving a class of non-convex min-max games using iterative first order methods
Recent applications that arise in machine learning have surged significant interest in solving
min-max saddle point games. This problem has been extensively studied in the convex …
min-max saddle point games. This problem has been extensively studied in the convex …
Near-optimal algorithms for minimax optimization
This paper resolves a longstanding open question pertaining to the design of near-optimal
first-order algorithms for smooth and strongly-convex-strongly-concave minimax problems …
first-order algorithms for smooth and strongly-convex-strongly-concave minimax problems …
An introduction to continuous optimization for imaging
A large number of imaging problems reduce to the optimization of a cost function, with
typical structural properties. The aim of this paper is to describe the state of the art in …
typical structural properties. The aim of this paper is to describe the state of the art in …
The difficulty of computing stable and accurate neural networks: On the barriers of deep learning and Smale's 18th problem
Deep learning (DL) has had unprecedented success and is now entering scientific
computing with full force. However, current DL methods typically suffer from instability, even …
computing with full force. However, current DL methods typically suffer from instability, even …
Inverse problems with Poisson data: statistical regularization theory, applications and algorithms
Inverse problems with Poisson data arise in many photonic imaging modalities in medicine,
engineering and astronomy. The design of regularization methods and estimators for such …
engineering and astronomy. The design of regularization methods and estimators for such …
Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks
Learning approximations to smooth target functions of many variables from finite sets of
pointwise samples is an important task in scientific computing and its many applications in …
pointwise samples is an important task in scientific computing and its many applications in …
Efficient algorithms for smooth minimax optimization
This paper studies first order methods for solving smooth minimax optimization problems
$\min_x\max_y g (x, y) $ where $ g (\cdot,\cdot) $ is smooth and $ g (x,\cdot) $ is concave for …
$\min_x\max_y g (x, y) $ where $ g (\cdot,\cdot) $ is smooth and $ g (x,\cdot) $ is concave for …
Scaling algorithms for unbalanced optimal transport problems
This article introduces a new class of fast algorithms to approximate variational problems
involving unbalanced optimal transport. While classical optimal transport considers only …
involving unbalanced optimal transport. While classical optimal transport considers only …
Golden ratio algorithms for variational inequalities
Y Malitsky - Mathematical Programming, 2020 - Springer
The paper presents a fully adaptive algorithm for monotone variational inequalities. In each
iteration the method uses two previous iterates for an approximation of the local Lipschitz …
iteration the method uses two previous iterates for an approximation of the local Lipschitz …
Accelerated algorithms for smooth convex-concave minimax problems with O (1/k^ 2) rate on squared gradient norm
In this work, we study the computational complexity of reducing the squared gradient
magnitude for smooth minimax optimization problems. First, we present algorithms with …
magnitude for smooth minimax optimization problems. First, we present algorithms with …