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

275380106 · May 202619922001200920172026
48 results for non-smooth boundaries

Positive mass theorem for non-smooth metrics on flat manifolds with corners.

problem Proving a positive mass theorem for non-smooth metrics on asymptotically flat manifolds with non-compact boundary.
method Proves a positive mass theorem for metrics that are only continuous across a compact hypersurface.
result Obtains a positive mass theorem on manifolds with non-compact corners.

Recent research connects Hörmander's old work to modern boundary Laplacian analysis.

problem How close is the Dirichlet-to-Neumann map to the boundary Laplacian?
method Investigates techniques from Hörmander's 1950s manuscript to solve modern boundary Laplacian problems.
result Obtained results for DtN maps on non-smooth boundaries, Helmholtz equation, and differential forms.

This paper shows that the time tt map of the averaged Euler equations, with Dirichlet, Neumann, and mixed boundary conditions is canonical relative to a Lie-Poisson bracket constructed via a non-smooth reduction for the corresponding diffeomorphism groups. It is also shown that the geodesic spray for Neumann and mixed…

2005-04-19abs ↗pdf ↗

The paper develops bounds and regularity for minimal boundaries in non-smooth spaces with Ricci curvature.

problem Minimal boundaries in non-smooth spaces with Ricci curvature.
method Intrinsic theory of Laplacian bounds, PDE principle, sharp Laplacian bounds on distance function, regularity theory for perimeter-minimizing boundaries.
result Sharp Laplacian bounds and regularity results for perimeter-minimizing boundaries.

Study solves Gel'fand's inverse problem in non-smooth spaces with Ricci curvature bounds.

problem Determining a Riemannian manifold from heat kernel on subsets.
method Analyzes mRCD(K,N){ m RCD}(K,N) spaces with synthetic Ricci curvature bounds.
result Unique solvability of Gel'fand's inverse problem for compact mRCD(K,N){ m RCD}(K,N) spaces.

The paper analyzes Variable Annuities with surrender charges, providing a pricing formula and optimal exercise boundary.

problem Analyzing Variable Annuities with surrender charges and early termination rights.
method Formulated as an optimal stopping problem with a discontinuous payoff, non-monotonic optimal stopping boundaries are proven continuous and regular.
result A rigorous pricing formula and optimal exercise boundary for surrender options are derived.

MARINA-P improves non-smooth federated optimization with adaptive stepsizes.

problem Non-smooth federated optimization in machine learning applications.
method Extends EF21-P and MARINA-P to non-smooth convex setting, proving optimal convergence rate and communication complexity bounds.
result MARINA-P achieves O(1/T)O(1/\sqrt{T}) convergence rate and communication complexity matching classical subgradient methods.

We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains CC, with non-smooth boundary, in possibly non-compact manifolds. Assuming CC is a submanifold with corners, or is compact and locally convex with rough boundary, we prove that the restrictio…

2018-01-12abs ↗pdf ↗

We introduce non-smooth symplectic forms on manifolds and describe corresponding Poisson structures on the algebra of Colombeau generalized functions. This is achieved by establishing an extension of the classical map of smooth functions to Hamiltonian vector fields to the setting of non-smooth geometry. For mildly sin…

2014-03-02abs ↗pdf ↗

The paper explores various stationarity concepts in non-smooth optimization.

problem Understanding stationarity in non-smooth optimization problems.
method Introduction and discussion of different stationarity concepts for non-convex non-smooth functions.
result Clarification of the relationship among different stationarity concepts and their relevance in iterative methods.

New bounds explain deterministic non-smooth deep nets without large Lipschitz constants.

problem Challenges in explaining generalization of deterministic non-smooth deep nets.
method De-randomized PAC-Bayes margin bounds for deterministic non-convex and non-smooth predictors.
result New bounds avoid large Lipschitz constants, providing generalization guarantees.

Paper uses deep learning to price and hedge options in incomplete markets.

