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,657 papers · 148 categories

Trend · papers per month

4692137183 · Jun 202019922001200920172026
48 results for coordinate changes

Paper proposes a method to improve circular coordinate representation for detecting changes in high-dimensional datasets.

problem Detecting changes in high-dimensional datasets with preserved topological structures.
method Adapt circular coordinate framework using a generalized penalty function instead of an L2 penalty.
result Circular coordinates with generalized penalty can detect changes in high-dimensional datasets under different sampling schemes.

Post-detection analysis identifies responsible coordinates for multivariate change-points.

problem Identifying which coordinates in multivariate time series change after a detected change-point.
method Two-sample testing procedures with nonparametric tests for Type I error control.
result Strong performance of proposed post hoc statistical procedures.

This paper constructs a family of coordinate systems about a point on a quaternionic contact manifold, called quaternionic contact pseudohermitian normal coordinates. Once defined, conformal variations of the quaternionic contact structure induce changes on the coordinates which are studied in an effort to simplify the…

2008-07-02abs ↗pdf ↗

Natural coordinates for SL3-webs on surfaces are shown to be consistent under triangulation changes.

problem Natural coordinates for SL3-webs on surfaces.
method Showed natural coordinates are consistent under triangulation changes using cluster transformations.
result Natural coordinates for SL3-webs on surfaces are consistent under triangulation changes.

Considering a Hamiltonian Dynamical System describing the motion of charged particle in a Tokamak or a Stellarator, we build a change of coordinates to reduce its dimension. This change of coordinates is in fact an intricate succession of mappings that are built using Hyperbolic Partial Differential Equations, Differen…

2013-06-24abs ↗pdf ↗

For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas with subordinate partition of unity on manifolds with boundary of bounded geomet…

2000-01-19abs ↗pdf ↗

CODA resolves coordination issues in offline multi-agent reinforcement learning.

problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.

Chekhov, Fock and Kashaev introduced a quantization of the Teichmüller space Tq(S)\mathcal{T}^q(S) of a punctured surface SS, and an exponential version of this construction was developed by Bonahon and Liu. The construction of the quantum Teichmüller space crucially depends on certain coordinate change isomorphisms betw…

2005-09-28abs ↗pdf ↗

We study coordinate-invariance of some asymptotic invariants such as the ADM mass or the Chruściel-Herzlich momentum, given by an integral over a "boundary at infinity". When changing the coordinates at infinity, some terms in the change of integrand do not decay fast enough to have a vanishing integral at infinity; bu…

2010-12-16abs ↗pdf ↗

Coordinate descent (CD) algorithms have become the method of choice for solving a number of optimization problems in machine learning. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We consider general CD with …

2014-01-15abs ↗pdf ↗

Let G be a simply connected, simple, complex Lie group of rank 2. We give explicit Fock-Goncharov coordinates for configurations of triples and quadruples of affine flags in G. We show that the action on triples by orientation preserving permutations corresponds to explicit quiver mutations, and that the same holds for…

2016-05-26abs ↗pdf ↗

The abstract introduces golden Finsler structures and explores their local and global properties.

problem Investigating geometric properties of golden Finsler structures.
method Local and global analysis of golden Finsler structures, including explicit computations and transformations.
result Proved that golden Finsler structures cannot be projectively related.

We present a unified derivation of covariant time derivatives, which transform as tensors under a time-dependent coordinate change. Such derivatives are essential for formulating physical laws in a frame-independent manner. Three specific derivatives are described: convective, corotational, and directional. The covaria…

2001-02-28abs ↗pdf ↗

Twisted SL2C\operatorname{SL}_2 \mathbb{C} local systems on surfaces of finite type appear often in geometry and physics. Most of them arise geometrically as local systems of charts for pleated hyperbolic structures. Bonahon and Thurston's "shear-bend coordinates" parameterize these local systems of charts. On a surface …

2015-10-20abs ↗pdf ↗

Coordinated defensive escorts can aid a navigating payload by positioning themselves in order to maintain the safety of the payload from obstacles. In this paper, we present a novel, end-to-end solution for coordinating an escort team for protecting high-value payloads. Our solution employs deep reinforcement learning …

2019-10-09abs ↗pdf ↗

We define new coordinates for Fock-Goncharov's higher Teichmüller spaces for a surface with holes, which are the moduli spaces of representations of the fundamental group into a reductive Lie group GG. Some additional data on the boundary leads to two closely related moduli spaces, the X\mathscr{X}-space and the $\ma…

2014-07-11abs ↗pdf ↗

We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more general polynomial transformation laws. The key examples of such bundles include af…

2017-07-08abs ↗pdf ↗

The aim of the present paper is to provide an intrinsic investigation of projective changes in Finlser geometry, following the pullback formalism. Various known local results are generalized and other new intrinsic results are obtained. Nontrivial characterizations of projective changes are given. The fundamental proje…

2009-04-09abs ↗pdf ↗

