Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

21436485 · Jun 202619922001200920182026
48 results for min-max formulas

Study properties of Black-Scholes equation solutions for puttable bonds with credit risk.

problem Properties of solutions to Black-Scholes equation for puttable bonds with credit risk.
method Solution representation, min-max estimation, gradient estimates, strict monotonicity analysis.
result Derivation of analytical pricing formulae for puttable bonds with credit risk.

Equity-Transformer solves NP-hard min-max routing problems efficiently.

problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.

The paper solves min-max widths on a 3-sphere and strengthens multiplicity theorems.

problem Which min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π?
method Homological min-max theory and stronger versions of multiplicity one theorems.
result Proves the 10th to 13th min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π.

Proves multiplicity one for min-max minimal hypersurfaces in specific manifolds.

problem Proving multiplicity one for min-max minimal hypersurfaces in specific manifolds.
method Using min-max theory for hypersurfaces with prescribed mean curvature and approximating min-max values.
result Confirms a conjecture by Marques-Neves for min-max minimal hypersurfaces in bumpy metrics.

Adaptive momentum method solves non-convex min-max problems.

problem Non-convex min-max optimization problems in training generative adversarial networks.
method Proposes an adaptive momentum algorithm for non-convex min-max optimization.
result Establishes non-asymptotic convergence rates for the proposed algorithm.

We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.

problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.

Study min-max hypersurface in positive Ricci curvature manifolds.

problem Characterize the properties of min-max hypersurface in positive Ricci curvature manifolds.
method Apply Almgren-Pitts-Schoen-Simon min-max theory, discretization theorem, and Morse theory.
result The min-max hypersurface is either orientable with Morse index one or a double cover of a non-orientable stable minimal hypersurface.

New methods solve min-max problems on manifolds using Riemannian Hamiltonians.

problem Min-max optimization on Riemannian manifolds.
method Riemannian Hamiltonian methods (RHM) to minimize the Hamiltonian function.
result RHM leads to correct search directions and global optimality in min-max problems.

Epoch-GDA achieves optimal convergence rate for SCSC min-max problems.

problem Solving stochastic min-max problems with strong convexity and strong concavity.
method Epoch-wise stochastic gradient descent ascent method (Epoch-GDA) without additional assumptions.
result Achieves the optimal rate of O(1/T)O(1/T) for the duality gap of general SCSC min-max problems.

The paper bounds the min-max width of embedded circles on spheres and manifolds.

problem Bounding the min-max width of embedded circles on spheres and manifolds.
method Inducing a sweepout by pairs of points in embedded circles from a given sweepout of the sphere by closed curves.
result Lower bounds for the Birkhoff min-max invariant of a Riemannian sphere in terms of the min-max width of its embedded circles.

Generic min-max theory proves existence of hypersurfaces with specific mean curvature.

problem Proving existence of hypersurfaces with prescribed mean curvature for generic functions.
method Generic min-max theory applied to smooth prescription functions.
result Existence of nontrivial, smooth, closed hypersurfaces with specific mean curvature.

The study proves a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

problem Proving a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.
method Equivariant min-max theory and analysis of GG-homology classes.
result Shows a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

This study reveals a Min-Max property in LeNet's convolutional layers, enhancing adversarial robustness.

problem Uncertainty in the connection weights of convolutional layers in neural networks.
method Demonstrates the Min-Max property through back propagation-based training and a simplified convolution formulation.
result The Min-Max property improves adversarial robustness, indicating a stronger uncertainty in the model parameters.

New insights into gradient descent and ascent dynamics in min-max optimization.

problem Understanding the convergence and limit points of gradient descent and ascent methods in min-max optimization problems.
method Characterization of limit points using dynamical systems perspective for GDA and OGDA.
result Both GDA and OGDA dynamics avoid unstable critical points and have a superset of local min-max solutions.

New Gaussian min-max theorem extends classical results to non-i.i.d. Gaussian matrices.

problem Extending classical Gaussian min-max theorems to non-i.i.d. Gaussian matrices.
method Identifying a new pair of Gaussian processes that satisfy comparison inequalities.
result New Gaussian min-max and convex Gaussian min-max theorems with applications in multi-source Gaussian regression and binary classification.

Proves min-max theory for constant geodesic curvature curves on closed surfaces.

problem Prescribing mean curvature on surfaces with constant geodesic curvature.
method Min-max theory applied to classify blowups and ensure almost embedded solutions.
result Produces a solution with constant geodesic curvature cc on closed surfaces.

Generic density of equivariant min-max hypersurfaces in Riemannian manifolds.

problem Finding generic density of equivariant min-max hypersurfaces in Riemannian manifolds.
method Weyl asymptotic law for GG-equivariant volume spectrum, generic density result.
result Generic density of equivariant min-max hypersurfaces in Riemannian manifolds.

New geometric invariant from min-max width of spheres on Riemannian 2-spheres.

problem Understanding the min-max width of spheres associated to distance functions.
method Application of min-max methods to pairs of points on Riemannian 2-spheres.
result The min-max width does not always equal half the length of a simple closed geodesic.

The study finds anisotropic minimal surfaces in 3-manifolds with smooth boundaries.

problem Finding smooth anisotropic minimal surfaces in closed 3-manifolds.
method Min-max construction with elliptic integrands, uniform upper bound for density ratios.
result Obtains a smooth anisotropic minimal surface in a closed 3-manifold.

In this paper, we study the shape of the min-max minimal hypersurface produced by Almgren-Pitts in \cite{A2}\cite{P} corresponding to the fundamental class of a Riemannian manifold (Mn+1,g)(M^{n+1}, g) of positive Ricci curvature with 2n62\leq n\leq 6. We characterize the Morse index, area and multiplicity of this min-max hyp…

2012-10-07abs ↗pdf ↗

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.

New algorithm solves min-max optimization problems in a decentralized manner.

problem Solving min-max saddle point games in a decentralized and adaptive manner.
method Developed a decentralized adaptive momentum (DADAM3^3) algorithm for min-max optimization.
result DADAM3^3 achieves non-asymptotic rates of convergence for finding Nash equilibrium points.

Optimizes solving complex min-max problems with stochastic and nonconvex elements.

problem Min-max problems with stochastic and nonconvex elements.
method Combines conic nonexpansiveness, refined inexact Halpern iteration, and multilevel Monte Carlo estimator.
result Optimal or best-known complexity guarantees for $ρ< rac{1}{L}$, improving previous results.