problem Incomplete markets lack unique no-arbitrage solutions for pricing and hedging European options.
method Constrained deep learning approach with a single neural network representing option prices and hedging strategies.
result Constrained networks produce superior P&L distributions compared to unconstrained networks.

Smoothness analysis of adversarial training reveals LL_\infty constraints cause more non-smoothness.

problem Non-smoothness of adversarial training loss function.
method Analyzed the smoothness of adversarial training loss function using optimal attacks for model parameters.
result The LL_\infty constraint causes more non-smoothness than L2L_2 constraint.

In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…

2003-08-16abs ↗pdf ↗

The question whether a Riemannian manifold is geodesically connected can be studied from geometrical as well as variational methods, and accurate results can be obtained by using the associated distance and related properties of the positive-definiteness. It is natural to state this problem in manifolds with (possibly …

2000-05-04abs ↗pdf ↗

New principles prove precompactness of domains with lower Ricci curvature bound.

problem Proving precompactness of domains with lower Ricci curvature bound.
method Quantitative Hopf-Rinow theorem and doubling property.
result New precompactness principles applicable to incomplete Riemannian manifolds.

This work speeds up hyperparameter selection for non-smooth convex models using implicit differentiation.

problem Optimizing hyperparameters of non-smooth convex models.
method Implicit differentiation of proximal gradient and coordinate descent methods.
result Implicit differentiation can speed up hyperparameter optimization, especially for non-smooth problems.

This paper improves boundary regularity of harmonic maps in metric measure spaces.

problem Improving boundary regularity of harmonic maps in non-smooth spaces.
method Developed a Gauss-Green formula for RCD(K,N)RCD(K, N) spaces and applied it to harmonic maps.
result Optimal boundary regularity of harmonic maps from RCD(K,N)RCD(K,N)-spaces to CAT(0)CAT(0)-spaces.

Adam achieves optimal convergence in deep ReLU networks via novel Kakeya bounds.

problem Training deep ReLU networks using Adam in non-smooth settings.
method Stratified Morse theory and Kakeya bounds to analyze region crossings and convergence.
result First global-optimal convergence for Adam in non-smooth, non-convex ReLU landscapes.

Advances smooth over-parameterization for solving non-smooth optimization problems.

problem Non-smooth optimization with structural constraints in imaging and machine learning.
method Smooth over-parameterization of non-smooth problems, using gradient descent and mirror descent.
result Gradient descent on the reformulated smooth problem converges efficiently without parameter tuning.

New methods improve convergence in non-convex non-smooth learning problems.

problem Sparse learning from high-dimensional data with non-convex, non-smooth regularizers.
method Stochastic proximal gradient methods with arbitrary sampling.
result Independent sampling improves performance over uniform sampling.

Numerical methods solve Steklov eigenvalue problems to generate free boundary minimal surfaces.

problem Generating free boundary minimal surfaces using Steklov eigenvalue problems.
method Maximizing Steklov eigenvalues over a class of metrics, using conformal uniformization and gradient-based optimization.
result Numerical solutions for free boundary minimal surfaces with various boundary components.

New SPS variant improves non-smooth optimization without small gradients.

problem Improving non-smooth optimization without small gradients.
method Safeguarded Stochastic Polyak Step Size (SPSsafe_{safe}) for non-smooth optimization.
result Rigorous convergence guarantees for non-smooth convex optimization without strong assumptions.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.

We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of \ell_\infty regression, we achieves an O(ε4/5)O(ε^{-4/5}) iteration complexity, breaking the O(ε1)O(ε^{-1}) barrier so far present for previous methods. We arrive at a similar rate fo…

2019-06-04abs ↗pdf ↗

Compact proof for Brown-York mass positivity and rigidity in flat and spherical spaces.

problem Positivity of Brown-York mass and rigidity of manifolds with mean-convex boundaries.
method Spinorial proof and optimal lower bound for eigenvalues.
result Optimal lower bound for first non-null eigenvalue of Dirac operator.