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

3216419621,282 · Jun 202019922001200920172026
48 results for virtual data points

In a typical online learning scenario, a learner is required to process a large data stream using a small memory buffer. Such a requirement is usually in conflict with a learner's primary pursuit of prediction accuracy. To address this dilemma, we introduce a novel Bayesian online classi cation algorithm, called the Vi…

2012-05-09abs ↗pdf ↗

This paper gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one morphism corresponding to a transposition in the symmetric group. The key to this…

2011-03-16abs ↗pdf ↗

In this paper, we explore the virtual technique that is very useful in studying moduli problem from differential geometric point of view. We introduce a class of new objects "virtual manifolds/orbifolds", on which we develop the integration theory. In particular, the virtual localization formula is obtained.

2006-10-11abs ↗pdf ↗

Develops virtual Morse-Bott indices for four-manifolds, proving inequalities.

problem Proving inequalities for four-manifolds of Seiberg-Witten simple type.
method Uses virtual Morse-Bott indices and Hirzebruch-Riemann-Roch Theorem.
result Proves positivity of virtual Morse-Bott indices, leading to inequalities.

In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain how to extend this construction from virtual knots to flat virtual knots.

2018-11-22abs ↗pdf ↗

A flat virtual link is a finite collection of oriented closed curves L\mathfrak L on an oriented surface MM considered up to virtual homotopy, i.e., a composition of elementary stabilizations, destabilizations, and homotopies. Specializing to a pair of curves (L1,L2)(L_1,L_2), we show that the minimal number of intersecti…

2017-08-10abs ↗pdf ↗

A weak chord index IndInd' is constructed for self crossing points of virtual links. Then a new writhe polynomial WW of virtual links is defined by using IndInd'. WW is a generalization of writhe polynomial defined in [6]. Based on WW, three invariants of virtual links are constructed. These invariants can be used to …

2018-12-13abs ↗pdf ↗

A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is uniformly continuous for the hyperbolic metric, it is proved that the set of regula…

2012-03-07abs ↗pdf ↗

For ordinary knots in R3, there are no degree one Vassiliev invariants. For virtual knots, however, the space of degree one Vassiliev invariants is infinite dimensional. We introduce a sequence of three degree one Vassiliev invariants of virtual knots of increasing strength. We demonstrate that the strongest invariant …

2008-03-05abs ↗pdf ↗

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic immersion of a singular link in R2R^{2}. We tackle this problem by the so-called…

2008-11-05abs ↗pdf ↗

We consider several classes of knotted objects, namely usual, virtual and welded pure braids and string links, and two equivalence relations on those objects, induced by either self-crossing changes or self-virtualizations. We provide a number of results which point out the differences between these various notions. Th…

2015-07-01abs ↗pdf ↗

Study improves reliability of neural models for virtual screening.

problem Reliability issues in neural models for molecular property prediction.
method Investigated model architectures, regularization, and loss functions.
result Correct choice of regularization and inference methods improves reliability.

Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.

problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.

The paper develops a multi-unit soft sensing model for virtual flow meters that improves few-shot learning.

problem Improving soft sensor performance for new wells with limited data.
method Formulates a probabilistic, hierarchical model using a deep neural network for multi-unit soft sensing.
result Multi-unit models trained on many wells can perform well on new wells with just a few data points.

The paper extends Lipschitz metric isometries between Outer Spaces of virtually free groups.

problem Extending isometry properties of Lipschitz metric to virtually free groups.
method Analyzing finite-index subgroups and their covers, identifying folding paths, and using deformation retraction.
result Existence of candidates for Lipschitz distance and deformation retraction of spine.

Study on coloring virtual tangles with integer and modular arithmetic.

problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=ZR=\mathbb{Z}, realizability depends on divisibility of the alternating sum. For R=Z/pZR=\mathbb{Z}/p\mathbb{Z}, all vectors are realizable.

