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

Trend · papers per month

205410615820 · Jun 202019922001200920172026
48 results for train tracks

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…

2010-04-26abs ↗pdf ↗

Paper translates train track concepts to cluster algebras for pseudo-Anosov mapping classes.

problem Understanding pseudo-Anosov mapping classes on surfaces.
method Using Goncharov--Shen's potential function, the paper translates train track concepts into cluster algebra language.
result Proves sign stability of general pseudo-Anosov mapping classes.

This work uses SVM to identify track component failures in AC Track Circuits.

problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.

The paper defines and proves the existence of train track maps on graphs of groups.

problem Understanding homotopy equivalences in graphs of groups.
method Developed the theory of train track maps on graphs of groups, defining maps and homotopy equivalences.
result Any homotopy equivalence of a graph of groups may be represented by a relative train track map under certain conditions.

Study of endperiodic maps on infinite graphs, proving homotopy and eigenvalue properties.

problem Understanding endperiodic maps on infinite graphs with finitely many ends.
method Adapting relative train track maps and combinatorial techniques to infinite type setting.
result Any generalized endperiodic map is homotopic to a relative train track map.

Let XX be an infinite Riemann surface equipped with its conformal hyperbolic metric such that the action of the covering group π1(X)π_1(X) on X~\tilde{X} is of the first kind-i.e., the surface XX is equal to its convex core. We first prove that any geodesic lamination on XX is nowhere dense. Given a fixed geodesic pant…

2019-02-09abs ↗pdf ↗

The study of pseudo-Anosov maps with minimum expansion factor using train tracks.

problem Finding pseudo-Anosov maps with minimum expansion factor.
method Analysis of standardly embedded train tracks and Thurston symplectic form.
result The expansion factor of pseudo-Anosov maps is bounded by a specific inequality involving the golden ratio.

In this paper we develop the metric theory for the outer space of a free product of groups. This generalizes the theory of the outer space of a free group, and includes its relative versions. The outer space of a free product is made of GG-trees with possibly non-trivial vertex stabilisers. The strategies are the same…

2013-12-15abs ↗pdf ↗

We prove that for every P there is a bound B depending only on P so that the mapping torus of every P--small irreducible train-track map can be obtained by surgery from one of B mapping tori. We show that given an integer P>0 there is a bound MM depending only on P, so that there exists a presentation of the fundament…

2012-09-25abs ↗pdf ↗

Let Sg,pS_{g,p} denote the genus gg orientable surface with pp punctures. We show that nested train track sequences constitute O((g,p)2)O((g,p)^{2})-quasiconvex subsets of the curve graph, effectivizing a theorem of Masur and Minsky. As a consequence, the genus gg disk set is O(g2)O(g^{2})-quasiconvex. We also show that splitti…

2013-06-06abs ↗pdf ↗

The thesis shows how automorphisms of hyperbolic groups can be represented by train track maps.

problem Representing automorphisms of hyperbolic groups using train track maps.
method Using graphs of groups and Bestvina-Handel's irreducible train track maps, the thesis constructs relative train track maps.
result Outer automorphisms of finitely-generated word hyperbolic groups satisfy a dynamical trichotomy.

Any endomorphism of a finitely generated free group naturally descends to an injective endomorphism of its stable quotient. In this paper, we prove a geometric incarnation of this phenomenon: namely, that every expanding irreducible train track map inducing an endomorphism of the fundamental group gives rise to an expa…

2015-07-10abs ↗pdf ↗

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.

Carbontracker tracks and predicts training DL models' carbon footprint.

problem Exponential growth in energy consumption for training deep learning models.
method Carbontracker tool for tracking and predicting energy and carbon footprint.
result Promotes responsible computing and encourages energy-efficient deep learning.

Tribuo integrates ML models with provenance in Java.

problem Tracking and ensuring ML models behave appropriately as they grow in number and complexity.
method Integrates model training, inference, type-safety, runtime checking, and automatic provenance recording into a single Java library.
result Automatic recording of full processing pipeline and training details inside the model object.

Global results are proved about the way in which Boyland's forcing partial order organizes a set of braid types: those of periodic orbits of Smale's horseshoe map for which the associated train track is a star. This is a special case of a conjecture introduced in a previous paper, which claims that forcing organizes al…

2002-04-10abs ↗pdf ↗

Quantifying behavior is crucial for many applications in neuroscience. Videography provides easy methods for the observation and recording of animal behavior in diverse settings, yet extracting particular aspects of a behavior for further analysis can be highly time consuming. In motor control studies, humans or other …

