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

54108161215 · May 202619922001200920172026
48 results for Causal Rule Ensemble

CRE discovers interpretable subgroups with heterogeneous treatment effects.

problem Identifying subgroups with notable treatment effect heterogeneity.
method Causal Rule Ensemble (CRE) using an ensemble-of-trees approach.
result CRE offers interpretable decision rules and high stability in subgroup discovery.

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

Proposes an interpretable machine learning framework for multi-arm HTE estimation.

problem Challenges in estimating heterogeneous treatment effects in multi-arm settings.
method Rule-based ensemble approach for HTE estimation in multi-arm trials.
result Achieved lower bias and higher estimation accuracy compared to existing methods.

Valid causal inference with invalid instruments using majority or modal valid relationships.

problem Estimating causal effects in the presence of unobserved confounding and invalid instruments.
method Ensemble of instrumental variable estimators to estimate the modal prediction, achieving accurate estimates of conditional average treatment effects.
result Valid causal inference can be achieved with a majority or modal valid instrument-response relationship.

The paper tackles causal rule discovery from observational data.

problem Challenges in inferring causal effects from observational data due to confounding factors and high variance.
method Measures causal effect from observational data, providing graphical criteria and a conservative estimator.
result Proposes an efficient algorithm that maximises the estimator and discovers meaningful causal rules.

Caus-Modens uses deep ensembles to better predict causal outcomes in hidden confounding scenarios.

problem Predicting causal outcomes in the presence of hidden confounders.
method Caus-Modens employs a modulated ensemble approach to improve prediction intervals for causal outcomes using sensitivity models.
result Caus-Modens provides tighter prediction intervals for causal outcomes compared to existing methods.

In this article, the logic rule ensembles approach to supervised learning is applied to the unsupervised or semi-supervised clustering. Logic rules which were obtained by combining simple conjunctive rules are used to partition the input space and an ensemble of these rules is used to define a similarity matrix. Simila…

2012-07-17abs ↗pdf ↗

This paper improves prediction rule ensembles using model-based data generation.

problem Improving the sparsity and predictive accuracy of prediction rule ensembles.
method The authors use surrogate models to train Lasso regression with data generated by a boosted decision tree ensemble, improving PRE performance.
result The use of surrogacy models can substantially improve the sparsity of PRE while retaining predictive accuracy.

A new ensemble method using random projections for kNN classification.

problem Improving kNN classification accuracy through ensemble methods.
method Random projection of bootstrap samples into lower dimensions, using extended neighbourhood rule for base learners.
result Enhanced classification accuracy compared to traditional kNN and other ensembles.

We propose a method to extract interpretable rules from tree ensembles.

problem Tree ensembles are accurate but hard to interpret.
method Propose an estimator to extract compact sets of decision rules from tree ensembles.
result Our estimator improves accuracy and reveals useful relationships in the data.

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.

A new ensemble method improves kNN performance by extending the neighborhood rule.

problem Traditional kNN's limitations when test points are outside the spherical region and ensemble's high errors.
method Determines neighbors in k steps, using bootstrap samples and optimal models selection.
result The proposed ensemble method outperforms state-of-the-art methods on 17 benchmark datasets.

CRL approach improves understanding of heterogeneous treatment effects in complex diseases.

problem Estimating heterogeneous treatment effects in complex diseases.
method Causal rule learning (CRL) workflow consisting of rule discovery, selection, and analysis.
result CRL outperforms other methods in providing interpretable estimates of HTE.

Causal trees struggle with accuracy in estimating treatment effects.

problem Estimating heterogeneous causal treatment effects using recursive decision trees.
method Adaptive recursive partitioning with and without sample splitting.
result Causal tree estimators can have uniform-norm errors decreasing more slowly than any power of the sample size.

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.

We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which allows for the learning of rules that generalize well on unseen data even in imbalanced settings. Weak…

2019-11-15abs ↗pdf ↗

This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences and interactions. Our problem formulation accordingly trades off rule set comple…

2019-06-05abs ↗pdf ↗

Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based le…

2014-08-23abs ↗pdf ↗

EnKBS smoothes complex systems with future observations for causal inference.

problem Improving state estimation in complex systems with rapid dynamics.
method Continuous-time ensemble Kalman-Bucy smoother for nonlinear dynamical systems.
result EnKBS provides derivative-free framework with high skill in various scientific problems.

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.

The paper classifies ruled surfaces in Lorentz-Minkowski space that are stationary for the moment of inertia.

problem Classifying ruled surfaces in Lorentz-Minkowski space that are stationary for the moment of inertia.
method Maximum principle applications, classification based on causal character of rulings.
result Planes are the only cylindrical stationary surfaces. For non-cylindrical surfaces, classification depends on the causal character of the rulings.

We describe, in the general setting of closed cone fields, the set of causal functions which can be approximated by smooth Lyapunov. We derive several consequences on causality theory. Dans le contexte général des champs de cones fermés, on décrit l'ensemble des fonctions causales qui peuvent être approchées par des fo…

2017-11-10abs ↗pdf ↗

New framework optimizes decisions under uncertainty considering causal and continuous data.

problem Optimizing decisions under uncertain distributions with causal and continuous data structures.
method Developed a framework using Causal Sinkhorn DRO with Soft Regression Forest decision rules.
result Framework provides interpretable and tractable decision rules for optimizing under uncertainty.

E-CIT framework reduces CITs' computational burden and improves causal discovery performance.

problem High computational cost of traditional CITs in causal discovery.
method E-CIT framework using divide-and-aggregate strategy with stable distribution p-value combination.
result Significant reduction in computational burden and competitive performance in causal discovery.

New method improves model explainability and accuracy with low computational cost.

problem Improving model explainability and accuracy in classification models.
method Distributionally robust optimization to learn sparse ensembles of rule sets.
result Improves model performance on various metrics compared to competing methods.

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.

In this article, we have proposed several approaches for post processing a large ensemble of prediction models or rules. The results from our simulations show that the post processing methods we have considered here are promising. We have used the techniques developed here for estimation of quantitative traits from mar…

2011-12-16abs ↗pdf ↗

The paper develops a stationary-distribution theory for Random Forest ensemble size selection.

problem Determining the optimal number of trees in Random Forests.
method Modeling the ensemble size as a birth-death Markov chain and deriving its stationary distribution.
result The stationary ensemble size BB_* scales as O(ε2)O(\varepsilon^{-2}) as ε0\varepsilon\downarrow 0.

We propose a new Bayesian model for flexible nonlinear regression and classification using tree ensembles. The model is based on the RuleFit approach in Friedman and Popescu (2008) where rules from decision trees and linear terms are used in a L1-regularized regression. We modify RuleFit by replacing the L1-regularizat…

2017-02-16abs ↗pdf ↗

A new gradient boosting method improves interpretability of probabilistic models.

problem Learning interpretable yet accurate probabilistic models with limited rule complexity.
method A new objective function that measures the angle between risk gradient and condition output vector projection.
result Significantly improves comprehensibility/accuracy trade-off of fitted ensemble.