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.
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.
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.
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.
Paper introduces information-constrained optimal transport, generalizing Talagrand's inequality.
problem Optimal transport problem with information constraints.
method Information constrained variation of optimal transport, using Marton's approach.
result Recovery of concentration of measure results and solution to Cover's open problem.
The article proves inequalities for capillary hypersurfaces in hyperbolic space.
problem Proving inequalities for capillary hypersurfaces in hyperbolic space.
method Constructing a new locally constrained inverse curvature flow.
result Obtained Alexandrov-Fenchel inequalities for convex capillary hypersurfaces in hyperbolic space.
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.
The paper proves geometric inequalities in sphere using locally constrained flows.
problem Deriving geometric inequalities in sphere.
method Established the longtime existence and convergence of a locally constrained flow.
result Proved new families of three-term geometric inequalities in sphere.
Paper proves a generalized Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary.
problem Proving a generalized Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary.
method Using a locally constrained nonlinear curvature flow to preserve the n-th quermassintegral and decrease the k-th quermassintegral. result Obtained the Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary in Bn+1. 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.
Study optimal stopping times under regime-switching models with constraints.
problem Optimal stopping times for discounted payoffs on a regime-switching geometric Brownian motion.
method Solve variational inequality to find value functions and optimal thresholds.
result Existence and expressions of optimal stopping times under specific conditions.
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 …
We establish a one-parameter family of Harnack inequalities connecting the constrained trace Li-Yau differential Harnack inequality for a nonlinear parabolic equation to the constrained trace Chow-Hamilton Harnack inequality for this nonlinear equation with respect to evolving metrics related to Ricci flow on a 2-dimen…
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.
We consider a singular control problem with regime switching that arises in problems of optimal investment decisions of cash-constrained firms. The value function is proved to be the unique viscosity solution of the associated Hamilton-Jacobi-Bellman equation. Moreover, we give regularity properties of the value functi…
We propose a method to impose homogeneous linear inequality constraints of the form Ax≤0 on neural network activations. The proposed method allows a data-driven training approach to be combined with modeling prior knowledge about the task. One way to achieve this task is by means of a projection step at test time…
Study hypothesis testing under quantized samples with communication constraints, achieving near-optimal sample complexity.
problem Optimizing hypothesis testing with quantized samples and communication constraints.
method Developed a polynomial-time algorithm achieving near-optimal sample complexity under communication constraints.
result Achieved near-optimal sample complexity under communication constraints, with a logarithmic factor increase over unconstrained setting.
The paper proves geometric inequalities for pinched convex hypersurfaces in de Sitter space.
problem Geometric inequalities for convex hypersurfaces in de Sitter space.
method Locally constrained flows with initial compact spacelike hypersurfaces pinched in de Sitter space.
result Established geometric inequalities related to quermassintegrals and weighted curvature integrals.
Study of star-shaped hypersurfaces with capillary boundary using constrained mean curvature flow.
problem Understanding the evolution of hypersurfaces with capillary boundaries.
method Locally constrained mean curvature flow for star-shaped hypersurfaces in the half-space.
result Established new Alexandrov-Fenchel inequalities for convex hypersurfaces with capillary boundary.
We prove constrained trace, matrix and constrained matrix Harnack inequalities for the nonlinear heat equation ωt=Δω+aωlnω on closed manifolds. We also derive a new interpolated Harnack inequality for the equation ωt=Δω−ωlnω+εRω on closed surfaces under the ε-Ricci flow. Finally we prove…
Study flow on de Sitter space for convex hypersurfaces.
problem Behavior of locally constrained inverse curvature flow in de Sitter space.
method Analyze flow on de Sitter space with specific initial conditions and inequalities.
result Derive Alexandrov-Fenchel type inequalities.
OLLA framework efficiently samples from constrained distributions with nonconvex constraints.
problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in W2 distance. 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.
The paper proves new Minkowski inequalities for flows in warped spaces.
problem Proving new Minkowski inequalities for flows in warped spaces.
method Locally constrained inverse curvature flows in Riemannian warped spaces.
result New Minkowski inequalities are derived for flows in warped spaces.
In the theory of submanifolds, the following problem is fundamental: to establish simple relationships between the main intrinsic invariants and the main extrinsic invariants of the submanifolds.The basic relationships discovered until now [1, 2, 3, 4] are inequalities. To analyze these problems, we follow the idea of …
The Willmore flow preserves surface volume, leading to convergence to a sphere.
problem Long-term behavior of volume-preserving Willmore flow on surfaces.
method Volume-preserving Willmore flow, blow-up analysis, constrained Lojasiewicz-Simon inequality.
result Smooth solutions exist for spherical surfaces with Willmore energy below 8π and converge to a sphere.
Neural networks solve variational inequalities for optimal stopping problems.
problem Solving variational inequalities for optimal stopping problems in finance.
method Proposed neural network approach using loss functions directly incorporating variational inequality on whole domain.
result Existence and convergence of neural networks whose losses converge to zero.
Paper optimizes approximating high-dimensional diffusions by independent coordinates.
problem Optimizing approximations of high-dimensional diffusions by independent coordinates.
method Introduces independent projection as optimal for two criteria.
result Independent projection is optimal for two criteria related to entropy and convergence.
New method for constrained sampling using gradient flows.
problem Sampling from constrained domains.
method Introducing a boundary condition for gradient flow to confine particles within the domain.
result Provable continuous-time convergence in total variation for constrained sampling.
We consider inverse curvature flows in warped product manifolds, which are constrained subject to local terms of lower order, namely the radial coordinate and the generalized support function. Under various assumptions we prove longtime existence and smooth convergence to a coordinate slice. We apply this result to ded…
We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives of a given order are subject to inequality or equality constraints. We then chara…
A variational inequality for pricing the perpetual American option and the corresponding difference equation are considered. First, the maximum principle and uniqueness of the solution to variational inequality for pricing the perpetual American option are proved. Then the maximum principle, the existence and uniquenes…
This paper combines three techniques to reduce communications in distributed variational inequalities.
problem Efficiently communicating solutions in large-scale distributed variational inequalities.
method Combining similarity, compression, and local steps to reduce communication rounds and cost.
result Best theoretical guarantees of communication complexity and superior performance in adversarial learning experiments.
Geometric inequalities for static convex domains in hyperbolic space proved.
problem Proving geometric inequalities for static convex domains in hyperbolic space.
method Using static convexity of flow hypersurfaces, new inequalities are derived.
result New family of geometric inequalities for static convex domains in hyperbolic space.
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.
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.
Study finds loops with specific curvature exist using Hardy's inequality.
problem Existence of closed planar loops with prescribed curvature.
method Variational approach, Hardy's inequality and associated functional space.
result Existence of loops with specific curvature proven.
New proof of Gaffney's inequality for differential forms on manifolds with boundary.
problem Proving Gaffney's inequality for differential forms on manifolds with boundary.
method Variational approach combined with Bochner's technique.
result New proof of Gaffney's inequality for differential forms.
The purpose of this paper is describe Lagrangian Mechanics for constrained systems on Lie algebroids, a natural framework which covers a wide range of situations (systems on Lie groups, quotients by the action of a Lie group, standard tangent bundles...). In particular, we are interested in two cases: singular Lagrangi…
New conditions ensure Dantzig-Wolfe relaxation matches rank-constrained optimization problems.
problem Rank-constrained optimization problems with linear matrix inequalities.
method Investigates Dantzig-Wolfe relaxation and develops conditions for exactness.
result Conditions for extreme point, convex hull, and objective exactness.
Extends Langevin dynamics for constrained domains.
problem Optimization of constrained probability measures.
method Mirror mean-field Langevin dynamics (MMFLD).
result Linear convergence guarantees and propagation of chaos results.
The paper proves Michael-Simon inequalities in hyperbolic space using novel curvature flows.
problem Proving the sharp Michael-Simon inequality for mean curvature in hyperbolic space.
method Developed new locally constrained curvature flows for proving the inequality.
result Sharp Michael-Simon inequalities for mean and k-th mean curvatures in starshaped hypersurfaces in hyperbolic space.
Canary optimizes VaR-constrained RL problems with a conservative bound using Cantelli's inequality.
problem Optimizing reinforcement learning policies under VaR constraints in dense cost regimes.
method Employing Cantelli's inequality to create a conservative and smooth bound on VaR constraints based on moments of cost returns. Extending trust-region framework for worst-case bounds on policy improvement and constraint violation.
result Canary reliably satisfies VaR constraints with fewest violations and earliest permanent satisfaction, while maintaining reward competitiveness.
Study min-max theory for hypersurfaces with boundary constraints.
problem Finding minimal hypersurfaces with boundary constraints.
method Schoen-Simon-type regularity result for integral varifolds, proving existence of closed hypersurfaces with specific properties.
result Existence of a closed C1,1 hypersurface with codimension ≥7 singular set in the interior. The paper solves a conjecture about spacelike hypersurfaces in de Sitter space.
problem Proving an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.
method Investigating the locally constrained inverse curvature flow to establish the inequality.
result Established an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.
Constrained Willmore surfaces are conformal immersions of Riemann surfaces that are critical points of the Willmore energy W=∫H2 under compactly supported infinitesimal conformal variations. Examples include all constant mean curvature surfaces in space forms. In this paper we investigate more generally the crit…
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.
The paper studies curvature flows in hyperbolic space and proves geometric inequalities.
problem Proving geometric inequalities in hyperbolic space using curvature flows.
method Locally constrained curvature flows, h-convexity, and shifted principal curvatures.
result Established new sharp geometric inequalities comparing curvature integrals to quermassintegrals.