Related papers: A corrected Maslov index for complex saddle trajec…
In this paper, we propose an inexact golden ratio primal-dual algorithm with linesearch step(IP-GRPDAL) for solving the saddle point problems, where two subproblems can be approximately solved by applying the notations of inexact extended…
In this work we present an a posteriori error indicator for approximation schemes of Runge-Kutta-discontinuous-Galerkin type arising in applications of compressible fluid flows. The purpose of this indicator is not only for mesh adaptivity,…
Primal-dual algorithm (PDA) is a classic and popular scheme for convex-concave saddle point problems. It is universally acknowledged that the proximal terms in the subproblems about the primal and dual variables are crucial to the…
Quantum-corrected equations of motion generically contain higher time derivatives, computed here in the setting of canonically quantized systems. The main example in which detailed derivations are presented is a general anharmonic…
An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…
This paper considers the problem of understanding the exit time for trajectories of gradient-related first-order methods from saddle neighborhoods under some initial boundary conditions. Given the 'flat' geometry around saddle points,…
In this paper we propose a primal-dual proximal extragradient algorithm to solve the generalized Dantzig selector (GDS) estimation problem, based on a new convex-concave saddle-point (SP) reformulation. Our new formulation makes it possible…
Nonconvex optimization problems such as the ones in training deep neural networks suffer from a phenomenon called saddle point proliferation. This means that there are a vast number of high error saddle points present in the loss function.…
Causality places nontrivial constraints on QFT in Lorentzian signature, for example fixing the signs of certain terms in the low energy Lagrangian. In d-dimensional conformal field theory, we show how such constraints are encoded in…
In two phase materials, each phase having a non-local response in time, it has been found that for some driving fields the response somehow untangles at specific times, and allows one to directly infer useful information about the geometry…
Machine learning problems such as neural network training, tensor decomposition, and matrix factorization, require local minimization of a nonconvex function. This local minimization is challenged by the presence of saddle points, of which…
Slowing down phenomena occur in both deterministic and stochastic dynamical systems at the vicinity of phase transitions or bifurcations. An example is found in systems exhibiting a saddle-node bifurcation, which undergo a dramatic time…
We consider the problem of efficient simulation estimation of the density function at the tails, and the probability of large deviations for a sum of independent, identically distributed, light-tailed and non-lattice random vectors. The…
A powerful way to guarantee the absence of a sign problem in determinantal quantum Monte Carlo simulations is imposing a particular type of anti-unitary symmetries. It is shown that these same symmetries give rise to constraints on…
A Monte Carlo sampling of diagrammatic corrections to the non-crossing approximation is shown to provide numerically exact estimates of the long-time dynamics and steady state properties of nonequilibrium quantum impurity models. This…
Discovering the causal effect of a decision is critical to nearly all forms of decision-making. In particular, it is a key quantity in drug development, in crafting government policy, and when implementing a real-world machine learning…
We consider a generic convex-concave saddle point problem with separable structure, a form that covers a wide-ranged machine learning applications. Under this problem structure, we follow the framework of primal-dual updates for saddle…
Stochastic nonconvex-concave min-max saddle point problems appear in many machine learning and control problems including distributionally robust optimization, generative adversarial networks, and adversarial learning. In this paper, we…
In this paper we consider regression problems subject to arbitrary noise in the operator or design matrix. This characterization appropriately models many physical phenomena with uncertainty in the regressors. Although the problem has been…
We argue that the Lorentzian path integral is a better starting point for quantum cosmology than the Euclidean version. In particular, we revisit the mini-superspace calculation of the Feynman path integral for quantum gravity with a…