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

Trend · papers per month

136272408544 · Jun 202019922001200920172026
48 results for prediction rules

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.

HRTPP improves TPP interpretability and accuracy in medical event modeling.

problem Lack of interpretability in TPPs for medical event sequences.
method Hybrid-Rule Temporal Point Processes (HRTPP) integrating temporal logic rules and numerical features.
result HRTPP outperforms state-of-the-art interpretable TPPs in predictive performance and clinical interpretability.

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.

In this paper, we study the problem of learning probabilistic logical rules for inductive and interpretable link prediction. Despite the importance of inductive link prediction, most previous works focused on transductive link prediction and cannot manage previously unseen entities. Moreover, they are black-box models …

2019-10-31abs ↗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 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.

Two methods are proposed for high-dimensional shape-constrained regression and classification. These methods reshape pre-trained prediction rules to satisfy shape constraints like monotonicity and convexity. The first method can be applied to any pre-trained prediction rule, while the second method deals specifically w…

2018-05-16abs ↗pdf ↗

This research adapts scoring rules for training survival models, improving predictive performance.

problem Training survival models with traditional methods struggles with censoring.
method Adapting scoring rules for survival analysis, creating a flexible framework for model training.
result Scoring rules can be successfully incorporated into model training, yielding competitive performance.

Proposes PEMI for online selective conformal prediction with asymmetric rules.

problem Challenges of handling asymmetric selection mechanisms in online selective conformal prediction.
method PEMI: permutation-based framework for selective conformal prediction with arbitrary asymmetric selection rules.
result Achieves exact selection-conditional coverage for any asymmetric selection mechanism and any prediction model.

The paper develops deep learning models for personalized treatment rules in survival analysis.

problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points (t1,t2)(t_1, t_2).

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.

Proposes measures for uncertainty quantification using proper scoring rules.

problem Uncertainty quantification for prediction tasks.
method Decomposes proper scoring rules into divergence and entropy components, tailoring uncertainty quantification to specific tasks.
result Flexibility in uncertainty quantification improves performance in selective prediction and active learning.

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.

The nearest neighbor rule is proven consistent in a broad setting.

problem Proving consistency of the nearest neighbor rule in various settings.
method Proving online consistency for all measurable functions in doubling metric spaces under mild assumptions.
result The nearest neighbor rule is online consistent in all measurable functions in doubling metric spaces.

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

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 ↗

With a growing interest in using non-representative samples to train prediction models for numerous outcomes it is necessary to account for the sampling design that gives rise to the data in order to assess the generalized predictive utility of a proposed prediction rule. After learning a prediction rule based on a non…

2017-11-13abs ↗pdf ↗

A new score function improves explainability and reliability of AI systems.

problem Designing AI systems that are explainable, robust, and trustworthy.
method Integrates conformal prediction with explainable machine learning using a novel score function.
result The method achieves improved performance on target classes and satisfies conformal guarantees.

An expanding literature articulates the view that Taylor rules are helpful in predicting exchange rates. In a changing world however, Taylor rule parameters may be subject to structural instabilities, for example during the Global Financial Crisis. This paper forecasts exchange rates using such Taylor rules with Time V…

2014-03-03abs ↗pdf ↗

Kernel Bayes' rule has been proposed as a nonparametric kernel-based method to realize Bayesian inference in reproducing kernel Hilbert spaces. However, we demonstrate both theoretically and experimentally that the prediction result by kernel Bayes' rule is in some cases unnatural. We consider that this phenomenon is i…

2015-07-04abs ↗pdf ↗

TransINT embeds KGs by preserving implication rules, outperforming existing methods.

problem Embedding KGs while preserving relation implications for better access and analysis.
method Isomorphic intersections of linear subspaces with shared parameters for missing facts.
result Significant performance improvement in link prediction and triple classification.

Understanding the behavior of a trained network and finding explanations for its outputs is important for improving the network's performance and generalization ability, and for ensuring trust in automated systems. Several approaches have previously been proposed to identify and visualize the most important features by…

2018-08-29abs ↗pdf ↗

Conditional forecasts improve performative prediction accuracy.

problem Performative predictions undermine standard forecasting methods.
method Condition forecasts on covariates to make them forecast-invariant.
result Proper scoring rules fail under conditioning, but two solutions are identified.

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

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 ↗

Study efficient sequential evaluation of large language models using historical data.

problem Sequentially evaluate a new large language model (LLM) on a fixed question set.
method Construct a confidence sequence (CS) and design active querying rules to shrink CS width.
result Simple uniform sampling can sometimes outperform adaptive querying rules.

Signature kernel scoring rule improves weather forecasting by capturing temporal and spatial dependencies.

problem Lack of suitable scoring rules for probabilistic weather forecasting.
method Reframe weather variables as continuous paths using iterated integrals (signature kernels) to capture temporal and spatial dependencies.
result Signature kernel scoring rule outperforms conventional methods in weather forecasting, especially for long-term forecasts.

This work proposes optimal decision rules for hierarchical classifiers to better align with evaluation metrics.

problem Heuristic decision rules in hierarchical classification do not align with evaluation metrics.
method Derives optimal decision rules for various prediction settings, focusing on hierarchical hFβhF_β scores.
result Optimal decision rules enhance the performance and reliability of hierarchical classifiers.

When people learn mathematical patterns or sequences, they are able to identify the concepts (or rules) underlying those patterns. Having learned the underlying concepts, humans are also able to generalize those concepts to other numbers, so far as to even identify previously unseen combinations of those rules. Current…

2020-01-13abs ↗pdf ↗

In many predictive decision-making scenarios, such as credit scoring and academic testing, a decision-maker must construct a model that accounts for agents' propensity to "game" the decision rule by changing their features so as to receive better decisions. Whereas the strategic classification literature has previously…

2020-02-24abs ↗pdf ↗

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

We consider using an ensemble of binary classifiers for transductive prediction, when unlabeled test data are known in advance. We derive minimax optimal rules for confidence-rated prediction in this setting. By using PAC-Bayes analysis on these rules, we obtain data-dependent performance guarantees without distributio…

2015-01-15abs ↗pdf ↗

The paper argues that machine learning is a falsificationist process.

problem The role of falsification in machine learning is underexplored.
method The paper presents a falsificationist account of artificial neural networks, emphasizing empirical risk minimization and implicit regularization.
result Artificial neural networks can be seen as a falsificationist process, rejecting inadequate prediction rules.