arXiv research

VaSST uses soft symbolic trees for probabilistic symbolic regression.

This work analyzes tree-based methods from a ranking perspective, providing insights and new statistics.

Develops a Bayesian framework for symbolic regression of scientific expressions.

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

Neural programming involves training neural networks to learn programs, mathematics, or logic from data. Previous works have failed to achieve good generalization performance, especially on problems and programs with high complexity or on large domains. This is because they mostly rely either on black-box function eval…

GFN-SR uses deep learning to generate diverse mathematical expressions.

This paper shows that scientific discovery can be efficiently learned via compositional function trees, reducing the sample complexity.

Bayesian symbolic regression uncovers missing physics from data with uncertainty quantification.

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…

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

NEMoTS improves time series analysis by deriving efficient, interpretable models.

Classifier evasion consists in finding for a given instance $x$ the nearest instance $x'$ such that the classifier predictions of $x$ and $x'$ are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorithm uses a Mixe…

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…

EML-CD discovers causal mechanisms from neural networks in a structured way.

While deep reinforcement learning has successfully solved many challenging control tasks, its real-world applicability has been limited by the inability to ensure the safety of learned policies. We propose an approach to verifiable reinforcement learning by training decision tree policies, which can represent complex p…

Transformers learn multi-step reasoning through gradient descent.

Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…

Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…

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…

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…

SPPL simplifies probabilistic programming for exact inference.

Symbolic regression is a type of discrete optimization problem that involves searching expressions that fit given data points. In many cases, other mathematical constraints about the unknown expression not only provide more information beyond just values at some inputs, but also effectively constrain the search space. …

A system is presented that segments, clusters and predicts musical audio in an unsupervised manner, adjusting the number of (timbre) clusters instantaneously to the audio input. A sequence learning algorithm adapts its structure to a dynamically changing clustering tree. The flow of the system is as follows: 1) segment…

A technique scales symbolic methods with gradients for neural model explanation.

Smooth fractal trees via analytic generators, preserving combinatorial and geometric properties.

AlphaCFG discovers alpha factors using grammar-guided search.

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

EvoNUDGE uses graph neural networks to improve genetic programming performance.

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…

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…

Classifies 3-braids from choreographic motions on Lissajous curves, linking them to mapping classes and geodesics.

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

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.

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.

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…

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.