We tackle the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employe…
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
48 results for “Label inference”
The paper tackles multi-label ranking with uncertain probabilities.
problem Making skeptical inferences for multi-label ranking with sets of probabilities.
method Assumes a convex set of probabilities (credal set) over labels and seeks set-valued predictions.
result Developed methods for making skeptical inferences in multi-label ranking with uncertain probabilities.
New attacks can infer model training membership using only label predictions, not confidence.
problem Inferring whether a data point was used to train a machine learning model.
method Evaluate model's predicted labels under perturbations to infer membership.
result Label-only attacks perform as well as confidence-based attacks and break defenses that rely on confidence masking.
The unprecedented demand for large amount of data has catalyzed the trend of combining human insights with machine learning techniques, which facilitate the use of crowdsourcing to enlist label information both effectively and efficiently. The classic work on crowdsourcing mainly focuses on the label inference problem …
Regression for the Mean: Auto-Evaluation and Inference with Few Labels through Post-hoc Regressioncs.LG
New methods improve inference with scarce labels using regression.
problem Efficient inference with limited labeled data.
method Relates PPI++ to ordinary least squares regression and uses robust regressors.
result Improved variance in estimators for few-label scenarios.
Efficiently learns from partial labels using variational inference.
problem Learning from noisy and ambiguous partial labels in crowdsourcing.
method Amortized variational inference for probabilistic posterior approximation.
result Achieves state-of-the-art performance in accuracy and efficiency.
PPI uses predictions and weighting to infer from partially labeled data.
problem Valid inference with partially labeled data.
method Combines model-based predictions with bias correction from labeled data, using Horvitz-Thompson and Hájek corrections.
result IPW-adjusted PPI with estimated propensities performs similarly to known-probability case.
Cross-prediction improves inference from small labeled datasets.
problem Valid inference from small labeled datasets with imperfect predictions.
method Imputes missing labels via machine learning and debiases predictions.
result Inferences achieve desired error probability and are more powerful.
OPAL optimizes labeling strategy for precise inference from uncertain models.
problem Inference from uncertain machine learning models is brittle.
method OPAL learns a smooth policy to adaptively label data points based on model uncertainty.
result OPAL yields estimators with the lowest variance and achieves nominal coverage in finite samples.
Multi-label text classification is a popular machine learning task where each document is assigned with multiple relevant labels. This task is challenging due to high dimensional features and correlated labels. Multi-label text classifiers need to be carefully regularized to prevent the severe over-fitting in the high …
The paper tackles partial inference in structured prediction using a convex optimization approach.
problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.
Active inference framework improves -statistic estimation efficiency.
problem Costly acquisition of labels for -statistics.
method Active inference framework with optimal sampling rule.
result Substantial gains in estimation efficiency over baseline methods.
Paper tackles causal inference with partially labeled data, introducing robust methods.
problem Challenges in causal inference due to partially labeled datasets and potential bias.
method Decaying missing-at-random framework and BRSS estimator for doubly robust causal inference.
result Established asymptotic normality of BRSS estimator under decaying labeling propensity scores.
This work compares regularization and constrained inference for label constraints in machine learning.
problem Improving model performance with label constraints in machine learning.
method Comparison of regularization and constrained inference strategies.
result Constrained inference reduces population risk by correcting model violations, while regularization narrows the generalization gap but introduces bias.
Noisy labeled data is more a norm than a rarity for crowd sourced contents. It is effective to distill noise and infer correct labels through aggregation results from crowd workers. To ensure the time relevance and overcome slow responses of workers, online label aggregation is increasingly requested, calling for solut…
PPI uses proxy data to improve inference from limited labels across related tasks.
problem Statistical inference with limited labels across multiple related tasks.
method Prediction-powered inference framework that uses cross-task recalibration to improve power and accuracy.
result Cross-task recalibration can substantially reduce confidence interval widths when labels are scarce.
AM-PPI uses multiple predictors to reduce label cost in healthcare AI.
problem Reduces label cost in post-deployment monitoring of healthcare AI.
method Combines model predictions with a small labeled sample, routing each instance to a cost-appropriate subset of predictors.
result Produces narrower confidence intervals than single-predictor methods.
FABLE incorporates instance features into PWS label models for improved performance.
problem Lack of instance features in existing label models limits their performance.
method FABLE uses a mixture of Bayesian label models and a Gaussian Process classifier to incorporate instance features.
result FABLE achieves the highest averaged performance across nine baselines on benchmark datasets.
Unified framework DDNs for multi-label classification, improving inference efficiency.
problem Efficient inference for multi-label classification with dependency networks.
method Combining dependency networks and deep learning, proposing novel inference schemes.
result Novel inference schemes outperform basic neural architectures and Markov networks.
Generative Augmented Inference improves AI-generated data for causal inference.
problem Challenges in using AI-generated annotations for reliable causal inference.
method Generative Augmented Inference (GAI) treats AI outputs as informative features for learning true labels, flexibly modeling the relationship using nonparametric methods.
result GAI significantly reduces estimation error and improves confidence interval quality compared to human-only and PPI-based methods.
The paper tackles skeptical binary inferences in multi-label problems with sets of probabilities.
problem Making distributionally robust, skeptical inferences for multi-label problems.
method Study of distributionally robust, skeptical inferences for multi-label problems using Hamming loss.
result Skeptical inferences provide partial predictions for a sufficiently big set of probability distributions.
Active Statistical Inferencestat.ML
Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.
problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.
Crowdsourced labeling recovers task types with minimal queries.
problem Labeling tasks accurately with minimal queries.
method Worker clustering, skill estimation, weighted majority voting.
result Achieves any targeted recovery accuracy with minimum queries.
InfoSEM: A Deep Generative Model with Informative Priors for Gene Regulatory Network Inferencestat.ML
InfoSEM infers gene regulatory networks without GT labels, improving performance.
problem Inferring GRNs from gene expression data with high accuracy and avoiding biases.
method InfoSEM uses deep generative models with informative priors (textual gene embeddings).
result InfoSEM outperforms existing models by 38.5% across four datasets.
Structured prediction energy networks (SPENs; Belanger & McCallum 2016) use neural network architectures to define energy functions that can capture arbitrary dependencies among parts of structured outputs. Prior work used gradient descent for inference, relaxing the structured output to a set of continuous variables a…
Paper proposes Meta Label Learning to infer global labels for robust few-shot models.
problem Few-shot learning with limited training data.
method Meta Label Learning (MeLa) framework that infers global labels.
result MeLa framework is competitive with existing methods and robust for few-shot learning.
The paper studies how to use AI-generated labels in econometrics to avoid bias.
problem Small misclassification errors in AI-generated labels can lead to large biases in econometric estimators.
method The paper proposes a coupled-label bootstrap method to correct bias and deliver valid inference.
result The coupled-label bootstrap method is valid without the strong independence condition between true and imputed labels.
Annotating large unlabeled datasets can be a major bottleneck for machine learning applications. We introduce a scheme for inferring labels of unlabeled data at a fraction of the cost of labeling the entire dataset. Our scheme, bounded expectation of label assignment (BELA), greedily queries an oracle (or human labeler…
StratPPI improves prediction-powered inference with stratified sampling.
problem Improving statistical estimates with limited human-labeled data.
method Combining small human-labeled data with large automatic-labeled data, stratifying data for tighter confidence intervals.
result StratPPI provides substantially tighter confidence intervals than unstratified approaches.
Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function of the label difference. Exact inference in such labeling tasks is still difficul…
New method uses imperfect LLM annotations for valid statistical inference in social science.
problem Inaccurate large language model annotations in social science research.
method Design-based supervised learning (DSL) combining imperfect LLM surrogates with gold-standard labels.
result DSL provides valid statistical inference with comparable predictive accuracy to existing methods.
TIMELY improves consistency in labeling blood cell images.
problem Inconsistent labeling of blood cells in microscopy images leads to unreliable diagnoses.
method TIMELY combines pseudotime inference and hidden Markov trees to correct labeling mistakes.
result TIMELY outperforms baseline methods in identifying and correcting inconsistent labels.
Labeling data for classification requires significant human effort. To reduce labeling cost, instead of labeling every instance, a group of instances (bag) is labeled by a single bag label. Computer algorithms are then used to infer the label for each instance in a bag, a process referred to as instance annotation. Thi…
Can I Trust My Fairness Metric? Assessing Fairness with Unlabeled Data and Bayesian Inferencestat.ML
Bayesian framework uses unlabeled data to improve fairness assessment.
problem Reliable fairness assessment with limited labeled data.
method Hierarchical latent variable model with Bayesian inference.
result Significant reduction in estimation error for fairness metrics.
Bayesian algorithms improve crowdsourcing with label and instance constraints.
problem Efficiently labeling large datasets with additional human annotator information.
method Developed Bayesian algorithms for semi-supervised crowdsourced classification under label and instance constraints.
result Improved performance compared to unsupervised crowdsourcing on various datasets.
Extends PPI to sequential setting, improving inference over time.
problem Sequential data growth with unlabelled data.
method Prediction-powered confidence sequence procedures using Ville's inequality and the method of mixtures.
result Asymptotically valid uniformly over time, accommodating prior knowledge.
PPI++ uses machine learning predictions to improve inference from small datasets.
problem Efficient inference from small labeled datasets with high-quality predictions.
method Adapts prediction-powered inference (PPI) to compute confidence sets for any parameter dimensionality.
result Improves classical intervals using only labeled data, always yielding better results.
Proposes a method to make statistical inferences robust in spatially dependent settings with missing at random labels.
problem Statistical inference challenges with missing at random labels and spatial dependence.
method Doubly robust estimator with cross-fit nuisances and jackknife spatial HAC variance correction.
result Asymptotically valid confidence intervals with improved finite-sample calibration.
MeLa learns task relations by inferring global labels for robust FSL.
problem Few-shot learning with limited global labels.
method Meta Label Learning (MeLa) and augmented pre-training.
result MeLa outperforms existing methods across diverse benchmarks.
Unified approach to non-standard classification tasks.
problem Non-standard classification tasks like semi-supervised, positive-unlabelled, multi-positive-unlabelled and noisy-label learning.
method Probabilistic, unified approach training a classifier to predict label-distributions, then inferring class-distributions.
result Unified model for various non-standard classification tasks.
In this work, we address semi-supervised classification of graph data, where the categories of those unlabeled nodes are inferred from labeled nodes as well as graph structures. Recent works often solve this problem via advanced graph convolution in a conventionally supervised manner, but the performance could degrade …
We introduce the SaaS Algorithm for semi-supervised learning, which uses learning speed during stochastic gradient descent in a deep neural network to measure the quality of an iterative estimate of the posterior probability of unknown labels. Training speed in supervised learning correlates strongly with the percentag…
New method for estimating mean in SS inference with selection bias and decaying overlap.
problem Estimating mean in SS inference with selection bias and decaying overlap.
method Double Robust Semi-Supervised (DRSS) mean estimator.
result Consistent estimation of mean with correct specification of outcome or propensity score model.
Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained transitions. Recently, it has become common to locally parametrize these models…
pRSL combines probabilistic rules to improve multi-label classification.
problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limitscs.HC
New model optimizes worker-task specialization for crowdsourcing.
problem Inferring correct labels from noisy answers across varying worker and task skills.
method Introduced a -type specialization model to account for varying worker and task types, and proposed algorithms achieving optimal sample complexity.
result Optimal label inference algorithms for crowdsourcing with unknown worker and task types.
Machine learning models are generally vulnerable to adversarial examples, which is in contrast to the robustness of humans. In this paper, we try to leverage one of the mechanisms in human recognition and propose a bio-inspired classification framework in which model inference is conditioned on label hypothesis. We pro…
New attacks reveal membership in label-only ML models.
problem Vulnerability of ML models to membership inference attacks.
method Developed decision-based membership inference attacks.
result Label-only exposures are vulnerable to membership leakage.