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

2575147701,027 · Jun 202019922001200920172026
48 results for ground-truth generation

RealCause provides a realistic benchmark for causal inference.

problem Lack of a reliable benchmark for comparing causal effect estimators.
method Flexible generative models to create a benchmark that is both ground-truth and realistic.
result Evaluation of over 1500 causal estimators provides evidence for choosing hyperparameters using predictive metrics.

Paper introduces metrics to evaluate missing data imputation without ground truth.

problem Handling missing data in time series without ground truth.
method Introduces Wasserstein distance (WD) and Jensen-Shannon divergence (JSD) as metrics to evaluate imputation quality.
result WD and JSD are effective metrics for assessing missing data imputation quality.

Generative model combines multi-dimensional annotations for more accurate ground truth estimation.

problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.

SAMPLR optimizes for ground truth in aleatoric parameters to avoid curriculum-induced covariate shift.

problem Curriculum learning shifts training distribution, leading to suboptimal policies in aleatoric settings.
method SAMPLR optimizes ground-truth utility function, avoiding curriculum-induced covariate shift.
result SAMPLR preserves optimality under ground-truth distribution, promoting robustness across various environments.

Estimates classifier errors without ground truth using algebraic geometry.

problem Lack of ground truth in real-world production systems.
method Non-parametric estimation using algebraic geometry to solve the self-assessment problem.
result Accuracy estimators are better than one part in a hundred.

Improved generalization with iterative self-distillation using weighted ground-truth targets.

problem Improving generalization accuracy in neural networks.
method Iterative kernel regression with weighted ground-truth targets and 2\ell_2 regularization.
result Closed-form solution for optimal weighting parameter and efficient estimation.

Universally valid ground truth is almost impossible to obtain or would come at a very high cost. For supervised learning without universally valid ground truth, a recommended approach is applying crowdsourcing: Gathering a large data set annotated by multiple individuals of varying possibly expertise levels and inferri…

2018-07-31abs ↗pdf ↗

Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.

problem Tackles noisy supervision in multi-label learning with partially valid labels.
method Develops a two-stage method that estimates label enrichment and ground-truth confidences.
result Demonstrates improved performance over state-of-the-art PML methods.

Noise affects the effectiveness of interpolating models, especially those with strong inductive biases.

problem The impact of noise on interpolating models with strong inductive biases.
method Analyzing linear and classification models with sparse ground truths, proving fast rates for interpolators.
result Strong inductive biases can lead to faster but noisier interpolators, contrary to intuition.

Recently developed deep-learning-based denoisers often outperform state-of-the-art conventional denoisers such as the BM3D. They are typically trained to minimize the mean squared error (MSE) between the output image of a deep neural network (DNN) and a ground truth image. Thus, it is important for deep-learning-based …

2018-03-04abs ↗pdf ↗

New research shows the maximum ℓ1-margin classifier doesn't adapt to sparse ground truths.

problem Understanding the limitations of the maximum ℓ1-margin classifier in high-dimensional settings.
method Analyzing convergence and prediction error rates of the maximum ℓ1-margin classifier.
result Proves tight upper and lower bounds for prediction error, showing benign overfitting.

QUACKIE creates a new benchmark for NLP interpretability.

problem Evaluating NLP interpretability methods is challenging due to biased ground truths.
method Formulated a custom classification task from question-answering datasets, generating unbiased ground truths.
result Demonstrated the effectiveness of current interpretability methods on the new benchmark.

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

Unsupervised clustering can reproduce categorization systems if features and metrics are correctly selected.

problem Reproducing expert-provided categorization systems using unsupervised clustering.
method Investigated using toy datasets and real-world fund categorization. Used appropriate feature selection and a supervised Random Forest-based distance metric.
result Unsupervised clustering can reproduce ground truth classes if features and metrics are correctly selected.

Regression analysis is a standard supervised machine learning method used to model an outcome variable in terms of a set of predictor variables. In most real-world applications we do not know the true value of the outcome variable being predicted outside the training data, i.e., the ground truth is unknown. It is hence…

