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

7142128 · Jun 202019922001200920172026
48 results for Symbolic

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.

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.

Quantum 6j6j-symbols linked to tetrahedra angles and volumes.

problem Understanding quantum 6j6j-symbols and their geometric interpretation.
method Establishing the geometric connection between quantum 6j6j-symbols and tetrahedra angles, including spherical, Euclidean, and hyperbolic cases.
result Quantum 6j6j-symbols correspond to dihedral angles of specific tetrahedra, including generalized hyperbolic ones, with exponential growth rates tied to their volumes.

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.

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

2019-12-19abs ↗pdf ↗

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.

Study connects boundary geometry to symbol of Dirichlet-to-Neumann operator.

problem Determining geometric data from boundary symbol of connection Laplacian.
method Analyze symbol of Dirichlet-to-Neumann operator associated with connection Laplacian.
result Geometric data on boundary and normal derivatives are determined by symbol.

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.

We define a new homology theory we call symbol homology by using decorated moduli spaces of Whitney polygons. By decorating different types of moduli spaces we obtain different flavors of this homology theory together with morphisms between them. Each of these flavors encodes the properties of a different type of Heega…

2011-04-26abs ↗pdf ↗

Hybrid model learns novel handwritten characters better than neural or symbolic models alone.

problem Generating novel yet structured concepts.
method Neuro-symbolic model combining neural networks and probabilistic programs.
result Hybrid model outperforms alternative models in learning and generalizing novel handwritten characters.

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.

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…

2017-07-11abs ↗pdf ↗

We consider the following construction of quantization. For a Riemannian manifold MM the space of forms on TMT^*M is made into a space of (full) symbols of operators acting on forms on MM. This gives rise to the composition of symbols, which is a deformation of the (``super'')commutative multiplication of forms. The …

1998-09-23abs ↗pdf ↗

Interprets coarse symbol and index classes for Callias type operators.

problem Understanding coarse geometry and index classes for Callias type operators.
method Interprets coarse symbol and index classes in terms of K-theory classes of coarse corona.
result Local positivity and invertibility conditions are incorporated into support conditions in K-theory.

It is known that every ribbon category with unimodality allows symmetrized 6j6j-symbols with full tetrahedral symmetries while a spherical category does not in general. We give an explicit counterexample for this, namely the category E\mathcal{E}. We define the mirror conjugate symmetry of 6j6j-symbols instead and sho…

2009-07-13abs ↗pdf ↗