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

3517021,0521,403 · Jun 202019922001200920172026
48 results for Rule-based Models

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.

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.

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.

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.

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.

Multi-label classification (MLC) is a supervised learning problem in which, contrary to standard multiclass classification, an instance can be associated with several class labels simultaneously. In this chapter, we advocate a rule-based approach to multi-label classification. Rule learning algorithms are often employe…

2018-11-30abs ↗pdf ↗

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.

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.

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 ↗

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.

Rule-based models are often used for data analysis as they combine interpretability with predictive power. We present RuleKit, a versatile tool for rule learning. Based on a sequential covering induction algorithm, it is suitable for classification, regression, and survival problems. The presence of a user-guided induc…

2019-08-02abs ↗pdf ↗

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 ↗

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.

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 ↗

Develops a new fuzzy model using QPs and ewl2 regularization to improve local region behavior.

problem Inability of constant and linear functions to accurately describe local regions in fuzzy models.
method Applied Fuzzy C-Means for structure identification, used QPs as consequents, introduced ewl2 regularization.
result Improved model's ability to describe local regions without overfitting.

FinRL-X unifies trading components for AI and rule-based strategies.

problem Inconsistent between research and live deployment in trading platforms.
method Modular architecture integrating data processing, strategy construction, backtesting, and execution.
result Unified protocol supports AI and rule-based trading components without altering execution.

Proposes a fuzzy rule-based method for data visualization.

problem Preserving neighborhood relationships and handling non-linear manifolds in data visualization.
method Uses a first-order Takagi-Sugeno model with clusters and Geodesic c-means clustering for rule generation and parameter estimation.
result Behaves desirably and performs better than or comparable to other methods.

We propose a method for modeling and learning turn-taking behaviors for accessing a shared resource. We model the individual behavior for each agent in an interaction and then use a multi-agent fusion model to generate a summary over the expected actions of the group to render the model independent of the number of age…

2018-12-10abs ↗pdf ↗

Two methods improve 10-K item segmentation using large language models.

problem Challenges in extracting specific items from 10-K reports due to variations in document formats and item presentation.
method Two advanced item segmentation methods: GPT4ItemSeg and BERT4ItemSeg.
result BERT4ItemSeg achieves a macro-F1 of 0.9825, surpassing other methods.

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 ↗

A machine learning model improves relative valuation of municipal bonds.

problem Challenges in determining the value or relative value of municipal bonds.
method Proposes a supervised similarity framework using CatBoost algorithm to identify similar bonds based on risk profiles.
result The similarity-based method outperforms rule-based and heuristic-based methods in back-testing.

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.

Solves the challenge of retrieving item-specific financial information from Form 10-Q filings.

problem Retrieving item-specific information from Form 10-Q filings with varying formats and machine-readable hierarchy.
method Complements a rule-based algorithm with a Convolutional Neural Network (CNN) image classifier to itemize 10-Q files.
result Demonstrates a generalized pipeline for rapid data retrieval from a large volume of textual data.

Brief history and challenges of interpretable machine learning.

problem Challenges in interpreting machine learning models, especially in scientific applications.
method Overview of state-of-the-art methods and discussion of challenges.
result Interpretable machine learning has a rich history but faces significant challenges.

Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is th…

2019-06-20abs ↗pdf ↗

GA-MSSR optimizes forex trading rules for higher returns and reduced risk.

problem Noisy market data affects the consistency and profitability of trading algorithms.
method Optimized trading rules derived from technical indicators using a Genetic Algorithm.
result GA-MSSR achieved superior performance with significant positive returns and reduced risk factors.

We present a new algorithm based on an gradient ascent for a general Active Exploration bandit problem in the fixed confidence setting. This problem encompasses several well studied problems such that the Best Arm Identification or Thresholding Bandits. It consists of a new sampling rule based on an online lazy mirror …

2019-05-20abs ↗pdf ↗

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.