2019-10-09abs ↗pdf ↗

Unsupervised recalibration (URC) is a general way to improve the accuracy of an already trained probabilistic classification or regression model upon encountering new data while deployed in the field. URC does not require any ground truth associated with the new field data. URC merely observes the model's predictions a…

2019-08-24abs ↗pdf ↗

We give a new algorithm for learning a two-layer neural network under a general class of input distributions. Assuming there is a ground-truth two-layer network y=Aσ(Wx)+ξ, y = A σ(Wx) + ξ, where A,WA,W are weight matrices, ξξ represents noise, and the number of neurons in the hidden layer is no larger than the input or outp…

2018-10-16abs ↗pdf ↗

Autonomy and adaptation of machines requires that they be able to measure their own errors. We consider the advantages and limitations of such an approach when a machine has to measure the error in a regression task. How can a machine measure the error of regression sub-components when it does not have the ground truth…

2019-06-17abs ↗pdf ↗

Study robustness of conformal prediction to label noise in regression and classification.

problem Robustness of conformal prediction to label noise in regression and classification.
method Characterized robustness of conformal prediction for both regression and classification problems, extending theory to control general loss functions.
result Conformal prediction and risk-controlling techniques can achieve conservative risk over clean ground truth labels with noisy labels.

TOO optimizes stochastic epidemiological models by finding both parameter settings and random seeds.

problem Calibrating stochastic epidemiological models to match empirical observations.
method Gaussian process surrogates and Thompson sampling for optimization.
result Produces actual trajectories consistent with ground truth.

Develops a goodness-of-fit test for self-exciting processes.

problem Quantifying how well generative models capture self-exciting point processes.
method Connects to Quasi-maximum-likelihood estimator (QMLE) theory and develops a non-parametric self-normalizing statistic, the Generalized Score (GS) statistics.
result Validates the proposed GS test's good performance through numerical simulation and real-data experiments.

Preconditioned SGD accelerates convergence for ill-conditioned huge-scale matrix completion.

problem Recovering a low-rank matrix from incomplete data with high condition number.
method Preconditioned Stochastic Gradient Descent (SGD) for huge-scale online optimization.
result Preconditioned SGD converges to ε-accuracy in O(log(1/ε)) iterations, compared to O(κlog(1/ε)) for unpreconditioned SGD.

Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate …

2016-08-20abs ↗pdf ↗

Study reveals issues with neural autoregressive models and proposes mode recovery cost.

problem Unreasonable affinity of neural autoregressive models to short and long sequences.
method Investigates modes of ground-truth, empirical, and decoding-induced distributions via mode recovery cost.
result Mode recovery cost varies depending on ground-truth distribution and impacts decoding-induced distribution.

The paper analyzes GNNs with one hidden layer, proving their generalizability and convergence rate.

problem Theoretical guarantee on generalizability of GNNs with one hidden layer.
method Tensor initialization and accelerated gradient descent.
result The proposed learning algorithm converges to the ground-truth GNN model for regression and to a model close to the ground-truth for binary classification.

It is widely believed that sharing gradients will not leak private training data in distributed learning systems such as Collaborative Learning and Federated Learning, etc. Recently, Zhu et al. presented an approach which shows the possibility to obtain private training data from the publicly shared gradients. In their…

2020-01-08abs ↗pdf ↗

New method estimates model performance bounds without ground truth labels.

problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.

The paper formalizes feature attribution to address inconsistent definitions and evaluate methods.

problem Inconsistent definitions of feature relevance in feature attribution.
method Formalization based on relaxed functional dependence, extended to instance-wise setting.
result State-of-the-art methods often fail to verify necessary properties for candidate selection.

Reanalysis datasets combining numerical physics models and limited observations to generate a synthesised estimate of variables in an Earth system, are prone to biases against ground truth. Biases identified with the NASA Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA-2) aerosol optic…

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