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

73145218290 · Jun 202019922001200920172026
48 results for moving objects

In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …

2015-10-14abs ↗pdf ↗

Generates coherent 3D scenes from monocular videos without supervision.

problem Lack of 3D scene modeling in video generation models.
method Trains a model to generate 3D scenes with moving objects and a background from monocular videos.
result Trained model generates coherent 3D scenes with multiple moving objects and a background.

Study on consistency of ML methods for moving objects in non-stationary environments.

problem Consistency of machine learning methods for moving objects in non-stationary environments.
method Least squares, ridge regression, and s\ell_s-penalized least squares methods under non-stationary spatial-temporal sampling.
result Consistency and asymptotic normality of the estimates under weak conditions.

We present a novel approach to weakly supervised object detection. Instead of annotated images, our method only requires two short videos to learn to detect a new object: 1) a video of a moving object and 2) one or more "negative" videos of the scene without the object. The key idea of our algorithm is to train the obj…

2019-09-17abs ↗pdf ↗

Recently, the author discovered an interesting class of knot-like objects called free knots. These purely combinatorial objects are equivalence classes of Gauss diagrams modulo Reidemeister moves (the same notion in the language of words was introduced by Turaev, who thought all free knots to be trivial). As it turned …

2014-12-30abs ↗pdf ↗

We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links and looped graphs.

2009-01-15abs ↗pdf ↗

Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajec…

2015-11-04abs ↗pdf ↗

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …

2013-09-12abs ↗pdf ↗

Generative models learn from unlabeled videos via object segmentation and scene modeling.

problem Learning generative models from unlabelled videos.
method Decomposed into three subtasks: motion segmentation, background and foreground modeling, and scene sampling.
result Approach allows learning models that generalize beyond occlusions and represent scenes in a modular fashion.

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classi…

2009-02-01abs ↗pdf ↗

Simplified combinatorial descriptions of branched spines for 3-manifolds using primary MP move and sliding moves.

problem Combinatorial descriptions of branched spines for 3-manifolds and their equivalence relations.
method Demonstrated that 16 MP moves on branched spines are derived from a primary MP move, pure sliding moves, and their inverses.
result Simpler combinatorial descriptions for closed 3-manifolds and combed 3-manifolds.

In this paper Legendrian graphs in (R3,ξst)(\mathbb{R}^3,ξ_{\mathrm{st}}) are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

2014-12-06abs ↗pdf ↗

In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We a…

2017-12-18abs ↗pdf ↗

Let M be an oriented compact 3-manifold and let T be a (loose) triangulation of M, with ideal vertices at the components of the boundary of M and possibly internal vertices. We show that any spin structure s on M can be encoded by extra combinatorial structures on T. We then analyze how to change these extra structures…

2013-04-14abs ↗pdf ↗

Framed flow categories were introduced by Cohen-Jones-Segal as a way of encoding the flow data associated to a Floer functional. A framed flow category gives rise to a CW-complex with one cell for each object of the category. The idea is that the Floer invariant should take the form of the stable homotopy type of the r…

2016-05-06abs ↗pdf ↗

A novel Neural Network architecture is proposed using the mathematically and physically rich idea of vector fields as hidden layers to perform nonlinear transformations in the data. The data points are interpreted as particles moving along a flow defined by the vector field which intuitively represents the desired move…

2018-02-22abs ↗pdf ↗

Scalability in terms of object density in a scene is a primary challenge in unsupervised sequential object-oriented representation learning. Most of the previous models have been shown to work only on scenes with a few objects. In this paper, we propose SCALOR, a probabilistic generative world model for learning SCALab…

2019-10-06abs ↗pdf ↗

Improves deep learning models by blending gradients from training loss and auxiliary objective.

problem Minimizing a single training loss while encouraging desirable model properties.
method Solves a bilevel optimization problem by combining training loss gradients and orthogonal projections of auxiliary gradients.
result Bloop method leads to better performance than other gradient surgery methods without EMA.

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists and is unique. We apply this result to different situations and get several new re…

2009-04-09abs ↗pdf ↗
Graphoidsmath.CO

Graphoids are topological invariants of virtual graph diagrams.

problem Understanding knotted graphs with open ends in proteins and simplifying virtual spatial graphs.
method Topological interpretations of graphoids using graph Reidemeister moves.
result Virtual graphoids are useful for studying knotted graphs and simplifying spatial graphs.

This paper presents two unsupervised learning layers (UL layers) for label-free video analysis: one for fully connected layers, and the other for convolutional ones. The proposed UL layers can play two roles: they can be the cost function layer for providing global training signal; meanwhile they can be added to any re…

2017-05-24abs ↗pdf ↗

We show that simple coverings of B^4 branched over ribbon surfaces up to certain local ribbon moves bijectively represent orientable 4-dimensional 2-handlebodies up to handle sliding and addition/deletion of cancelling handles. As a consequence, we obtain an equivalence theorem for simple coverings of S^3 branched over…

2004-07-02abs ↗pdf ↗

Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions. Exploiting the connection be…

2018-03-26abs ↗pdf ↗

This paper introduces a novel deep learning framework for image animation. Given an input image with a target object and a driving video sequence depicting a moving object, our framework generates a video in which the target object is animated according to the driving sequence. This is achieved through a deep architect…

2018-12-20abs ↗pdf ↗

Machine learning models outperform traditional technical analysis in Bitcoin trading.

problem Maximizing profits in the Bitcoin market using trading signals.
method Comparison of machine learning models (LightGBM, LSTM) and technical analysis strategies (EMA, MACD+ADX).
result LSTM model achieved a 65.23% cumulative return over a year, significantly outperforming other strategies.

This work has the purpose of applying the concept of Geometric Calculus (Clifford Algebras) to the Fibre Bundle description of Quantum Mechanics. Thus, it is intended to generalize that formulation to curved spacetimes [the base space of the fibre bundle in question] in a more natural way. It starts off with a review o…

2003-08-04abs ↗pdf ↗

We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental stud…

2012-05-10abs ↗pdf ↗