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

212425637849 · Jun 202019922001200920172026
48 results for recall improvement

Paper proposes a human-algorithm approach to reduce medical device recall risk and workload.

problem High recall rate and regulatory workload in FDA's 510(k) pathway.
method Developed machine learning models to estimate recall risk and proposed a data-driven clearance policy.
result Conservative evaluation of policy shows a 32.9% improvement in recall rate and 40.5% reduction in workload.

Study improves detection of cryptocurrency pump-and-dump schemes.

problem Class imbalance in P&D detection due to rare events.
method Synthetic Minority Oversampling Technique (SMOTE) and ensemble learning models.
result XGBoost and LightGBM achieved high recall rates (94.87% and 93.59%) with strong F1-scores.

RAGuard improves safety in LLMs for offshore wind maintenance.

problem Conventional LLMs fail with specialised or unexpected scenarios in offshore wind maintenance.
method Integrates safety-critical documents alongside technical manuals in RAG framework.
result RAGuard increases safety recall from almost 0% to over 50% while maintaining technical recall above 60%.

This paper introduces a new method to train normalizing flows using precision-recall divergences.

problem Training generative models with mode dropping and low-quality samples.
method Introduces PR-divergences and proposes a novel generative model to minimize precision-recall trade-offs.
result Normalizing flows can be trained to achieve specific precision-recall trade-offs using PR-divergences.

Smooth calibration improves forecast reliability even with leaked information.

problem Improving forecast reliability with leaked information.
method Combining nearby forecasts to ensure smooth calibration, which can be guaranteed by deterministic procedures.
result Smooth calibration can be guaranteed by deterministic procedures even with leaked forecasts, and it yields uncoupled finite-memory dynamics in games.

The study formalizes temporal precision and recall for anomaly detection in sequences.

problem Insufficient understanding of precision and recall in sequential anomaly detection.
method Formalized temporal precision and recall measures, developed time-tolerant confusion matrices, and demonstrated statistical significance.
result Precision and recall may overestimate performance with temporal tolerance.

KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.

problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.

Transformers can store facts efficiently using associative memories.

problem Understanding how transformers store and recall factual information.
method Proved linear scaling of storage capacities for linear and MLP associative memories, introduced a synthetic task, and analyzed gradient flow.
result Shallow transformers can achieve near optimal storage capacity for factual recall tasks using associative memories.

LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.

problem Hard causal discovery in nonparametric settings with exponential complexity.
method Local Discovery by Partitioning (LDP) for causal inference around exposure-outcome pairs.
result LDP yields less biased and more precise estimates than baseline methods.

We recall the similarities between the concepts and techniques of Thermodynamics and Roegenian Economics. The Phase Diagram for a Roegenian economic system highlights a triple point and a critical point, with related explanations. These ideas can be used to improve our knowledge and understanding of the nature of devel…

2018-11-06abs ↗pdf ↗

LLMs can memorize economic data and recall exact values before their training cutoff.

problem Evaluating the trustworthiness of LLMs' economic forecasts during their training period.
method Demonstrated through counterfactual forecasting and analysis of LLMs' recall ability.
result LLMs have memorized economic and financial data, leading to recall-level accuracy before their knowledge cutoff.

Paper tackles imbalanced binary classification by optimizing precision and recall directly.

problem Imbalanced binary classification where standard accuracy is misleading.
method Exact constrained reformulations for precision and recall optimization.
result ERO framework outperforms state-of-the-art methods on multiple datasets.

The paper proposes a method to improve random forest classification accuracy by weighting trees based on their decision path reliability.

problem Random forests' uniform voting fails to correct errors in regions where incorrect tree representations outnumber correct ones.
method The paper introduces using the structural pattern of each tree's decision path as an instance-adaptive reliability signal to identify and weight more reliable trees.
result Using the proposed method yields a statistically significant accuracy improvement over RF on 36 binary classification benchmarks.

Over the last decade there has been increasing concern about the biases embodied in traditional evaluation methods for Natural Language Processing/Learning, particularly methods borrowed from Information Retrieval. Without knowledge of the Bias and Prevalence of the contingency being tested, or equivalently the expecta…

2015-04-03abs ↗pdf ↗

Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…

2014-05-09abs ↗pdf ↗

New method improves causal discovery in time series with latent confounders.

