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.
Crowdsourcing infers ground truth from multiple annotators, verified for supervised learning.
problem Obtaining universally valid ground truth for supervised learning is challenging and costly.
method Gather multiple annotations from diverse individuals, verify and aggregate for training classifiers.
result Inferred ground truth improves classifier performance in sensitive tasks like mitosis detection.
Paper proposes metrics to evaluate AI explanations without ground truth.
problem Challenges in evaluating neural network explanations without ground truth.
method Designs four metrics to evaluate explanation results.
result New insights into neural network interpretation methods.
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.
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.
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.
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.
Tests for classifier independence without ground truth labels.
problem Validation of classifier independence without ground truth labels.
method Exact solution for independent binary classifiers using algebraic geometry.
result Self-consistent test for classifier independence without ground truth labels.
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.
Paper estimates regression errors without known ground truth.
problem Estimating regression errors when ground truth is unknown.
method Developed a framework to estimate generalization error.
result Framework robustly detects concept drift in real-world datasets.
A new score measures data reliability without ground truth.
problem Assessing reliability of datasets without access to ground truth.
method Define ground-truth-based orderings and propose Gram determinant score.
result Gram determinant score effectively captures data quality across diverse observation processes.
New method falsifies causal discovery results without ground truth.
problem Evaluation of causal discovery algorithms without ground truth data.
method Detects incompatibilities between causal graphs learned on different subsets of variables.
result Detection of incompatibilities can falsify wrongly inferred causal relations.
New method accounts for uncertainty in medical AI evaluations.
problem Uncertainty in ground truth affects AI model performance estimates.
method Statistical aggregation approach to infer probabilities of medical conditions.
result Performance estimates are significantly lower when uncertainty is accounted for.
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 …
Ranking a set of objects involves establishing an order allowing for comparisons between any pair of objects in the set. Oftentimes, due to the unavailability of a ground truth of ranked orders, researchers resort to obtaining judgments from multiple annotators followed by inferring the ground truth based on the collec…
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 regularization. result Closed-form solution for optimal weighting parameter and efficient estimation.
Error correction for correlated regressors using compressed sensing.
problem Measuring errors in regression tasks with sparse correlations.
method Compressed sensing applied to error signals, with ℓ1-minimization for uniqueness. result Correct solution recovery in settings of error correction.
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.
The MoN loss fails to accurately represent ground truth probability density functions in probabilistic trajectory prediction.
problem Improving the diversity of probabilistic trajectory predictions in autonomous driving and robot planning.
method Proof and validation of the MoN loss's inaccuracy and proposed solutions to correct it.
result The MoN loss approximates the square root of the ground truth probability density function, not the function itself.
URC improves model accuracy without ground truth for new data.
problem Improving model accuracy with new, unseen data without ground truth.
method URC observes and corrects model predictions when training data is not representative of field data.
result URC corrects model bias without retraining or ground truth for some subpopulations.
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.
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.
Study corrects misaligned cadaster maps using noisy supervision.
problem Correcting misaligned cadaster maps with noisy supervision data.
method Iterative training rounds to refine ground truth annotations.
result Reduces noise in cadaster map alignment datasets.
Deep learning for Venus images uses high-res hyperspectral data to simulate ground truth.
problem Lack of accurate ground truth data for training deep neural networks in remote sensing.
method Unmixing high-resolution hyperspectral images to simulate ground truth for training a CNN.
result The model can classify mid-resolution Venus images successfully.
FUSE improves verification quality without ground truth labels.
problem Verification of model outputs using imperfect judges and reward models.
method Ensembling verifiers without ground truth labels using spectral algorithms.
result FUSE matches or improves upon semi-supervised alternatives in test-time scaling experiments.
PoGDiff improves diffusion models on imbalanced datasets.
problem Diffusion models struggle with imbalanced text-image pairs.
method PoGDiff replaces ground-truth with a Product of Gaussians.
result PoGDiff enhances generation accuracy and quality on imbalanced datasets.
Study measures malware detection metrics without ground truth.
problem Accurate measurement of security metrics in the absence of ground truth.
method Statistical estimation methods for five malware detection metrics.
result Characterized and improved statistical estimators for accuracy.
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.
Polymarket-v1 Database tracks 1.2B trades across 1.3M markets with 100% ground-truth direction.
problem Lack of ground-truth data in prediction markets archives.
method Ground-truth archive of 1.2B trades from Polymarket's CTF Exchange.
result Ground-truth data reveals systematic errors in microstructure metrics.
Self-supervised methods learn from noisy data alone, useful for imaging problems.
problem Inferring signals from noisy and incomplete observations.
method Learning a solver from measurement data alone, without ground-truth references.
result Self-supervised methods can learn meaningful estimates from noisy data.
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.
A new method finds DAG models without ground truth.
problem Finding DAG models without ground truth.
method Markov Checker test and Cross-Algorithm Frugality Search (CAFS).
result Models can be chosen without ground truth.
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.
This article evaluates explanations without ground truth in IML.
problem Lack of ground truth for evaluating explanations in IML.
method Rigorously defined problem, reviewed existing efforts, summarized three aspects of explanation, designed a unified evaluation framework.
result Unified evaluation framework for different scenarios in practice.
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 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.
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.
Improves NMT by sampling context from predicted sequence during training.
problem Error accumulation and overcorrection in NMT due to mismatched training and inference contexts.
method Samples context words from both ground truth and predicted sequences during training.
result Significant improvements on multiple datasets, including Chinese->English and WMT'14 English->German.
System separates sounds from mixtures without ground truth info.
problem Sound separation from multi-channel mixtures without labeled data.
method Deep clustering on multi-channel mixtures, projecting bins to spatially correlated clusters.
result Performance matches ground truth separation using only multi-channel mixtures.
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.
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.
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.
Improved DLG extracts accurate labels from gradients, overcoming DLG's convergence issues.
problem Private training data leakage from shared gradients in distributed learning systems.
method Proposes iDLG, a simple approach to synthesize accurate labels from gradients.
result iDLG reliably extracts ground-truth labels from gradients, unlike DLG.
Deep learning improves aerosol optical depth predictions from reanalysis data.
problem Biases in reanalysis datasets like MERRA-2 against ground truth AOD measurements.
method A hybrid CNN model combining MERRA-2 reanalysis with deep learning.
result The CNN-based model provides better AOD estimates than MERRA-2 alone.
Paper proposes a method to reduce annotation time for 3D object detection.
problem Effort and time required for generating 3D object annotations.
method Combines human supervision with pretrained neural networks for 3D point cloud segmentation and bounding box generation.
result Reduces human annotation time by 30x.
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 …
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.
New theory for partial disentanglement from sparse graphs.
problem Disentangling latent factors from sparse causal graphs.
method Generalization of disentanglement theory to any graph, using consistency equivalence.
result Partial disentanglement captures expected factor entanglement based on graph structure.