Survey of methods for solving smooth stochastic variational inequalities.
problem Solving smooth (strongly) monotone stochastic variational inequalities.
method Deterministic foundation, general stochastic formulation, finite sum setup, recent advances.
result Review of various methods for solving smooth stochastic variational inequalities.
Improved algorithms for convex-concave min-max optimization and monotone variational inequalities.
problem Efficiently solving constrained convex-concave min-max problems and monotone variational inequalities.
method Higher-order methods achieving iteration complexities of O(1/T^{ rac{p+1}{2}}) for p-th order derivatives.
result Achieved improved convergence rates for min-max and monotone variational inequalities.
The paper proves inequalities for submanifolds in Riemannian manifolds.
problem Proving geometric inequalities for submanifolds in Riemannian manifolds.
method Using Rauch's comparison theorem and first variation formula.
result General Li-Yau inequality applicable in bounded sectional curvature manifolds.
The extragradient method fails for hypomonotone variational inequalities.
problem The convergence of the extragradient method for hypomonotone variational inequalities.
method Application of the extragradient method to hypomonotone linear operators.
result The extragradient method diverges for hypomonotone variational inequalities.
This paper shows how to learn variational inequalities fast with strong monotonicity.
problem Learning variational inequalities efficiently.
method Extending convex optimization techniques to variational inequalities with strong monotonicity.
result Fast generalization rates of Θ ( 1 / ε ) Θ(1/ε) Θ ( 1/ ε ) for learning variational inequalities. New algorithms reduce variance in solving complex mathematical problems.
problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.
Alternative neural network training using monotone variational inequality.
problem Training neural networks efficiently and with guarantees.
method Using monotone variational inequality to solve non-convex problems efficiently.
result Our approach leads to fast convergence and competitive performance compared to traditional methods.
A new method solves variational inequality problems with multiple constraints without needing optimal Lagrange multipliers.
problem Solving variational inequality problems with multiple functional constraints efficiently.
method Constrained Gradient Method (CGM) for Minty variational inequality problems.
result The Constrained Gradient Method achieves complexity similar to projection-based methods but with cheaper oracles.
Extends tracking guarantees for time-varying variational inequalities.
problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.
The paper defines new geometric concepts on Riemannian manifolds and applies them to optimization problems.
problem Optimization problems on Riemannian manifolds.
method Strongly geodesic preinvexity, strongly η-invexity, and strongly invariant η-monotonicity definitions.
result Characterization of strict η-minimizers and solutions to variational like-inequality problems.
Improved analysis of extragradient methods for structured VIPs.
problem Efficiently solving large-scale VIPs with weaker conditions.
method Single-call stochastic extragradient methods with expected residual condition.
result Convergence guarantees for quasi-strongly monotone and weak Minty VIPs.
New method estimates GGLM parameters, overcoming non-convexity.
problem Estimating parameters in GGLM with dependencies.
method Monotone operator-based variational inequality method.
result Guarantees for parameter recovery in GLM and GGLM.
Develops a first-order interior-point method for solving constrained variational inequalities.
problem Solving constrained variational inequalities with nontrivial constraints.
method ADMM-based interior-point method for constrained VIs (ACVI).
result First-order interior-point method with global convergence guarantees for general cVI problems.
This paper develops a novel numerical method for pricing American options in a two-asset jump-diffusion model.
problem Pricing American options under correlated two-asset jump-diffusion models using finite difference methods often fails to preserve monotonicity and accurately discretize jump integrals.
method Introduces a novel monotone integration scheme to solve 2-D Partial Integro-Differential Equations (PIDEs) efficiently and accurately.
result The proposed method ensures convergence to the viscosity solution of the variational inequality and is both ℓ ∞ \ell_{\infty} ℓ ∞ -stable and consistent. New method learns low-dimensional representations of nonlinear time series without supervision.
problem Learning low-dimensional representations of nonlinear time series without supervision.
method Based on monotone variational inequality, the method learns representations by assuming sequences arise from a common domain.
result The method can learn the geometry for the entire domain and faithful representations for the dynamics of each individual sequence.
Market makers optimize trading with a new implicit scheme for complex inequalities.
problem Optimizing trading in a limit order book with stochastic and impulse control.
method Implicit numerical scheme coupled with policy iteration algorithm.
result Convergence to the unique viscosity solution of the HJBQVI.
We consider variational inequalities coming from monotone operators, a setting that includes convex minimization and convex-concave saddle-point problems. We assume an access to potentially noisy unbiased values of the monotone operators and assess convergence through a compatible gap function which corresponds to the …
New insights into stochastic methods for solving variational inequalities.
problem Understanding convergence behaviors of stochastic algorithms in variational inequalities.
method Re-casting SEG/SGDA as Markov Chains to analyze their probabilistic structures.
result The average iterate is asymptotically normal with a unique invariant distribution for various VIPs.
Improved convergence for VIPs with SEG-RR, a variant of SEG with random reshuffling.
problem Solving variational inequality problems (VIPs) in machine learning.
method Stochastic Extragradient with Random Reshuffling (SEG-RR).
result SEG-RR achieves faster convergence rates than with-replacement variants for certain VIP classes.
New energy functional and fields for Yang-Mills theory, proving monotonicity and vanishing theorems.
problem Developing new mathematical tools for Yang-Mills theory.
method Introducing normalized exponential Yang-Mills energy functional, deriving monotonicity formula and vanishing theorem.
result Monotonicity and vanishing theorems for exponential Yang-Mills fields.
Unified analysis of efficient local training methods for distributed variational inequalities.
problem Efficient distributed/federated learning for variational inequality problems.
method Unified convergence analysis of communication-efficient local training methods.
result First local gradient descent-accent algorithms with improved communication complexity.
In this article, we propose the notion of the general p p p -affine capacity and prove some basic properties for the general p p p -affine capacity, such as affine invariance and monotonicity. The newly proposed general p p p -affine capacity is compared with several classical geometric quantities, e.g., the volume, the p p p -var…
Improves GANs training through game theory.
problem Hard training of GANs due to antagonistic networks.
method Rewrote GAN training as a variational inequality and introduced a stochastic relaxed forward-backward algorithm.
result Algorithm converges to an exact solution or a neighborhood of it under monotonicity.
Equivalence of convex optimization, saddle-point problems, and variational inequalities is a well-established concept. The variational inequality (VI) is a static problem which is studied under dynamical settings using a framework called the projected dynamical system, whose stationary points coincide with the static s…
Survey on extragradient methods for solving nonlinear equations and inclusions.
problem Approximating solutions of nonlinear equations and inclusions.
method Unified convergence analysis of extragradient and its variants.
result Sublinear convergence rates for different classes of algorithms.
New algorithms solve stochastic variational inequalities without bounded variance assumption.
problem Solving stochastic variational inequalities without bounded variance assumption.
method Developed algorithms for two classes of problems: monotone and structured nonmonotone VIs.
result Oracle complexity of O(ε^-4) for solving VIs with unbounded domains and possibly unbounded variance.
Explains geometric inequalities for minimal hypersurfaces.
problem Geometric inequalities for minimal hypersurfaces.
method Expository discussion of known inequalities.
result Discussion of classical inequalities for minimal hypersurfaces.
New adaptive methods for constrained convex optimization and variational inequalities.
problem Optimization of constrained convex problems and variational inequalities.
method AdaACSA and AdaAGD+ are accelerated methods that achieve nearly-optimal convergence rates for smooth and non-smooth functions.
result Achieve nearly-optimal convergence rates for both smooth and non-smooth functions, even with stochastic gradients.
Paper presents a method to solve variational inequalities with general constraints without requiring analytic solutions.
problem Solving variational inequalities with general constraints.
method A primal-dual approach using approximate subproblem solutions and warm-starting.
result The method converges with a rate of O ( 1 K ) O(\frac{1}{\sqrt{K}}) O ( K 1 ) for L L L -Lipschitz and monotone operators. The paper extends Busemann's inequalities to complex and quaternionic spaces.
problem Extending Busemann's inequalities to complex and quaternionic vector spaces.
method Proof leverages a monotonicity property under symmetrization with respect to complex or quaternionic hyperplanes.
result Standard Steiner symmetrization does not exhibit the monotonicity property in complex or quaternionic spaces.
Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.
problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ 2 Γ_2 Γ 2 criterion inequalities and a modified inequality. result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.
The paper extends intersection theory for b-divisors, proving monotonicity and volume inequalities.
problem Intersection theory for b-divisors and monotonicity of intersection products.
method Developed general intersection theory of nef b-divisors, defined restricted volume, proved monotonicity.
result Proved quantitative monotonicity of intersection product and new volume inequalities.
Study noncommutative Sobolev inequalities using quantum state metrics.
problem Establishing Sobolev inequalities in noncommutative settings.
method Generalizing monotone metrics in quantum states.
result Developed new matrix-valued Beckner inequalities.
We study a generalized functional related to the pullback metrics (3). We derive the first variation formula which yield stationary maps. We introduce the stress-energy tensor which is naturally linked to conservation law and yield monotonicity formula via the coarea formula and comparison theorem in Riemannian geometr…
This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian…
Introduces new gradient-based methods for machine learning problems.
problem New challenges in machine learning due to decision-making and multi-agent problems.
method Gradient-based optimization and variational inequalities.
result Shifts focus from pattern recognition to decision-making and multi-agent problems.
Study on stock trading model with uncertain market status, proving free boundaries and optimal strategies.
problem Optimal trading strategies in a stock market with uncertain market status.
method Free boundary problem, variational inequality system, degenerate operator, C^∞-smoothness.
result All four switching free boundaries are no-overlapping, monotonic, and C^∞-smooth, and their relative localities are completely determined.
Strong geodesic convex function and strong monotone vector field of order m m m on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order m m m for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequal…
Improved variational inequality algorithms using adaptive step sizes.
problem Solving monotone variational inequalities and convex-concave min-max problems efficiently.
method Adaptive step sizes that eliminate hyperparameters and global Lipschitz continuity requirements.
result Eliminated the need for the golden ratio in the algorithm and improved complexity bounds.
New proof of log-Brunn-Minkowski inequality for zonoids and convex bodies.
problem Proving the log-Brunn-Minkowski inequality for convex bodies and zonoids.
method Establishing monotonicity of the deficit in the LLBM under line segment addition.
result Equality in LLBM for smooth convex bodies occurs only for homothetic bodies.
The paper derives inequalities for p p p -capacitary functions in 3-manifolds with nonnegative scalar curvature.
problem Deriving inequalities for p p p -capacitary functions in 3-manifolds with nonnegative scalar curvature. method Deriving general monotone quantities and geometric inequalities associated with p p p -capacitary functions in asymptotically flat 3-manifolds with nonnegative scalar curvature. result The inequalities become equalities on the spatial Schwarzschild manifolds outside rotationally symmetric spheres.
It is common to encounter large-scale monotone inclusion problems where the objective has a finite sum structure. We develop a general framework for variance-reduced forward-backward splitting algorithms for this problem. This framework includes a number of existing deterministic and variance-reduced algorithms for fun…
Binomial tree methods (BTM) and explicit difference schemes (EDS) for the variational inequality model of American options with time dependent coefficients are studied. When volatility is time dependent, it is not reasonable to assume that the dynamics of the underlying asset's price forms a binomial tree if a partitio…
Develops a dynamical method to prove the sharp Berezin-Li-Yau inequality.
problem Proving the sharp Berezin-Li-Yau inequality for convex domains.
method Volume-preserving mean curvature flow and a new monotonicity principle.
result Shows the sharp Berezin-Li-Yau bound for every smooth convex domain.
In this paper, we consider first-order convergence theory and algorithms for solving a class of non-convex non-concave min-max saddle-point problems, whose objective function is weakly convex in the variables of minimization and weakly concave in the variables of maximization. It has many important applications in mach…
Two new algorithms solve privacy-constrained SVI and SSP problems.
problem Privacy-constrained stochastic variational inequality and saddle-point problems.
method Proposed Noisy Stochastic Extragradient (NSEG) and Noisy Inexact Stochastic Proximal Point (NISPP) algorithms.
result Optimal risk bounds for weak gap function with sampling with replacement.
The paper studies frequency monotonicity for solutions of nonlinear equations under Ricci flow.
problem Frequency monotonicity for positive solutions of nonlinear equations under Ricci flow.
method Obtained parabolic frequency monotonicity for solutions of two nonlinear parabolic equations with bounded Ricci curvature.
result Established integral type Harnack inequalities using parabolic frequency monotonicity.
The paper establishes inequalities for p p p -capacitary functions in flat half-spaces.
problem Understanding p p p -capacitary functions in asymptotically flat half-spaces. method Establishes monotone quantities and mass-capacity inequalities.
result Sharp inequalities attain equality on a Schwarzschild half-space.