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

186372558744 · Jun 202019922001200920172026
48 results for cut time map

Stability of cut locus under metric perturbations in compact Riemannian manifolds.

problem Stability of cut locus under C2C^2-perturbations of the metric.
method Proving stability with respect to the Hausdorff metric of the cut locus under C2C^2 perturbation of the metric.
result The Hausdorff distance between cut loci converges to zero as the metrics converge.

The left-invariant sub-Riemannian problem on the Engel group is considered. The problem gives the nilpotent approximation to generic nonholonomic systems in four-dimensional space with two-dimensional control, for instance to a system which describes motion of mobile robot with a trailer. The global optimality of extre…

2014-08-28abs ↗pdf ↗

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

problem Solving parametric mixed-integer linear optimization problems with changing data.
method Introducing cutting-plane layers (CPLs) for differentiable cutting-plane generation.
result The algorithm computes solutions with low integrality gaps and generalizes to unseen instances.

Functor connects symplectic and contact structures via cutting and blowups.

problem Establishing a functorial relationship between symplectic and contact structures.
method Developed a cutting procedure and its inverse for manifolds with boundary and equivariant transverse maps, then applied it to non-symplectic and non-contact structures.
result Obtained an inverse functor for equivariant radial-squared blowups.

A new spectrum recovers cobordism cut and paste groups of manifolds with boundary.

problem Defining and studying cobordism cut and paste groups of manifolds with boundary.
method Constructing a spectrum that recovers the cobordism cut and paste groups of manifolds with boundary.
result Construction of a spectrum that recovers the cobordism cut and paste groups of manifolds with boundary.

We define spin-c prequantization of a symplectic manifold to be a spin-c structure and a connection which are compatible with the symplectic form. We describe the cutting of an S^1-equivariant spin-c prequantization. The cutting process involves a choice of a spin-c prequantization for the complex plane. We prove that …

2007-10-23abs ↗pdf ↗

The paper proves the existence of a tubular neighborhood for Finsler submanifolds.

problem Existence of a tubular neighborhood for Finsler submanifolds.
method Geometric proof of the existence of a tubular neighborhood for Finsler submanifolds.
result The distance between a Finsler submanifold and its cut locus is at least ε when the submanifold is compact.

Maps on Sasakian manifolds limit to sub-Riemannian distance bounds.

problem Understanding sub-Riemannian distances on Sasakian manifolds.
method Parallel and mirror maps along geodesics of a taming Riemannian metric.
result Limits of transport maps outside sub-Riemannian cut-locus provide bounds on sub-Riemannian distance.

The goal of this thesis is to study the singularities of the exponential map of Riemannian and Finsler manifolds (a concept related to caustics and catastrophes), and the object known as the cut locus (aka ridge, medial axis or skeleton), to improve existing results about its structure, to look at it in new ways, and t…

2014-11-14abs ↗pdf ↗

The study identifies conjugate and cut points in ideal fluid motion configurations.

problem Understanding stability and re-convergence of fluid configurations.
method Existence and non-existence of conjugate points in specific fluid configurations, using geometric and physical analysis.
result Existence of conjugate points in Kolmogorov flows and non-existence in Arnold steady states.

We discuss a general framework for cutting constructions and reinterpret in this setting the work on non-Abelian symplectic cuts by Weitsman. We then introduce two analogous non-Abelian modification constructions for hyperkähler manifolds: one modifies the topology significantly, the other gives metric deformations. We…

2010-02-09abs ↗pdf ↗

The level set of an elliptic function is a doubly periodic point set in C. To obtain a wider spectrum of point sets, we consider, more generally, a Riemann surface S immersed in C^2 and its sections (``cuts'') by C. We give S a crystallographic isometry in C^2 by defining a fundamental surface element as a conformal ma…

1999-04-03abs ↗pdf ↗

