Statistical mechanics models node-perturbation learning with noisy baselines.
problem Understanding learning dynamics in node-perturbation algorithms with noisy baselines.
method Developed statistical mechanics to model node-perturbation learning with noisy baselines and derived coupled differential equations.
result Derived coupled differential equations of order parameters to depict learning dynamics and calculated generalization error.
Simple method improves deep learning with noisy labels.
problem Deep learning's overfitting to noisy labels.
method Adds a variance regularization term to penalize neural network's Jacobian norm.
result Achieves state-of-the-art performance with high noise tolerance.
Enhances network intrusion detection in noisy data.
problem Robustness against contaminated and noisy data inputs in network intrusion detection.
method Probabilistic Temporal Graph Network Support Vector Data Description (TGN-SVDD) model.
result Significant improvements in detection performance with synthetic noise.
FUNSD dataset tackles noisy scanned forms, offering comprehensive annotations.
problem Extracting and structuring textual content from noisy scanned documents.
method Comprehensive dataset with real, fully annotated forms, including text detection, OCR, layout analysis, and entity linking.
result First publicly available dataset for form understanding, addressing challenges in noisy scanned documents.
Paper introduces a noisy-labeled audio tagging challenge.
problem Acoustic mismatch and noisy labels in audio tagging.
method Large dataset with minimal supervision, convolutional neural network baseline.
result Demonstrates effectiveness of minimal supervision in noisy conditions.
Self-training with noisy student-teacher boosts keyword spotting accuracy.
problem Robust keyword spotting in challenging conditions.
method Aggressive data augmentation and self-training with noisy student-teacher approach.
result Significant accuracy improvement in difficult conditions, up to 60%.
A method to train deep neural networks on noisy labeled data.
problem Training deep neural networks on noisy labeled data causes performance degradation.
method A noise-tolerant training algorithm that simulates actual training with synthetic noisy labels.
result The proposed method outperforms state-of-the-art baselines on noisy CIFAR-10 and Clothing1M datasets.
Improves classification accuracy with noisy labels using generative classifiers.
problem Handling noisy labels in large-scale datasets.
method Robust Generative Classifier (RoG) on top of pre-trained DNNs.
result Significantly improves classification accuracy with no re-training of the deep model.
Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.
problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density
Increasing variance of losses improves learning with noisy labels.
problem Learning with noisy labels and the need to penalize variance of losses.
method Designing regularizers based on the label noise transition matrix to increase variance of losses.
result Increasing variance of losses significantly improves generalization ability.
A fast method approximates likelihood scores for noisy linear inverse problems.
problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.
Method learns low-dim. state vars from noisy high-dim. data.
problem Discovering dynamical models from noisy high-dimensional data.
method Stochastic Variational Deep Kernel Learning with encoder and latent model.
result Effective denoising, compact state representation, and uncertainty quantification.
MARVEL curbs memorization of noisy labels in deep nets.
problem Noisy labels degrade deep net performance.
method MARVEL tracks classification margins to identify and abandon noisy instances.
result MARVEL outperforms baselines on noisy datasets.
Thompson Sampling tackles noisy context in stochastic bandits.
problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.
Gen-CUDE is a neural network for denoising noisy channels.
problem Denoising in finite-input, general-output noisy channels.
method Unsupervised neural network trained on noisy data.
result Gen-CUDE achieves better denoising results than other methods.
SelectMix improves deep learning robustness against noisy labels.
problem Deep neural networks memorize noisy labels, degrading performance.
method Confidence-guided targeted sample mixing with soft labels.
result SelectMix consistently outperforms baseline methods on noisy label datasets.
The paper tackles noisy labels in high-dimensional data, showing low-dimensional intuitions fail and proposing an optimized method.
problem Noisy labels in high-dimensional data classification.
method Linear classifier with a label noisiness aware loss function, using random matrix theory and Gaussian mixture data model.
result The performance of the linear classifier in high-dimension converges to a limit involving scalar statistics of the data, and the optimal classifier in low-dimension fails.
New loss function helps models avoid noisy labels, improving robustness.
problem Designing robust models for datasets with noisy labels.
method Introduced a gambler's loss function that encourages models to abstain from learning noisy data points.
result Training with gambler's loss leads to improved robustness and generalization across various tasks.
Improved fine-tuning with regularization and robustness for noisy labels.
problem Fine-tuning pre-trained models on small datasets can lead to overfitting and memorization.
method PAC-Bayes generalization bound analysis, layer-wise regularization, self-label-correction, label-reweighting.
result Improves performance by 1.76% on average for image classification tasks and 0.75% for few-shot classification.
Paper proposes a modified uncertainty sampling method to speed up preference learning from noisy humans.
problem Learning preferences from humans with limited queries and noisy responses.
method Modified uncertainty sampling using expected output value to speed up preference learning.
result The modified method outperforms the baseline uncertainty sampling in preference learning.
Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.
problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.
We describe a method for parameter estimation in bipartite probabilistic graphical models for joint prediction of clinical conditions from the electronic medical record. The method does not rely on the availability of gold-standard labels, but rather uses noisy labels, called anchors, for learning. We provide a likelih…
Enhanced visual feature attribution via adaptive baseline weighting.
problem IG's sensitivity to baseline images leads to noisy or unstable explanations.
method Weighted Integrated Gradients (WG) evaluates and weights baselines for improved reliability.
result WG improves over Expected Gradients (EG) by up to 36% across various models.
Algorithm learns nearest neighbor graph from noisy distance queries.
problem Learning nearest neighbor graph from noisy distance samples.
method Active algorithm to find graph with high probability, analyzing query complexity.
result Empirically and theoretically efficient, needing only O(n log(n)Delta^-2) queries.
Framework tackles class imbalance and noisy labels in active learning.
problem Class imbalance and noisy labels in real-world datasets.
method Uses foundation model priors to select informative samples for active learning.
result Substantial annotation savings (over 50%) with preserved performance and robustness.
Study presents a dataset and methods to handle noisy labels in sound event classification.
problem Label noise in sound event classification datasets.
method Developed a dataset with noisy labels and evaluated CNN baseline systems.
result Training with large amounts of noisy data can outperform training with carefully-labeled data.
Crowdsourced PAC learning algorithm reduces labeling tasks for noisy data.
problem Learning from noisy labels in crowdsourced data.
method Three-step algorithm combining voting, bandits, and noisy-PAC learning.
result Reduces the number of tasks workers need to label for PAC learning.
A method for robust learning with noisy data using mixture density networks.
problem Weakly supervised learning with noisy training data for classification and regression.
method Estimates target distribution and data quality using correlation-guided Cholesky Block.
result Shows comparable or superior performance in handling noisy data compared to existing methods.
Improved graph attention model for noisy graphs.
problem Understanding and improving graph attention in noisy graphs.
method Proposes SuperGAT, a self-supervised graph attention network.
result SuperGAT learns more expressive attention by encoding edges.
The paper tackles noisy data by focusing training on classes with high learnability.
problem Noisy labels in data collected via crowdsourcing or Web tagging.
method Develops an online algorithm that selects training data based on class learnability.
result The algorithm improves model generalization on learnable classes, leading to better performance.
Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.
problem Noisy labeled data and non-consecutive sentences in n-ary cross-sentence relation extraction.
method Two-level agent reinforcement learning model and hybrid attention mechanism/PCNN approach.
result The model reduces the impact of noisy data and achieves better performance.
Paper tackles noisy S-D data for classification.
problem Learning from noisy Similar (S) and Dissimilar (D) pairs.
method Proposes two algorithms to learn from noisy S-D data under two noise models.
result Noise-informed algorithms outperform noise-blind baselines.
Paper improves preterm birth prediction using neural networks with noisy labels.
problem Predicting preterm birth from noisy EHR diagnosis codes.
method Developed ALC method to correct label noise in deep learning models.
result Improved prediction performance compared to baseline methods.
Paper tackles noisy reinforcement learning with perturbed rewards, improving agent performance.
problem Noisy rewards in reinforcement learning scenarios, leading to unreliable model performance.
method Develops a robust RL framework using a confusion matrix to estimate unbiased surrogate rewards.
result Trained policies using estimated surrogate rewards achieve higher expected rewards and faster convergence.
SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.
problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and ℓ2-norm switching costs, with spectral regret analysis. result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.
New framework for fair ranking with noisy protected attributes.
problem Errors in socially-salient attributes undermine fairness guarantees.
method Modeling perturbations in protected attributes and incorporating probabilistic information.
result Framework provides provable guarantees on fairness and utility.
Paper proposes a novel policy distillation method for better order execution in noisy markets.
problem Effective order execution in noisy and imperfect market conditions.
method Policy distillation method to guide reinforcement learning towards optimal trading strategies.
result Significant improvements over various baselines in order execution.
Improves conditional GANs' robustness to noisy labels.
problem Learning conditional generators from noisy labeled samples.
method Introduces Robust Conditional GAN (RCGAN) and RCGAN-U architectures.
result Improves quality and accuracy of generated samples from noisy labels.
This paper proposes a new estimation algorithm for the parameters of an HMM as to best account for the observed data. In this model, in addition to the observation sequence, we have \emph{partial} and \emph{noisy} access to the hidden state sequence as side information. This access can be seen as "partial labeling" of …
Bayesian method detects neuron spike activities from noisy fluorescence data.
problem Detecting neuron spike activities from noisy fluorescence data.
method Random finite set (RFS) based Bayesian approach.
result Gains 12% extra detection accuracy compared to MLSpike method.
MASA discovers motifs in noisy time series data.
problem Discovering common sequences of states in noisy time series data.
method MASA uses an expectation-maximization approach to solve a large optimization problem.
result MASA outperforms state-of-the-art baselines by up to 38.2%.
New method detects corporate fraud in noisy financial networks.
problem Detecting corporate fraud in rich yet noisy financial networks.
method Knowledge-enhanced GCN with Robust Two-stage Learning (KeGCN_R)
result KeGCN_R outperforms baselines in fraud detection effectiveness and robustness.
Self-training improves neural sequence generation by correcting incorrect predictions.
problem Improving neural sequence generation models using unlabeled data.
method Injecting pseudo-parallel data (model predictions) into the labeled dataset and using dropout as a regularizer.
result Noisy self-training significantly improves performance on machine translation and text summarization benchmarks.
Butterfly tackles wild unsupervised domain adaptation with noisy labeled data.
problem Training classifiers with noisy labeled data from source domain and unlabeled data from target domain.
method Butterfly framework, maintaining four deep networks for simultaneous adaptations.
result Butterfly significantly outperforms existing methods in wild unsupervised domain adaptation.
RFMs transition from linear to nonlinear under specific input-label correlation.
problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.
Causal Imitation Learning handles noisy measurements and distribution shifts.
problem Learning from noisy state observations and distributional shifts.
method Causal inference framework and adversarial RKHS learning.
result Improved robustness to distribution shifts compared to standard methods.
Algorithm identifies nearest mode in noisy data.
problem Identifying the point with the minimum k-th nearest neighbor distance in unknown multivariate probability density.
method Sequential learning algorithm using noisy oracle queries to adaptively decide which points to query.
result Upper bounds on query complexity show significant improvement over baselines.
Algorithm improves multi-agent learning with noisy observations.
problem Challenges in learning optimal policies with noisy, weakly correlated observations.
method Enhanced multi-agent deep deterministic policy gradient algorithm (MADDPG-M) with a communication medium.
result Algorithm performs well in complex, non-stationary environments, offering significant performance gains.