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

105210314419 · Jun 202019922001200920172026
48 results for convex extension

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 …

2013-04-30abs ↗pdf ↗

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…

2016-02-22abs ↗pdf ↗

Let EE be an arbitrary subset of Rn\mathbb{R}^n, and f:ERf:E\to\mathbb{R}, G:ERnG:E\to\mathbb{R}^n be given functions. We provide necessary and sufficient conditions for the existence of a convex function FCloc1,1(Rn)F\in C^{1,1}_{\textrm{loc}}(\mathbb{R}^n) such that F=fF=f and F=G\nabla F=G on EE. We give a useful explicit formula …

2019-05-06abs ↗pdf ↗

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

2016-10-07abs ↗pdf ↗

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…

2018-11-06abs ↗pdf ↗

Developed a theory of local convexity for second order differential equations on Lie algebroids.

problem Analyzing convexity in differential equations on Lie algebroids.
method Theory development for local convexity of SODEs on Lie algebroids.
result Extensive discussion of homogeneous quadratic SODEs on Lie algebroids.

The paper explores rigidity and flexibility of isometric extensions with critical Hölder exponent.

problem The critical Hölder exponent in isometric extensions and its implications.
method Convex integration and construction of isometric extensions.
result The Hölder exponent $θ_0= rac12$ is critical, with extensions violating the tangential connection for $θ< rac12$.

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…

2017-05-01abs ↗pdf ↗

Let CC be a compact convex subset of Rn\mathbb{R}^n, f:CRf:C\to\mathbb{R} be a convex function, and m{1,2,...,}m\in\{1, 2, ..., \infty\}. Assume that, along with ff, we are given a family of polynomials satisfying Whitney's extension condition for CmC^m, and thus that there exists FCm(Rn)F\in C^{m}(\mathbb{R}^n) such that F=fF=f on $…

2015-01-21abs ↗pdf ↗

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…

2008-08-13abs ↗pdf ↗

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 …

2017-06-07abs ↗pdf ↗

Let EE be an arbitrary subset of Rn\mathbb{R}^n (not necessarily bounded), and f:ERf:E\to\mathbb{R}, G:ERnG:E\to\mathbb{R}^n be functions. We provide necessary and sufficient conditions for the 11-jet (f,G)(f,G) to have an extension (F,F)(F, \nabla F) with F:RnRF:\mathbb{R}^n\to\mathbb{R} convex and of class C1C^{1}. Besides, if $…

2017-06-29abs ↗pdf ↗

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…

2015-01-29abs ↗pdf ↗

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…

2015-06-01abs ↗pdf ↗

We study relations of some classes of kk-convex, kk-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{kk-circular convex} and \textrm{kk-circular visible} ones. Investigati…

2008-09-22abs ↗pdf ↗

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 C1,αC^{1,α} isometric extensions for any α<1n(n+1)+1α<\frac{1}{n(n+1)+1} via the method of convex integration.

2018-06-19abs ↗pdf ↗

Let CC be a subset of Rn\mathbb{R}^n (not necessarily convex), f:CRf:C\to\mathbb{R} be a function, and G:CRnG:C\to\mathbb{R}^n be a uniformly continuous function, with modulus of continuity ωω. We provide a necessary and sufficient condition on ff, GG for the existence of a convex function FC1,ω(Rn)F\in C^{1, ω}(\mathbb{R}^n)

2015-07-14abs ↗pdf ↗

Geodesically convex functions are continuous on Riemannian manifolds.

problem Continuity of geodesically convex functions on Riemannian manifolds.
method Proof of continuity using geodesic convexity and addressing a gap in existing proof.
result All geodesically convex functions are continuous in the interior of their domain 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…

2011-08-03abs ↗pdf ↗

Study spherical convex bodies using LpL_p-floating areas and curvature entropy.

problem Analogous isoperimetric inequalities for spherical convex bodies.
method Introduced LpL_p-floating areas and curvature entropy for spherical convex bodies.
result Established isoperimetric inequalities and dual isoperimetric inequalities.

Convex optimization refines neural network training, improving model performance and reducing hyperparameter sensitivity.

problem Training deep neural networks using non-convex optimization methods often leads to suboptimal solutions and requires extensive tuning.
method Formulate neural network training as convex programs with regularization terms, leveraging sparse recovery models and semi-infinite programming theory.
result Convex models can achieve global optima and outperform traditional non-convex methods, with improved robustness to hyperparameters.

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…

2012-09-20abs ↗pdf ↗

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the 1\ell_1-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…

2012-06-07abs ↗pdf ↗

Deep learning models generalize by extending decision boundaries outside the convex hull of training data.

problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.

Study derivations for nilpotent Lie algebras with negative Ricci curvature.

problem Characterize derivations leading to solvable extensions with negative Ricci curvature.
method Investigate the space of diagonalizable derivations for specific Lie algebras.
result Prove conjecture about derivations in dimension 5 and for Heisenberg and standard filiform Lie algebras.

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…

2007-06-05abs ↗pdf ↗

A new convex loss function optimizes set predictions with balanced size and coverage.

problem Optimizing set predictions with balanced size and coverage.
method Proposes a convex loss function using Choquet integrals for nondecreasing subset-valued functions.
result Optimal trade-offs between conditional probabilistic coverage and set size.

The paper refines and generalizes worst-case law invariant convex risk measures.

problem Developing robust convex risk measures under uncertainty sets.
method Generalizing closed forms for worst-case law invariant convex risk measures with uncertainty sets based on norms and moment constraints.
result Explicit closed forms for convex risk measures are developed and assessed through numerical simulations.

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…

2015-01-26abs ↗pdf ↗

Unified framework for training neural networks with non-smooth, non-convex regularizers.

problem Training neural networks with non-smooth, non-convex regularizers.
method ProxGen framework for stochastic proximal gradient descent.
result ProxGen framework achieves the same convergence rate as standard methods and outperforms subgradient-based approaches.

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…

2007-09-16abs ↗pdf ↗

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.

1995-03-28abs ↗pdf ↗

We prove that all atoroidal automorphisms of Out(FN)Out(F_N) 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 Out(FN)Out(F_N) such that the corresponding free group extension is hyp…

2017-11-21abs ↗pdf ↗

Sharp spectral extension of rigidity theorem for mean-convex manifolds.

problem Rigidity and flexibility of manifolds with mean-convex boundary and nonnegative Ricci curvature.
method Spectral Ricci lower bounds and mean-convex boundary conditions.
result Sharp spectral extension of rigidity theorem for specific conditions.