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.

169,341 papers · 148 categories

Trend · papers per month

15304560 · Jun 202019922001200920182026
48 results for symbol frequency

Study explains Zipf's law using geometric mechanisms from a finite alphabet.

problem Explains Zipf's law in language without relying on linguistic elements.
method Uses the Full Combinatorial Word Model (FCWM) to generate geometric distributions of word lengths.
result Supports predictions of power-law rank-frequency curves, matching various languages.

New algorithms improve time series classification accuracy and efficiency while enhancing interpretability.

problem Lack of interpretability in time series classification algorithms.
method Combining multiple resolutions and domains, using SEQL with greedy feature selection.
result SAX-SFA-SEQL achieves similar accuracy to state-of-the-art methods but with lower computational time.

Symbolic Data Analysis is based on special descriptions of data - symbolic objects (SO). Such descriptions preserve more detailed information about units and their clusters than the usual representations with mean values. A special kind of symbolic object is a representation with frequency or probability distributions …

2015-07-23abs ↗pdf ↗

Simplified Ricci curvature for spherical fluid dynamics models.

problem Studying stability in incompressible fluid dynamics on a sphere.
method Definition and calculation of Ricci curvature for two-dimensional hydrodynamics using finite-dimensional Zeitlin models.
result Strong numerical evidence suggests convergence of finite-dimensional approximations to infinite-dimensional limit, indicating average instability for high-frequency modes.

Co-eye combines multiple symbolic representations to improve time series classification accuracy.

problem Challenges in time series classification due to domain diversity.
method Inspired by compound eyes, Co-eye uses multiple symbolic representations and hyper-parameterised lenses to classify time series data.
result Co-eye outperforms state-of-the-art techniques in accuracy and robustness across various domains.

A system is presented that segments, clusters and predicts musical audio in an unsupervised manner, adjusting the number of (timbre) clusters instantaneously to the audio input. A sequence learning algorithm adapts its structure to a dynamically changing clustering tree. The flow of the system is as follows: 1) segment…

2015-02-02abs ↗pdf ↗

Unified framework integrates symbolic planning and HRL for robust decision-making.

problem Combining reinforcement learning and symbolic planning for robust decision-making in dynamic environments.
method Integrates symbolic planning with hierarchical reinforcement learning to guide task execution and improve planning.
result Unified framework leads to rapid policy search and robust symbolic plans in complex domains.

EML-CD discovers causal mechanisms from neural networks in a structured way.

problem Extracting causal mechanisms from neural network weights is ill-posed.
method Integrates EML operator into causal structure learning, representing each edge mechanism as a gated EML binary tree.
result Achieves SHD=11.2 +/- 0.4 on real data, matching or outperforming existing methods.

New method for constructing frames for vector distributions with specific symbols.

problem Constructing frames for vector distributions with given Jacobi symbols.
method Introducing Jacobi symbols, Optimal Control ideas, explicit construction of canonical frames, algebraic procedure.
result Explicit construction of canonical frames for all distributions with given Jacobi symbols, description of prolongation algebra for most Jacobi symbols.

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 ↗

Symbolic dynamics applied to share prices reveals complex, non-Markovian patterns.

problem Analyzing complex systems like share prices using symbolic dynamics.
method Symbolic dynamics applied to time series of share price returns.
result Nontrivial spectrum of Renyi entropies found, indicating non-Markovian behavior.

TradeR uses RL to execute trades in real markets, minimizing surprise and catastrophe.

problem Minimizing surprise and catastrophe in high-frequency trading.
method Hierarchical RL with energy-based surprise value function.
result TradeR outperforms in abrupt price changes and maintains profitability.

Symbolic knowledge in neural models can inadvertently make them more vulnerable to adversarial attacks.

problem Symbolic knowledge in neural models can make models more susceptible to adversarial attacks.
method Investigated deep probabilistic graphical models that incorporate symbolic knowledge and neural nets.
result Symbolic knowledge can propagate the negative effects of adversarial examples, making models more vulnerable.

Profile entropy measures learnability and compressibility of discrete distributions.

problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.

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.

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.

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.

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 compares symbolic and distributional methods for relational learning.

problem Comparing symbolic and distributional paradigms for relational learning.
method Comparison of representation learning and relational learning on various tasks.
result Preliminary results suggest possible indicators for choosing between approaches.

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.

The study improves pitch detection in polyphonic music by learning harmonic priors.

problem Challenges in transcribing polyphonic music due to overlapping harmonics.
method Introduced Gaussian process priors and used variational Bayes for inference.
result Learning priors that fit the frequency content of sound events improves pitch detection.

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.

A new risk distribution model reduces inflated risk capital calculations.

problem Inflated risk capital calculations due to very large losses from conduct risk.
method A novel distribution with an exponential of a fourth power, estimated using symbolic computation and numeric calculations.
result The proposed exponential density produces a more accurate risk capital calculation without loss frequency and severity limits.

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.

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.