This paper introduces AdaSDCA: an adaptive variant of stochastic dual coordinate ascent (SDCA) for solving the regularized empirical risk minimization problems. Our modification consists in allowing the method adaptively change the probability distribution over the dual variables throughout the iterative process. AdaSD…

2015-02-27abs ↗pdf ↗

In this paper we \emph{explicitly} compute the transformation that maps the generic second order differential equation y=f(x,y,y)y''= f(x, y, y') to the Painlevé first equation y=6y2+xy''=6y^2+x (resp. the Painlevé second equation y=2y3+yx+α{y''=2 y^{3}+yx+ α}). This change of coordinates, which is function of ff and its partial derivativ…

2007-11-18abs ↗pdf ↗

The paper connects isomonodromic and isospectral deformations for sl2(C)\mathfrak{sl}_2(\mathbb{C}) connections.

problem Connecting isomonodromic and isospectral deformations for sl2(C)\mathfrak{sl}_2(\mathbb{C}) connections.
method Explicitly constructing Lax pairs and Darboux coordinates to bridge isomonodromic and isospectral deformations.
result Explicit change of Darboux coordinates to match spectral invariants, solving an open issue.

Analyzes how quadratic differential trajectories change with variation, proving a wall-crossing formula.

problem Analyzing how the number of trajectories of quadratic differentials changes with variation.
method Proves an analytic wall-crossing formula using Fock-Goncharov coordinates and characterizes birational automorphisms.
result Characterizes certain birational automorphisms and computes Stokes automorphisms.

Coordinate-independent convolutions on manifolds avoid reference frame ambiguity.

problem Applying convolutions on non-Euclidean manifolds without reference frame ambiguity.
method Developed coordinate-independent and gauge-equivariant convolutions on Riemannian manifolds.
result Coordinate-independent convolutions are equivariant under local gauge transformations.

New method detects changes in high-dimensional data from small samples.

problem Detecting changes in high-dimensional data with limited samples.
method Angular kernel scan framework for detecting marginal distributional shifts.
result Exact population mean factorization and asymptotically distribution-free test.

Paper tackles dynamic behavior of variable topology mechanisms, presenting new transition conditions.

problem Dynamic behavior of mechanisms with changing kinematic topology.
method Presented new transition conditions for variable topology mechanisms using projected motion equations and Voronets equations.
result Results show the dynamic behavior of joint locking in 3R and 6DOF mechanisms.

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…

2017-03-07abs ↗pdf ↗

New algorithm for nonstationary multi-armed bandits with optimal performance.

problem Nonstationary multi-armed bandits with changing model parameters over time.
method Adaptive Resetting Bandit (ADR-bandit) algorithm using adaptive windowing techniques.
result ADR-bandit achieves nearly optimal performance in both abrupt and gradual changes.

We investigate the Berezin integral of non-compactly supported quantities. In the framework of supermanifolds with corners, we give a general, explicit and coordinate-free repesentation of the boundary terms introduced by an arbitrary change of variables. As a corollary, a general Stokes's theorem is derived - here, th…

2011-06-10abs ↗pdf ↗

Let ρ0ρ_0 be an action of a Lie group on a manifold with boundary that is transitive on the interior. We study the set of actions that are topologically conjugate to ρ0ρ_0, up to smooth or analytic change of coordinates. We show that in many cases, including the compactifications of negatively curved symmetric spaces, …

2008-04-15abs ↗pdf ↗

Efficiently simulates Langevin dynamics on manifold using diffusion maps and finite volume schemes.

problem Simulating Langevin dynamics on high-dimensional manifolds with limited data.
method Diffusion maps, Fokker-Planck equation, finite volume scheme, explicit time discretization.
result Data-driven finite volume scheme approximates Langevin dynamics on manifold with good properties.

We study the general structure of formal perturbative solutions to the Hamiltonian perturbations of spatially one-dimensional systems of hyperbolic PDEs. Under certain genericity assumptions it is proved that any bihamiltonian perturbation can be eliminated in all orders of the perturbative expansion by a change of coo…

2004-10-01abs ↗pdf ↗

The present paper deals with an \emph{intrinsic} investigation of the notion of a concurrent ππ-vector field on the pullback bundle of a Finsler manifold (M,L)(M,L). The effect of the existence of a concurrent ππ-vector field on some important special Finsler spaces is studied. An intrinsic investigation of a particular…

2008-05-16abs ↗pdf ↗

Consider a smooth manifold MM with a smooth cometric gg^{\ast} which changes the bilineal type by transverse way, on a hypersurface DD^{\infty}. Suppose that the radical annihilator hyperplane is tangent to DD^{\infty}. We examine the geometry of the (gg^{\ast}-dual) covariant metric gg on MM- DD^{\infty}, prov…

2006-06-02abs ↗pdf ↗

In machine learning, Feature Selection (FS) is a major part of efficient algorithm. It fuels the algorithm and is the starting block for our prediction. In this paper, we present a new method, called Optimal Coordinate Ascent (OCA) that allows us selecting features among block and individual features. OCA relies on coo…

2018-11-29abs ↗pdf ↗