2018-04-09abs ↗pdf ↗

The study examines the stretch factors of outer automorphisms and their latent symmetry.

problem Understanding stretch factors of outer automorphisms in free groups.
method Analyzes the latent symmetry of graphs and uses it to bound stretch factors.
result A precise notion of latent symmetry provides a lower bound on the number of folds required.

DD algorithm tracks test error from train error without validation data.

problem Systematic generalization gap between train and test errors in modern model training.
method Decoupled descent (DD) algorithm that cancels data reuse biases via approximate message passing.
result DD algorithm rigorously demonstrates zero-cost validation and 100% data utilization.

Paper presents neural network controllers for offset-free setpoint tracking.

problem Offset-free setpoint tracking using neural network controllers.
method Exploiting slope-restricted activation functions, linear matrix inequalities are used to verify stability.
result Global and local stability conditions for neural network controllers are derived.

Enhances particle filters with neural augmentation for multi-sub-state tracking.

problem Particle filters struggle with complex or approximated models and low latency requirements.
method Learning Flock (LF) uses a neural network to correct particle weights based on sub-particle relationships.
result LF improves performance, robustness, and latency in radar multi-target tracking.

Graph neural networks improve charged particle tracking on FPGAs.

problem Charged particle trajectory determination in high interaction density conditions.
method Graph neural networks (GNNs) embedded in tracker data as graphs, classifying edges as track segments.
result GNNs implemented on FPGAs for charged particle tracking, enabling future HL-LHC experiments.

A robust visual tracking system requires an object appearance model that is able to handle occlusion, pose, and illumination variations in the video stream. This can be difficult to accomplish when the model is trained using only a single image. In this paper, we first propose a tracking approach based on affine subspa…

2014-03-03abs ↗pdf ↗

New approach uses Gaussian processes to learn and track complex systems with guaranteed accuracy.

problem Inaccurate first principle models for complex systems due to data complexity.
method Bayesian prediction error bound for Gaussian process regression, derived from kernel-based data density.
result Achieves vanishing tracking error with increasing data density, providing time-varying accuracy guarantees.

PiVoT improves real-time multi-object detection and tracking in clutter.

problem Challenges in multi-object detection and tracking from noisy point clouds.
method Variational inference for fast, clutter-resilient multi-object tracking.
result Substantial performance improvement over existing Bayesian trackers.

Tracking large numbers of densely-arranged, interacting objects is challenging due to occlusions and the resulting complexity of possible trajectory combinations, as well as the sparsity of relevant, labeled datasets. Here we describe a novel technique of collective tracking in the model environment of a 2D honeybee hi…

2018-12-31abs ↗pdf ↗

Recent advances in visual tracking are based on siamese feature extractors and template matching. For this category of trackers, latest research focuses on better feature embeddings and similarity measures. In this work, we focus on building holistic object representations for tracking. We propose a framework that is d…

2019-07-21abs ↗pdf ↗

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

The tracking method based on the extreme learning machine (ELM) is efficient and effective. ELM randomly generates input weights and biases in the hidden layer, and then calculates and computes the output weights by reducing the iterative solution to the problem of linear equations. Therefore, ELM offers the satisfying…

2018-07-26abs ↗pdf ↗

A new method computes Teichmüller polynomials from integer permutations.

problem Computing Teichmüller polynomials for fibered 3-manifolds.
method Using integer permutations to characterize pseudo-Anosov homeomorphisms and train tracks.
result Direct implementation of McMullen's algorithm for Teichmüller polynomials.

Automatic cover detection -- the task of finding in an audio database all the covers of one or several query tracks -- has long been seen as a challenging theoretical problem in the MIR community and as an acute practical problem for authors and composers societies. Original algorithms proposed for this task have prove…

2019-07-03abs ↗pdf ↗

The paper studies the action of automorphisms on train tracks and finds that the set of minimally displaced points is co-compact.

problem The study of automorphisms and their action on train tracks in free products.
method Analysis of train track points and minimally displaced set under cyclic subgroup generated by automorphisms.
result The minimally displaced set is co-compact under the action of the cyclic subgroup generated by the automorphism.

Robust detection and tracking of objects is crucial for the deployment of autonomous vehicle technology. Image based benchmark datasets have driven development in computer vision tasks such as object detection, tracking and segmentation of agents in the environment. Most autonomous vehicles, however, carry a combinatio…

2019-03-26abs ↗pdf ↗