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.

168,695 papers · 148 categories

Trend · papers per month

336598130 · Jun 202019922001200920172026
48 results for min-max scheme

The min-max kernel is a generalization of the popular resemblance kernel (which is designed for binary data). In this paper, we demonstrate, through an extensive classification study using kernel machines, that the min-max kernel often provides an effective measure of similarity for nonnegative data. As the min-max ker…

2015-03-05abs ↗pdf ↗

Proves existence of Yamabe metrics on conical 4-manifolds using min-max method.

problem Existence of Yamabe metrics on conical 4-manifolds with singular points.
method Min-max scheme adapted to singular setting, leveraging recent positive mass theorems.
result Existence of Yamabe metrics on conical 4-manifolds with finitely-many singular points.

The paper proves the existence of embedded hypersurfaces of constant mean curvature in manifolds with positive Ricci curvature.

problem Proving the existence of embedded hypersurfaces of constant mean curvature in manifolds with positive Ricci curvature.
method Using the Allen--Cahn min-max scheme with a non-zero constant prescribing function.
result The existence of embedded, closed λ-CMC hypersurfaces with Morse index 1 for any prescribed non-zero constant λ.

We introduce a general scheme that permits to generate successive min-max problems for producing critical points of higher and higher indices to Palais-Smale Functionals in Banach manifolds equipped with Finsler structures. We call the resulting tree of minmax problems a minmax hierarchy. Using the viscosity approach t…

2017-05-27abs ↗pdf ↗

Proves existence of special 2-spheres in curved 3-spaces.

problem Existence of constant mean curvature 2-spheres in Riemannian 3-spheres.
method Develops a min-max scheme for a weighted Dirichlet energy functional, using bi-harmonic approximation, derivative estimates, and Morse index estimates.
result Proves existence for almost every mean curvature and all for positively curved 3-spheres.

The paper explains how simple methods can converge to optimal solutions in complex neural games.

problem Finding optimal solutions in neural games with non-convex objectives.
method Theoretical framework using hidden convexity and overparameterization, with path-length bounds and PŁ conditions.
result Simple gradient methods can converge to Nash equilibria in non-convex min-max games under certain conditions.

New approach improves deep learning robustness in medical imaging.

problem Deep learning models are vulnerable to adversarial examples in medical imaging.
method Propose a min-max learning scheme to generate adversarial examples and filter them out.
result Proposed method significantly improves robustness of deep learning models in medical imaging.

ALPS improves neural network robustness and generalization.

problem Challenges in designing effective regularization schemes for adversarial robustness.
method Adversarial Labelling of Perturbed Samples (ALPS) using synthetic samples and min-max formulation.
result ALPS achieves state-of-the-art regularization performance and adversarial robustness.

We employ min-max methods to construct uncountably many, geometrically distinct, properly embedded geodesic lines in any asymptotically conical surface of non-negative scalar curvature, a setting where minimization schemes are doomed to fail. Our construction provides control of the Morse index of the geodesic lines we…

2016-10-28abs ↗pdf ↗

We construct and analyze minimal disc stackings with bounds on their Morse index.

problem Constructing and analyzing minimal free boundary disc stackings.
method Constructing minimal free boundary disc stackings in a three-dimensional Euclidean unit ball, proving bounds on their Morse index.
result Uniform, linear bounds on the Morse index of all such surfaces.

Model-free approach to hedge path-dependent options using min-max optimization.

problem Hedging path-dependent options with maturity T using a static portfolio of vanilla options.
method Model-free approach based on primal-dual Martingale Optimal Transport (MOT) problem, solving a min-max optimization problem.
result Provides theoretical bounds on hedging error at maturity T.

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.

Following the very recent line of work on the ``generalized min-max'' (GMM) kernel, this study proposes the ``generalized intersection'' (GInt) kernel and the related ``normalized generalized min-max'' (NGMM) kernel. In computer vision, the (histogram) intersection kernel has been popular, and the GInt kernel generaliz…

2016-12-29abs ↗pdf ↗

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π.

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.

Framework for worst-case generation using Wasserstein space optimization.

problem Evaluating robustness and stress-testing systems under distribution shifts.
method Min-max optimization over continuous probability distributions in Wasserstein space.
result Global convergence guarantees for the proposed Gradient Descent Ascent scheme.

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.

We prove that in a closed manifold of dimension between 3 and 7 with a bumpy metric, the min-max minimal hypersurfaces associated with the volume spectrum introduced by Gromov, Guth, Marques-Neves, are two-sided and have multiplicity one. This confirms a conjecture by Marques-Neves. We prove that in a bumpy metric each…

2019-01-04abs ↗pdf ↗

The paper proves existence of solutions for mean field equations on compact Riemann surfaces.

problem Existence of solutions for mean field equations on compact Riemann surfaces.
method Min-max scheme introduced by Djadli-Malchiodi (2006) and Djadli (2008).
result Proves existence of solutions for mean field equations on compact Riemann surfaces.

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.

Optimistic method adapted for faster convex-concave min-max problems.

problem Solving convex-concave min-max optimization problems efficiently.
method Adaptive, line search-free second-order methods combining optimistic updates and second-order information.
result Achieves optimal convergence rate without line search or backtracking.

In this paper, we study the shape of the min-max minimal hypersurface produced by Almgren-Pitts-Schoen-Simon \cite{AF62, AF65, P81, SS81} in a Riemannian manifold (Mn+1,g)(M^{n+1}, g) of positive Ricci curvature for all dimensions. The min-max hypersurface has a singular set of Hausdorff codimension 77. We characterize the …

2015-04-04abs ↗pdf ↗

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 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.

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.

We characterize the Zoll Riemannian metrics on a given simply connected spin closed manifold as those Riemannian metrics for which two suitable min-max values in a finite dimensional loop space coincide. We also show that on odd dimensional Riemannian spheres, when certain pairs of min-max values in the loop space coin…

2018-09-23abs ↗pdf ↗

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.

Given a Riemannian manifold and a closed submanifold, we find a geodesic segment with free boundary on the given submanifold. This is a corollary of the min-max theory which we develop in this article for the free boundary variational problem. In particular, we develop a modified Birkhoff curve shortening process to ac…

2015-04-04abs ↗pdf ↗