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

51102153204 · May 202619922001200920172026
48 results for symbol smoothing

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 ↗

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.

Let NN and PP be smooth closed manifolds of dimensions nn and pp respectively. Given a Thom-Boardman symbol II, a smooth map f:NPf:N\to P is called an ΩIΩ^{I}-regular map if and only if the Thom-Boardman symbol of each singular point of ff is not greater than II in the lexicographic order. We will represent the gr…

2004-12-13abs ↗pdf ↗

The paper characterizes vector bundles and differential operators using Lie algebras and their symbols.

problem Characterizing vector bundles and differential operators using algebraic methods.
method Lie-algebraic characterization of vector bundles and differential operators.
result The Lie algebras P(E,M)\mathcal{P}(E,M) and S(P(E,M))\mathcal{S}(\mathcal{P}(E,M)) characterize vector bundles and their smooth sections.

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.

We prove the existence and uniqueness of a projectively equivariant symbol map (in the sense of Lecomte and Ovsienko) for the spaces DpD_p of differential operators transforming p-forms into functions. These results hold over a smooth manifold endowed with a flat projective structure. As an application, we classify the…

2002-06-20abs ↗pdf ↗

The paper studies boundedness of pseudo-differential operators on smooth manifolds.

problem Boundedness of pseudo-differential operators in LpL^p-LqL^q spaces on smooth manifolds.
method Using global symbols and extending Hörmander's condition, the paper investigates LpL^p-boundedness, LL^\infty-BMOBMO estimates, and LpL^p-LqL^q boundedness for Fourier multipliers and pseudo-differential operators.
result The paper proves LpL^p-LqL^q boundedness for the range 1<p2q<1<p \leq 2 \leq q<\infty.

A new approach to symbol calculus on filtered manifolds using CC^{*}-algebras.

problem Symbol calculus on filtered manifolds with local isomorphism to stratified Lie groups.
method Establishing a surjective *-homomorphism between a CC^{*}-algebra bundle and the algebra of bounded continuous sections.
result Existence of a surjective *-homomorphism sym_M: Π_M → C_b(E_hom) with specific kernel properties.

The paper proposes a method to compute higher infinitesimals in numerical and symbolic analysis.

problem Computing higher-order derivatives with higher infinitesimals.
method Automatic differentiation in terms of C-infinity rings and Weil algebras.
result A unifying theoretical framework for multivariate higher-order derivatives.

Extends elliptic operator regularity to maximally hypoelliptic operators.

problem Maximally hypoelliptic differential operators and their regularity.
method Define a principal symbol for arbitrary differential operators involving vector fields and their commutators.
result Proves the invertibility of the principal symbol is equivalent to maximally hypoellipticity, answering a conjecture.

Reinforcement learning algorithms can solve dynamic decision-making and optimal control problems. With continuous-valued state and input variables, reinforcement learning algorithms must rely on function approximators to represent the value function and policy mappings. Commonly used numerical approximators, such as ne…

2019-03-22abs ↗pdf ↗

Proves a Gel'fand-Kolmogoroff type result for vector bundles and polynomial functions.

problem Characterizing vector bundles and polynomial functions using differential operators.
method Analyzes the associative structure of symbols of differential operators and their eigenvectors.
result Derives a Gel'fand-Kolmogoroff type result for the algebra of symbols of differential operators.

Innovative advances validate a conjecture on maximal hypoellipticity in sub-Riemannian geometry.

problem Characterizing maximal hypoellipticity in sub-Riemannian geometry.
method Generalization of Connes tangent groupoid, pseudodifferential calculus, and invertibility of principal symbol.
result Validation of Helffer and Nourrigat's conjecture on maximal hypoellipticity.

The purpose of this article is to study Ezra Getzler's approach to the Atiyah-Singer index theorem from the perspective of Alain Connes' tangent groupoid. We shall construct a "rescaled" spinor bundle on the tangent groupoid, define a convolution operation on its smooth, compactly supported sections, and explain how th…

2019-02-22abs ↗pdf ↗

A two-step approach efficiently selects hyperparameters for FCMs.

problem Efficiently selecting hyperparameters for FCMs in a computationally expensive process.
method Two-step sequential approach: first estimate context length k, then estimate α.
result The proposed method achieves comparable compression performance to exhaustive search but with reduced computational cost.

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.

Achieving machine intelligence requires a smooth integration of perception and reasoning, yet models developed to date tend to specialize in one or the other; sophisticated manipulation of symbols acquired from rich perceptual spaces has so far proved elusive. Consider a visual arithmetic task, where the goal is to car…

2018-09-13abs ↗pdf ↗

We consider a consider the case of a compact manifold M, together with the following data: the action of a compact Lie group H and a smooth H-invariant distribution E, such that the H-orbits are transverse to E. These data determine a natural equivariant differential form with generalized coefficients J(E,X) whose prop…

2008-10-02abs ↗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 ↗

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 ↗

Study uniquely determines Riemannian metric derivatives from boundary data.

problem Determining Riemannian metric derivatives from boundary data.
method Computing the full symbol of the elastic Dirichlet-to-Neumann map.
result The elastic Dirichlet-to-Neumann map uniquely determines all partial derivatives of the Riemannian metric on the boundary.

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.