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

Trend · papers per month

64128192256 · Jun 202019922001200920172026
48 results for reference validity

Study validates ML-UQ calibration statistics using simulated reference values.

problem Validation of ML-UQ calibration statistics is lacking due to lack of predefined reference values.
method Proposed validation workflow using simulated reference values derived from synthetic datasets.
result Some statistics, like CC and ENCE, are overly sensitive to generative distribution choice.

The paper analyzes how conformal prediction works with contaminated reference data.

problem The impact of contamination on the validity and power of conformal prediction methods.
method The paper analyzes the impact of contamination on the validity of conformal methods and proposes a data-cleaning framework to enhance power.
result The proposed data-cleaning framework can effectively enhance power while maintaining type-I error control.

New methods improve LLM preference optimization by intelligently weighting multiple reference models.

problem Improving LLM preference optimization with multiple reference models.
method Introducing four new weighting strategies for multiple-reference preference optimization.
result All four new weighting strategies outperform current methods on preference accuracy.

A new method for releasing AI workflows to avoid premature incorrect results.

problem Statistical challenges in releasing AI workflows with adaptive scoring.
method Wrapper that calibrates and accumulates evidence from high-scoring failures.
result Reduces premature incorrect release while still releasing on moderate evidence.

This paper uses reference priors to improve deep learning models with unlabeled and labeled data.

problem Improving deep learning models with limited labeled data and unlabeled data from the same or related tasks.
method Develops and applies generalizations of reference priors for deep networks to exploit unlabeled and labeled data.
result Demonstrates new semi-supervised learning and pretraining methods for transfer learning.

A new test validates ensemble models against the null hypothesis.

problem Validating ensemble models against the null hypothesis of a constant response.
method Randomized permutation test on SVEM model predictions.
result The test maintains Type I error rate even with more parameters than observations.

New measures for prediction validity and consonant plausibility introduced.

problem Challenges in predicting future observations and quantifying prediction uncertainty.
method Introducing Type-2 validity and using consonant plausibility measures and conformal prediction.
result Achieving both Type-1 and Type-2 validity through consonant plausibility measures and conformal prediction.

This work bridges outlier and drift detection by comparing inputs to a part of the reference distribution.

problem Monitoring machine learning models to ensure they operate within their validated distribution.
method Comparing a set of inputs to a chosen part of the reference distribution.
result A new approach that bridges outlier detection and drift detection.

This paper improves model training by using a reference model to guide target model training.

problem Improving generalization and data efficiency in model training.
method DRRho risk minimization framework based on Distributionally Robust Optimization (DRO).
result DRRho risk minimization improves generalization and data efficiency compared to training without a reference model.

Auto-regressive sequence-to-sequence models with attention mechanism have achieved state-of-the-art performance in many tasks such as machine translation and speech synthesis. These models can be difficult to train. The standard approach, teacher forcing, guides a model with reference output history during training. Th…

2019-09-26abs ↗pdf ↗

CDL index improves clustering validation for non-convex data.

problem Selecting clustering algorithms and hyperparameters without labeled data.
method CDL uses compactness, centers, and covariances to compute a probabilistic description length bound.
result CDL outperforms conventional CVIs on synthetic and image benchmarks.

New deep learning method validated across multiple sleep staging databases.

problem Improving automatic sleep scoring accuracy across different datasets.
method Ensemble of local models using deep learning for automatic sleep staging.
result Good general performance compared to human experts and state-of-the-art methods.

This paper employs machine learning algorithms to forecast German electricity spot market prices. The forecasts utilize in particular bid and ask order book data from the spot market but also fundamental market data like renewable infeed and expected demand. Appropriate feature extraction for the order book data is dev…

2019-06-14abs ↗pdf ↗

In spaces of nonpositive curvature the existence of isometrically embedded flat (hyper)planes is often granted by apparently weaker conditions on large scales. We show that some such results remain valid for metric spaces with non-unique geodesic segments under suitable convexity assumptions on the distance function al…

2015-08-11abs ↗pdf ↗

The paper proposes a method to learn evolving multivariate distributions from sample paths.

problem Learning the temporal evolution of multivariate densities from sample data.
method Normalizing flows to construct time-dependent mappings.
result The method can approximate evolving probability density functions from observed data.

Meta-learning reduces set prediction size in conformal prediction for few-shot calibration.

problem Inefficient set prediction in conformal prediction for limited training data.
method Meta-learning approach using cross-validation-based conformal prediction.
result Meta-learning scheme reduces set prediction size and preserves formal guarantees.

