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

58117175233 · Jun 202019922001200920172026
48 results for targeted corruption

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.

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.

Enhances neural network robustness with Mixup and TLAT.

problem Neural networks are sensitive to various perturbations and adversarial examples.
method Combines Mixup augmentation with Targeted Labeling Adversarial Training (TLAT).
result M-TLAT increases robustness against 19 corruptions and 5 adversarial attacks without reducing clean sample accuracy.

COLUMBUS discovers new features to improve domain generalization.

problem Improving machine learning models' ability to generalize to unseen domains.
method COLUMBUS uses targeted corruption of input and multi-level representations to discover new features.
result COLUMBUS achieves state-of-the-art performance on DG benchmarks.

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.

A diffusion model estimates data manifold dimension by tracking likelihood increases.

problem Estimating the intrinsic dimension of data manifolds.
method Trained diffusion model approximates score function, revealing manifold directionality.
result Diffusion model provides an approximation of the tangent space's dimension.

Model predicts counterfactuals under domain shift and inaccessible variables.

problem Runtime domain corruption impairs counterfactual prediction.
method Subsumes counterfactual prediction under domain adaptation, uses adversarial domain adaptation to reduce distribution disparity.
result VEGAN outperforms baselines in individual-level treatment effect estimation.

Quantifying the value of data is a fundamental problem in machine learning. Data valuation has multiple important use cases: (1) building insights about the learning task, (2) domain adaptation, (3) corrupted sample discovery, and (4) robust learning. To adaptively learn data values jointly with the target task predict…

2019-09-25abs ↗pdf ↗

State-of-the art vision models can achieve superhuman performance on image classification tasks when testing and training data come from the same distribution. However, when models are tested on corrupted images (e.g. due to scale changes, translations, or shifts in brightness or contrast), performance degrades signifi…

2019-06-08abs ↗pdf ↗

This paper optimizes attacks on stochastic bandits and proposes defenses against them.

problem Optimizing adversarial attacks on stochastic bandit algorithms.
method Designs optimal attack strategies and proposes defense algorithms.
result Optimal attack strategies and defense algorithms achieve near perfect performance.

When society maintains a competitive system to promote an abstract goal, competition by necessity relies on imperfect proxy measures. For instance profit is used to measure value to consumers, patient volumes to measure hospital performance, or the Journal Impact Factor to measure scientific value. Here we note that \t…

2018-03-01abs ↗pdf ↗

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.

In this article, we improve extreme learning machines for regression tasks using a graph signal processing based regularization. We assume that the target signal for prediction or regression is a graph signal. With this assumption, we use the regularization to enforce that the output of an extreme learning machine is s…

2018-03-12abs ↗pdf ↗

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.

This paper improves test-time adaptation for distribution shifts using confidence maximization and input transformation.

problem Improving deep networks' performance on data shifted from the training distribution.
method Proposes a novel loss function combining confidence maximization and batch-wise entropy maximization with an input transformation module.
result Significantly improves robustness of pretrained networks to corruptions on benchmarks like ImageNet-C.

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.

A new generalized Statistical Complexity Measure (SCM) was proposed by Rosso et al in 2010. It is a functional that captures the notions of order/disorder and of distance to an equilibrium distribution. The former is computed by a measure of entropy, while the latter depends on the definition of a stochastic divergence…

2012-07-03abs ↗pdf ↗

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 ↗

Matrix completion is a modern missing data problem where both the missing structure and the underlying parameter are high dimensional. Although missing structure is a key component to any missing data problems, existing matrix completion methods often assume a simple uniform missing mechanism. In this work, we study ma…

2018-12-19abs ↗pdf ↗

ATC predicts target domain accuracy using only labeled and unlabeled data.

problem Predicting out-of-distribution performance with limited labeled data.
method Average Thresholded Confidence (ATC) method that learns a threshold on model confidence.
result ATC outperforms previous methods across various types of distribution shifts and datasets.

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.

The paper examines how gradient descent stabilizes low-rank matrix factorization in noisy conditions.

problem Stability of low-rank implicit regularization in perturbed deep matrix factorization.
method Derives spectral conditions for gradient descent to exhibit a low-rank phase in noiseless settings and analyzes perturbed dynamics.
result Gradient descent converges to a low-rank solution under perturbation, with explicit dependence on perturbation size.

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 ↗