Research
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

10.7%21.4%32.0%42.7% · Jun 202019922001200920172026
48 results for Data Contamination

Generative models can still learn from contaminated data, but with limitations.

problem How much contamination can generative models tolerate?
method Characterized robustness under contaminated enumerations, proving generation is achievable for all countable collections if contamination fraction converges to zero.
result Generation under contamination is achievable for all countable collections if contamination fraction converges to zero, but dense generation is strictly less robust.

New method trims network data to resist adversarial contamination.

problem Adversarial contamination in network data affects statistical and algorithmic performance.
method Proposes a new trimming method operating in model space to address both block and white noise contamination.
result Demonstrates superior performance in simulations compared to direct trimming.

The paper analyzes how conformal prediction works with contaminated reference data.

problem The impact of contamination on the validity and power of conformal prediction methods.
method The paper analyzes the impact of contamination on the validity of conformal methods and proposes a data-cleaning framework to enhance power.
result The proposed data-cleaning framework can effectively enhance power while maintaining type-I error control.

Theoretical study shows AI models can recover from contaminated training data.

problem Data contamination in AI training can degrade model performance.
method Theoretical analysis and experiments on various data types.
result Models converge to true distribution under mild conditions, with rate dependent on real data fraction.

Study robustness of split conformal prediction in data contamination setting.

problem Robustness of split conformal prediction under data contamination.
method Analyze split conformal prediction's performance in a contaminated data setting and propose a new method.
result Demonstrated the impact of corrupted data on prediction intervals' coverage and efficiency.

A low rank matrix X has been contaminated by uniformly distributed noise, missing values, outliers and corrupt entries. Reconstruction of X from the singular values and singular vectors of the contaminated matrix Y is a key problem in machine learning, computer vision and data science. In this paper we show that common…

2017-10-26abs ↗pdf ↗

Efficiently clusters data with weak assumptions, robust to contamination.

problem General-shaped clustering under weak parametric assumptions with data contamination.
method Two-step hybrid robust clustering algorithm combining trimmed k-means and hierarchical agglomeration.
result Outperforms state-of-the-art methods in various applications.

New algorithm resists contamination in high-dimensional regression with optimal performance.

problem Adversarial and measurement errors in high-dimensional data.
method Adversarial Contamination-resistant Iterative Hard Thresholding (AC-IHT) algorithm.
result Achieves minimax near-optimal estimation and signal-adaptive support recovery.

Neural networks compress and sample WDN contamination dynamics efficiently.

problem Infrastructure monitoring of complex, networked systems like water distribution networks is expensive and challenging.
method Developed Graph Fourier Transform (GFT) operators and neural networks (NN) for efficient data collection and inference.
result High accuracy reconstruction of contamination dynamics using only 5-10% of the sample set.

Theoretical study on AI models' resilience to data contamination during recursive training.

problem Data contamination in recursive training of generative AI models.
method General framework with minimal assumptions on real data distribution and flexible generative models.
result Contaminated recursive training converges with a rate equal to the minimum of baseline model's rate and contamination fraction.

Improved robust regression for heavy-tailed and contaminated data.

problem Linear regression with heavy-tailed and adversarially contaminated covariates and responses.
method Applying a filtering algorithm to covariates and then using Huber regression, least trimmed squares, or least absolute deviation estimators on the remaining data.
result Near-optimal error rates achieved for the Huber regression estimator.

Paper shows MoM is optimal under adversarial contamination for certain distributions.

problem Optimality of MoM under adversarial contamination.
method Upper and lower bounds for MoM's error under adversarial contamination.
result MoM is (minimax) optimal for distributions with finite variance and infinite variance with finite absolute moments.

A contaminated mixture model detects outliers in multivariate functional data.

problem Detecting abnormal sensor measurements in multivariate functional data.
method A contaminated mixture model that clusters and detects outliers without specifying outlier proportion.
result The model outperforms competitors and correctly detects abnormal behaviors in real data.

A contamination in a 3-manifold is an object interpolating between the contact structure and the lamination. Contaminations seem to provide a link between 3-dimensional contact geometry and the classical topology of 3-manifolds, as described in a separate paper. In this paper we deal with contaminations carried by bran…

2003-07-21abs ↗pdf ↗

A robust loss for anomaly mitigation and unsupervised contamination classification

problem Detecting and mitigating contamination in supervised and unsupervised settings
method Neural Bayesian Anomaly Mitigation (NBAM)
result Recovering the structure of contamination and identifying label-flip pairs

