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

Trend · papers per month

14274154 · Oct 201919922001200920172026
48 results for malicious events

Adversarial neural network improves cyber attack detection across different networks.

problem Detecting cyber attacks across networks with different traffic distributions.
method Adversarial Siamese neural network that learns invariant attack representations.
result The method retrieves sizable proportions of malicious events, even when trained on one dataset and tested on another.

Develops a framework to assess infrastructure reliability under natural and malicious events.

problem Assessing reliability and costs of infrastructure under various hazards.
method Coupling mechanical reliability analyses with economical reliability analyses using probabilistic considerations.
result Indicators of probable cost of failure for infrastructure, aiding safety investments.

ADSAGE detects anomalies in graph edge sequences for insider threat detection.

problem Detecting insider threats in fine-grained audit logs using graph and text features.
method Anomaly detection at edge level, supporting numeric, categorical, and text attributes.
result ADSAGE detects anomalies in authentications and email communications effectively.

Paper examines adversarial attacks on event cause analysis in power grids.

problem Adversarial attacks manipulate data to mislead event classifiers.
method Investigated adversarial attacks on CNN-based event cause analysis.
result Demonstrated adversaries can misclassify events through stealthy data manipulations.

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.

New framework detects and removes malicious model updates in federated learning.

problem Vulnerability of federated learning systems to malicious client attacks.
method Central server learns to detect and remove malicious model updates using a detection model.
result Ensures robust federated learning resilient to Byzantine and targeted model poisoning attacks.

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.

Detects malware-infected clients and malicious domains using transfer learning.

problem Detecting malware-infected computers and malicious web domains from encrypted HTTPS traffic.
method Transfer learning with sluice networks to bootstrap each other's detection models.
result Outperforms known reference models and detects previously unknown malware and domains.

For well over a quarter century, detection systems have been driven by models learned from input features collected from real or simulated environments. An artifact (e.g., network event, potential malware sample, suspicious email) is deemed malicious or non-malicious based on its similarity to the learned model at runt…

2016-03-31abs ↗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.

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 ↗

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.

GEM detects malicious accounts using adaptive embeddings from heterogeneous graphs.

problem Detecting malicious accounts on a leading mobile payment platform.
method Adaptive learning of discriminative embeddings from heterogeneous account-device graphs with attention mechanism for node importance.
result GEM consistently outperforms competitive methods in detecting malicious accounts.

Optimal policies identified for learning systems with a malicious expert.

problem Adversarial attacks on learning systems combining expert advice.
method Analysis of offline and online settings, dynamic programming for online setting.
result Greedy policy is asymptotically optimal with approximation ratio for offline setting.

Malicious agents can manipulate linear contextual bandits to pull desired arms with logarithmic overhead.

problem Malicious attacks on linear contextual bandit algorithms in various domains.
method Study and propose an efficient algorithm to perform adversarial attacks on linear contextual bandits.
result Malicious agents can force a linear contextual bandit algorithm to pull any desired arm To(T)T - o(T) times over a horizon of TT steps with logarithmic modifications.

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.

ERM and RERM minimize error even with malicious label corruptions.

problem Malicious label corruptions in regression problems.
method Empirical Risk Minimizers (ERM) and Regularized Empirical Risk Minimizers (RERM) under a local Bernstein condition.
result The L2L_2-error rate is bounded by $r_N + AL |\cO|/N$ under the local Bernstein condition.

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 Ω(ε)Ω(ε).

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.

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 ↗

BadGD identifies gradient descent vulnerabilities through strategic backdoor attacks.

problem Gradient descent vulnerabilities through malicious data manipulation.
method Introduces Max RiskWarp, Max GradWarp, and Max GradDistWarp triggers to exploit gradient descent.
result Demonstrates how malicious triggers can significantly alter loss landscapes and gradient calculations.

To promote secure and private artificial intelligence (SPAI), we review studies on the model security and data privacy of DNNs. Model security allows system to behave as intended without being affected by malicious external influences that can compromise its integrity and efficiency. Security attacks can be divided bas…

2018-07-31abs ↗pdf ↗

A new federated learning framework ensures fairness and robustness.

problem Collaborative fairness and adversarial robustness in federated learning.
method RFFL framework with a reputation mechanism to identify and remove non-contributing or malicious participants.
result RFFL achieves high fairness and robustness to different types of adversaries.

Paper examines vulnerabilities in data-driven pricing schemes.

problem Vulnerability of clustering-oriented pricing schemes to malicious user behavior.
method Defined a notion of disguising to identify strategic behaviors of malicious users, characterized sensitivity zones to evaluate malicious user percentages, conducted cost benefit analysis.
result Concluded with a vulnerability analysis of data-driven pricing schemes.

Online learning algorithms update models via one sample per iteration, thus efficient to process large-scale datasets and useful to detect malicious events for social benefits, such as disease outbreak and traffic congestion on the fly. However, existing algorithms for graph-structured models focused on the offline set…

2019-05-26abs ↗pdf ↗