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

491317 · Oct 201819922001200920172026
48 results for date-only recall

We detect lookahead bias in LLM forecasts using a novel statistical method.

problem Detecting lookahead bias in LLM-generated economic forecasts.
method Developed a statistical procedure using date-only recall queries and estimated Lookahead Propensity (LAP).
result LLM forecasts are contaminated with lookahead bias, as indicated by a positive interaction between LAP and the forecast in accuracy regressions.

In a seminal paper "Volumen und Oberfläche" (1903), Minkowski introduced the basic notion of mixed volumes and the corresponding inequalities that lie at the heart of convex geometry. The fundamental importance of characterizing the extremals of these inequalities was already emphasized by Minkowski himself, but has to…

2019-02-26abs ↗pdf ↗

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.

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.

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.

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.

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%.

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.

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.

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.

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.

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.

Improves interpretability of neural network intermediate layers by making concept activations more robust and effective.

problem Challenges in interpreting neural network decisions and learning in intermediate layers due to opacity and shared interactions.
method Proposes A-CAV to increase effectiveness and employs Gram-Schmidt process to improve robustness.
result Significant improvement in recall rate of concept images from 18.35% to 76.83% for VGG16, with reduced variance in recall across different random seeds.

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.

Short sales are regarded as negative purchases in textbook asset pricing theory. In reality, however, the symmetry between purchases and short sales is broken by a variety of costs and risks peculiar to the latter. We formulate an optimal stopping model in which the decision to cover a short position is affected by two…

2019-03-28abs ↗pdf ↗

Despite the tremendous progress in the estimation of generative models, the development of tools for diagnosing their failures and assessing their performance has advanced at a much slower pace. Recent developments have investigated metrics that quantify which parts of the true distribution is modeled well, and, on the…

2019-05-26abs ↗pdf ↗

LLMs can be tricked into recalling facts based on context clues.

problem Manipulation of LLMs' factual recall through context changes.
method Mathematical exploration of transformers' associative memory properties.
result Transformers use self-attention and value matrix for associative memory.

Typically options with a path dependent payoff, such as Target Accumulation Redemption Note (TARN), are evaluated by a Monte Carlo method. This paper describes a finite difference scheme for pricing a TARN option. Key steps in the proposed scheme involve tracking of multiple one-dimensional finite difference solutions,…

2013-04-29abs ↗pdf ↗

Unified framework for sequence models using test-time regression.

problem Designing efficient sequence models with associative memory.
method Formalizing associative recall as regression over input tokens, deriving various sequence models.
result Clarifies the effectiveness of query-key normalization in softmax attention and offers new generalizations.

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.

We analyze a model of learning and belief formation in networks in which agents follow Bayes rule yet they do not recall their history of past observations and cannot reason about how other agents' beliefs are formed. They do so by making rational inferences about their observations which include a sequence of independ…

2015-09-30abs ↗pdf ↗

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.

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.

Paper introduces a new performance metric for class imbalance datasets.

problem Challenges in selecting and comparing models for imbalanced datasets.
method Proposes a new performance measure based on the harmonic mean of Recall and Selectivity normalized in class labels.
result The proposed measure is less sensitive to changes in the majority class and more sensitive to changes in the minority class.

We address challenges of active learning under scarce informational resources in non-stationary environments. In real-world settings, data labeled and integrated into a predictive model may become invalid over time. However, the data can become informative again with switches in context and such changes may indicate un…

2012-06-20abs ↗pdf ↗

Batch normalization improves deep networks by aligning their decision boundaries with data.

problem Improving the performance and generalization of deep networks.
method Theoretical analysis of batch normalization as a function approximation technique for continuous piecewise affine splines.
result Batch normalization adapts the geometry of a deep network's partition to match the data, improving learning and generalization.

This encyclopedia article briefly reviews without proofs some of the main results in cotangent bundle reduction. The article recalls most the necessary prerequisites to understand the main results.

2005-08-31abs ↗pdf ↗