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

65129194258 · Jun 202019922001200920172026
48 results for adaptive contamination

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.

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.

Optimal transport adapted for contaminated probabilities, showing equivalence under specific conditions.

problem Adapting optimal transport for εε-contaminated sets.
method Generalized optimal transport problems with lower probabilities, showing equivalence under εε-contaminations.
result Monge's and Kantorovich's problems coincide under εε-contaminated sets, but not always.

This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, where each arm pull has probability ε\varepsilon of generating a sample from an arbitrary contamination distribution instead of the true und…

2018-02-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.

The paper develops adaptive confidence intervals for Efron's Gaussian two-groups model with unknown contamination.

problem Developing robust uncertainty quantification for Efron's Gaussian two-groups model with unknown contamination fraction.
method The approach involves Fourier-based certification procedures to find minimax-optimal adaptive confidence intervals.
result The minimax-optimal length of adaptive confidence intervals is polynomially worse than when contamination fraction is known.

Paper proposes CLAIR for efficient LLM fine-tuning across clients.

problem Fine-tuning large language models (LLMs) efficiently and collaboratively.
method Federated LoRA fine-tuning with Collaborative Low-rank Alignment and Identifiable Recovery (CLAIR).
result CLAIR achieves better performance and contamination detection compared to local fine-tuning.

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.

New algorithms achieve optimal robustness in stochastic convex optimization under contamination.

problem Determining optimal rates for robust stochastic convex optimization under εε-contamination.
method Developed novel algorithms achieving minimax-optimal excess risk under εε-contamination model without stringent assumptions.
result Achieved minimax-optimal excess risk (up to logarithmic factors) under εε-contamination model.

Study sample complexity of robust binary hypothesis testing under different contamination models.

problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.

Language model benchmarks often misrepresent true understanding, revealing vulnerabilities in evaluation methods.

problem Language model benchmarks fail to accurately reflect true language understanding and adaptability.
method Systematic analysis of NLP evaluation frameworks, identifying vulnerabilities in static benchmarks, human evaluation protocols, and LLM-as-judge frameworks.
result Current evaluation methods are unreliable and need improvement to accurately assess LLM performance.

New robust estimator improves variable selection and coefficient estimation in linear regression with heavy-tailed errors and outliers.

problem Heavy-tailed errors and anomalous predictors in high-dimensional regression.
method Adaptive PENSE estimator for robust variable selection and estimation.
result Adaptive PENSE estimator provides reliable results even under very heavy-tailed errors and aberrant predictors.

Study improves scalability of cell-free massive MIMO networks by optimizing UE-AP association.

problem Optimizing UE-AP association in cell-free massive MIMO networks.
method Deep learning algorithm using Bidirectional Long Short-Term Memory cells and hybrid probabilistic weight updating.
result Enhanced scalability without retraining, robust against pilot contamination.

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

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 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.

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.

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.

New algorithms robust to adversarial data achieve optimal performance.

problem Adversarial robustness in high-dimensional online learning problems.
method Alternating minimization scheme combining least-squares and convex reweighting.
result Achieves optimal robustness guarantees without distributional assumptions.

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 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.

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.

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.

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 ↗

New algorithm resists corruption in linear contextual bandits.

problem Adversarial corruption in linear contextual bandits.
method Variance-aware algorithm with multi-level partition and adaptive confidence sets.
result Regret bound of ildeO(C2dt=1Tσt2+C2RdT) ilde{O}(C^2d\sqrt{\sum_{t = 1}^T σ_t^2} + C^2R\sqrt{dT}).

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.

We address challenges in estimating parameters from adaptively collected data.

problem Estimating parameters from data collected adaptively leads to non-normal asymptotic distributions.
method We develop semi-parametric estimators that account for adaptivity in data collection.
result Our estimators are asymptotically normal under certain conditions.

A new method optimizes anomaly scoring from score distribution to improve AD performance.

problem Vulnerability to anomaly contamination and lack of adaptability in existing AD methods.
method Optimizes anomaly scoring function from score distribution perspective, using Overlap loss.
result Overlap loss-based AD models significantly outperform state-of-the-art methods.

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.

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.

The paper analyzes how overparameterized models can generalize well in multiclass classification.

problem Generalization in multiclass classification with overparameterized models.
method Survival/contamination analysis framework adapted for multiclass classification.
result Multiclass classification can generalize well even with many classes, unlike regression tasks.