arXiv research

We introduce mod 3 triple Milnor invariants and triple cubic residue symbols for certain primes of the Eisenstein number field $\mathbb{Q}(\sqrt{-3})$, following the analogies between knots and primes. Our triple symbol generalizes both the cubic residue symbol and Rédei's triple symbol, and describes the decomposition…

Introduces a new entropy concept for analyzing symbol similarities in information theory.

Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this propert…

The paper characterizes vector bundles and differential operators using Lie algebras and their symbols.

Study develops supervised algorithm for symbolic music style translation.

This paper presents a ML-based receiver for SDR that outperforms conventional methods.

DEFINED uses decision feedback ICL to detect symbols with minimal pilot data.

Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying a linear transformation based on a "one-hot" encoding of the discrete symbols. Despite its simplicity, such approach yields the number of parameters that grows linearly with the vocabulary s…

Generalized Lagrange-Weyl structures and compatible connections are introduced as a natural generalization of similar notions from Riemannian geometry. Exactly as in Riemannian case, the compatible connection is unique if certain symmetry conditions with respect to vertical and horizontal Christoffel symbols are impose…

In [9] Kaimanovich introduced the concept of augmented tree on the symbolic space of a self-similar set. It is hyperbolic in the sense of Gromov, and it was shown in [13] that under the open set condition, a self-similar set can be identified with the hyperbolic boundary of the tree. In the paper, we investigate in det…

We observe that the line bundle associated to the tame symbol of two invertible holomorphic functions also carries a fairly canonical hermitian metric, hence it represents a class in a Hermitian holomorphic Deligne cohomology group. We put forward an alternative definition of hermitian holomorphic structure on a gerbe …

We develop a categorical index calculus for elliptic symbol families. The categorified index problems we consider are a secondary version of the traditional problem of expressing the index class in K-theory in terms of differential-topological data. They include orientation problems for moduli spaces as well as similar…

Embedding methods such as word embedding have become pillars for many applications containing discrete structures. Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying linear transformation based on "one-hot" encoding of the discrete symbols. …

Study identifies clusters of EU countries with similar young mortality patterns.

The cognitive framework of conceptual spaces bridges the gap between symbolic and subsymbolic AI by proposing an intermediate conceptual layer where knowledge is represented geometrically. There are two main approaches for obtaining the dimensions of this conceptual similarity space: using similarity ratings from psych…

The article approximates solutions to the Beltrami equation using similarity surfaces.

NeuRules learns interpretable rule lists from data without pre-discretization.

Stability of black holes proven in full subextremal range with positive cosmological constant.

Proves a Gel'fand-Kolmogoroff type result for vector bundles and polynomial functions.

The time series classification literature has expanded rapidly over the last decade, with many new classification approaches published each year. The research focus has mostly been on improving the accuracy and efficiency of classifiers, while their interpretability has been somewhat neglected. Classifier interpretabil…

Paper proposes using logic networks to inject prior knowledge for better reinforcement learning.

In order to build efficient deep recurrent neural architectures, it is essential to analyze the complexityof long distance dependencies (LDDs) of the dataset being modeled. In this paper, we presentdetailed analysis of the dependency decay curve exhibited by various datasets. The datasets sampledfrom a similar process …

VaSST uses soft symbolic trees for probabilistic symbolic regression.

Analytic Kähler potentials yield analytic Bergman kernels.

We describe dimensionally constrained symbolic regression which has been developed for mass measurement in certain classes of events in high-energy physics (HEP). With symbolic regression, we can derive equations that are well known in HEP. However, in problems with large number of variables, we find that by constraini…

Paper closes neural-symbolic learning loop with grammar model and back-search algorithm.

Given an iterated function system (IFS) of contractive similitudes, the theory of Gromov hyperbolic graph on the IFS has been established recently. In the paper, we introduce a notion of simple augmented tree which is a Gromov hyperbolic graph. By generalizing a combinatorial device of rearrangeable matrix, we show tha…

Reinforcement learning and symbolic planning have both been used to build intelligent autonomous agents. Reinforcement learning relies on learning from interactions with real world, which often requires an unfeasibly large amount of experience. Symbolic planning relies on manually crafted symbolic knowledge, which may …

For an arbitrary Riemannian manifold $X$ and Hermitian vector bundles $E$ and $F$ over $X$ we define the notion of the normal symbol of a pseudodifferential operator $P$ from $E$ to $F$. The normal symbol of $P$ is a certain smooth function from the cotangent bundle $T^*X$ to the homomorphism bundle $Hom (E,F)$ and dep…

Based on the ideas of Optimal Control, we introduce the new basic characteristic of a bracket generating distribution, the Jacobi symbol. In contrast to the classical Tanaka symbol, the set of Jacobi symbols is discrete and classifiable. We give an explicit and unified algebraic procedure for the construction of the ca…

DL/FBF improves GPSR solutions by selecting compact, generalising expressions.

Estimating a large alphabet probability distribution from a limited number of samples is a fundamental problem in machine learning and statistics. A variety of estimation schemes have been proposed over the years, mostly inspired by the early work of Laplace and the seminal contribution of Good and Turing. One of the b…

Symbolic knowledge in neural models can inadvertently make them more vulnerable to adversarial attacks.

A formula for Rademacher symbols in triangle groups is provided.

The symbolic dynamics technique is well-known for low-dimensional dynamical systems and chaotic maps, and lies at the roots of the thermodynamic formalism of dynamical systems. Here we show that this technique can also be successfully applied to time series generated by complex systems of much higher dimensionality. Ou…

Complex $b$-$6j$ symbols relate to hyperbolic tetrahedron volumes and determinants.

The paper classifies symbols of differential operators on vector bundles.

NeSS combines neural and symbolic approaches for better compositional generalization.

Defines transverse symbols for foliated manifolds and proves their K-homology class.

A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.

Paper proposes a bijective approach for signal/symbol translation using variational auto-encoders.

Paper presents a new trie for integer sketches to improve similarity searches.

The Wodzicki residue and the cut-off integral extend to classical symbol-valued forms. We show that they obey a Stokes' type property and that the extended Wodzicki residue can be interpreted as a complex residue like the ordinary one. In the case of cut-off integrals, Stokes' property (i.e. vanishing on exact forms) o…

Perceptor Gradients learns symbolic representations from raw data.

Bayesian symbolic regression automates model discovery from data.

Symbolic regression finds simple formulas for implied volatility.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

Anticipatory model generates music with control over events.