problem Low recall in causal discovery for autocorrelated time series with latent confounders.
method Iterative procedure that includes causal parents in conditioning sets, using novel orientation rules.
result Significantly higher recall compared to existing methods, especially in strong autocorrelation cases.

Framework for precise recall control in spatial conflation tasks.

problem Precise recall control in large-scale spatial conflation tasks to avoid downstream analytics failures and excessive manual review.
method End-to-end framework using equigrid bounding-box filter, CSR representation, neural ranker, and inverse-variance weighted ensemble of threshold estimators.
result Achieves exact recall with sub-percent variance over tens of millions of geometry pairs, runs on a single TPU v3 core.

A new method for generating replay samples on the fly, optimizing for not forgetting.

problem Addressing the issue of forgetting in neural networks.
method Generates auxiliary samples on the fly using the model's implicit memory, specialized to each real training batch.
result Optimizing for not forgetting leads to more efficient and scalable generation of specialized samples.

The paper critiques and expands on common evaluation metrics in machine learning.

problem The common evaluation metrics like Precision, Recall, F-Measure, and Rand Accuracy are biased and misleading.
method The paper introduces new measures like Informedness, Markedness, and Correlation to better reflect the quality of predictions.
result A system that performs worse in terms of Informedness can appear better using common measures like Precision and Recall.

The increase in data collection has made data annotation an interesting and valuable task in the contemporary world. This paper presents a new methodology for quickly annotating data using click-supervision and hierarchical object detection. The proposed work is semi-automatic in nature where the task of annotations is…

2018-10-01abs ↗pdf ↗

Study develops and improves risk models using machine learning methods.

problem Classifying business delinquency using machine learning.
method Exploring several machine learning methods including regularization, hyper-parameter optimization, and model ensembling.
result Bagging on KNN with K=9 is the optimal model for risk classification.

We recall and partially improve four versions of smooth, non-abelian gerbes: Cech cocycles, classifying maps, bundle gerbes, and principal 2-bundles. We prove that all these four versions are equivalent, and so establish new relations between interesting recent developments. Prominent partial results we prove are a bij…

2011-03-24abs ↗pdf ↗

Model infers mineral locations from geospatial data, improving predictions with auxiliary data.

problem Challenges in characterizing hidden mineral deposits underground.
method Generative modeling approach using masked and infilled geospatial maps.
result Models achieve Dice coefficients of 0.31 and recalls of 0.22 at 1×1 mi² resolution.

New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.

problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.

Machine Learning (ML) helps us to recognize patterns from raw data. ML is used in numerous domains i.e. biomedical, agricultural, food technology, etc. Despite recent technological advancements, there is still room for substantial improvement in prediction. Current ML models are based on classical theories of probabili…

2019-03-04abs ↗pdf ↗

AI random forest model improves credit risk scoring for Azerbaijani SMEs.

problem Improving accuracy in identifying defaulters for SME loans.
method Used Python to compare a Delphi model with a random forest model, measuring accuracy, precision, recall, and F-1 scores.
result Significant improvements in model performance (e.g., from 0.69 to 0.83 in accuracy).

The optimal ranking score between precision and recall is rarely F1 and can be found using specific methods.

problem Finding a meaningful and optimal compromise between precision and recall scores.
method Established a shortest path between precision- and recall-induced rankings, framed the problem as an optimization problem, and provided theoretical tools to find the optimal β.
result F1 and its skew-insensitive version are not optimal tradeoffs between precision and recall scores.

Efficiently selects nearest neighbors for labeling to speed up active learning.

problem Intractable active learning and search for large-scale unlabeled data.
method Restricts candidate pool to nearest neighbors of labeled set.
result Achieved similar performance to global approach but reduced computational cost by up to 3 orders of magnitude.

DIAL learns embeddings to maximize recall and accuracy for entity resolution.

problem Low resource settings for entity resolution with large Cartesian product search space.
method DIAL uses an Index-By-Committee framework with pre-trained transformer language models to jointly learn embeddings for recall and accuracy.
result DIAL achieves high precision, recall, and efficiency on benchmark datasets.

Transformers recall from long distributions with statistical guarantees.

problem Designing Transformers that can recall from arbitrarily long, distributional contexts.
method Recast associative memory as probability measures, decomposing the task into recall and prediction.
result A shallow measure-theoretic Transformer learns the recall-and-predict map under spectral assumptions.