Research
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.

168,695 papers · 148 categories

Trend · papers per month

20406080 · May 202619922001200920172026
48 results for Symbolic AI

A hybrid algorithm combines optimization and enumeration for symbolic regression.

problem Finding any function from a set of operators without prior specification.
method Mixed-integer nonlinear optimization with explicit enumeration and constraints.
result The hybrid algorithm is competitive with state-of-the-art methods.

Platform combines RL and language models to study narrative influence on AI decisions.

problem Understanding how narrative elements shape AI decision-making.
method Dual-system architecture with reinforcement learning and language model integration.
result Initial experiments show narrative frameworks can influence AI decision-making.

Neural-symbolic model improves link prediction in knowledge graphs.

problem Effective relational learning and reasoning for AI systems.
method Neural-symbolic graph neural network that learns over all paths in knowledge graphs.
result Neural-symbolic model outperforms path-based approaches in link prediction.

Neuro-symbolic traders suppress market prices, highlighting risks to stability.

problem Understanding and quantifying the influence of AI-generated financial models on markets.
method Developed virtual neuro-symbolic traders using deep generative models and tested them in a virtual market.
result Neuro-symbolic traders suppress market prices compared to historical data, indicating potential market instability.

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.

DILP improves fraud detection explainability without significant performance boost.

problem Improving fraud detection explainability in machine learning.
method Differentiable Inductive Logic Programming (DILP) for fraud detection with data curation.
result DILP provides comparable results to traditional methods but lacks significant advantage.

LLMs struggle to outperform markets over long periods and diverse stocks.

problem Overstated effectiveness of LLM-based investing strategies due to biases.
method FINSABER framework for systematic backtests over two decades and 100+ symbols.
result Previously reported LLM advantages deteriorate significantly under broader evaluation.

With a view to bridging the gap between deep learning and symbolic AI, we present a novel end-to-end neural network architecture that learns to form propositional representations with an explicitly relational structure from raw pixel data. In order to evaluate and analyse the architecture, we introduce a family of simp…

2019-05-24abs ↗pdf ↗

Study finds optimal board gender diversity for emissions performance.

problem Association between board gender diversity and emissions performance.
method Panel regressions, machine learning, explainable AI.
result Optimal board gender diversity for emissions performance is approximately 35%.

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…

2011-06-20abs ↗pdf ↗

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.

Paper investigates differentiable fuzzy implications and their suitability for learning.

problem Analyzing differentiable fuzzy implications and their suitability for learning.
method Investigates the properties of fuzzy implications in a differentiable setting and introduces a new family of fuzzy implications.
result Various fuzzy implications are unsuitable for differentiable learning, and a new family of fuzzy implications is introduced.

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

1996-12-11abs ↗pdf ↗

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…

2016-10-29abs ↗pdf ↗

The paper classifies symbols of differential operators on vector bundles.

problem Classifying symbols of linear differential operators on vector bundles.
method Associated tuples of linear operators to non-degenerate symbols and used C. Procesi's results to find rational invariants and equivalence criteria.
result Generators for rational invariants and a criterion for symbol equivalence.

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.

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

problem Transverse index theory for foliated manifolds.
method Using filtrations of tangent bundles, defining transverse symbols, and constructing equivariant KK-classes.
result Transversally Rockland operators yield a K-homology class and there is a Poincare duality result.

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

problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.

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.

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…

2005-10-21abs ↗pdf ↗

Bayesian symbolic regression automates model discovery from data.

problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.

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

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

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

problem Training activations in KANs often lack symbolic fidelity, leading to unintelligible models.
method Softly Symbolified Kolmogorov-Arnold Networks (S2KAN) integrates symbolic primitives into training with learnable gates and a Minimum Description Length objective.
result S2KAN discovers interpretable forms when symbolic terms suffice, gracefully degrading to dense splines when necessary.

Symbolic LSTM improves time series forecasting by reducing hyperparameter sensitivity.

problem High sensitivity to hyperparameters and random initialization in numerical time series forecasting.
method Combining LSTM with a dimension-reducing symbolic representation.
result Symbolic representation alleviates forecasting problems and speeds up training.

Meta-learning symbolic default hyperparameters from dataset properties.

problem Empirical hyperparameter optimization is slow and requires manual configuration.
method Evolutionary algorithm to learn symbolic hyperparameter formulas from dataset properties.
result Meta-learning finds viable symbolic defaults for ML algorithms.