arXiv research

BOSS optimizes string inputs using string kernels and genetic algorithms.

Analysis of large-scale sequential data has been one of the most crucial tasks in areas such as bioinformatics, text, and audio mining. Existing string kernels, however, either (i) rely on local features of short substructures in the string, which hardly capture long discriminative patterns, (ii) sum over too many subs…

String kernels are attractive data analysis tools for analyzing string data. Among them, alignment kernels are known for their high prediction accuracies in string classifications when tested in combination with SVM in various applications. However, alignment kernels have a crucial drawback in that they scale poorly du…

We introduce a new class of nonstationary kernels, which we derive as covariance functions of a novel family of stochastic processes we refer to as string Gaussian processes (string GPs). We construct string GPs to allow for multiple types of local patterns in the data, while ensuring a mild global regularity condition…

We present a novel framework for kernel learning with sequential data of any kind, such as time series, sequences of graphs, or strings. Our approach is based on signature features which can be seen as an ordered variant of sample (cross-)moments; it allows to obtain a "sequentialized" version of any static kernel. The…

The Tong-Yang-Ma representations are extended to string links and welded string links.

Researchers resolve string theory ambiguities and define a new metric for massless spectrum.

This paper shows that, away from 6, the kernel of the Witten genus is precisely the ideal consisting of (bordism classes of) Cayley plane bundles with connected structure group, but only after restricting the Witten genus to string bordism. It does so by showing that the divisibility properties of Cayley plane bundle c…

Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using …

We employ Hirzebruch-type invariants obtained from iterated p-covers to investigate concordance of links and string links. We show that the invariants naturally give various group homomorphisms of the string link concordance group into L-groups over number fields. We also obtain homomorphisms of successive quotients of…

We show that the Artin representation on concordance classes of string links induces a well-defined epimorphism modulo order n twisted Whitney tower concordance, and that the kernel of this map is generated by band sums of iterated Bing-doubles of any string knot with nonzero Arf invariant. We also continue J. Levine's…

We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where edges are created over time, which induces an order. Combining convolutional subgra…

We provide the first mathematically complete derivation of the Nyström method for low-rank approximation of indefinite kernels and propose an efficient method for finding an approximate eigendecomposition of such kernel matrices. Building on this result, we devise highly scalable methods for learning in reproducing ker…

Sequence feature embedding is a challenging task due to the unstructuredness of sequence, i.e., arbitrary strings of arbitrary length. Existing methods are efficient in extracting short-term dependencies but typically suffer from computation issues for the long-term. Sequence Graph Transform (SGT), a feature embedding …

Derives path integrals for perturbative strings on various backgrounds.

Identifies all perturbative vacua in bosonic string theory.

String geometry theory connects strings to space-time and finds string vacua.

We propose a specialized string kernel for small bio-molecules, peptides and pseudo-sequences of binding interfaces. The kernel incorporates physico-chemical properties of amino acids and elegantly generalize eight kernels, such as the Oligo, the Weighted Degree, the Blended Spectrum, and the Radial Basis Function. We …

Derives path-integrals for superstrings on curved backgrounds using string geometry theory.

We introduce a class of regularisable infinite dimensional principal fibre bundles which includes fibre bundles arising in gauge field theories like Yang-Mills and string theory and which generalise finite dimensional Riemannian principal fibre bundles induced by an isometric action. We show that the orbits of regulari…

Chiral string integrands simplify to ambitwistor string integrands in the tensionless limit.

Perturbative string amplitudes are correctly derived from the string geometry theory, which is one of the candidates of a non-perturbative formulation of string theory. In order to derive non-perturbative effects rather easily, we formulate topological string geometry theory. We derive the perturbative partition functi…

We attempt to set a mathematical foundation of immunology and amino acid chains. To measure the similarities of these chains, a kernel on strings is defined using only the sequence of the chains and a good amino acid substitution matrix (e.g. BLOSUM62). The kernel is used in learning machines to predict binding affinit…

A virtual string is a scheme of self-intersections of a closed curve on a surface. We study algebraic invariants of strings as well as two equivalence relations on the set of strings: homotopy and cobordism. We show that the homotopy invariants of strings form an infinite dimensional Lie group. We also discuss connecti…

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

There is an interpretation of open string field theory in algebraic topology. An interpretation of closed string field theory can be deduced from this open string theory to obtain as well the interpretation of open and closed string field theory combined.

New formulas link string bordism to integers.

Extended Alexander groups are used to define an invariant for open virtual strings. Examples of non-commuting open strings and a ribbon-concordance obstruction are given. An example is given of a slice virtual open string that is not ribbon. Definitions are extended to open n-strings.

String topology coproduct and Turaev cobracket computed for surfaces.

We present a finite-dimensional and smooth formulation of string structures on spin bundles. It uses trivializations of the Chern-Simons 2-gerbe associated to this bundle. Our formulation is particularly suitable to deal with string connections: it enables us to prove that every string structure admits a string connect…

Cobordism of virtual string links on $n$ strands is a combinatorial generalization of link cobordism. There exists a bijection between virtual string links up to cobordisms and elements of the group $\mathbb{Z}^{n(n-1)}$. This paper also shows that virtual string links up to unwelded equivalence are classified by those…

Paper shows string cobordism at 24 dims can be determined by elliptic genus.

Introduces string structures linking to loop spaces.

The actions, anomalies, and quantization conditions allow the M2-brane and the M5-brane to support, in a natural way, structures beyond Spin on their worldvolumes. The main examples are twisted String structures. This also extends to twisted String^c structures, which we introduce and relate to twisted String structure…

A virtual string is a scheme of self-intersections of a closed curve on a surface. We introduce virtual strings and study their geometric properties and homotopy invariants. We also discuss connections between virtual strings, Gauss words, and virtual knots.

Study topological G₂ and Spin(7) strings at 1-loop using double complexes.

In this note we revisit the subject of anomaly cancelation in string theory and M-theory on manifolds with String structure and give three observations. First, that on String manifolds there is no E8 x E8 global anomaly in heterotic string theory. Second, that the description of the anomaly in the phase of the M-theory…

End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.

A virtual $n$-string $α$ is a collection of $n$ oriented smooth generic loops on a surface $M$. A stabilization of $α$ is a surgery that results in attaching a handle to $M$ along disks avoiding $α$, and the inverse operation is a destabilization of $α$. We consider virtual $n$-strings up to virtual homotopy, i.e., seq…

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

For many machine learning problem settings, particularly with structured inputs such as sequences or sets of objects, a distance measure between inputs can be specified more naturally than a feature representation. However, most standard machine models are designed for inputs with a vector feature representation. In th…

The multi dimensional string objects are introduced as a new alternative for an application of string models for time series forecasting in trading on financial markets. The objects are represented by open string with 2-endpoints and D2-brane, which are continuous enhancement of 1-endpoint open string model. We show ho…

Developing tools for computing string amplitudes with hyperbolic vertices.

STRING improves 2D and 3D position encodings for better performance.

In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links to commute under the stacking operation.

Analyzes string topology operations using Chen's integrals and homotopy transfer.

Extends Goldberg's result for string links over surfaces.

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted stri…