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

138276413551 · Jun 202019922001200920172026
48 results for symbolic computation

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.

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.

We introduce the C++ library Wedge, based on GiNaC, for symbolic computations in differential geometry. We show how Wedge makes it possible to use the language C++ to perform such computations, and illustrate some advantages of this approach with explicit examples. In particular, we describe a short program to determin…

2008-04-20abs ↗pdf ↗

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.

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.

Recurrent Neural Networks (RNN) are a type of statistical model designed to handle sequential data. The model reads a sequence one symbol at a time. Each symbol is processed based on information collected from the previous symbols. With existing RNN architectures, each symbol is processed using only information from th…

2017-03-03abs ↗pdf ↗

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.

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.

We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the…

2012-01-07abs ↗pdf ↗

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.

This paper is essentially a short version of hep-th/9404046. We compute multiplicative anomaly det(AB)/(detA detB) =F(A,B) for elliptic pseudo-differential operators (PDOs) A, B on a closed manifold M in terms of their symbols. We prove that F(A,B)=1 for elliptic differential operators close to positive-definite ones o…

1994-06-21abs ↗pdf ↗

Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.

problem Modeling scenes with high performance on unseen input scenes composed of known visual elements.
method Neurosymbolic grounding with neurosymbolic scene encodings and attention mechanisms.
result Establishes a new state-of-the-art for compositional generalization in world modeling.

We address the problem of combining sequence models of symbolic music with user defined constraints. For typical models this is non-trivial as only the conditional distribution of each symbol given the earlier symbols is available, while the constraints correspond to arbitrary times. Previously this has been addressed …

2019-09-10abs ↗pdf ↗

NEMoTS improves time series analysis by deriving efficient, interpretable models.

problem Lack of comprehensive understanding and insightful explanations in time series analysis.
method Neural-enhanced Monte-Carlo Tree Search (NEMoTS) for symbolic regression.
result NEMoTS provides efficient and interpretable models for time series analysis.

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML has appealing theoretical properties, but is difficult to compute exactly. Inspi…

2017-12-19abs ↗pdf ↗

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 ↗

Researchers extend pseudodifferential calculus on filtered manifolds using fixed point algebras.

problem Defining operators with varying orders on filtered manifolds.
method Using generalized fixed point algebras and nilpotent Lie groups, they construct a new calculus.
result They establish a new calculus that reflects the behavior of differential operators on filtered manifolds.

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.

RED CoMETS improves multivariate time series classification accuracy.

problem Complexity of multivariate time series classification.
method Ensemble classifier RED CoMETS for symbolically represented multivariate time series.
result RED CoMETS achieves highest reported accuracy on 'HandMovementDirection' dataset.

Proposes a method to train neural networks directly on compressed text data.

problem Training neural networks on compressed text data without decompression.
method Introduces composer modules to encode symbols from grammar compression rules into vector representations.
result Demonstrates that the proposed method can achieve both memory and computational efficiency while maintaining moderate performance.

Autoregressive models struggle with hard-to-compute distributions, alternatives like energy-based and latent-variable models solve this.

problem Autoregressive models struggle with distributions whose next-symbol probability is hard to compute.
method Alternatives include energy-based models and latent-variable autoregressive models.
result Alternatives to autoregressive models can escape limitations of hard-to-compute distributions.

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 develops a framework to discover bioprocessing regulatory mechanisms using symbolic and statistical learning.

problem Challenges in modeling complex intracellular regulation, stochastic system behavior, and limited experimental data.
method Symbolic and statistical learning framework based on stochastic differential equations and Bayesian learning.
result Improved sample efficiency and robust model selection compared to state-of-the-art approaches.

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 ↗

Researchers compute Wodzicki residue for pseudo-differential operators on compact Lie groups.

problem Computing the Wodzicki residue for pseudo-differential operators on compact Lie groups.
method Analytic continuation of traces and matrix-valued symbols.
result Main theorem complementary to [2], removing ellipticity hypothesis.

The design of symbol detectors in digital communication systems has traditionally relied on statistical channel models that describe the relation between the transmitted symbols and the observed signal at the receiver. Here we review a data-driven framework to symbol detection design which combines machine learning (ML…

2020-02-14abs ↗pdf ↗