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,694 papers · 148 categories

Trend · papers per month

11223344 · Jun 202019922001200920172026
48 results for corruption

Develops a comprehensive theory of corruption in supervised learning.

problem Widespread corruption in data collection affects supervised learning problems.
method Introduces a general theory of corruption using Markov kernels, distinguishing and comparing corruption types.
result Establishes a unified framework for corruption types and develops mitigation strategies.

New algorithm robust to label corruptions in active learning.

problem Active learning under unknown adversarial label corruptions.
method Proposed a new active learning algorithm that is provably correct without assumptions on corruptions.
result Achieves minimax label complexity in non-corrupted setting and only requires additional labels to achieve desired accuracy in corrupted setting.

Study improves image classifier robustness to random p-norm corruptions.

problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.

Unified framework for corruption-robust linear bandits with optimal gap-dependent misspecification bounds.

problem Effective learning in linear bandits with corrupted rewards across different corruption models.
method Unified framework for analyzing strong and weak corruption, connection to gap-dependent misspecification, and specialized algorithm.
result Optimal bounds for gap-dependent misspecification in linear bandits.

We report quantitative relations between corruption level and economic factors, such as country wealth and foreign investment per capita, which are characterized by a power law spanning multiple scales of wealth and investments per capita. These relations hold for diverse countries, and also remain stable over differen…

2007-05-01abs ↗pdf ↗

CUTS removes corruption from models without clean data, improving utility and security.

problem Removing corruption from models without access to clean training data.
method CUTS uses a proxy set to amplify corruption and subtract it from model weights.
result CUTS recovers a large fraction of lost utility and nearly eliminates attacks with minimal damage.

Binary classification improves with a small fraction of corrupted labels.

problem Binary classification with corrupted labels.
method Established corruption as a form of regularization and computed upper bounds on estimation error.
result Corruption is beneficial only up to a small fraction of the total sample, scaling with the square root of the sample size.

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of arbitrary corruption, tractable recovery is possible when both signal and corrup…

2013-05-11abs ↗pdf ↗

New algorithm optimizes noisy, potentially corrupted functions.

problem Optimizing unknown functions with noisy bandit feedback, especially when evaluations are corrupted.
method Fast-Slow GP-UCB algorithm, combining robust and non-robust evaluations, enlarged confidence bounds.
result Theoretical analysis upper bounds cumulative regret, showing dependencies on corruption level and kernel.

New algorithm reduces linear contextual bandit regret with adversarial corruption.

problem Linear contextual bandit with adversarial reward corruption.
method Optimism in the face of uncertainty principle, weighted ridge regression.
result Achieves nearly optimal regret for both corrupted and uncorrupted cases.

We extend the model of stochastic bandits with adversarial corruption (Lykouriset al., 2018) to the stochastic linear optimization problem (Dani et al., 2008). Our algorithm is agnostic to the amount of corruption chosen by the adaptive adversary. The regret of the algorithm only increases linearly in the amount of cor…

2019-09-04abs ↗pdf ↗

Picket guards against corrupted data in machine learning models.

problem Data corruption biases models and invalidates predictions.
method PicketNet detects corrupted data using self-supervised deep learning; flags corrupted queries online.
result Picket consistently protects models from corrupted data during training and deployment.

We use methods from network science to analyze corruption risk in a large administrative dataset of over 4 million public procurement contracts from European Union member states covering the years 2008-2016. By mapping procurement markets as bipartite networks of issuers and winners of contracts we can visualize and de…

2019-09-18abs ↗pdf ↗

The main purpose of this paper is to formalize the modelling process, analysis and mathematical definition of corruption when entering into a contract between principal agent and producers. The formulation of the problem and the definition of concepts for the general case are considered. For definiteness, all calculati…

2018-04-06abs ↗pdf ↗

Algorithm maximizes total reward in multi-agent bandits with adversarial corruptions.

problem Maximizing total reward in multi-agent bandits with adversarial corruptions.
method Proposes a cooperative learning algorithm robust to adversarial corruptions.
result Demonstrates an additive O((L/Lmin)C)O((L / L_{\min}) C) regret term for an adversary with unknown corruption budget.

New algorithm robustly trains deep neural networks under corrupted supervision.

problem Training deep neural networks with corrupted supervision data.
method Unified framework for classification and regression, focusing on collective impact of data points on average gradient.
result Achieves strong guarantees without assuming the type of corruption, robust under various types of corruption.

We inspect a possible clustering structure of the corruption perception among 134 countries. Using the average linkage clustering, we uncover a well-defined hierarchy in the relationships among countries. Four main clusters are identified and they suggest that countries worldwide can be quite well separated according t…

2015-01-31abs ↗pdf ↗

This study tackles adversarial corruption in model-based reinforcement learning.

problem Adversarial corruption in model-based reinforcement learning.
method Maximum likelihood estimation (MLE) approach for learning transition model in both online and offline settings.
result Proves a regret of ildeO(T+C) ilde{\mathcal{O}}(\sqrt{T} + C) for CR-OMLE and a suboptimality of O(C/n)\mathcal{O}(C/n) for CR-PMLE.