Efficiently estimates mean in contaminated Gaussian data with near-optimal sample complexity.

problem Robust mean estimation in the presence of mean-shift contamination.
method First computationally efficient algorithm with near-optimal sample complexity and polynomial-time running.
result Approximates the target mean to any desired accuracy with constant fraction of outliers tolerated.

Efficiently estimates sparse linear regression with heavy-tailed and outlier-contaminated data.

problem Estimating sparse linear regression coefficients with heavy-tailed and outlier-contaminated data.
method Efficient computation of estimators with sharp error bounds.
result Sharp error bounds for efficient estimators.

Improves anomaly detection with contaminated unlabeled data.

problem Weakness in existing semi-supervised anomaly detection methods when unlabeled data contain anomalies.
method Integrates positive-unlabeled learning with deep anomaly detection models.
result Achieves better detection performance on various datasets.

Study improves robustness of Bayesian inference for cognitive models.

problem Outliers and contaminants affect parameter estimation in cognitive models.
method Robustness of parameter estimation using amortized Bayesian inference (ABI) with neural networks.
result Introducing contaminants from a Cauchy distribution increases robustness.

Study minimax robustness in statistical estimation under Wasserstein contamination.

problem Adversarial perturbations in statistical data.
method Developed minimax theory for qr\ell_q^r losses under Wasserstein-rr contaminations.
result Exact minimax risk identified for joint contaminations in location estimation and prediction in linear regression.

Study tackles contamination and heterogeneity in multi-task learning, improving robustness and personalization.

problem Challenges in integrating related tasks due to contamination and heterogeneity.
method Proposes a filtering-based robust multi-task gradient descent method to estimate global and clean task-specific minimizers.
result Demonstrates improved robustness and personalization compared to existing methods.

Study shows robust method for estimating density ratios even with heavy contamination.

problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.

In the face of growing needs for water and energy, a fundamental understanding of the environmental impacts of human activities becomes critical for managing water and energy resources, remedying water pollution, and making regulatory policy wisely. Among activities that impact the environment, oil and gas production, …

2019-08-29abs ↗pdf ↗

New method for selective prediction under interventions learns causal structure from data.

problem Tight uncertainty sets in selective conformal prediction under unknown interventional settings.
method Partial causal structure learning for descendant indicators, contamination-robust coverage theorem, algorithms for descendant discovery and distance estimation.
result Valid selective conformal prediction under contamination up to 30% with controlled coverage.

Study on estimating Gaussian mean with missing data in high dimensions.

problem Estimating Gaussian mean in high dimensions with missing data due to realizable contamination.
method Statistical Query model, Low-Degree Polynomials, PTF tests, and algorithms.
result Established information-computation gap and developed efficient algorithms.

Unified framework improves neural network robustness against label noise and adversarial attacks.

problem High sensitivity of neural networks to data contamination, including label noises and adversarial perturbations.
method Unified minimum-divergence estimation problem, rSDNet framework.
result Improves robustness to label corruption and adversarial attacks while maintaining competitive accuracy on clean data.

A new Heckman selection model uses a bivariate contaminated normal distribution for more accurate data analysis.

problem Sample selection biases in econometric data analysis.
method Introduces a Heckman selection model using a bivariate contaminated normal distribution and presents an efficient ECM algorithm for parameter estimation.
result The proposed model outperforms normal and Student's t counterparts in real data analysis and simulation studies.

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.

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.

Robust covariance testing requires significantly more samples in contaminated data.

problem Testing the covariance matrix of a high-dimensional Gaussian in the presence of contamination.
method We study the problem in the Huber's contamination model, distinguishing between the identity matrix and matrices far from it in Frobenius norm.
result The sample complexity of covariance testing increases dramatically to Ω(d2)Ω(d^2) in the contaminated setting.

Bayesian method estimates contamination factor for unsupervised anomaly detection.

problem No good methods for estimating contamination factor in unsupervised anomaly detection.
method Bayesian approach using mixture formulation of anomaly detector outputs.
result Estimated contamination factor distribution is well-calibrated and improves anomaly detection performance.

New methods combat data poisoning attacks in bandit algorithms using limited verification.

problem Data poisoning attacks on bandit algorithms, especially in the UCB and ETC types.
method Verification-based mechanisms to restore optimal regret with limited verifications.
result A simple modified ETC type bandit algorithm can restore optimal regret with O(logT)O(\log T) verifications.