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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for locally convex ends

The paper proves a bound on the length of the shortest geodesic flower on certain manifolds.

problem Finding the shortest geodesic flower on a specific class of manifolds.
method Analyzing a non-compact Riemannian manifold with locally convex ends and finite volume, proving the existence of a geodesic net with constraints on its length.
result The existence of a non-trivial geodesic flower with a bounded total length on the manifold.

We prove a theorem of Hadamard-Stoker type: a connected locally convex complete hypersurface immersed in Hn×RH^n \times R (n>1), where HnH^n is n-dimensional hyperbolic space, is embedded and homeomorphic either to the n-sphere or to RnR^n. In the latter case it is either a vertical graph over a convex domain in HnH^n or…

2012-05-02abs ↗pdf ↗

A real projective orbifold is an nn-dimensional orbifold modeled on RPn\mathbb{RP}^n with the group PGL(n+1,R)PGL(n+1, \mathbb{R}). We concentrate on an orbifold that contains a compact codimension 00 submanifold whose complement is a union of neighborhoods of ends, diffeomorphic to closed (n1)(n-1)-dimensional orbifolds times …

2010-11-04abs ↗pdf ↗

Real projective structures on nn-orbifolds are useful in understanding the space of representations of discrete groups into SL(n+1,R)\mathrm{SL}(n+1, \mathbb{R}) or PGL(n+1,R)\mathrm{PGL}(n+1, \mathbb{R}). A recent work shows that many hyperbolic manifolds deform to manifolds with such structures not projectively equivalent to the o…

2015-07-03abs ↗pdf ↗

Real projective structures on nn-orbifolds are useful in understanding the space of representations of discrete groups into SL(n+1,R)\mathrm{SL}(n+1, \mathbb{R}) or PGL(n+1,R)\mathrm{PGL}(n+1, \mathbb{R}). A recent work shows that many hyperbolic manifolds deform to manifolds with such structures not projectively equivalent to the o…

2015-01-02abs ↗pdf ↗

We establish that over a C^{2,1} manifold the exponential map of any Lipschitz connection or spray determines a local Lipeomophism and that, furthermore, reversible convex normal neighborhoods do exist. To that end we use the method of Picard-Lindelof approximation to prove the strong differentiability of the exponenti…

2013-08-30abs ↗pdf ↗

In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization depends on whether the group has a certain type of splitting over a virtually abel…

2017-05-02abs ↗pdf ↗

This work proposes splitting deep neural networks into smaller sub-networks for faster and more efficient distillation.

problem Challenges in training deep neural networks, including local optima, gradient issues, and computational demands.
method Proposes a non-end-to-end distillation approach by splitting networks into smaller, independent sub-networks (neighbourhoods).
result Independent training of smaller sub-networks can speed up distillation and improve efficiency in various applications.

NOVAS uses adaptive stochastic search for non-convex optimization in deep networks.

problem Non-convex optimization challenges in deep neural networks.
method Adaptive stochastic search for non-convex optimization.
result NOVAS outperforms existing alternatives in a structured prediction task.

We prove that the log-Brunn-Minkowski inequality \begin{equation*} |λK+_0 (1-λ)L|\geq |K|^λ|L|^{1-λ} \end{equation*} (where |\cdot| is the Lebesgue measure and +0+_0 is the so-called log-addition) holds when KRnK\subset\mathbb{R}^n is a ball and LL is a symmetric convex body in a suitable C2C^2 neighborhood of KK.

2017-10-29abs ↗pdf ↗

The paper solves a conjecture about spacelike hypersurfaces in de Sitter space.

problem Proving an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.
method Investigating the locally constrained inverse curvature flow to establish the inequality.
result Established an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.

Novel technique reduces Bayesian network complexity while preserving inference accuracy.

problem Complexity reduction in Bayesian networks for efficient inference.
method Directed convex hull structure and polynomial-time algorithm for identifying minimum localized networks.
result High dimension reduction capability and improved inference efficiency in real networks.

We generalize Hadamard-Stoker-Currier Theorems for surfaces immersed in a Killing submersion over a strictly Hadamard surface whose fibers are the trajectories of a unit Killing field. We prove that every complete surface whose principal curvatures are greater than a certain function (depending on the ambient manifold)…

2010-02-05abs ↗pdf ↗

