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

5111621 · May 202619922001200920172026
48 results for rule-based checks

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.

The operational space of an autonomous vehicle (AV) can be diverse and vary significantly. This may lead to a scenario that was not postulated in the design phase. Due to this, formulating a rule based decision maker for selecting maneuvers may not be ideal. Similarly, it may not be effective to design an a-priori cost…

2019-03-29abs ↗pdf ↗

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.

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.

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.

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.

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.

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.

We give a definition of an integer-valued function iαixi\sum_i α_i x ^*_i derived from arrow diagrams for the ambient isotopy classes of oriented spherical curves. Then, we introduce certain elements of the free Z\mathbb{Z}-module generated by the arrow diagrams with at most ll arrows, called relators of Type~($\check{…

2019-08-16abs ↗pdf ↗

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 ↗

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.

This paper deforms complex tori and their mirrors using gerbes.

problem Deforming complex tori and their mirror partners.
method Using flat gerbes to deform complex tori and their mirrors, constructing holomorphic line bundles over deformed objects.
result Deformed complex tori and their mirrors can be studied using flat gerbes.

Statistical model checking for PCTL on MDPs using reinforcement learning.

problem Model checking PCTL specifications on MDPs with statistical methods.
method Reinforcement learning for policy search, statistical model checking with UCB-based Q-learning.
result Provably guaranteed statistical model checking method for PCTL specifications on MDPs.

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 ↗

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 ↗

The paper optimizes exceptions in a statistical production system using machine learning.

problem Lack of curated and labeled training data for machine learning in data quality assurance.
method Explainable supervised machine learning to identify and prioritize exceptions.
result Improvement in the quality and efficiency of exceptions generated and authenticated by users.

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.

State-of-the-art password guessing tools, such as HashCat and John the Ripper, enable users to check billions of passwords per second against password hashes. In addition to performing straightforward dictionary attacks, these tools can expand password dictionaries using password generation rules, such as concatenation…

2017-09-01abs ↗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.

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 ↗

Proves SYZ mirror symmetry for del Pezzo and rational elliptic surfaces.

problem Proving mirror symmetry for specific Calabi-Yau surfaces.
method Adapting Hein's work, constructing asymptotically semi-flat Calabi-Yau metrics, and defining a mirror map.
result Existence and uniqueness of Calabi-Yau metrics on YDY\setminus D.

We describe the infinitesimal moduli space of pairs (Y,V)(Y, V) where YY is a manifold with G2G_2 holonomy, and VV is a vector bundle on YY with an instanton connection. These structures arise in connection to the moduli space of heterotic string compactifications on compact and non-compact seven dimensional spaces, e.…

2016-07-12abs ↗pdf ↗

By the SYZ construction, a mirror pair (X,Xˇ)(X,\check{X}) of a complex torus XX and a mirror partner Xˇ\check{X} of the complex torus XX is described as the special Lagrangian torus fibrations XBX \rightarrow B and XˇB\check{X} \rightarrow B on the same base space BB. Then, by the SYZ transform, we can construct a simpl…

2019-05-02abs ↗pdf ↗

We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANRANR-continuum is a VGnV^n_G-continuum provided dimGX=n1\dim_GX=n\geq 1 and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, where GG is a principal ideal domain. This implies that any homogeneous nn-dimensional metric ANRANR-continuum with $\check{H}^n(X;G)\neq…

2012-08-31abs ↗pdf ↗

We specify a result of Yokoi \cite{yo} by proving that if GG is an abelian group and XX is a homogeneous metric ANRANR compactum with dimGX=n\dim_GX=n and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, then XX is an (n,G)(n,G)-bubble. This implies that any such space XX has the following properties: Hˇn1(A;G)0\check{H}^{n-1}(A;G)\neq 0 for every closed…

2014-03-18abs ↗pdf ↗

New method evaluates language model forecasters by checking consistency of predictions.

problem Evaluating the performance of language model forecasters is difficult due to lack of ground truth.
method Developed a consistency check framework based on arbitrage to evaluate forecasters.
result Consistency metrics correlate with ground truth performance of LLM forecasters.

Study how past radiation determines present matter in Penrose's cyclic cosmology.

problem Determining matter content in the present eon from past radiation in Penrose's cyclic cosmology.
method Solve Einstein's equations for a spherical wave in the past eon, then apply reciprocity to find the present eon's matter content.
result The present eon is filled with three types of radiation: a damped wave, an in-going wave, and randomly scattered waves.

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.