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

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920182026
48 results for simple rule-based baseline

Simple embedding models outperform complex ones in knowledge base completion.

problem Improving the accuracy of knowledge base completion using embedding models.
method Evaluation of embedding models for knowledge base completion using different protocols and a rule-based baseline.
result Current embedding models perform poorly in knowledge base completion compared to a simple rule-based approach.

Introduces a rule-based Bayesian regression for better uncertainty quantification and expert knowledge integration.

problem Handling regression problems with uncertainty quantification and expert intuition.
method Combines Bayesian inference and rule-based systems for better model performance.
result Improves model performance with better uncertainty quantification and point predictions.

Proposes a score to compare rule-based algorithms' interpretability.

problem Lack of consensus on interpretability for predictive models.
method Defines a score with three terms: predictivity, stability, and simplicity, each quantified by simple formulas.
result Compares interpretability of rule-based and tree-based algorithms for regression and classification.

A new stopping rule based on E-values helps efficiently use sampling in Bayesian Deep Ensembles.

problem How long should sampling continue in Bayesian Deep Ensembles to yield significant improvements?
method Formulated as a sequential anytime-valid hypothesis test, using E-values to decide when to stop sampling.
result Only a fraction of the full-chain budget is often required for significant improvements.

In regression problems, the use of TSK fuzzy systems is widely extended due to the precision of the obtained models. Moreover, the use of simple linear TSK models is a good choice in many real problems due to the easy understanding of the relationship between the output and input variables. In this paper we present FRU…

2015-07-17abs ↗pdf ↗

A deep reinforcement learning method with rule-based constraints improves safe and efficient lane changes in autonomous driving.

problem Complex and uncertain traffic environment challenges autonomous driving decision-making.
method Deep Q-Network (DQN) combined with rule-based constraints for lane change decision-making.
result The proposed rule-based DQN method outperforms both rule-based and DQN approaches in a real-world simulator.

FinReflectKG builds a comprehensive financial knowledge graph from SEC filings, improving extraction quality.

problem Lack of large-scale, open-source financial knowledge graph datasets.
method Intelligent document parsing, table-aware chunking, schema-guided iterative extraction, reflection-driven feedback loop.
result Reflection-agent-based mode achieves best balance of efficiency, accuracy, and reliability.

Time series forecasting models fail to consistently select the best model across different datasets.

problem Inconsistency in model selection for time series forecasting across varying data regimes.
method Characterized time series using descriptors like trend strength, seasonality, noise level, and temporal dependence. Developed a rule-based selection mechanism to map data regimes to candidate models.
result Rule-based model selection achieves low accuracy, with correct model identification occurring in only a small fraction of cases.

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

An algorithm was recently introduced by INTECH for the purposes of estimating the trading-profit contribution of systematic rebalancing to the relative return of rules-based investment strategies. We apply this methodology to analyze the size factor through the use of equal-weighted portfolios. These strategies combine…

2016-01-28abs ↗pdf ↗

Rule-based classifiers quantify uncertainty using Bernoulli random variables.

problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.

New rule-based method for classification with scalability, interpretability, and fairness.

problem Developing a scalable and fair classification method.
method Column generation for linear programming, decision tree-based heuristic, and rule-based optimization.
result The method returns interpretable rules with optimal weights and addresses fairness constraints.

pLogicNet combines logic rules and embeddings for efficient knowledge graph reasoning.

problem Efficiently predicting missing facts in knowledge graphs.
method Combines Markov Logic Networks with knowledge graph embeddings using variational EM algorithm.
result pLogicNet outperforms traditional methods on multiple knowledge graphs.

Improved negation detection in Dutch clinical texts using machine learning.

problem Extracting negation from clinical text for better model development.
method Comparison of rule-based and machine learning methods (biLSTM, RoBERTa).
result BiLSTM and RoBERTa models outperform rule-based method in F1 score, precision, and recall.

Proposes RPG-RT for red-teaming T2I models without internal access.

problem Evaluating T2I models' security through red-teaming is challenging due to their closed-source nature and unknown defense mechanisms.
method Integrates LLM and rule-based preference modeling to dynamically adapt to unknown defense mechanisms.
result Demonstrates superior and practical approach for red-teaming T2I models.

SigD2 reduces noisy rules in rule-based classifiers for better accuracy and readability.

