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

79158237316 · Jun 202019922001200920172026
48 results for corrupted measurements

Gradient descent recovers low-rank matrices from corrupted measurements with double over-parameterization.

problem Robust recovery of low-rank matrices from grossly corrupted measurements.
method Gradient descent with discrepant learning rates for double over-parameterized models.
result Gradient descent with discrepant learning rates provably recovers the underlying matrix without prior knowledge on rank or sparsity.

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 ↗

Study robust mean estimation under coordinate-level corruptions using Hamming distance.

problem Robust mean estimation under realistic coordinate-level corruptions.
method Introduce a novel Hamming distance-based measure and present information-theoretic analysis.
result Data cleaning-inspired approaches can match information theoretic bounds for robust mean estimation.

In order to investigate whether government regulations against corruption can affect the economic growth of a country, we analyze the dependence between Gross Domestic Product (GDP) per capita growth rates and changes in the Corruption Perceptions Index (CPI). For the period 1999-2004 on average for all countries in th…

2007-10-10abs ↗pdf ↗

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 ↗

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.

Robust Kalman filter for corrupted measurements.

problem Estimating linear dynamical systems from noisy measurements, especially when a fraction of measurements are adversarially corrupted.
method Developed a robust Kalman filter framework that can handle large and unknown perturbations in measurement noise.
result First strong provable guarantees for linear quadratic estimation with adversarial corruptions.

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 ↗

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 ↗

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.

We consider the robust phase retrieval problem of recovering the unknown signal from the magnitude-only measurements, where the measurements can be contaminated by both sparse arbitrary corruption and bounded random noise. We propose a new nonconvex algorithm for robust phase retrieval, namely Robust Wirtinger Flow to …

2017-04-20abs ↗pdf ↗

Dynamic Influence Tracker measures changing sample importance during model training.

problem Static influence measurements during training overlook how sample importance varies over time.
method Dynamic Influence Tracker (DIT) captures time-varying sample influence across arbitrary time windows.
result DIT reveals distinct learning phases with shifting priorities and detects corrupted samples more efficiently.

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.

Framework learns data manifold and generative model from corrupted data.

problem Learning from corrupted data with latent manifold structures.
method Riemannian AmbientFlow, incorporating normalizing flows and Riemannian Autoencoders.
result Framework recovers underlying data distribution and smooth manifold parametrization.

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.

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 model robustness against corruptions using online adaptation.

problem Machine vision models' vulnerability to image corruptions like blurring or compression artefacts.
method Using corrupted images' statistics for unsupervised online adaptation to improve robustness.
result ResNet-50 achieves 62.2% mCE on ImageNet-C with adaptation, improving from 76.7% without.

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

The paper addresses uncertainties in spectral clustering of corrupted data.

problem Uncertainties in spectral clustering due to measurement errors and missing data.
method Mathematical framework based on random set theory for Monte Carlo approximation of expected clusterings.
result Consistent quantities of interest for evaluating clusterings in corrupted data.

Study robust recovery of low-rank matrices from corrupted measurements without rank prior.

problem Robust recovery of low-rank matrices from corrupted Gaussian measurements with unknown rank.
method Subgradient method with diminishing stepsizes for nonconvex nonsmooth problem.
result Subgradient method converges to exact low-rank solution at sublinear rate under RDPP condition.

We introduce a comprehensive and statistical framework in a model free setting for a complete treatment of localized data corruptions due to severe noise sources, e.g., an occluder in the case of a visual recording. Within this framework, we propose i) a novel algorithm to efficiently separate, i.e., detect and localiz…

2014-09-30abs ↗pdf ↗

Class selectivity affects robustness to corruptions but not to adversarial attacks.

problem Understanding the relationship between class selectivity and robustness in neural networks.
method Investigated the impact of class selectivity on robustness to natural corruptions and adversarial attacks using Tiny ImageNetC and CIFAR10C datasets.
result Decreasing class selectivity increases robustness to both natural corruptions and adversarial attacks.

This paper develops a dynamic internal fraud model for operational losses in retail banking. It considers public operational losses arising from internal fraud in retail banking within a group of international banks. Additionally, the model takes into account internal factors such as the ethical quality of workers and …

2020-02-08abs ↗pdf ↗

We introduce a new model of stochastic bandits with adversarial corruptions which aims to capture settings where most of the input follows a stochastic pattern but some fraction of it can be adversarially changed to trick the algorithm, e.g., click fraud, fake reviews and email spam. The goal of this model is to encour…

2018-03-25abs ↗pdf ↗

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2016-10-21abs ↗pdf ↗

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2015-07-16abs ↗pdf ↗

This paper investigates the phase retrieval problem, which aims to recover a signal from the magnitudes of its linear measurements. We develop statistically and computationally efficient algorithms for the situation when the measurements are corrupted by sparse outliers that can take arbitrary values. We propose a nove…

2016-03-11abs ↗pdf ↗

AMP algorithms can be efficiently simulated by SDPs even with corrupted data.

problem Optimizing average-case optimization problems with corrupted data.
method Local statistics hierarchy semidefinite programs (SDPs) simulate AMP algorithms robustly.
result Robust guarantees for many AMP algorithms are offered, contrasting with strong lower bounds for SDPs.

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.

Blind source separation (BSS) aims at recovering signals from mixtures. This problem has been extensively studied in cases where the mixtures are contaminated with additive Gaussian noise. However, it is not well suited to describe data that are corrupted with Poisson measurements such as in low photon count optics or …

2018-12-11abs ↗pdf ↗

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.

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 resolves BIHT convergence, showing normalization is not necessary in noiseless settings but crucial for robustness.

problem Analyzing convergence and robustness of BIHT for 1-bit compressed sensing.
method Characterizes BIHT convergence and robustness, proving necessity of normalization for robustness under sign corruptions.
result Per-iteration normalization is not necessary for optimal recovery in noiseless settings but is crucial for robustness under sign corruptions.

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.

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.