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…
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,786 papers · 148 categories
Trend · papers per month
48 results for “min-max values”
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…
Study extends min-max eigenvalue results to -energy and packing radii on Riemannian manifolds.
problem Extending min-max eigenvalue results to -energy and packing radii.
method Extending results for -th power of the first eigenvalue of the -Laplacian to -th min-max values related to -energy.
result Limits of certain -th min-max values are packing radii.
Survey of advances in non-convex min-max optimization for applications.
problem Finding optimal solutions in non-convex, non-concave min-max problems.
method Selective review of theoretical and algorithmic advances.
result Exciting recent advances in solving non-convex min-max problems.
Study introduces statistical mechanics for min-max problems.
problem Understanding the properties of min-max problems in high dimensions.
method Statistical mechanical formalism for analyzing min-max problems.
result Derives the relationship between training data and generalization error.
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.
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.
We consider the problem of two-player zero-sum games. This problem is formulated as a min-max Markov game in the literature. The solution of this game, which is the min-max payoff, starting from a given state is called the min-max value of the state. In this work, we compute the solution of the two-player zero-sum game…
In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus . We develop a direct variational methods similar to the proof of the famous Plateau problem by J. Douglas and T. Rado. As a result, we show that the min-max value for the area functional can be achieved by a …
We use the theory of rectifiable metric spaces to define a Dirichlet energy of Lipschitz functions defined on the support of integral currents. This energy is obtained by integration of the square of the norm of the tangential derivative, or equivalently of the approximate local dilatation, of the Lipschitz functions. …
How large can be the width of Riemannian three-spheres of the same volume in the same conformal class? If a maximum value is attained, how does a maximising metric look like? What happens as the conformal class changes? In this paper, we investigate these and other related questions, focusing on the context of Simon-Sm…
We perform a replacement procedure in order to produce a free boundary minimal surface whose area achieves the min-max value over all disk sweepouts of a manifold whose boundary lie in a submanifold. Our result is based on a proof of the convexity of the energy for free boundary harmonic maps and a generalization of Co…
Study shows fast rates for inverse reinforcement learning with linear rewards.
problem Entropy-regularized min-max inverse reinforcement learning in finite-horizon MDPs.
method Structural and statistical analysis of Min-Max-IRL with pseudo-self-concordance.
result Both trajectory-level KL divergence and parameter error decay at .
Paper tackles constrained robust optimization without gradients.
problem Constrained robust (min-max) optimization in a black-box setting.
method Integrates ZO gradient estimator with alternating projected SGD-ascent method.
result Proposed ZO-Min-Max framework converges sub-linearly under mild conditions.
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 characterizes eigenvalues of surfaces using min-max quantities for harmonic maps.
problem Characterizing eigenvalues of surfaces using harmonic maps.
method Defining min-max quantities associated with sphere-valued maps and proving eigenvalue bounds.
result Identifies and with min-max quantities for sphere-valued maps.
Bayesian optimization for function-valued responses, addressing worst case deviations.
problem Optimizing expensive functions with functional responses, focusing on worst case performance.
method Min-Max Functional Bayesian Optimization (MM-FBO) using Gaussian process surrogates and functional principal component analysis.
result MM-FBO consistently outperforms existing methods in synthetic and real-world applications.
We present the min-max construction of critical points of the area using penalization arguments. Precisely, for any immersion of a closed surface into a given closed manifold, we add to the area Lagrangian a term equal to the norm of the second fundamental form of the immersion times a "viscosity" parameter. …
Study finds geodesic networks for surfaces with convex boundary.
problem Finding geodesic networks for surfaces with convex boundary.
method Investigates free boundary geodesic networks in surfaces with non-negative sectional curvature and convex boundary.
result Existence of a geodesic network realizing the first width of a surface with non-negative sectional curvature and strictly convex boundary.
Study shows strong min-max principle for phase transitions.
problem Understanding nodal sets near minimal hypersurfaces.
method Analogous to White's principle, applies to Allen-Cahn energy.
result Strong min-max principle for phase transitions.
Upper bound for Morse index of min-max varifolds.
problem Bounding Morse index of varifolds.
method Proving upper bound for Morse index of min-max stationary integral varifolds.
result Upper bound for Morse index of min-max stationary integral varifolds.
Localized min-max method proves minimal hypersurface existence.
problem Existence of minimal hypersurfaces in complete manifolds.
method Localized min-max approach to prove existence.
result Existence of complete embedded minimal hypersurface with index at most one.
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 and ?
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 and .
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.
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.
Paper proves finiteness and Morse index estimates for equivariant min-max hypersurfaces.
problem Existence and finiteness of -invariant minimal hypersurfaces.
method Equivariant min-max theory, compactness theorem, bumpy metrics theorem.
result Generalization of Morse index estimates to equivariant setting.
New proof of Smale conjecture for RP^3 and lens spaces using min-max theory.
problem Proving the Smale conjecture for specific spaces.
method Minimal surfaces and min-max theory.
result New proof of Smale conjecture for and lens spaces.
We study global variational properties of the space of solutions to on any closed Riemannian manifold . Our techniques are inspired by recent advances in the variational theory of minimal hypersurfaces and extend a well-known analogy with the theory of phase transitions. First, we show t…
Paper improves Morse index bound for hypersurfaces.
problem Improving Morse index bound for hypersurfaces.
method Construction of hierarchical deformations and restrictive min-max theory.
result Generalizes a result by X. Zhou for .
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.
Bound on equivariant index for min-max surfaces.
problem Bounding the index of equivariant min-max surfaces.
method Equivariant min-max procedure with group action.
result Equivariant index bound by number of parameters.
Improves model generalization by minimizing loss sharpness.
problem Overparameterized models often fail to generalize well despite low training loss.
method Sharpness-Aware Minimization (SAM) minimizes both loss value and sharpness.
result SAM improves model generalization across various datasets and models.
The paper is devoted to modeling optimal exercise strategies of the behavior of investors and issuers working with convertible bonds. This implies solution of the problems of stock price modeling, payoff computation and min-max optimization. Stock prices (underlying asset) were modeled under the assumption of the geome…
Energy Concentration for Min-Max Solutions of the Ginzburg-Landau Equations on Manifolds with math.DG
We establish a new estimate for the Ginzburg-Landau energies of complex-valued maps on a compact, oriented manifold with , obtained by decomposing the harmonic component of the one-form into an integral and frac…
We reformulate LIPs as min-max problems for easier solution.
problem Recovering signals from few linear measurements.
method Proposed a min-max reformulation of LIPs.
result Saddle points characterize solutions to LIPs.
Study proves value of non-Markovian games with partial, asymmetric info.
problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.
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 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.
Study confirms a 2-sphere metric with three geodesics of minimal length.
problem Understanding the systolic, width, and Gromov-Guth metrics on a 2-sphere.
method Classical min-max and hyperbolic geometry tools.
result Figure-eight geodesics achieve the systolic, width, and Gromov-Guth metrics on a 2-sphere.
Bayesian optimization methods improved for min max optimization problems.
problem Min-max optimization for unknown functions.
method Extended Bayesian optimization to min-max problems with new acquisition functions.
result Improved acquisition functions lead to better solutions.
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 of positive Ricci curvature for all dimensions. The min-max hypersurface has a singular set of Hausdorff codimension . We characterize the …
The study proves a generic multiplicity one theorem for -invariant minimal hypersurfaces.
problem Proving a generic multiplicity one theorem for -invariant minimal hypersurfaces.
method Equivariant min-max theory and analysis of -homology classes.
result Shows a generic multiplicity one theorem for -invariant minimal hypersurfaces.
Constructs cmc doublings of minimal surfaces via min-max theory.
problem Construct cmc doublings of minimal surfaces.
method Uses min-max theory and catenoid estimate.
result Constructs ε-cmc doublings of Σ for small ε > 0.
This research proves that two min-max theories for hypersurfaces are equivalent.
problem Comparing two min-max theories for hypersurfaces.
method Developed and proved the equivalence of Almgren-Pitts and Allen-Cahn min-max theories.
result The Almgren-Pitts widths and Allen-Cahn widths are equivalent.
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.
New algorithm solves non-convex, non-differentiable min-max games.
problem Limited theoretical understanding of non-smooth min-max games.
method Proximal gradient descent-ascent algorithm for convex-strongly convex games.
result Algorithm converges to ε-Nash equilibrium with polynomial gradient evaluations.
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 -equivariant volume spectrum, generic density result.
result Generic density of equivariant min-max hypersurfaces in Riemannian manifolds.