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.
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least 2π. The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywher…
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…
We consider the problem of finding local minimizers in non-convex and non-smooth optimization. Under the assumption of strict saddle points, positive results have been derived for first-order methods. We present the first known results for the non-smooth case, which requires different analysis and a different algorithm…
An anisotropic surface energy is the integral of an energy density that depends on the normal at each point over the considered surface, and it is a generalization of surface area. The minimizer of such an energy among all closed surfaces enclosing the same volume is unique and it is (up to rescaling) so-called the Wul…
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…
In this paper, we develop a novel {\bf ho}moto{\bf p}y {\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an explicit max-structure and a smooth term or a simple non-smooth term whose proximal mapping is easy to compute. The best known iteration compl…
We give a metric characterization of the scalar curvature of a smooth Riemannian manifold, analyzing the maximal distance between (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…
We investigate a generalization of the so-called metric splitting of globally hyperbolic space-times to non-smooth Lorentzian manifolds and show the existence of this metric splitting for a class of wave-type space-times. Our approach is based on smooth approximations of non-smooth space-times by families (or sequences…
Algebras of generalized functions offer possibilities beyond the purely distributional approach in modelling singular quantities in non-smooth differential geometry. This article presents an introductory survey of recent developments in this field and highlights some applications in mathematical physics.
An extrinsic representation of a Ricci flow on a differentiable n-manifold M is a family of submanifolds S(t), each smoothly embedded in R^{n+k}, evolving as a function of time t such that the metrics induced on the submanifolds S(t) by the ambient Euclidean metric yield the Ricci flow on M. When does such a representa…
We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of ℓ∞ regression, we achieves an O(ε−4/5) iteration complexity, breaking the O(ε−1) barrier so far present for previous methods. We arrive at a similar rate fo…
We theoretically discuss why deep neural networks (DNNs) performs better than other models in some cases by investigating statistical properties of DNNs for non-smooth functions. While DNNs have empirically shown higher performance than other standard methods, understanding its mechanism is still a challenging problem.…
Stochastic Gradient Descent (SGD) is one of the simplest and most popular stochastic optimization methods. While it has already been theoretically studied for decades, the classical analysis usually required non-trivial smoothness assumptions, which do not apply to many modern applications of SGD with non-smooth object…