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

Trend · papers per month

4080120160 · Jun 202019922001200920172026
48 results for malicious noise

Improved sample complexity for learning halfspaces with malicious noise.

problem Efficiently learning halfspaces in the presence of malicious noise.
method New analysis of Awasthi et al. algorithm with matrix Chernoff inequality and localization schemes.
result Achieved near-optimal sample complexity of ildeO(d) ilde{O}(d) for isotropic log-concave distributions.

Efficiently learns halfspaces with malicious noise, near-optimal label complexity.

problem Learning ss-sparse halfspaces under malicious label noise.
method Active learning algorithm with instance reweighting and empirical risk minimization.
result Near-optimal label complexity of O(slog4d/ε)O(s \log^4 d / ε) and noise tolerance Ω(ε)Ω(ε).

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

problem Sparse estimation of linear regression coefficients with heavy-tailed covariates and noises, including outliers.
method Efficient computation of robust estimator with nearly optimal error bound.
result Nearly optimal error bound for robust sparse estimation.

Proposes a method to improve Byzantine-robustness in compressed federated learning.

problem Byzantine-robustness in compressed federated learning.
method Gradient difference compression and stochastic average gradient algorithm (SAGA).
result The proposed method reaches a neighborhood of the optimal solution at a linear convergence rate.

New method detects and measures malicious users in recommendation algorithms.

problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.

A scalable protocol for federated averaging with privacy and correctness guarantees.

problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.

New algorithm reduces regret in multi-agent bandits with malicious agents.

problem Collaboration between honest and malicious agents in multi-armed bandits.
method Dynamic reduction of communication with malicious agents, learning who is malicious.
result Algorithm reduces regret even with a single malicious agent, assuming mm is small compared to KK.

Proposes a new model for noisy labels considering multiple labelers and adversarial attacks.

problem Real-world noisy label models with multiple labelers and adversarial attacks.
method Labeler-dependent noise model with adversarial attack vectors.
result State-of-the-art approaches for learning from noisy labels are defeated by adversarial label attacks.

We consider the problem of estimating the mean and covariance of a distribution from iid samples in Rn\mathbb{R}^n, in the presence of an ηη fraction of malicious noise; this is in contrast to much recent work where the noise itself is assumed to be from a distribution of known type. The agnostic problem includes many…

2016-04-24abs ↗pdf ↗

Detects malicious accounts in permissionless blockchains using graph properties and ML.

problem Identifying and classifying malicious accounts in permissionless blockchains.
method Temporal graph properties, ML algorithms (ExtraTreesClassifier, K-Means), cosine similarity, behavior change analysis.
result ExtraTreesClassifier performs best in detecting malicious accounts on Ethereum blockchain.

Federated learning systems are vulnerable to attacks from malicious clients. As the central server in the system cannot govern the behaviors of the clients, a rogue client may initiate an attack by sending malicious model updates to the server, so as to degrade the learning performance or enforce targeted model poisoni…

2020-02-01abs ↗pdf ↗

Paper proposes efficient privacy-preserving matrix encryption for secure collaborative learning against malicious adversaries.

problem Secure collaborative learning of sensitive data across different agencies is challenging with malicious adversaries.
method The paper applies matrix encryption to secure data against chosen plaintext attack, known plaintext attack, and collusion attack, achieving local differential privacy and high computation efficiency.
result The proposed schemes are computationally efficient and secure against malicious adversaries compared to existing techniques.

Data poisoning attacks can severely degrade FL models, especially targeting specific classes.

problem Data poisoning attacks against federated learning systems.
method Demonstrated targeted attacks on FL systems, analyzed attack longevity, and proposed a defense strategy.
result Data poisoning attacks can cause substantial drops in classification accuracy and recall with a small percentage of malicious participants.

With the celebrated success of deep learning, some attempts to develop effective methods for detecting malicious PowerShell programs employ neural nets in a traditional natural language processing setup while others employ convolutional neural nets to detect obfuscated malicious commands at a character level. While the…

2018-10-03abs ↗pdf ↗

Detection of malware-infected computers and detection of malicious web domains based on their encrypted HTTPS traffic are challenging problems, because only addresses, timestamps, and data volumes are observable. The detection problems are coupled, because infected clients tend to interact with malicious domains. Traff…

2019-06-21abs ↗pdf ↗

