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,742 papers · 148 categories

Trend · papers per month

2995988961,195 · Jun 202019922001200920172026
48 results for Symbolic Methods

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

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

problem Estimating probability density functions from limited samples.
method Maximum-Entropy approach with gradient flow and symbolic regression.
result Efficiently finds optimal symbolic expressions for unknown distributions.

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.

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.

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.

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.

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.

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.

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

problem Understanding the effectiveness of tree-based methods in finite-sample settings, especially symbolic feature selection.
method Local ranking perspective, finite-sample analysis, oracle bounds, posterior contraction results, concordant divergence statistics.
result New insights and statistics for evaluating symbolic feature mappings.

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.

PAN+SR tackles scalable symbolic regression for large pp datasets.

problem Symbolic regression struggles with large number of input variables and measurement error.
method Combines ab initio nonparametric variable selection with SR to pre-screen and reduce search complexity.
result PAN+SR consistently enhances 19 SR methods' performance on challenging datasets.

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.

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 ↗

Extract symbolic models from deep learning with inductive biases.

problem Interpreting and discovering physical principles from deep neural networks.
method Introduce strong inductive biases in GNNs, encourage sparse latent representations, apply symbolic regression.
result Extracted symbolic equations from neural networks, including known force laws and new analytic formulas.

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.

Paper introduces a new symbol map for differential symmetry breaking operators.

problem Generalizing the symbol map to non-abelian settings.
method Introduces and studies the truncated symbol map Symb0(D)\mathrm{Symb}_0(\mathbb{D}).
result Classified and constructed differential intertwining operators and homomorphisms.

New CR hypersurfaces in complex space with specific properties.

problem Constructing CR hypersurfaces with arbitrary nilpotent symbols.
method Introduced a class of CR hypersurfaces with methods applicable to all cases with N>5N>5.
result Solved equivalence problem for structures with a single Jordan block symbol.

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 ↗

Active learning improves SR by proposing experiments in data-limited settings.

problem Efficiently gathering data for symbolic regression with physical constraints.
method Query by committee using the Pareto frontier of equations, with physical constraints.
result Reduces data required for SR and achieves state-of-the-art results.

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 ↗

DeepSIC learns to detect multiple symbols in MIMO systems without assuming a specific channel model.

problem Challenges in multiuser MIMO detection due to non-linear channels and lack of accurate channel state information.
method Integrates machine learning into iterative soft interference cancellation (SIC) algorithm to learn from limited training samples.
result Significantly outperforms conventional methods in linear and non-linear channels, even with CSI uncertainty.

Symbolic data analysis (SDA) is an emerging area of statistics concerned with understanding and modelling data that takes distributional form (i.e. symbols), such as random lists, intervals and histograms. It was developed under the premise that the statistical unit of interest is the symbol, and that inference is requ…

2018-09-11abs ↗pdf ↗

Enhances Cox model for survival analysis with symbolic non-linear log-risk functions.

problem Limited interpretability and non-linearity in traditional Cox models.
method Introduces GCPH model using Kolmogorov-Arnold Networks for symbolic non-linear log-risk functions.
result GCPH achieves competitive performance and superior interpretability.

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

problem Symbolic knowledge in neural models can make models more susceptible to adversarial attacks.
method Investigated deep probabilistic graphical models that incorporate symbolic knowledge and neural nets.
result Symbolic knowledge can propagate the negative effects of adversarial examples, making models more vulnerable.

Efficiently searches through Gaussian process kernels using symbolic representation and Bayesian optimization.

problem Manual selection of kernels in Gaussian processes is complex and computationally expensive.
method Proposes a novel method using symbolic representation and Bayesian optimization to search through a structured kernel space.
result Empirically shows a computationally more efficient way of searching through a discrete kernel space.

EPSTE: A geometric token and deep learning approach to estimating transfer entropy in neuroimaging time series

problem Inferring directed interactions between neural systems from EEG and MEG
method Reframing TE estimation as a learnable problem operating on structured symbolic representations
result EPSTE achieves near-perfect recovery of ground-truth directed structure and significantly lower absolute error than the baseline

Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this propert…

2017-05-22abs ↗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.