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,657 papers · 148 categories

Trend · papers per month

129258386515 · Jun 202019922001200920172026
48 results for symbolic stack machine

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.

New neural stack and Turing Machine architectures prove stability and computational power.

problem Designing stable neural network architectures for Turing Machine simulation.
method Introducing neural stack and Turing Machine architectures, proving stability and computational equivalence.
result Differentiable nnTM with bounded neurons can simulate Turing Machine in real-time and is equivalent to UTM.

In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks und…

2018-05-01abs ↗pdf ↗

Paper proves stacking ensembling is effective and proposes a new family of stacked generalizations.

problem Lack of theoretical guarantees for stacking ensembling methods.
method Proves novel theoretical result and proposes a new family of stacked generalizations.
result Proves stacking ensembling is effective and proposes a new family of stacked generalizations.

The paper proposes a demand prediction model for e-commerce sites using machine learning and stacking.

problem Accurately predicting demand for products sold by multiple sellers at different prices.
method Applied different regression algorithms and stacked generalization for demand prediction.
result Stacked generalization produced almost as good results as individual machine learning methods.

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.

PySR method automates discovering equations from data in chaotic dynamics and epidemics.

problem Discovering equations from complex data in dynamical systems.
method Symbolic regression methods, focusing on PySR.
result PySR method efficiently infers equations from chaotic dynamics and epidemic models, matching original forms.

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.

Machine learning improves CHD screening accuracy from 70% to 87.7%.

problem Predicting coronary heart disease using echocardiography and clinical features.
method Ensemble machine learning approach with model stacking and two-step stacking.
result Improved CHD classification accuracy from 70% to 87.7%.

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.

Design of printed circuit board (PCB) stack-up requires the consideration of characteristic impedance, insertion loss and crosstalk. As there are many parameters in a PCB stack-up design, the optimization of these parameters needs to be efficient and accurate. A less optimal stack-up would lead to expensive PCB materia…

2019-11-01abs ↗pdf ↗

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.

A method to improve gradient boosting models using stacking.

problem Improving the performance of gradient boosting models.
method Proposes a stacking algorithm to learn a meta-model for ensembles of gradient boosting models.
result The proposed approach can be extended to differentiable combination models like neural networks.

StackGenVis simplifies ensemble learning by visualizing model selection and performance.

problem Complexity in choosing and combining models for stacking ensemble learning.
method Visual analytics system that dynamically adapts performance metrics, manages data instances, selects algorithms, and measures predictive performance.
result Reduces complexity of stacking by removing overpromising and underperforming models.

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.

Improves neural network search in combinatorial spaces of mathematical symbols.

problem Early commitment and initialization bias limit exploration in neural network search.
method Entropy regularization and distribution initialization methods.
result Improves performance, increases sample efficiency, lowers solution complexity.

In this paper, we present iPrescribe, a scalable low-latency architecture for recommending 'next-best-offers' in an online setting. The paper presents the design of iPrescribe and compares its performance for implementations using different real-time streaming technology stacks. iPrescribe uses an ensemble of deep lear…

2019-05-31abs ↗pdf ↗

Warfarin dosing remains challenging due to narrow therapeutic index and highly individual variability. Incorrect warfarin dosing is associated with devastating adverse events. Remarkable efforts have been made to develop the machine learning based warfarin dosing algorithms incorporating clinical factors and genetic va…

2018-09-10abs ↗pdf ↗

A new machine learning framework called machine collaboration improves prediction accuracy.

problem Improving prediction accuracy in machine learning.
method Machine Collaboration (MaC) framework, which uses a circular and interactive learning approach.
result Machine Collaboration framework significantly outperforms other state-of-the-art methods in most cases.

Extends Fisher's Discriminant Analysis for interval-valued data.

problem Classifying entities represented by intervals and histograms.
method Adapts Fisher's Discriminant Analysis using Moore's interval arithmetic and Mallows' distance.
result Discriminant directions for interval-valued data are numerically maximized.

Study predicts heart failure patient survival using stacked ensemble ML.

problem Predicting survival of heart failure patients.
method Collect and analyze patient data, apply SMOTE, use K-Means, Fuzzy C-Means clustering, Random Forest, XGBoost, Decision Tree, and propose a stacked ensemble model.
result Supervised ML algorithms outperform unsupervised models, achieving high accuracy and F1 score.

We introduce a stacking version of the Monte Carlo algorithm in the context of option pricing. Introduced recently for aeronautic computations, this simple technique, in the spirit of current machine learning ideas, learns control variates by approximating Monte Carlo draws with some specified function. We describe the…

2019-03-26abs ↗pdf ↗

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.

Model predicts S&P500 volatility more accurately than existing models.

problem Improving accuracy of volatility and market risk forecasts.
method Stacked model using Gradient Descent Boosting, Random Forest, SVM, and Artificial Neural Network.
result The model outperforms other models in forecasting S&P500 volatility.

Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.

problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.

Paper proposes a new reserving model using machine learning techniques.

problem Managing uncertainties in premium sufficiency and reserves for future claims.
method Stacked model combining Gradient Boosting, Random Forest, Artificial Neural Networks, and log-normal approach.
result The proposed model improves traditional reserving techniques, leading to more accurate reserving risk assessment.

RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.

problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.

The deep network model, with the majority built on neural networks, has been proved to be a powerful framework to represent complex data for high performance machine learning. In recent years, more and more studies turn to nonneural network approaches to build diverse deep structures, and the Deep Stacking Network (DSN…

2019-02-15abs ↗pdf ↗

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 ↗

A central machine is interested in estimating the underlying structure of a sparse Gaussian Graphical Model (GGM) from datasets distributed across multiple local machines. The local machines can communicate with the central machine through a wireless multiple access channel. In this paper, we are interested in designin…

2018-12-26abs ↗pdf ↗

Kolmogorov-Arnold Networks offer interpretable models for energy applications.

problem Lack of interpretability in modern machine learning methods for sensitive industries.
method Symbolic regression with Kolmogorov-Arnold Networks compared to traditional feedforward neural networks.
result Kolmogorov-Arnold Networks yield perfectly interpretable models and learn real, physical relations.

Discovering quasipotential equations from data using machine learning.

problem Understanding escape mechanisms from metastable states in nonlinear systems.
method Combining neural networks and sparse regression to symbolically reconstruct quasipotential equations.
result Model-unbiased analytical forms of quasipotential discovered directly from data.

We developed a caching method to speed up concept learning in complex knowledge bases.

problem Complex concept learning requires many instance retrieval calls, increasing runtime.
method Semantics-aware caching that links concepts to instances via crisp set operations.
result Our cache reduces concept retrieval and learning runtime by an order of magnitude.