Study on how imperfect labels affect classification methods.
problem Effect of imperfect training labels on classification performance.
method Bounding excess risk for various classifiers under noisy labels.
result Imperfect labels can improve performance of k-NN and SVM classifiers.
Study active learning with imperfect labelers who can abstain or make mistakes.
problem Learning from noisy and abstaining labelers in active learning.
method Proposed an algorithm that utilizes abstention responses and analyzes its consistency and query complexity.
result Achieves nearly optimal query complexity under certain conditions.
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.
A new feature selection method for semi-supervised learning with imperfect labels.
problem Feature selection for semi-supervised learning with imperfectly labeled data.
method Genetic algorithm for proposing feature subsets, probabilistic error model for mislabeling, multi-class C-bound selection criterion.
result Empirical results show the effectiveness of the proposed framework compared to state-of-the-art approaches.
The paper analyzes knowledge distillation in wide neural networks, providing theoretical insights and practical implications.
problem Lack of theoretical understanding of knowledge distillation in wide neural networks.
method Theoretical analysis of knowledge distillation in a linearized model of a wide neural network, introducing a metric of task training difficulty.
result For a perfect teacher, a high ratio of teacher's soft labels can be beneficial. For imperfect teacher, hard labels can correct wrong predictions.
The paper tackles fair decision-making with imperfect labels.
problem Predictive models learn from biased data due to selective labeling.
method Proposes learning decision policies that maximize utility under fairness constraints.
result Learning to decide improves fairness and utility compared to traditional risk minimization.
Improved machine learning models outperform their simpler counterparts by using imperfect labels.
problem Improving model performance using imperfect labels.
method Random feature ridge regression (RFRR) with a deterministic equivalent for excess test error.
result The student model can outperform the teacher model regardless of the teacher's scaling law, achieving the minimax optimal rate.
Paper corrects deep learning for noisy labels.
problem Overfitting to imperfectly labeled data.
method Distribution correction approach to handle noisy inputs.
result Significantly higher accuracy compared to alternative methods.
The paper proposes a fast method to predict tactical solutions to operational problems under imperfect information.
problem Predicting tactical solutions to operational planning problems under imperfect information.
method Formulated as a two-stage optimal prediction stochastic program, solved with a supervised machine learning algorithm using training data from deterministic problems.
result Deep learning algorithms produce highly accurate predictions in very short computing time (milliseconds or less).
Method corrects bias in regression using simulated data and real-world gene expression data.
problem Bias in estimated effect parameters due to misclassification of class labels.
method Simulation and extrapolation method to correct bias.
result Corrected bias in estimated effect parameters.
ActiveLab improves classifier accuracy with fewer annotations by re-labeling.
problem Imperfect labels from multiple annotators in real-world data.
method ActiveLab automatically decides when to re-label examples for better classifier training.
result ActiveLab trains more accurate classifiers with fewer annotations.
New method improves IL from imperfect demos using confidence scores.
problem Learning optimal policies from imperfect demonstrations is challenging.
method Proposes two confidence-based IL methods: 2IWIL and IC-GAIL.
result Confidence scores from sub-optimal demos significantly improve IL performance.
Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.
problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.
The paper explores how regularization can lead to convergence in imperfect information games.
problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.
The paper tackles learning from imperfect human feedback, especially in dueling bandit problems.
problem Learning from human feedback that can be irrational or imperfect.
method Developed a Robustified Stochastic Mirror Descent for Imperfect Dueling (RoSMID) algorithm.
result Achieved nearly optimal regret for dueling bandit problems under imperfect human feedback.
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.
Model learns tensor representations from imperfect multimodal data.
problem Learning from imperfect multimodal data with noise or missing entries.
method Tensor rank minimization to regularize rank of tensor representations.
result Model effectively learns tensor representations from imperfect data.
End-to-end framework learns from imperfect annotations directly.
problem Training machine learning models on imperfect human annotations.
method End-to-end framework merging aggregation with model training and modeling annotator competencies.
result Accuracy gains of up to 25% over state-of-the-art annotation aggregation methods.
New taxonomy reveals different detection limits for various types of fraud.
problem Existing fraud detection treats all fraud as the same, ignoring its diverse forms.
method Introduced an observation-mechanism taxonomy with five fraud classes.
result Separate estimation by fraud class outperforms pooled estimation.
Investigates a Kyle model with imperfect information and risk aversion.
problem Tackles a Kyle model with imperfect information and risk-averse informed traders.
method Solves an optimal transport problem and a filtering problem under specific measures.
result Constructs an equilibrium for the Gaussian Kyle model with imperfect information and risk aversion.
New method tackles simulator imperfection in data assimilation.
problem Handling simulator imperfection in data assimilation.
method Ensemble-based kernel learning approach.
result Functional approximation through machine learning can handle simulator imperfection.
Paper tackles classification without labels using statistical mixtures in collider physics.
problem Training models on imperfect simulations in high energy physics.
method Classification without labels (CWoLa) paradigm, distinguishing statistical mixtures of classes.
result Optimal classifier in CWoLa is also optimal in fully-supervised case.
TabPFN model shows strong robustness to noisy data.
problem TabPFN tackles robustness to noisy and imperfect tabular data.
method Empirical robustness analysis of TabPFN's attention mechanisms under various perturbations.
result TabPFN maintains high predictive performance and coherent internal behavior under noisy and imperfect data.
Policy gradient method proves convergence in imperfect-information games.
problem Policy gradient methods in imperfect-information games (EFGs).
method Policy gradient approach with best-iterate convergence.
result Policy gradient leads to provable best-iterate convergence in self-play EFGs.
New method robustly discovers causal relationships from imperfect data.
problem Challenges in causal discovery from imperfect structural constraints.
method Prior alignment and conflict resolution through surrogate model and multi-task learning.
result Proposes a robust method for causal discovery under imperfect constraints.
New model shows weak teachers can help strong students learn even with imperfect labels.
problem Improving strong student's performance with weak teacher's imperfect pseudolabels.
method Stylized overparameterized spiked covariance model with Gaussian covariates, proving two phases of generalization.
result Provable successful and random guessing phases of strong student's generalization.
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.
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.
New algorithm controls type I error in NP classification under label noise.
problem Label noise affects NP classification methods, reducing power.
method Proposes a label-noise-adjusted Neyman-Pearson algorithm.
result Improves power while controlling type I error under desired level.
Volatility smiles emerge from imperfect hedging in financial markets.
problem Imperfect hedging in financial markets leads to volatility smiles.
method Examined option prices as fair game agreements based on expected payoffs and risk.
result Resulting prices lead to the volatility smile.
RODMAN improves ML-based disk failure prediction accuracy in cloud environments.
problem Imperfect data quality in real-world cloud environments degrades ML-based disk failure prediction accuracy.
method RODMAN uses three data preprocessing techniques: failure-type filtering, spline-based data filling, and automated pre-failure backtracking.
result RODMAN significantly improves prediction accuracy compared to no preprocessing.
Study on teaching with imperfect knowledge, showing its impact on optimal teaching sets.
problem Effect of imperfect teacher knowledge on effective teaching.
method Connections to machine teaching problem, optimal teaching sets.
result Teacher's success or failure depends on imperfect knowledge.
Paper shows noisy labels can improve PLR variable selection.
problem Variable selection in PLR is challenging due to noisy labels.
method Proposes a novel ADMM-based algorithm to fuse noisy labels.
result Fused noisy labels improve PLR performance in estimation and classification.
JPS improves joint policies for multi-agent collaboration in imperfect information games.
problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.
Triangle lasso improves clustering and optimization in noisy graphs.
problem Noise and missing data in graph datasets lead to sub-optimal clustering results.
method Triangle lasso uses neighbors' similarity to find similar instances, avoiding direct feature comparison.
result Triangle lasso yields better results than state-of-the-art methods in practical scenarios.
Deep neural network learns to play Big 2, a 4-player imperfect information game, outperforming amateurs.
problem Training a neural network to play a complex, imperfect information game with multiple players.
method Self-play reinforcement learning using Proximal Policy Optimization.
result Deep neural network trained via self-play reaches performance level surpassing amateur players.
New numerical method for quantile hedging in imperfect markets.
problem Quantile hedging in non-linear markets with imperfections.
method Piecewise Constant Policy Timestepping (PCPT) coupled with monotone finite difference approximation.
result Convergence of the proposed numerical scheme proved using BSDE arguments.
BCCNet combines biased crowd labels to train classifiers for disaster response.
problem Improper labels from citizen scientists limit machine learning applications.
method Bayesian classifier combination neural network (BCCNet) aggregates and trains classifiers from imperfect labels.
result BCCNet effectively processes large unstructured data for disaster prevention and response.
Algorithm learns NE in imperfect information games with imperfect feedback.
problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with 1 / T 1/\sqrt{T} 1/ T convergence rate. result IXOMD achieves 1 / T 1/\sqrt{T} 1/ T convergence rate to NE. The paper develops a new discount rate for derivatives using imperfect securities as collateral.
problem Inconsistent and non-observable collateral rates in derivatives markets.
method Synthesizes effects of imperfect collateral into a new discount rate, employs break-even repo formulae, and uses linear programming for optimization.
result Liquidity value adjustment (LVA) can be significant for long-term derivatives portfolios.
Model financial markets using open quantum systems to understand market imperfections.
problem Understanding market imperfections through imperfect trading mechanisms.
method Using open quantum systems to represent financial markets, characterizing orbits, and analyzing reduced density matrices.
result Non-classical modes of time evolution can incorporate factors like illiquid trades and imperfect trading mechanisms.
Paper studies fairness postprocessing with imperfect attribute information.
problem Ensuring fairness with imperfect protected attribute information.
method Equalized odds postprocessing method with imperfect attribute information.
result Conditions on perturbation ensure reduced bias in classifier.
Improves off-policy evaluation with imperfect annotations.
problem Limited dataset coverage for evaluating new policies.
method Doubly robust estimators combining IS and DM, incorporating counterfactual annotations.
result Using annotations within the DM component yields the most desirable theoretical results.
Bayesian machine learning algorithm for causal effects with imperfect compliance.
problem Heterogeneous causal effects in imperfect compliance scenarios.
method Bayesian Causal Forest with Instrumental Variable (BCF-IV) methodology.
result BCF-IV outperforms other techniques in discovering and estimating heterogeneous causal effects.
The study examines how verifier imperfections impact test-time scaling techniques.
problem Understanding how verifier imperfections affect test-time scaling methods.
method Proves the instance-level accuracy of Best-of-N and Rejection Sampling methods using the geometry of the verifier's ROC curve.
result RS outperforms BoN for fixed compute, but both converge to the same accuracy in the infinite-compute limit.
New method predicts y distributions from imperfect data.
problem Predicting y from imperfect data (discrete, truncated, censored).
method Optimal transformations to estimate p(y|x).
result Estimates location, scale, and shape of y distribution.
Paper improves RL from imperfect demonstrations with soft expert guidance.
problem Improper and insufficient expert demonstrations in RLfD.
method Formalizes imperfect expert setting, tackles optimality and convergence issues with soft constraints, and uses local linear search on dual form.
result Method achieves consistent improvement over other RLfD methods.
Study learns optimal strategies in imperfect information games with self-play.
problem Learning optimal strategies in imperfect information games.
method Proposes Follow the Regularized Leader (FTRL) algorithms for imperfect information games.
result Proposes two FTRL algorithms: Balanced FTRL and Adaptive FTRL.