The question was raised as to whether the cut number of a 3-manifold X is bounded from below by 1/3 beta_1(X). We show that the answer to this question is `no.' For each m>0, we construct explicit examples of closed 3-manifolds X with beta_1(X)=m and cut number 1. That is, pi_1(X) cannot map onto any non-abelian free g…

2001-12-19abs ↗pdf ↗

Study on limits and cut-off phenomena in deep neural networks.

problem Understanding the behavior of deep neural networks as the number of layers increases.
method Analysis of semi-invariant metrics and application of non-commutative ergodic theorems.
result Observation of a cut-off phenomenon in the number of layers for random network initialization.

Study on focal locus of submanifolds in Finsler manifolds, showing regularity and smoothness.

problem Investigating the focal locus of submanifolds in Finsler manifolds.
method Using the normal exponential map and extending Warner's ideas, studying connected components and smoothness of focal time maps.
result Identified an open and dense subset where focal time maps are smooth, provided they are finite.

Study on mapping classes of real rational surface automorphisms, focusing on reducible maps and pseudo-Anosov maps.

problem Investigating the mapping classes of real rational surface automorphisms and their restrictions.
method Analysis of reducible maps, determination of pseudo-Anosov mapping classes, and comparison with Penner's construction.
result Realized Lehmer's number as the stretch factor of a pseudo-Anosov map on a specific surface.

Financial time series have been investigated to follow fat-tailed distributions. Further, an empirical probability distribution sometimes shows cut-off shapes on its tails. To describe this stylized fact, we incorporate the cut-off effect in superstatistics. Then we confirm that the presented stochastic model is capabl…

2018-09-13abs ↗pdf ↗

In this note, we study the cut locus of the free, step two Carnot groups Gk\mathbb{G}_k with kk generators, equipped with their left-invariant Carnot-Carathéodory metric. In particular, we disprove the conjectures on the shape of the cut loci proposed in [Myasnichenko - 2002] and [Montanari, Morbidelli - 2016], by exh…

2016-10-05abs ↗pdf ↗

Nilpotent groups can't be biLipschitz embedded into L1L^1.

problem Proving that simply connected nilpotent Lie groups cannot be biLipschitz embedded into L1L^1.
method Using a pull-back distance and cut measures, the authors show that bi-Lipschitz embeddings can't exist in non-abelian settings.
result Every Carnot group that biLipschitz embeds into L1L^1 is abelian.

Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cu…

2014-10-29abs ↗pdf ↗

We study the small time asymptotics of the gradient and Hessian of the logarithm of the heat kernel at the cut locus, giving, in principle, complete expansions for both quantities. We relate the leading terms of the expansions to the structure of the cut locus, especially to conjugacy, and we provide a probabilistic in…

2006-05-29abs ↗pdf ↗

The paper constructs optimal sub-Riemannian geodesics in specific Carnot groups.

problem Optimal paths in sub-Riemannian geometry for certain groups.
method Explicit construction of geodesics using symmetries and the Hadamard technique.
result Identification of cut time and cut locus in the constructed geodesics.

The study examines optimal synthesis in a radially symmetric Grushin space with conditions on the weight function.

problem Optimal synthesis in a radially symmetric Grushin space with a weight function.
method Analysis of the geometry of R3\mathbb{R}^3 with a weighted Carnot-Carathéodory metric, providing conditions for Grushin-like structure, and describing optimal synthesis.
result Sufficient conditions on the weight function ensure a Grushin-like structure, and the candidate cut time coincides with the true cut time in the integrable case.

Max-Cut decision tree improves classification accuracy and reduces computation time.

problem Improving decision tree accuracy and efficiency for complex classification tasks.
method Alternative splitting metric (max cut) and PCA-based feature selection at each node.
result 49% improvement in accuracy with 94% reduction in CPU time on CIFAR-100 data.

The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP conver…

2011-05-05abs ↗pdf ↗

New polynomial-time solutions found for training ReLU networks, mirroring Max-Cut complexity.

problem Training two-layer ReLU neural networks with weight decay regularization.
method Developed a convex formulation and randomized algorithm to find approximate global optimizers.
result First polynomial-time approximation guarantees and hardness of approximation results for regularized ReLU networks.

Study geodesics and shortest arcs on Lie groups with specific metrics.

problem Characterize geodesics and shortest paths on Lie groups with sub-Riemannian metrics.
method Analytical and geometric methods to find geodesics and shortest arcs.
result Found geodesics, shortest arcs, distances, and conjugate loci for specified metrics.

We consider the nilpotent left-invariant sub-Riemannian structure on the Engel group. This structure gives a fundamental local approximation of a generic rank 2 sub-Riemannian structure on a 4-manifold near a generic point (in particular, of the kinematic models of a car with a trailer). On the other hand, this is the …

2017-09-30abs ↗pdf ↗

Study geodesics and shortest arcs on Lie groups with specific metrics.

problem Characterize geodesics and shortest arcs in sub-Riemannian metrics on Lie groups.
method Investigated left-invariant sub-Riemannian metrics on SU(1,1)imesRSU(1,1) imes\mathbb{R} and SO0(2,1)imesRSO_0(2,1) imes\mathbb{R}.
result Found geodesics, shortest arcs, cut loci, and conjugate loci.

Sequential modelling with self-attention has achieved cutting edge performances in natural language processing. With advantages in model flexibility, computation complexity and interpretability, self-attention is gradually becoming a key component in event sequence models. However, like most other sequence models, self…

2019-11-28abs ↗pdf ↗

This research introduces dynamic portfolio cuts using a spectral approach for graph-theoretic diversification.

problem Traditional methods for estimating asset-return covariance assume statistical time-invariance, failing to capture the nonstationary nature of asset price movements.
method Introduces graph spectral estimators that account for nonstationarity, partitioning the market graph into time-evolving clusters for dynamic portfolio cuts.
result Demonstrates the advantages of the proposed framework over traditional methods through numerical case studies using real-world price data.

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

2008-10-24abs ↗pdf ↗

This article addresses regularity of optimal transport maps for cost="squared distance" on Riemannian manifolds that are products of arbitrarily many round spheres with arbitrary sizes and dimensions. Such manifolds are known to be non-negatively cross-curved [KM2]. Under boundedness and non-vanishing assumptions on th…

2010-06-10abs ↗pdf ↗

Study mapping class groups of infinite type surfaces with noncompact boundaries.

problem Classify pure mapping class groups of infinite type surfaces.
method Developed a method to cut surfaces into simpler ones and combined recent results.
result Complete classification of perfect and uniformly perfect pure mapping class groups.