We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…

2013-01-02abs ↗pdf ↗

It has been noticed that some external CVIs exhibit a preferential bias towards a larger or smaller number of clusters which is monotonic (directly or inversely) in the number of clusters in candidate partitions. This type of bias is caused by the functional form of the CVI model. For example, the popular Rand index (R…

2016-06-17abs ↗pdf ↗

Paper tackles rDR classification and lesion segmentation using self-supervised equivariant learning and attention-based MIL.

problem Classifying rDR and segmenting lesions from image-level labels.
method Integrates self-supervised equivariant attention mechanism (SEAM) with attention-based multi-instance learning (MIL).
result Achieved AU ROC of 0.958 on Eyepacs dataset, outperforming state-of-the-art.

Automatically detects and down-weights noisy samples in machine learning training.

problem Numerical noise in reference data hampers the accuracy of machine learning models.
method On-the-fly outlier detection using exponential moving average to identify and down-weight noisy samples.
result The method prevents overfitting and matches the performance of iterative refinement with reduced overhead.

UK's rapid vaccine rollout linked to reduced COVID-19 mortality.

problem Assessing the impact of accelerated vaccine rollout on public health outcomes.
method Flexible probabilistic models combining interrupted time series analysis and synthetic control methods with multi-output Gaussian processes.
result Substantial reduction in COVID-19 mortality with little effect on transmission rates.

Recently, many regularized procedures have been proposed for variable selection in linear regression, but their performance depends on the tuning parameter selection. Here a criterion for the tuning parameter selection is proposed, which combines the strength of both stability selection and cross-validation and therefo…

2013-01-30abs ↗pdf ↗

LLMs fail to match statistical ground truth despite stable run-to-run performance.

problem LLMs lack validation against statistical ground truth in automated scientific workflows.
method Introduced a behavioral evaluation framework for LLMs, separating four decision-making dimensions.
result LLMs can exhibit near-perfect stability but diverge from statistical ground truth.

In many real-world applications, data are often collected in the form of stream, and thus the distribution usually changes in nature, which is referred as concept drift in literature. We propose a novel and effective approach to handle concept drift via model reuse, leveraging previous knowledge by reusing models. Each…

2018-09-08abs ↗pdf ↗

A general framework of least squares support vector machine with low rank kernels, referred to as LR-LSSVM, is introduced in this paper. The special structure of low rank kernels with a controlled model size brings sparsity as well as computational efficiency to the proposed model. Meanwhile, a two-step optimization al…

2019-01-29abs ↗pdf ↗

Root Cause Analysis for Anomalies is challenging because of the trade-off between the accuracy and its explanatory friendliness, required for industrial applications. In this paper we propose a framework for simple and friendly RCA within the Bayesian regime under certain restrictions (that Hessian at the mode is diago…

2018-08-13abs ↗pdf ↗

New method generates plausible counterfactuals for time series classification.

problem Generating realistic counterfactuals for time series data.
method Gradient-based optimization with soft-DTW alignment and multi-faceted loss function.
result Our method outperforms existing approaches in temporal realism and distributional alignment.

One significant challenge to scaling entity resolution algorithms to massive datasets is understanding how performance changes after moving beyond the realm of small, manually labeled reference datasets. Unlike traditional machine learning tasks, when an entity resolution algorithm performs well on small hold-out datas…

2015-09-10abs ↗pdf ↗

We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating examples, we have corrected previous misunderstandings on the topological prope…

2013-05-09abs ↗pdf ↗

This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in high-dimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we s…

2007-04-09abs ↗pdf ↗

We investigated the temporally evolving network structures of the Japanese and Korean stock markets through the minimum spanning trees composed of listed stocks. We tested the validity of conventional grouping by industrial categories, and found a common trend of decrease for Japan and Korea. This phenomenon supports t…

2005-11-27abs ↗pdf ↗

Defines cost of MEV and shows its relevance in various settings.

problem Excess value miners can realize by manipulating transaction order.
method Introduces a simple theoretical definition of cost of MEV, proves properties, and provides examples.
result Reveals the cost of MEV is related to the 'smoothness' of a function over the symmetric group.

The paper proposes a method to select clusters, models, and algorithms based on quadratic discriminant scores.

problem Selecting the number of clusters, models, and algorithms in cluster analysis.
method Develops quadratic scores for cluster quality, uses bootstrap resampling, and compares partitions.
result The proposed method achieves better overall performance compared to other state-of-the-art methods.