Adversarial inference on tree models is possible with limited corruption, improving on Kesten-Stigum threshold.

problem Posterior inference on tree-structured graphical models in the presence of adversarial corruption.
method Dynamic programming via belief propagation, constrained adversarial corruption.
result Belief propagation can perform accurate inference with limited adversarial corruption.

Recently, the field of adversarial machine learning has been garnering attention by showing that state-of-the-art deep neural networks are vulnerable to adversarial examples, stemming from small perturbations being added to the input image. Adversarial examples are generated by a malicious adversary by obtaining access…

2019-08-06abs ↗pdf ↗

Efficient active learning method defends against malicious mislabeling and data poisoning attacks.

problem Malicious mislabeling and data poisoning attacks on deep neural networks.
method Adversarial retraining and active learning with random sampling strategy.
result The proposed method achieves 89% accuracy with only one-third of the labeled data, significantly outperforming the baseline method.

Over the last few years, the phenomenon of adversarial examples --- maliciously constructed inputs that fool trained machine learning models --- has captured the attention of the research community, especially when the adversary is restricted to small modifications of a correctly handled input. Less surprisingly, image…

2019-01-29abs ↗pdf ↗

Noise injection improves inference privacy in DNN models.

problem Malicious servers can infer sensitive attributes from input data.
method Adaptive Noise Injection (ANI) using a lightweight DNN on the client.
result Significant improvement in privacy (up to 48.5% degradation in sensitive-task accuracy with <1% degradation in primary accuracy).

We consider high dimensional sparse regression, and develop strategies able to deal with arbitrary -- possibly, severe or coordinated -- errors in the covariance matrix XX. These may come from corrupted data, persistent experimental errors, or malicious respondents in surveys/recommender systems, etc. Such non-stochas…

2013-01-12abs ↗pdf ↗

Phishing is the simplest form of cybercrime with the objective of baiting people into giving away delicate information such as individually recognizable data, banking and credit card details, or even credentials and passwords. This type of simple yet most effective cyber-attack is usually launched through emails, phone…

2019-05-22abs ↗pdf ↗

An important problem in networked systems is detection and removal of suspected malicious nodes. A crucial consideration in such settings is the uncertainty endemic in detection, coupled with considerations of network connectivity, which impose indirect costs from mistakely removing benign nodes as well as failing to r…

2019-01-31abs ↗pdf ↗

New algorithm reduces regret in multi-agent bandits over undirected graphs.

problem Minimize regret in a multi-agent bandit setting with malicious agents.
method Proposed a new algorithm for undirected graphs, considering the number of malicious neighbors.
result The new algorithm achieves nearly linear regret improvement over existing methods.

FLANDERS detects and blocks extreme model poisoning in federated learning.

problem Resilience against large-scale model poisoning attacks in federated learning.
method FLANDERS treats client updates as matrix-valued time series and identifies outliers using autoregressive forecasting.
result FLANDERS significantly improves robustness in federated learning across various attacks.

The devastating effects of cyber-attacks, highlight the need for novel attack detection and prevention techniques. Over the last years, considerable work has been done in the areas of attack detection as well as in collaborative defense. However, an analysis of the state of the art suggests that many challenges exist i…

2019-09-17abs ↗pdf ↗

We present, GEM, the first heterogeneous graph neural network approach for detecting malicious accounts at Alipay, one of the world's leading mobile cashless payment platform. Our approach, inspired from a connected subgraph approach, adaptively learns discriminative embeddings from heterogeneous account-device graphs …

2020-02-27abs ↗pdf ↗

Contextual bandit algorithms are applied in a wide range of domains, from advertising to recommender systems, from clinical trials to education. In many of these domains, malicious agents may have incentives to attack the bandit algorithm to induce it to perform a desired behavior. For instance, an unscrupulous ad publ…

2020-02-10abs ↗pdf ↗

Data analytics and machine learning techniques are being rapidly adopted into the power system, including power system control as well as electricity market design. In this paper, from an adversarial machine learning point of view, we examine the vulnerability of data-driven electricity market design. More precisely, w…

2019-11-18abs ↗pdf ↗

Federated learning distributes model training among a multitude of agents, who, guided by privacy concerns, perform training using their local data but share only model parameter updates, for iterative aggregation at the server. In this work, we explore the threat of model poisoning attacks on federated learning initia…

2018-11-29abs ↗pdf ↗