problem Redundant and noisy rules in rule-based classifiers reduce model accuracy and readability.
method Two-stage pruning strategy and ensemble methods (bagging and boosting) to reduce noise and improve model performance.
result SigD2 and ACboost ensemble models outperform state-of-the-art classifiers in terms of accuracy and rule count.

Dark Experience improves continual learning with a simple, strong baseline.

problem General Continual Learning in scenarios where tasks are not sequential and offline training is not possible.
method Mixing rehearsal with knowledge distillation and regularization.
result Dark Experience outperforms consolidated approaches and leverages limited resources.

Cubic predicts stock market indices by fusing stock latent embeddings and converting to binary classification.

problem Challenges in predicting stock market indices due to isolated time series treatment and simple regression.
method Fusion of stock latent embeddings, binary encoding classification, and confidence-guided prediction.
result Cubic outperforms state-of-the-art baselines in stock index prediction tasks.

Proposes a neural network for efficient imbalance electricity price forecasting.

problem Accurate and efficient imbalance electricity price forecasting in industrial energy trading systems.
method Market-rule-informed neural network framework.
result The proposed model achieves competitive forecasting performance with fewer parameters and shorter training time.

Bayesian Scattering offers a simple baseline for image data uncertainty.

problem Lack of interpretable, mathematically grounded uncertainty quantification methods for image data.
method Coupling wavelet scattering transform with a simple probabilistic head.
result Bayesian Scattering provides sensible uncertainty estimates under distribution shifts.

Simple graph representation outperforms complex methods in graph classification.

problem Graph classification and representation learning on graphs.
method Developed a simple yet meaningful graph representation and tested its effectiveness.
result Simple graph representation achieves similar performance to state-of-the-art methods for non-attributed graph classification.

Mining relationships between treatment(s) and medical problem(s) is vital in the biomedical domain. This helps in various applications, such as decision support system, safety surveillance, and new treatment discovery. We propose a deep learning approach that utilizes both word level and sentence-level representations …

2018-06-26abs ↗pdf ↗

In a recent paper [1] we introduced the Fuzzy Bayesian Learning (FBL) paradigm where expert opinions can be encoded in the form of fuzzy rule bases and the hyper-parameters of the fuzzy sets can be learned from data using a Bayesian approach. The present paper extends this work for selecting the most appropriate rule b…

2017-03-29abs ↗pdf ↗

Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes, yielding no insight of the underlying learned patterns. In this paper we conside…

2017-02-08abs ↗pdf ↗

CFM-BD builds interpretable fuzzy models for Big Data.

problem Maintaining accuracy and interpretability in fuzzy models for Big Data.
method Distributed learning algorithm with three stages: pre-processing, rule induction, and rule selection.
result CFM-BD constructs simpler models with fewer rules and linguistic labels, achieving competitive accuracy.

Invariant Causal Set Covering Machines avoid spurious associations.

problem Learning algorithms for rule-based models are vulnerable to spurious associations.
method Building on invariant causal prediction, propose Invariant Causal Set Covering Machines for conjunctions/disjunctions of binary-valued rules.
result The method can identify causal parents of a variable of interest in polynomial time.

The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in computational linguistics. The algorithm was not mathematically well understood until (Abney 2004) which analyzed some specific variants of the algorithm, and also proposed some new algorithm…

2012-06-20abs ↗pdf ↗

AI models outperform simple rules in cross-asset futures timing, especially with lower transaction costs.

problem Optimizing cross-asset portfolio weights using traditional forecasting and optimization methods.
method End-to-end AI policies that map market states directly to portfolio weights, trained on CME futures using a differentiable Sharpe ratio loss function.
result Transformer-based AI policies outperform simple rules and equal weighting, trading less and matching or exceeding equal weighting through moderate transaction costs.

Investigates Q value evolution in Stable Baselines for DQL in simple vs complex environments.

problem DQL in Stable Baselines struggles with simple non-game environments.
method Comparison of TrafficLight and FrozenLake environments; Q value decomposition analysis.
result Q values meander far from optimal in complex relationships between states.

Adaptive source selection for positive transfer in linear models improves target dataset performance.

problem Limited task-specific labeled data in business settings.
method Greedily decides from which sources and how many samples to incorporate into the target dataset using an accept/reject rule based on a data-dependent estimate of the transfer gain.
result Consistent gains over classical and recent strong baselines while avoiding negative transfer.