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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for symbolic structure

Neural networks learn symbolic structure to perform compositional tasks.

problem How neural networks perform well on compositional tasks without explicit representations.
method ROLE analysis to uncover symbolic structure in recurrent neural networks.
result Neural networks converge to solutions that implicitly represent symbolic structure.

In this article, we introduce symbol calculus on a projective scheme. Using holomorphic Poisson structures, we construct deformations of ring structures for structure sheaves on projective spaces.

2013-03-31abs ↗pdf ↗

Develops new approach to recover CR structures from their Levi foliations.

problem Recovering CR structures from their Levi foliations for nonregular symbols.
method Reduction to dynamical Legendrian contact structure on leaf space.
result New geometric interpretation of CR prolongation conditions.

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.

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.

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.

Unified approach to structured prediction combining entropy regularization and neuro-symbolic logic.

problem Structured prediction challenges due to large output spaces and insufficient labeled data.
method Neuro-symbolic entropy regularization loss that restricts entropy regularization to valid structures.
result Models predict more accurately and are more likely to be valid.

Develops experimental design for discovering missing physics in bioreactors.

problem Discovering missing physics in incomplete model structures of process systems.
method Combines universal differential equations and symbolic regression with sequential experimental design.
result Successfully recovered true model structure of a bioreactor using machine learning techniques.

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 ↗

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

We construct an explicit scheme to associate to any potential symbol an operator acting between sections of natural bundles (associated to irreducible representations) for a so-called AHS-structure. Outside of a finite set of critical (or resonant) weights, this procedure gives rise to a quantization, which is intrinsi…

2009-04-21abs ↗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 ↗

Classifies homogeneous CR hypersurfaces in low dimensions with maximal symmetry.

problem Classifying CR hypersurfaces with maximal symmetry in low dimensions.
method Introduced modified CR symbols to organize local invariants, classified hypersurfaces through modified symbols, and used Lie group structures.
result Found nine model structures among locally homogeneous 2-nondegenerate hypersurfaces in C4\mathbb{C}^4.

Generative Neuro-Symbolic model learns from raw data with rich conceptual representations.

problem Learning rich, general-purpose conceptual representations from raw perceptual inputs.
method Generative Neuro-Symbolic (GNS) model combining symbolic and neural network approaches.
result Model learns from raw data and generalizes to 4 unique tasks.

We observe that the line bundle associated to the tame symbol of two invertible holomorphic functions also carries a fairly canonical hermitian metric, hence it represents a class in a Hermitian holomorphic Deligne cohomology group. We put forward an alternative definition of hermitian holomorphic structure on a gerbe …

2003-10-02abs ↗pdf ↗

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.

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.

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.

Efficient algorithm for identifying causal effects in linear models.

problem Determining causal effects from observational data under latent confounding.
method Symbolic computation and efficient algorithm for finding identifying formulas.
result Proves the existence of identifying formulas of a specified degree in quasi-polynomial time.

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 ↗

Successful human-robot cooperation hinges on each agent's ability to process and exchange information about the shared environment and the task at hand. Human communication is primarily based on symbolic abstractions of object properties, rather than precise quantitative measures. A comprehensive robotic framework thus…

2017-01-23abs ↗pdf ↗

A unified approach to geometric, symbol and deformation quantizations on a generalized flag manifold endowed with an invariant pseudo-Kaehler structure is proposed. The Hilbert space of states is realized via the Bott-Borel-Weil theorem in the sheaf cohomology of the geometric quantization line bundle. The correspondin…

1997-09-17abs ↗pdf ↗

This paper develops a novel methodology for using symbolic knowledge in deep learning. From first principles, we derive a semantic loss function that bridges between neural output vectors and logical constraints. This loss function captures how close the neural network is to satisfying the constraints on its output. An…

2017-11-29abs ↗pdf ↗

Symbolic regression finds two projective invariants capturing most of the Ricci-flat metric variation.

problem Capturing the Ricci-flat metric variation on the Dwork quintic using a small number of projective invariants.
method Using symbolic regression on sampled points, the authors find two low-order symmetric features that capture most of the variation.
result A degree-3 polynomial in (p2,σ3)(p_2,σ_3) achieves held-out test R2=0.946R^2=0.946.

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

problem Optimal model structure reconstruction from weighted colored graph adjacency matrix.
method Uses prize-collecting Steiner tree algorithm to reconstruct minimum spanning tree.
result Demonstrates the effectiveness of the prize-collecting Steiner tree algorithm for model structure reconstruction.

We compute the asymptotical growth rate of a large family of Uq(sl2)U_q(sl_2) 6j6j-symbols and we interpret our results in geometric terms by relating them to volumes of hyperbolic truncated tetrahedra. We address a question which is strictly related with S.Gukov's generalized volume conjecture and deals with the case of hy…

2006-11-13abs ↗pdf ↗

Study recovers C*-algebra from fields of Toeplitz algebras on specific groups.

problem Recovering C*-algebra from fields of Toeplitz algebras on specific groups.
method Using continuous fields of Toeplitz algebras and a crossed product.
result Algebra of principal symbols can be recovered from fields of Toeplitz algebras.

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.