We consider the following properties of compact oriented irreducible graph-manifolds: to contain a π1π_1-injective surface (immersed, virtually embedded or embedded), be (virtually) fibered over S1S^1, and to carry a metric of nonpositive sectional curvature. It turns out that all these properties can be described from…

2001-12-31abs ↗pdf ↗

We study properly discontinuous and cocompact actions of a discrete subgroup ΓΓ of an algebraic group GG on a contractible algebraic manifold XX. We suppose that this action comes from an algebraic action of GG on XX such that a maximal reductive subgroup of GG fixes a point. When the real rank of any simple subg…

2010-07-16abs ↗pdf ↗

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers mim_{i} (i=1,,n)(i=1,\ldots,n) and an ordered nn-component virtual link diagram DD, a new virtual link diagram D(m1,,mn)D(m_{1},\ldots,m_{n}) is ob…

2017-08-21abs ↗pdf ↗

Modern computer vision algorithms typically require expensive data acquisition and accurate manual labeling. In this work, we instead leverage the recent progress in computer graphics to generate fully labeled, dynamic, and photo-realistic proxy virtual worlds. We propose an efficient real-to-virtual world cloning meth…

2016-05-20abs ↗pdf ↗

The paper proves that certain surface mapping class groups do not virtually surject to the integers.

problem Proving that certain mapping class groups do not virtually surject to the integers.
method Analyzing the structure of finite-index subgroups of mapping class groups of surfaces of genus ≥ 3.
result Finite-index subgroups of mapping class groups of surfaces of genus ≥ 3 do not virtually surject to the integers.

We conjecture a formula for the generating function of virtual χyχ_y-genera of moduli spaces of rank 2 sheaves on arbitrary surfaces with holomorphic 2-form. Specializing the conjecture to minimal surfaces of general type and to virtual Euler characteristics, we recover (part of) a formula of C. Vafa and E. Witten. The…

2017-03-21abs ↗pdf ↗

We introduce the notion of ascent sliceness of virtual knots. A representative of a virtual knot is an embedding S1Σg×I S^1 \hookrightarrow Σ_{g} \times I , for Σg Σ_g a closed connected oriented surface of genus g g ; the virtual knot represented is slice if there exists a pair consisting of a disc D D and an oriented…

2018-02-05abs ↗pdf ↗

This is the first part of a trilogy where we apply the theory of virtual manifold/orbifolds developed by the first named author and Tian to study the Gromov-Witten moduli spaces. In this paper, we resolve the main analytic issue arising from the lack of differentiability of $PSL(2, \C)$-action on spaces of W1,pW^{1, p}-m…

2013-06-14abs ↗pdf ↗

A classical result by K.B. Lee states that every group morphism between almost crystallographic groups is induced by an affine map on the nilpotent Lie group whereon these groups by definition act. It is the main technique for studying morphisms between virtually nilpotent groups, having important applications in fixed…

2018-10-26abs ↗pdf ↗

This paper describes a polynomial invariant of virtual knots that is defined in terms of an integer labeling of the virtual knot diagram. This labeling is seen to derive from an essentially unique structure of affine flat biquandle for flat virtual diagrams. The invariant is discussed in detail with many examples,inclu…

2012-11-07abs ↗pdf ↗

Enhances multi-tag classification using low-dimensional vector representations and virtual data.

problem Improving the performance of multi-tag classifiers.
method Embedding raw data into a low-dimensional feature space, then generating virtual data from linear operations on these vectors, to train multi-tag classifiers.
result Significant improvement in F1 scores (up to 224%) compared to training directly with raw data.

Novel framework for efficient Gaussian process models with monotonicity constraints.

problem Improving predictive accuracy and reducing uncertainty in high-dimensional problems with monotonicity constraints.
method Virtual point-based framework using regularized linear randomize-then-optimize (RLRTO) and No U-Turn Sampler (NUTS) for efficient sampling.
result Significant improvements in computational efficiency with the RLRTO method and NUTS enhancements.

Estimates log-likelihood of interacting particle systems using virtual particles.

problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.