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 …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Symbolic Domains”
Paper proposes a bijective approach for signal/symbol translation using variational auto-encoders.
problem Extracting symbolic information from signals, especially in music, is challenging and non-generic.
method Turned into a density estimation task, using two variational auto-encoders with additive constraint.
result Bijective signal/symbol translation achieved, allowing both signal-to-symbol and symbol-to-signal inference.
Paper applies GANs to symbolic music genre transfer.
problem Symbolic music genre transfer using GANs.
method CycleGAN architecture with additional discriminators to preserve structure.
result Fidelity of transformed music improved with additional discriminators.
New algorithms improve time series classification accuracy and efficiency while enhancing interpretability.
problem Lack of interpretability in time series classification algorithms.
method Combining multiple resolutions and domains, using SEQL with greedy feature selection.
result SAX-SFA-SEQL achieves similar accuracy to state-of-the-art methods but with lower computational time.
QABBA improves time series storage efficiency while preserving shape information.
problem Efficient storage and shape preservation of time series data.
method Quantized symbolic time series approximation (QABBA) using ABBA technique.
result QABBA achieves a new state-of-the-art on Monash regression dataset.
NeSS combines neural and symbolic approaches for better compositional generalization.
problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.
Many real-world domains can be expressed as graphs and, more generally, as multi-relational knowledge graphs. Though reasoning and learning with knowledge graphs has traditionally been addressed by symbolic approaches, recent methods in (deep) representation learning has shown promising results for specialized tasks su…
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…
Diffusion models generate music sequences without autoregressive loops.
problem Generating music sequences from symbolic data using diffusion models.
method Parameterize discrete symbolic data in continuous latent space, train diffusion model, generate sequences through reverse process.
result Strong unconditional generation and post-hoc conditional infilling compared to autoregressive models.
Zoetrope Genetic Programming improves symbolic regression performance.
problem Evolutionary symbolic regression for complex mathematical expressions.
method Zoetropic representation, repeated fusion operations, linear combination, crossover, mutation, selection.
result Zoetrope Genetic Programming achieves state-of-the-art performance and low computational time.
PandaAI: A practical agent for neuro-symbolic data analysis and decision-making in finance
problem Sequential decision-making in finance
method Leveraging LLMs for market regime modeling and constrained alpha generation
result PandaAI achieves higher Rank IC and lower maximum drawdown
OccamNet finds interpretable symbolic fits to data efficiently.
problem Complex neural models extrapolate poorly and are hard to interpret.
method Samples functions, biases towards better fits, and uses cross-entropy matching.
result Outperforms state-of-the-art symbolic regression methods on real-world datasets.
The seemingly infinite diversity of the natural world arises from a relatively small set of coherent rules, such as the laws of physics or chemistry. We conjecture that these rules give rise to regularities that can be discovered through primarily unsupervised experiences and represented as abstract concepts. If such r…
Develops a Bayesian framework for symbolic regression of scientific expressions.
problem Lack of principled uncertainty quantification and interpretability in existing symbolic regression methods.
method Hierarchical Bayesian framework with tree-structured symbolic expressions and Markov chain Monte Carlo inference.
result Robust performance on various datasets, including single-atom catalysis.
FIGARO generates symbolic music with fine-grained control.
problem Minimal control over generated music sequences.
method Description-to-sequence task, learning conditional distribution of sequences given high-level descriptions.
result State-of-the-art controllable symbolic music generation.
The paper teaches a reinforcement learning agent to generate diverse programs based on symbolic instructions.
problem Learning to generate diverse programs for diverse scenes given a symbolic instruction.
method Instruction-conditioned reinforced adversarial learning.
result The agent's stochastic policy more accurately captures the diversity in the goal distribution.
One of the key challenges in applying reinforcement learning to real-life problems is that the amount of train-and-error required to learn a good policy increases drastically as the task becomes complex. One potential solution to this problem is to combine reinforcement learning with automated symbol planning and utili…
LLMs translate natural language trading intents into correct option strategies using a domain-specific language.
problem Challenges in translating natural language trading intents into correct option strategies due to the complexity of option chain data.
method Introduce Option Query Language (OQL) as a domain-specific intermediate representation to abstract option markets into high-level primitives under grammatical rules. Use LLMs as semantic parsers and validate queries by an engine.
result Significantly improves execution accuracy and logical consistency over direct baselines.
Study develops supervised algorithm for symbolic music style translation.
problem Transforming musical style while maintaining original content.
method Synthetic data generation for aligned training data, encoder-decoder model.
result Trained models produce meaningful accompaniments for real MIDI recordings.
Novel neural computer learns algorithmic solutions for symbolic tasks.
problem Learning abstract strategies for unfamiliar problems.
method Memory-augmented neural network architecture with Evolution Strategies.
result Strong generalization and abstraction across various tasks.
Neural-guided symbolic regression uses asymptotic constraints to find unknown functions.
problem Finding unknown functions from data points with additional mathematical constraints.
method A neural network generates expressions with desired leading powers, and Monte Carlo Tree Search optimizes the expressions.
result The system effectively finds unknown functions outside the training set compared to existing methods.
Maximum principles for boundary-degenerate second-order linear elliptic differential operatorsmath.AP
We prove weak and strong maximum principles, including a Hopf lemma, for smooth subsolutions to equations defined by linear, second-order, partial differential operators whose principal symbols vanish along a portion of the domain boundary. The boundary regularity property of the smooth subsolutions along this boundary…
We prove an off-diagonal expansion for a Toeplitz operator with an indicator function.
problem Asymptotics of Toeplitz operators with indicator function
method Off-diagonal expansion
result We extend two results to the non-compact setting.
Introduces a new entropy concept for analyzing symbol similarities in information theory.
problem Analyzing the diversity and similarities of symbols in information theory.
method Introduces a geometric approach to entropy based on relative symbol abundances and similarities.
result Proposed divergence outperforms state-of-the-art methods and has a closed-form expression.
MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.
problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.
Let be a bounded logarithmically convex complete Reinhardt domain in centered at the origin. Generalizing a result for the one-dimensional case of the unit disk, we prove that the -algebra generated by Toeplitz operators with bounded measurable separately radial symbols (i.e., symbols depending …
New linear models improve time series classification efficiency and interpretability.
problem Complex and inefficient classifiers limit interpretability and applicability to variable-length time series.
method Symbolic representations, multi-resolution, multi-domain, linear models.
result mtSS-SEQL+LR achieves similar accuracy to state-of-the-art methods but with lower time and memory usage.
Hybrid models are reinterpreted as Neuro-Symbolic AI designs to quantify uncertainty and variability.
problem Limited semantic interface for comparing hybrid models across domains.
method Reinterpret hybrid models as Neuro-Symbolic AI, translating them into explicit inference function and logic-belief decomposition.
result Metrics SVR and BD quantify uncertainty and variability in hybrid models.
A new approach to symbol calculus on filtered manifolds using -algebras.
problem Symbol calculus on filtered manifolds with local isomorphism to stratified Lie groups.
method Establishing a surjective -homomorphism between a -algebra bundle and the algebra of bounded continuous sections.
result Existence of a surjective -homomorphism sym_M: Π_M → C_b(E_hom) with specific kernel properties.
SDE automatically recovers interpretable discrete distributions.
problem Limited interpretable discrete probability laws.
method Unsupervised framework using symbolic density estimation.
result Accurately recovers interpretable discrete distributions.
New method learns low-dimensional representations of nonlinear time series without supervision.
problem Learning low-dimensional representations of nonlinear time series without supervision.
method Based on monotone variational inequality, the method learns representations by assuming sequences arise from a common domain.
result The method can learn the geometry for the entire domain and faithful representations for the dynamics of each individual sequence.
Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.
problem Modeling scenes with high performance on unseen input scenes composed of known visual elements.
method Neurosymbolic grounding with neurosymbolic scene encodings and attention mechanisms.
result Establishes a new state-of-the-art for compositional generalization in world modeling.
SPPL simplifies probabilistic programming for exact inference.
problem Efficient exact inference in probabilistic models.
method SPPL translates probabilistic programs into sum-product expressions, leveraging new techniques for scalability.
result SPPL achieves up to 3500x speedups in exact inference.
SymNet uses neural models to solve RMDPs efficiently.
problem Limited effectiveness of generalized policies in RMDPs.
method SymNet trains shared parameters for an RDDL domain, converts instances to graphs, uses relational neural models for node embeddings, and scores actions based on embeddings.
result SymNet policies outperform random and state-of-the-art deep reactive policies on nine RDDL domains.
GNNs can learn multiple graph centrality measures from a single embedding.
problem Estimating network centrality measures from graph data.
method Training a GNN to refine a single set of multidimensional embeddings and decode them into multiple outputs.
result GNN achieves 89% accuracy on random instances with up to 128 vertices.
Framework learns portable representations for diverse tasks.
problem Creating task-independent abstract representations for diverse environments.
method Autonomously learns portable representations in egocentric space.
result Portable representations enable task-independent planning and transfer.
Co-eye: A Multi-resolution Symbolic Representation to TimeSeries Diversified Ensemble Classificationcs.LG
Co-eye combines multiple symbolic representations to improve time series classification accuracy.
problem Challenges in time series classification due to domain diversity.
method Inspired by compound eyes, Co-eye uses multiple symbolic representations and hyper-parameterised lenses to classify time series data.
result Co-eye outperforms state-of-the-art techniques in accuracy and robustness across various domains.
A two-tiered model solves visual arithmetic tasks by integrating perception and reasoning.
problem Integrating perception and reasoning for solving visual arithmetic tasks.
method Two-tiered architecture with a heterogeneous lower tier and a controller trained via reinforcement learning.
result The model improves sample efficiency and solves a variety of visual arithmetic tasks.
Let be a homogeneous bounded domain of and a set of (anti--Wick) symbols that defines a commutative algebra of Toeplitz operators on every weighted Bergman space of . We prove that if is rich enough, then it has an underlying geometric structure given by a Lagrangian fo…
Machine learning improves Buchberger's algorithm for polynomial systems.
problem Optimizing S-pair selection in Buchberger's algorithm for polynomial systems.
method Reinforcement learning agents trained with PPO to select S-pairs.
result Trained model outperforms existing heuristics in polynomial additions.
The notion of topological degree is studied for mappings from the boundary of a relatively compact strictly pseudo-convex domain in a Stein manifold into a manifold in terms of index theory of Toeplitz operators on the Hardy space. The index formalism of non-commutative geometry is used to derive analytic integral form…
VaSST uses soft symbolic trees for probabilistic symbolic regression.
problem Efficiently recover symbolic expressions from noisy data.
method Variational inference with soft symbolic trees.
result Superior performance in structural recovery and predictive accuracy.
This paper autoformalizes Euclidean geometry using LLMs and theorem provers.
problem Challenges in formalizing Euclidean geometry due to reliance on diagrams.
method Combines neuro-symbolic framework, SMT solvers, and LLMs to fill in diagrammatic gaps.
result Demonstrates the capability and limitations of LLMs on autoformalizing geometry problems.
We prove Transformers can learn diverse Gröbner bases.
problem Training Transformers for Gröbner basis computation.
method Prove generality of dataset generation algorithm; propose extended algorithm.
result Datasets are sufficiently general for diverse Gröbner bases learning.
Bayesian approach models neurodegenerative diseases without clinical labels.
problem Personalized, predictive modeling of neurodegenerative diseases.
method Probabilistic programmed deep kernel learning combining Gaussian processes and neural networks.
result Surpasses deep learning in accuracy and timeliness of predicting neurodegeneration.
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.
problem Slow convergence in neural-symbolic learning due to error propagation issues.
method Introduces grammar model as symbolic prior and back-search algorithm for efficient error propagation.
result Significantly outperforms RL methods in performance, converging speed, and data efficiency.
Geometric symbols help compute heat invariants.
problem Computing heat invariants efficiently.
method Geometric symbol calculus of pseudodifferential operators.
result Efficient computation of heat invariants.