arXiv research

NeSS combines neural and symbolic approaches for better compositional generalization.

LLMs translate natural language trading intents into correct option strategies using a domain-specific language.

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 …

Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. This paper presents the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we formalise coverage criteria for DNNs that have been studied in the literature, and then d…

The paper improves neural network predictions by integrating process knowledge.

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…

TradeR uses RL to execute trades in real markets, minimizing surprise and catastrophe.

We describe DyNet, a toolkit for implementing neural network models based on dynamic declaration of network structure. In the static declaration strategy that is used in toolkits like Theano, CNTK, and TensorFlow, the user first defines a computation graph (a symbolic representation of the computation), and then exampl…

Achieving machine intelligence requires a smooth integration of perception and reasoning, yet models developed to date tend to specialize in one or the other; sophisticated manipulation of symbols acquired from rich perceptual spaces has so far proved elusive. Consider a visual arithmetic task, where the goal is to car…

Framework for verifying deep learning operators.

In this paper, we present a new task that investigates how people interact with and make judgments about towers of blocks. In Experiment~1, participants in the lab solved a series of problems in which they had to re-configure three blocks from an initial to a final configuration. We recorded whether they used one hand …

We introduce an algorithm for model-based hierarchical reinforcement learning to acquire self-contained transition and reward models suitable for probabilistic planning at multiple levels of abstraction. We call this framework Planning with Abstract Learned Models (PALM). By representing subtasks symbolically using a n…

Study improves self-driving safety in dynamic environments.

DCR improves interpretability of concept-based models by using neural networks to build rule structures.

VaSST uses soft symbolic trees for probabilistic symbolic regression.

We are increasingly surrounded by artificially intelligent technology that takes decisions and executes actions on our behalf. This creates a pressing need for general means to communicate with, instruct and guide artificial agents, with human language the most compelling means for such communication. To achieve this i…

Enhances cooperative multi-task SemCom for distributed users.

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…

Polylab is a MATLAB toolbox for multivariate polynomial modeling.

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

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…

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.

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.

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.

ISR creates analytical relationships from data via invertible maps.

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

SE-RRMs solve structured problems like Sudoku and ARC-AGI by enforcing symbol equivariance.

Quantum $6j$-symbols linked to tetrahedra angles and volumes.

We extend projectively equivariant quantization and symbol calculus to symbols of pseudo-differential operators. An explicit expression in terms of hypergeometric functions with noncommutative arguments is given. Some examples are worked out, one of them yielding a quantum length element on $S^3$.

Transformer models can solve complex math problems with less data.

Improves neural network search in combinatorial spaces of mathematical symbols.

Arguments in favor of injecting symbolic knowledge into neural architectures abound. When done right, constraining a sub-symbolic model can substantially improve its performance and sample complexity and prevent it from predicting invalid configurations. Focusing on deep probabilistic (logical) graphical models -- i.e.…

MESSY estimation recovers symbolic density functions from samples using maximum entropy.

We derive an Ehrhart function for symbols from the Euler-MacLaurin formula with remainder.