Current reinforcement learning methods fail if the reward function is imperfect, i.e. if the agent observes reward different from what it actually receives. We study this problem within the formalism of Corrupt Reward Markov Decision Processes (CRMDPs). We show that if the reward corruption in a CRMDP is sufficiently "…

2019-06-30abs ↗pdf ↗

Improved SGD for robust linear and ReLU regression with adversarial corruptions.

problem Robust regression with adversarial corruptions in streaming data.
method Stochastic gradient descent (SGD-exp) with exponentially decaying step size.
result Nearly linear convergence to true parameter with up to 50% Massart corruption rate.

Monotone adversarial corruptions degrade optimal learning algorithms.

problem Optimal learning algorithms' reliance on exchangeability and independence is challenged.
method Introduces a monotone adversarial corruption model where an adversary adds monotone corruptions to a clean dataset.
result Optimal learning algorithms achieve suboptimal expected error on new test points.

Conventional sampling techniques fall short of drawing descriptive sketches of the data when the data is grossly corrupted as such corruptions break the low rank structure required for them to perform satisfactorily. In this paper, we present new sampling algorithms which can locate the informative columns in presence …

2016-11-18abs ↗pdf ↗

Adaptive learning method identifies and corrects corrupted data.

problem Robust learning from corrupted training sets.
method Identifies corrupted and non-corrupted samples with latent Bernoulli variables, formulates as likelihood maximization with marginalized latent variables, solved via variational inference and Expectation-Maximization.
result Improves over state-of-the-art by automatically inferring corruption level with minimal overhead.

CRIMED optimizes regret in bandits with unbounded stochastic corruption.

problem Minimizing regret in bandits with arbitrary unbounded corruptions.
method Introduces CRIMED, an asymptotically-optimal algorithm for Gaussian distributions with known variance.
result Achieves exact lower bound on regret for Gaussian distributions with high corruption probability.

Deep networks learn clean structure before memorizing corrupted labels, leaving a spectral signature in gradient centered scatter.

problem Deep networks' transition from learning clean structure to memorizing corrupted labels under label noise.
method Analysis of the centered scatter of per-example last-layer gradients to identify Fisher Rank Inflation.
result Fisher Rank Inflation is a spectral signature of memorization under label noise, with effective rank expanding during memorization.

RGI improves robustness of GAN-inversion for image restoration and anomaly detection.

problem Robustness of GAN-inversion to unknown gross corruptions.
method Proposes RGI and R-RGI methods with provable robustness guarantees.
result Restored images and corrupted region masks converge to ground truth under mild assumptions.

Paper introduces robust deep learning method for handling random data corruption.

problem Random corruption in deep learning data due to limited quality of data.
method Inspired by median-of-means and Le Cam's principle, introduces a new approach.
result Demonstrates the approach performs well in practice and is a promising alternative to standard training methods.

RILA learns HQMMs robustly against adversarial corruption.

problem Robustness of HQMM learning algorithms under adversarial perturbations.
method Adversarially Corrupted HQMM (AC-HQMM) and Robust Iterative Learning Algorithm (RILA).
result RILA outperforms existing algorithms in convergence stability, corruption resilience, and physical validity.

Study on measuring vulnerability of neural network parameters via corruption.

problem Understanding the robustness and generalization of deep neural networks.
method Proposes an indicator to measure parameter robustness via parameter corruption and provides a gradient-based estimation.
result Demonstrates the effectiveness of the proposed indicator and training method in improving parameter robustness and accuracy.

New method tackles adversarial sign-corrupted isotonic regression, estimating monotonic signals under heavy dependence.

problem Estimating monotonic signals when responses are sign-corrupted and adversarially designed to violate monotonicity.
method Developed ASCIFIT, a three-step estimation procedure using PAVA with pre- and post-processing corrections.
result Theoretical guarantees of sharp high probability upper bounds and minimax lower bounds for ASCIFIT.

We introduce a new metric to evaluate corruption robustness of ML classifiers.

problem Evaluating corruption robustness of machine learning classifiers.
method We propose a test data augmentation method using minimal class separation distance to derive a robustness distance ε and a metric MSCR.
result The MSCR metric allows interpretable comparison of classifier robustness on different datasets.

Study examines how governance, corruption, and R&D affect economic development.

problem The impact of corruption and governance on economic development.
method General equilibrium model with heterogeneous agents and a government, including corruption as a fraction of tax revenues.
result Redistribution and innovation-led strategies can mitigate the negative effects of corruption on economic development.

A new algorithm reduces regret in bandit problems with adversarial corruptions.

problem Optimizing decision-making in bandit problems with variable uncertainties and adversarial interference.
method Proposes HCW-GLB-OMD, an OMD-based estimator with Hessian-based confidence weights for robustness.
result Achieves instance-wise minimax optimality with a κκ-factor in the corruption term.