In this paper we consider the lens rigidity problem with partial data for conformal metrics in the presence of a magnetic field on a compact manifold of dimension 3\geq 3 with boundary. We show that one can uniquely determine the conformal factor and the magnetic field near a strictly convex (with respect to the magne…

2016-05-20abs ↗pdf ↗

New geometric inequalities for convex bodies derived from Log-Brunn-Minkowski conjecture.

problem Proving geometric inequalities for convex bodies.
method Analyzing semi-norms and symmetric convex bodies, using integral inequalities.
result Characterization and improvement of geometric inequalities involving convex bodies.

Flow deforms locally convex curves to curves of constant k-order width.

problem Evolve locally convex curves to curves of constant k-order width.
method Introduced a nonlocal curvature flow to evolve locally convex curves in the plane.
result The flow converges to a smooth, locally convex curve of constant k-order width as time goes to infinity.

LoCo learns local representations without end-to-end synchronization, improving performance on complex tasks.

problem Learning local representations without end-to-end synchronization constraints.
method Overlap local blocks to increase decoder depth and allow feedback from upper to lower layers.
result LoCo closes the performance gap between local learning and end-to-end contrastive learning.

Two results on end spaces of infinite type surfaces, answering questions about their topology and equivalence.

problem Topology and equivalence of end spaces of infinite type surfaces.
method Examples and Tsankov's argument to show equivalence relation.
result Examples of infinite type surfaces with end spaces that are not self-similar but have a unique maximal type.

Structured Prediction Energy Networks (SPENs) are a simple, yet expressive family of structured prediction models (Belanger and McCallum, 2016). An energy function over candidate structured outputs is given by a deep network, and predictions are formed by gradient-based optimization. This paper presents end-to-end lear…

2017-03-16abs ↗pdf ↗

The paper introduces a new flow to converge to a Wulff shape from a smooth convex hypersurface.

problem Proving Alexandrov-Fenchel inequalities for anisotropic mixed volumes.
method Introducing a fully nonlinear locally constrained anisotropic curvature flow.
result The flow converges smoothly and exponentially to a scaled Wulff shape.

BPQP improves efficiency of differentiable optimization layers for deep learning.

problem Efficiency in differentiating optimization problems for deep learning models.
method Reformulates optimization problems as quadratic programming, enabling efficient gradient calculation.
result Significant improvement in efficiency (order of magnitude faster) compared to other differentiable optimization layers.

Recently, based on the idea of randomizing space theory, random convex analysis has been being developed in order to deal with the corresponding problems in random environments such as analysis of conditional convex risk measures and the related variational problems and optimization problems. Random convex analysis is …

2016-03-23abs ↗pdf ↗

Local rigidity proved for convex hypersurfaces in spaces of constant curvature.

problem Proving rigidity of convex hypersurfaces in spaces of constant curvature.
method Analyzing isometric convex hypersurfaces in spaces of constant curvature of dimension n4n\ge4.
result Two convex isometric hypersurfaces are congruent locally around their corresponding under strict convexity isometries.

Study projective deformations of hyperbolic 3-orbifolds with turnover ends.

problem Deformations of hyperbolic 3-orbifolds with turnover ends in projective geometry.
method Projective deformations of hyperbolic 3-orbifolds with turnover ends, focusing on totally geodesic generalized cusps.
result Turnover funnels remain totally geodesic and the deformed projective 3-orbifold remains properly convex.

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.

Deep learning has revolutionized the ability to learn "end-to-end" autonomous vehicle control directly from raw sensory data. While there have been recent extensions to handle forms of navigation instruction, these works are unable to capture the full distribution of possible actions that could be taken and to reason a…

2018-11-25abs ↗pdf ↗

Quantum algorithm for multi-asset option pricing under different volatility models.

problem Efficiently pricing multi-asset options under various volatility models using quantum computing.
method Developed an end-to-end quantum PDE framework for European option pricing, solving PDEs after discretization on spatial grids.
result Quantum framework provides polynomial improvement in resource usage compared to classical methods.

We study a properly convex real projective manifold with (possibly empty) compact, strictly convex boundary, and which consists of a compact part plus finitely many convex ends. We extend a theorem of Koszul which asserts that for a compact manifold without boundary the holonomies of properly convex structures form an …

2015-11-19abs ↗pdf ↗

New Harnack inequality for curve shortening flow without convexity.

problem Proving a Harnack inequality for curve shortening flow without convexity.
method Developed a new Harnack inequality for one-dimensional mean curvature flow (curve shortening flow) that doesn't require convexity.
result Explicit time by which an initial curve becomes graphical under curve shortening flow.