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

255176101 · Jun 202019922001200920172026
48 results for Symbolic mathematics

Transformer models can solve complex math problems with less data.

problem Solving complex symbolic mathematics problems with limited data.
method Pretrain transformer models on language translation tasks and fine-tune for symbolic math.
result Pretrained transformer models achieve comparable accuracy to state-of-the-art models with less data.

Improves neural network search in combinatorial spaces of mathematical symbols.

problem Early commitment and initialization bias limit exploration in neural network search.
method Entropy regularization and distribution initialization methods.
result Improves performance, increases sample efficiency, lowers solution complexity.

In this study we introduce a new technique for symbolic regression that guarantees global optimality. This is achieved by formulating a mixed integer non-linear program (MINLP) whose solution is a symbolic mathematical expression of minimum complexity that explains the observations. We demonstrate our approach by redis…

2017-10-29abs ↗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.

This paper describes a new method for Symbolic Regression that allows to find mathematical expressions from a dataset. This method has a strong mathematical basis. As opposed to other methods such as Genetic Programming, this method is deterministic, and does not involve the creation of a population of initial solution…

2019-08-16abs ↗pdf ↗

PySR method automates discovering equations from data in chaotic dynamics and epidemics.

problem Discovering equations from complex data in dynamical systems.
method Symbolic regression methods, focusing on PySR.
result PySR method efficiently infers equations from chaotic dynamics and epidemic models, matching original forms.

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.

Explores tensor products in hyperdimensional computing.

problem Understanding tensor products in hyperdimensional computing.
method Generalized results from graph embeddings to vector symbolic architectures and hyperdimensional computing.
result Tensor product is the most general and expressive representation with errorless unbinding and detection.

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.

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…

2019-03-22abs ↗pdf ↗

A new algorithm speeds up sparse regression for discovering equations from data.

problem Learning governing equations from vast data with unsatisfying descriptions.
method SPRINT: a fast algorithm using bisection and analytic bounds to identify optimal rank-1 modifications.
result A calculation that would take millions of years can be done in a day.

Mathematical reasoning---a core ability within human intelligence---presents some unique challenges as a domain: we do not come to understand and solve mathematical problems primarily on the back of experience and evidence, but on the basis of inferring, learning, and exploiting laws, axioms, and symbol manipulation ru…

2019-04-02abs ↗pdf ↗

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

2019-01-23abs ↗pdf ↗

New model captures complex relationships from experimental data.

problem Capturing intricate feature interactions in empirical data.
method Shape Arithmetic Expressions (SHAREs) combining GAMs and mathematical expressions.
result SHAREs model captures complex feature interactions.

Neural network language models (NNLMs) have achieved ever-improving accuracy due to more sophisticated architectures and increasing amounts of training data. However, the inductive bias of these models (formed by the distributional hypothesis of language), while ideally suited to modeling most running text, results in …

2019-12-11abs ↗pdf ↗

DisCoPyro combines category theory with machine learning for program learning.

problem Applying category theory to machine learning tasks.
method Introducing DisCoPyro, a framework combining categorical structures with amortized variational inference.
result DisCoPyro can be applied in program learning for variational autoencoders and potentially contributes to AGI.

Meta-learning approach to learn interpretable models from human feedback.

problem Tackling the challenge of making machine learning models interpretable.
method A meta-learning approach where a model of non-trivial proxies of human interpretability is learned from human feedback, then incorporated into the ML training process to optimize for interpretability.
result The approach leads to formulas that are either significantly more or equally accurate while being more interpretable.

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 ↗

While it has become common to perform automated translations on natural language, performing translations between different representations of mathematical formulae has thus far not been possible. We implemented the first translator for mathematical formulae based on recursive neural networks. We chose recursive neural…

2018-11-10abs ↗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.

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.

In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on Delaney-Dress combinatorial tiling theory using an extension of mapping class groups to …

2018-08-02abs ↗pdf ↗

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.