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,742 papers · 148 categories

Trend · papers per month

53107160213 · Jun 202019922001200920172026
48 results for non-smooth metrics

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.

The paper studies moduli spaces of non-smooth metric structures with non-negative Ricci curvature.

problem Understanding moduli spaces of non-smooth metric structures with non-negative Ricci curvature.
method Relating convergence of RCD(0,N)-structures to their lifts, constructing Albanese and soul maps, proving their continuity, and constructing examples.
result Construction of moduli spaces with non-trivial rational homotopy groups.

Metrics are semipositively curved if they meet a specific asymptotic condition.

problem Characterizing semipositively curved metrics in Hermitian geometry.
method Proving metrics are semipositively curved if and only if they satisfy an asymptotic extension property.
result Proves a specific condition for Griffiths semipositively curved metrics.

Smooth bundles with rough data maintain Hodge kernel isomorphism.

problem Maintaining Hodge kernel isomorphism for smooth bundles with non-smooth geometric data.
method Analyzing nilpotent differential operators and Hodge-Dirac-type operators under perturbations of geometric data.
result Kernels of Hodge-Dirac operators remain isomorphic under uniform perturbations of geometric data.

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.

Study rigidity in low-regularity Riemannian and semi-Riemannian metrics.

problem Rigidity problems for low-regularity metrics.
method Proves Cheeger-Gromoll splitting theorem and flatness criterion for semi-Riemannian metrics of C1C^1 regularity.
result Obtains isometry of higher regularity than Lipschitz.

We study the positive mass theorem for certain non-smooth metrics following P. Miao's work. Our approach is to smooth the metric using the Ricci flow. As well as improving some previous results on the behaviour of the ADM mass under the Ricci flow, we extend the analysis of the zero mass case to higher dimensions.

2011-04-12abs ↗pdf ↗

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.

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

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 ↗

We give a metric characterization of the scalar curvature of a smooth Riemannian manifold, analyzing the maximal distance between (n+1)(n+1) points in infinitesimally small neighborhoods of a point. Since this characterization is purely in terms of the distance function, it could be used to approach the problem of definin…

2017-10-19abs ↗pdf ↗

Lipschitz maps on metric surfaces are rigid if they preserve area.

problem Understanding the rigidity of Lipschitz maps on metric surfaces.
method Established a coarea inequality for continuous Sobolev functions on metric surfaces.
result Proved that 1-Lipschitz maps from a closed metric surface to a closed Riemannian surface preserving area are isometries.

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.

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.

For non-smooth surfaces, the measure of Brownian loops is derived using the Polyakov-Alvarez formula.

problem Deriving the measure of Brownian loops on non-smooth surfaces.
method Using the Polyakov-Alvarez formula and heat kernel traces.
result The measure of Brownian loops on non-smooth surfaces is derived and shown to be uniform.

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 ↗

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.

Develops new synthetic Ricci flow concepts for metric measure spaces.

problem No specific problem stated; focuses on new mathematical concepts.
method Formulated in terms of dynamic convexity and local concavity of entropy, and global/short-time asymptotic transport cost estimates.
result Shows these properties characterise smooth (weighted) Ricci flows.

Study semicontinuity of capacity in non-smooth spaces using intrinsic flat convergence.

problem Investigate semicontinuity of capacity in non-smooth spaces.
method Analyze sequences of local integral current spaces converging in the pointed Sormani-Wenger intrinsic flat sense.
result Prove upper semicontinuity of capacity for balls and Lipschitz sublevel sets under volume-preserving convergence.

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.

The study analyzes convergence rates for sparse pivotal estimators in high-dimensional regression.

problem Sparse pivotal estimation in high-dimensional regression problems.
method Theoretical analysis and comparison of non-smooth + non-smooth optimization problems, including smoothing techniques.
result Minimax sup-norm convergence rates for square-root Lasso-type estimators are derived.