arXiv research

QABBA improves time series storage efficiency while preserving shape information.

Symbolic regression finds simple formulas for implied volatility.

Bayesian symbolic regression automates model discovery from data.

ABBA creates a new symbolic time series representation based on Brownian bridge.

Study approximates operator learning for PDEs using Fourier multipliers.

How can neural networks perform so well on compositional tasks even though they lack explicit compositional representations? We use a novel analysis technique called ROLE to show that recurrent neural networks perform well on such tasks by converging to solutions which implicitly represent symbolic structure. This meth…

Study evaluates clustering methods for Google Trends data.

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML has appealing theoretical properties, but is difficult to compute exactly. Inspi…

MARLeME extracts MARL models into symbolic models for better interpretability.

Shape-constrained symbolic regression improves model extrapolation with prior knowledge.

Reinforcement learning algorithms can solve dynamic decision-making and optimal control problems. With continuous-valued state and input variables, reinforcement learning algorithms must rely on function approximators to represent the value function and policy mappings. Commonly used numerical approximators, such as ne…

NeuroDiff improves neural network equivalence verification with fine-grained approximations.

A-NeSI scales approximate inference for probabilistic neurosymbolic learning.

In this paper, we consider the problem of fast and efficient indexing techniques for sequences evolving in non-Euclidean spaces. This problem has several applications in the areas of human activity analysis, where there is a need to perform fast search, and recognition in very high dimensional spaces. The problem is ma…

Deep neural network generates symbolic equations from data.

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…

Revel tackles safe exploration in RL with verified symbolic policies.

The Interaction-Transformation (IT) is a new representation for Symbolic Regression that restricts the search space into simpler, but expressive, function forms. This representation has the advantage of creating a smoother search space unlike the space generated by Expression Trees, the common representation used in Ge…

In the last decade, the approximate vanishing ideal and its basis construction algorithms have been extensively studied in computer algebra and machine learning as a general model to reconstruct the algebraic variety on which noisy data approximately lie. In particular, the basis construction algorithms developed in ma…

We study the Hochschild homology groups of the algebra of complete symbols on a foliated manifold $(M,F)$. The first step is to relate these groups to the Poisson homology of $(M,F)$ and of other related foliated manifolds. We then establish several general properties of the Poisson homology groups of foliated manifold…

VaSST uses soft symbolic trees for probabilistic symbolic regression.

This paper presents a technique for reduced-order Markov modeling for compact representation of time-series data. In this work, symbolic dynamics-based tools have been used to infer an approximate generative Markov model. The time-series data are first symbolized by partitioning the continuous measurement space of the …

A new approach for blind channel equalization and decoding, variational inference, and variational autoencoders (VAEs) in particular, is introduced. We first consider the reconstruction of uncoded data symbols transmitted over a noisy linear intersymbol interference (ISI) channel, with an unknown impulse response, with…

A new probabilistic model for semi-supervised learning unifies various methods.

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.

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…

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

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…

Embedding layers are commonly used to map discrete symbols into continuous embedding vectors that reflect their semantic meanings. Despite their effectiveness, the number of parameters in an embedding layer increases linearly with the number of symbols and poses a critical challenge on memory and storage constraints. I…

The paper finds compact symbolic approximations for Ricci-flat metrics using Calabi-Yau hypersurfaces.

This paper presents a Bayesian approach to symbol and phase inference in a phase-unsynchronized digital receiver. It primarily extends [Quinn 2011] to the multi-symbol case, using the variational Bayes (VB) approximation to deal with the combinatorial complexity of the phase inference in this case. The work provides a …

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…

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.

We consider the eigenvalue equation for the Laplace-Beltrami operator acting on scalar functions on the non-compact Eguchi-Hanson space. The corresponding differential equation is reducible to a confluent Heun equation with Ince symbol [0,2,1_2]. We construct approximations for the eigenfunctions and their asymptotic s…

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

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…

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

S2KAN integrates symbolic primitives into neural network activations for improved interpretability.

Symbolic LSTM improves time series forecasting by reducing hyperparameter sensitivity.

Introduces canonical connections for sub-Riemannian manifolds with constant symbol.

Meta-learning symbolic default hyperparameters from dataset properties.