PClean automates Bayesian data cleaning for specific datasets.
problem Bayesian inference for diverse and complex data cleaning.
method Domain-specific probabilistic programming language with custom models and inference.
result PClean programs outperform general-purpose PPLs in accuracy and runtime.
The paper cleans label noise in supervised classification using Bernoulli sampling.
problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.
This paper presents a statistical method of single-channel speech enhancement that uses a variational autoencoder (VAE) as a prior distribution on clean speech. A standard approach to speech enhancement is to train a deep neural network (DNN) to take noisy speech as input and output clean speech. Although this supervis…
SSMs can be poisoned with clean labels, leading to generalization failure.
problem The implicit bias of SSMs can be manipulated by including special training examples with clean labels.
method Formal proof and empirical demonstration of the phenomenon.
result SSMs can fail to generalize even with clean labels, due to the inclusion of special training examples.
Adversarial training leads to clean data generalization with significant robust overfitting gap.
problem Significant robust generalization gap in adversarial training.
method Two theoretical views: representation complexity and training dynamics.
result ReLU nets with O(ND) extra parameters can achieve CGRO. Neural networks learn clean data patterns first, then noisy data, leading to improved performance initially but deteriorating later.
problem Improvement in prediction error on clean data during early training of neural networks with noisy labels.
method Theoretical analysis and experiments to explore the dynamics of gradient descent and the impact of clean and noisy data.
result Neural networks prioritize learning clean data patterns first, leading to improved performance initially but deteriorating later due to diminishing gradient dominance of clean samples over noisy ones.
New method generates clean data from corrupted observations.
problem Generating clean data from corrupted observations.
method Iterative update of a transport map using black-box corruption channel access.
result Converges to a self-consistent transport map that effectively inverts the corruption channel.
Improved portfolio optimization method yields better risk-adjusted returns.
problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted k−BAHC covariance cleaning procedure for correlation matrices. result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.
Label noise may affect the generalization of classifiers, and the effective learning of main patterns from samples with noisy labels is an important challenge. Recent studies have shown that deep neural networks tend to prioritize the learning of simple patterns over the memorization of noise patterns. This suggests a …
Image classification problems are typically addressed by first collecting examples with candidate labels, second cleaning the candidate labels manually, and third training a deep neural network on the clean examples. The manual labeling step is often the most expensive one as it requires workers to label millions of im…
For a real valued periodic smooth function u on R, n≥0, one defines the osculating polynomial φs (of order 2n+1) at a point s∈R to be the unique trigonometric polynomial of degree n, whose value and first 2n derivatives at s coincide with those of u at s. We will say that a point s is a clean maximal flex …
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maxim…
Develops a method to compute Morse homology for clean but not necessarily transverse intersections.
problem Computing Morse homology for clean but not necessarily transversely intersecting manifolds.
method Constructs minimal semi-global Kuranishi structures for moduli spaces of Morse trajectories, generalizing obstruction bundle gluing.
result Obtains iterated gluing equals simultaneous gluing, maintaining computability.
Diffusion models enhance speech without supervision.
problem Challenges in generalizing supervised speech enhancement methods to unseen conditions.
method Unsupervised speech enhancement using diffusion-based generative models.
result Demonstrates promising results compared to supervised and unsupervised baselines.
EntProp increases entropy of clean samples to generate out-of-distribution data for better DNN performance.
problem Improving deep neural networks' accuracy and robustness to out-of-distribution data.
method High entropy propagation using data augmentation and free adversarial training.
result EntProp achieves higher standard accuracy and robustness with lower training cost.
INN method refines clean labeled data from noisy labels.
problem Handling noisy labels in deep neural networks.
method INN method based on memorization effect at neighbor regions.
result INN method resolves memorization effect shortcomings.
Study improves resilience against adversarial clean-label attacks in real and noisy settings.
problem Ensuring accurate predictions in the presence of adversarial clean-label samples.
method Sequential learning from a stream of i.i.d. data, allowing abstention for uncertain predictions.
result Theoretical analysis and adaptations for the agnostic setting with a clean-label adversary and noise.
Recently, Generative Adversarial Networks (GANs) have emerged as a popular alternative for modeling complex high dimensional distributions. Most of the existing works implicitly assume that the clean samples from the target distribution are easily available. However, in many applications, this assumption is violated. I…
The graph-based semi-supervised label propagation algorithm has delivered impressive classification results. However, the estimated soft labels typically contain mixed signs and noise, which cause inaccurate predictions due to the lack of suitable constraints. Moreover, available methods typically calculate the weights…
Trimming helps in conformal prediction when it separates anomaly scores.
problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.
SAT improves adversarial training by smoothing the loss landscape through curriculum learning.
problem Adversarial training sacrifices clean accuracy for robustness and suffers from large generalization error.
method SAT uses curriculum learning to smooth the adversarial loss landscape, improving both clean and robust accuracy.
result SAT models improve clean and robust accuracy significantly compared to adversarial training and other baselines.
New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.
problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.
Bullseye Polytope improves clean-label poisoning attacks in transfer learning.
problem Poisoning neural networks with correctly labeled data.
method Creates poison images with centers close to target images in feature space.
result Improves attack success rate by 26.75% in end-to-end transfer learning.
TS-Fault benchmarks TSF models against structural faults.
problem Evaluating the robustness of time series forecasting models against structured events.
method TS-Fault uses parameterized fault scenarios with controllable difficulty.
result Three findings contradict common leaderboard intuition.
We apply basic statistical reasoning to signal reconstruction by machine learning -- learning to map corrupted observations to clean signals -- with a simple and powerful conclusion: it is possible to learn to restore images by only looking at corrupted examples, at performance at and sometimes exceeding training using…
Cincer cleans both new and past data by identifying and relabeling suspicious and counter-examples.
problem Sequential learning under label noise, especially in applications with human supervision.
method Cincer uses example-based explanations to identify and relabel suspicious and counter-examples, leveraging Fisher information matrix approximation.
result Cincer achieves better data and models by clarifying the model's suspicions, especially with FIM approximation.
In this paper, we present a reverberation removal approach for speaker verification, utilizing dual-label deep neural networks (DNNs). The networks perform feature mapping between the spectral features of reverberant and clean speech. Long short term memory recurrent neural networks (LSTMs) are trained to map corrupted…
Self-supervised method predicts clean signal and noise distribution from noisy images.
problem Blind denoising and noise estimation in biomedical images with limited clean data.
method Two neural networks jointly predict clean signal and noise distribution from noisy observations.
result Significantly outperforms state-of-the-art algorithms on six biomedical image datasets.
Improved robust regression with clean covariates achieves better rates than Huber's model.
problem Robust regression under adaptive contamination of responses with clean covariates.
method Exploiting clean covariates to construct an estimator achieving better rates than Huber's model.
result Improved estimation rate even with constant contamination, achieving consistency.
MetaPoison poisons neural networks by learning to craft imperceptible changes to training data.
problem Data poisoning attacks on neural networks.
method MetaPoison uses meta-learning to approximate bilevel optimization for crafting poisons.
result MetaPoison outperforms previous methods and works in various scenarios.
We prove: If a complete connected smooth surface M in euclidean 3-space has general position, intersects some plane along a clean figure-8 (a loop with total curvature zero) and all compact intersections with planes have central symmetry, then M is a (geometric) cylinder over some central figure-8. On the way, we estab…
R package tsrobprep cleans and prepares time series data robustly.
problem Inefficient methods for handling missing values and outliers in time series data.
method Model-based methods for imputation and outlier detection considering time series properties.
result Robust and tunable methods for data preprocessing in time series analysis.
Enhances deep learning robustness to noise without sacrificing clean data accuracy.
problem Robustness of deep neural networks to input noise.
method Discriminative loss at penultimate layer and class-wise feature alignment with Gaussian noise.
result Improves robustness to various perturbations without degrading clean data accuracy.
Study finds discrepancies in model explanations for clean vs. adversarial inputs.
problem Identifying adversarial attacks on neural networks.
method Utilized experimental results to propose a framework for detecting adversarial inputs.
result Proposed framework can identify adversarial inputs based on model explanations.
CAT improves robustness of neural networks by customizing perturbation levels.
problem Poor generalization of adversarial training on clean and perturbed data.
method CAT adapts perturbation level and label for each sample.
result CAT achieves better clean and robust accuracy than previous methods.
Study proposes a clustering and logistic regression algorithm for PU classification under Non-SCAR.
problem PU classification under Non-SCAR condition when SCAR condition is unsatisfied.
method 2-means clustering followed by logistic regression.
result Efficacy of the proposed algorithm demonstrated on 11 real data sets and a synthetic set.
DynaCor detects noisy labels by learning from corrupted training signals.
problem Label noise in real-world datasets hinders model generalization.
method DynaCor introduces label corruption to indirectly simulate noisy labels and learns to distinguish clean from noisy instances.
result DynaCor outperforms state-of-the-art competitors in noisy label detection.
Game theory helps machine learn better from adversarial queries.
problem Adversarial evasion in machine learning prediction.
method Repeated Bayesian Sequential Game to balance classifier selection and query type.
result Learner selects appropriate classifier for clean vs. adversarial queries.
In the forthcoming ISDA Standard Credit Support Annex (SCSA), the trades denominated in non-G5 currencies as well as those include multiple currencies are expected to be allocated to the USD silo, where the contracts are collateralized by USD cash, or a different currency with an appropriate interest rate overlay to ac…
The US Census Bureau corrupts data to protect privacy, but we show how to clean and analyze it effectively.
problem Analyzing Census data with intentional corruption to maintain privacy.
method Formulated a semiparametric model, proposed data cleaning, estimation, and inference procedures.
result Demonstrated that data cleaning can maintain precision and provided theoretical and empirical support.
A graph helps understand Artin groups better.
problem Understanding the structure of Artin groups.
method Constructing a marking graph with transverse parabolic subgroups and defining natural moves.
result The marking graph is quasi-isometric to the group modulo its center.
Paper tackles label noise in large datasets, purifying noisy data with a nonparametric framework.
problem Label noise in large-scale datasets with coarse labels.
method Develops a model-agnostic nonparametric framework for classification.
result Framework purifies noisy data using a small clean dataset and manages ambiguous samples.
Unified approach for multicalibration in weakly supervised learning.
problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.
Study connects covariance cleaning theory to information theory for heavy-tailed distributions.
problem Optimizing covariance matrices for heavy-tailed distributions using information theory.
method Minimizing Frobenius norm and information loss between true and estimated covariance matrices.
result Asymptotic regime of large matrices minimizes information loss for Student's t distributions.
Paper cleans option price datasets by removing outliers.
problem Unusual option prices in datasets.
method Statistical techniques to identify and remove outliers.
result Removes option prices violating no arbitrage assumption.
New analysis shows PE in Transformers increases generalization gap and vulnerability.
problem Understanding the impact of PE on Transformer generalization and robustness.
method Generalization analysis and adversarial Rademacher bounds for a single-layer Transformer with trainable PE.
result PE systematically enlarges the generalization gap and makes models more vulnerable to attacks.
Graph neural networks (GNNs) are widely used in many applications. However, their robustness against adversarial attacks is criticized. Prior studies show that using unnoticeable modifications on graph topology or nodal features can significantly reduce the performances of GNNs. It is very challenging to design robust …
Improved speech enhancement using diffusion models with MSE loss.
problem Efficient incorporation of noisy speech in generative speech enhancement.
method Augmented diffusion-based generative model with a MSE loss for enhanced speech.
result Proposed method improves speech enhancement performance compared to original diffusion model.