Secure Multiparty Computation protects data privacy in Symbolic Regression.
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.
Trend · papers per month
MESSY estimation recovers symbolic density functions from samples using maximum entropy.
Efficient algorithm for identifying causal effects in linear models.
Analysis and manipulation of trained neural networks is a challenging and important problem. We propose a symbolic representation for piecewise-linear neural networks and discuss its efficient computation. With this representation, one can translate the problem of analyzing a complex neural network into that of analyzi…
The problem of evaluating heat invariants can be computerized. Geometric symbol calculus of pseudodifferential operators is the main tool of such computerization.
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…
Zoetrope Genetic Programming improves symbolic regression performance.
Introduces canonical connections for sub-Riemannian manifolds with constant symbol.
CHOOSE enhances shallow Transformers for wireless symbol detection.
Paper closes neural-symbolic learning loop with grammar model and back-search algorithm.
Calculates spinor heat flow using Gaussian-Grassmann integrals.
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…
A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.
Classifies generalized Seifert fiber spaces and their branched covers.
Explores tensor products in hyperdimensional computing.
Improved symbolic regression finds optimal formulas robust to noise.
OccamNet finds interpretable symbolic fits to data efficiently.
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…
QABBA improves time series storage efficiency while preserving shape information.
Neural-symbolic model improves link prediction in knowledge graphs.
We prove Transformers can learn diverse Gröbner bases.
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…
New method calculates winding of geodesics on surfaces.
Cosmos models scenes using neural encodings and symbolic attributes for compositional generalization.
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 …
SPPL simplifies probabilistic programming for exact inference.
In this paper, we consider the problem of fast and efficient indexing techniques for sequences evolving in non-Euclidean spaces. This problem has several applications in the areas of human activity analysis, where there is a need to perform fast search, and recognition in very high dimensional spaces. The problem is ma…
NEMoTS improves time series analysis by deriving efficient, interpretable models.
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…
VaSST uses soft symbolic trees for probabilistic symbolic regression.
We compute the asymptotical growth rate of a large family of -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…
Researchers extend pseudodifferential calculus on filtered manifolds using fixed point algebras.
Unified approach to structured prediction combining entropy regularization and neuro-symbolic logic.
RED CoMETS improves multivariate time series classification accuracy.
Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying a linear transformation based on a "one-hot" encoding of the discrete symbols. Despite its simplicity, such approach yields the number of parameters that grows linearly with the vocabulary s…
Proposes a method to train neural networks directly on compressed text data.
Autoregressive models struggle with hard-to-compute distributions, alternatives like energy-based and latent-variable models solve this.
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…
Paper develops a framework to discover bioprocessing regulatory mechanisms using symbolic and statistical learning.
Reinforcement learning and symbolic planning have both been used to build intelligent autonomous agents. Reinforcement learning relies on learning from interactions with real world, which often requires an unfeasibly large amount of experience. Symbolic planning relies on manually crafted symbolic knowledge, which may …
For an arbitrary Riemannian manifold and Hermitian vector bundles and over we define the notion of the normal symbol of a pseudodifferential operator from to . The normal symbol of is a certain smooth function from the cotangent bundle to the homomorphism bundle and dep…
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…
Researchers compute Wodzicki residue for pseudo-differential operators on compact Lie groups.
Symbol detection plays an important role in the implementation of digital receivers. In this work, we propose ViterbiNet, which is a data-driven symbol detector that does not require channel state information (CSI). ViterbiNet is obtained by integrating deep neural networks (DNNs) into the Viterbi algorithm. We identif…
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…
A new approach for blind channel equalization and decoding, variational inference, and variational autoencoders (VAEs) in particular, is introduced. We first consider the reconstruction of uncoded data symbols transmitted over a noisy linear intersymbol interference (ISI) channel, with an unknown impulse response, with…
Global homotopies upgrade classical map in differential geometry.
We introduce mod 3 triple Milnor invariants and triple cubic residue symbols for certain primes of the Eisenstein number field , following the analogies between knots and primes. Our triple symbol generalizes both the cubic residue symbol and Rédei's triple symbol, and describes the decomposition…