Given a monotone convex function on the space of essentially bounded random variables with the Lebesgue property (order continuity), we consider its extension preserving the Lebesgue property to as big solid vector space of random variables as possible. We show that there exists a maximum such extension, with explicit …
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.
Trend · papers per month
Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a mixed integer program (MIP) whose objective function is non-convex. In this form, t…
This paper introduces Jensen, an easily extensible and scalable toolkit for production-level machine learning and convex optimization. Jensen implements a framework of convex (or loss) functions, convex optimization algorithms (including Gradient Descent, L-BFGS, Stochastic Gradient Descent, Conjugate Gradient, etc.), …
Let be an arbitrary subset of , and , be given functions. We provide necessary and sufficient conditions for the existence of a convex function such that and on . We give a useful explicit formula …
We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains , with non-smooth boundary, in possibly non-compact manifolds. Assuming is a submanifold with corners, or is compact and locally convex with rough boundary, we prove that the restrictio…
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago…
We study the homeomorphic extension of biholomorphisms between convex domains in without boundary regularity and boundedness assumptions. Our approach relies on methods from coarse geometry, namely the correspondence between the Gromov boundary and the topological boundaries of the domains and the dynamic…
Regret minimization is a powerful tool for solving large-scale problems; it was recently used in breakthrough results for large-scale extensive-form game solving. This was achieved by composing simplex regret minimizers into an overall regret-minimization framework for extensive-form game strategy spaces. In this paper…
We consider the optimization of active extension portfolios. For this purpose, the optimization problem is rewritten as a stochastic programming model and solved using a clever multi-start local search heuristic, which turns out to provide stable solutions. The heuristic solutions are compared to optimization results o…
Developed a theory of local convexity for second order differential equations on Lie algebroids.
The paper explores rigidity and flexibility of isometric extensions with critical Hölder exponent.
Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive models. The proposed sparse difference of convex additive models (SDCAM) can est…
Let be a compact convex subset of , be a convex function, and . Assume that, along with , we are given a family of polynomials satisfying Whitney's extension condition for , and thus that there exists such that on $…
We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex bodies connect with some classical results of Convex Geometry, as Helly theorem, an…
Survey on extending rigidity theorems to Riemannian manifolds.
In this note, we generalize a theorem of Juan Souto on rank and Nielsen equivalence in the fundamental group of a hyperbolic fibered 3-manifold to a large class of hyperbolic group extensions. This includes all hyperbolic extensions of surfaces groups as well as hyperbolic extensions of free groups by convex cocompact …
Let be an arbitrary subset of (not necessarily bounded), and , be functions. We provide necessary and sufficient conditions for the -jet to have an extension with convex and of class . Besides, if $…
We extend the idea and techniques in \cite{Miao} to study variational effect of the boundary geometry on the ADM mass of an asymptotically flat manifold. We show that, for a Lipschitz asymptotically flat metric extension of a bounded Riemannian domain with quasi-convex boundary, if the boundary mean curvature of the ex…
Kernelized convex clustering handles non-linear and non-convex data.
We prove that the torsion of any closed space curve which bounds a simply connected locally convex surface vanishes at least 4 times. This answers a question of Rosenberg related to a problem of Yau on characterizing the boundary of positively curved disks in Euclidean space. Furthermore, our result generalizes the 4 v…
We investigate the structure of good deal bounds, which are subintervals of a no-arbitrage pricing bound, for financial market models with convex constraints as an extension of Arai and Fukasawa (2014). The upper and lower bounds of a good deal bound are naturally described by a convex risk measure. We call such a risk…
We study relations of some classes of -convex, -visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular, \textrm{-circular convex} and \textrm{-circular visible} ones. Investigati…
In this paper we consider the Cauchy problem for isometric immersions. More precisely, given a smooth isometric immersion of a codimension one submanifold we construct isometric extensions for any via the method of convex integration.
Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and statistics, gaining an understanding of these complexity-theoretic issues is importa…
Let be a subset of (not necessarily convex), be a function, and be a uniformly continuous function, with modulus of continuity . We provide a necessary and sufficient condition on , for the existence of a convex function …
Geodesically convex functions are continuous on Riemannian manifolds.
Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel selection. It turns out that many of the related estimation problems can be cast…
Study spherical convex bodies using -floating areas and curvature entropy.
Convex optimization refines neural network training, improving model performance and reducing hyperparameter sensitivity.
We prove that any smooth Riemannian manifold of non-negative scalar curvature and with a strictly mean convex and compact boundary component can be (C^2) extended beyond the component to have non-negative scalar curvature and to enjoy anyone of the following three types of (new) boundary: strictly convex, totally geode…
We give upper bounds on the principal curvatures of a maximal surface of nonpositive curvature in three-dimensional Anti-de Sitter space, which only depend on the width of the convex hull of the surface. Moreover, given a quasisymmetric homeomorphism , we study the relation between the width of the convex hull of th…
Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the -norm. However, several important learning applications cannot benefit from this approach as they feature these convex norms as constraints in addition to the non-convex rank a…
Deep learning models generalize by extending decision boundaries outside the convex hull of training data.
New method finds near-optimal solutions for non-convex optimization problems.
Study derivations for nilpotent Lie algebras with negative Ricci curvature.
In this paper, we study open complete metric spaces with non-negative curvature. Among other things, we establish an extension of Perelman's soul theorem for possibly singular spaces: "Let X be a complete, non-compact, finite dimensional Alexandrov space with non-negative curvature. Suppose that X has no boundary and h…
A new convex loss function optimizes set predictions with balanced size and coverage.
Faster, better sparse model estimation for large datasets.
The paper refines and generalizes worst-case law invariant convex risk measures.
The use of convex regularizers allows for easy optimization, though they often produce biased estimation and inferior prediction performance. Recently, nonconvex regularizers have attracted a lot of attention and outperformed convex ones. However, the resultant optimization problem is much harder. In this paper, for a …
Paper introduces ICGNs to model convex gradients.
In this survey, we report on the state of the art of some of the fundamental problems in the Lie theory of Lie groups modeled on locally convex spaces, such as integrability of Lie algebras, integrability of Lie subalgebras to Lie subgroups, and integrability of Lie algebra extensions to Lie group extensions. We furthe…
Unified framework for training neural networks with non-smooth, non-convex regularizers.
Convexity properties of Weil-Petersson geodesics on the Teichmüller space of punctured Riemann surfaces are investigated. A normal form is presented for the Weil-Petersson Levi-Civita connection for pinched hyperbolic metrics. The normal form is used to establish approximation of geodesics in boundary spaces. Considera…
New curvature measures characterize non-convex Wulff shapes in normed spaces.
We provide a simple way to obtain the meromorphic extension of Eisenstein series and Scattering matrices under conditions which generalize the case of discrete groups acting convex cocompactly on hyperbolic spaces.
We prove that all atoroidal automorphisms of act on the space of projectivized geodesic currents with generalized north-south dynamics. As an application, we produce new examples of non virtually cyclic, free and purely atoroidal subgroups of such that the corresponding free group extension is hyp…
Sharp spectral extension of rigidity theorem for mean-convex manifolds.