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.

169,181 papers · 148 categories

Trend · papers per month

5101520 · Jun 202019922001200920182026
48 results for Threats

Enhanced network threat detection using KG, LLM, and imbalanced learning.

problem Challenges in network threat detection due to complex attack patterns and limited historical data.
method Integrated framework combining Knowledge Graph, Imbalanced Learning, and Large Language Model.
result Improved threat capture rate by 3%-4% and increased interpretability of risk predictions.

We improve image perturbation defenses using a better-defined Wasserstein threat model.

problem Real-world image perturbations are not pixel-independent, unlike p\ell_p threat models.
method We rectify flaws in the Wasserstein threat model and explore stronger attacks and defenses.
result Current Wasserstein-robust models are ineffective against real-world perturbations.

New method defends against unseen threat models using perceptual adversarial training.

problem Lack of precise mathematical characterization of human perception in adversarial attacks.
method Adversarial training against the set of all imperceptible adversarial examples approximated by deep neural networks.
result Perceptual Adversarial Training (PAT) achieves state-of-the-art robustness against multiple diverse adversarial attacks.

This paper analyzes privacy threats in federated matrix factorization.

problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.

This study improves detection of insider threats using machine learning.

problem Detecting insider threats with anticipation and accuracy.
method Empirically tested 88 machine learning algorithms on CERT dataset, focusing on employee sentiment.
result Random forest algorithms offer the best overall performance, with high accuracy and interpretable rules.

Paper proposes a recursive PLS model for optimal response to security threats.

problem Optimal response to security threats after violations have occurred.
method Recursive Partial Least Squares (PLS) model with factorial analysis of security events.
result The model optimally estimates security administrators' responses to threats.

AnyThreat detects insider threats with minimal false positives.

problem High false positives in detecting insider threats.
method Opportunistic knowledge discovery system with four components: feature engineering, oversampling, class decomposition, and classification.
result Detects 87.5% of malicious insider threats with minimal false positives.

This article reviews recent advances in secure distributed and decentralized inference and learning against Byzantine threats.

problem Securing distributed and decentralized inference and learning against malicious attacks.
method Review of recent algorithmic approaches under Byzantine threat model.
result A plethora of robust algorithmic approaches have been developed.

This paper explores security threats in ML systems and proposes mitigation techniques.

problem Security vulnerabilities in ML-based systems during training and inference.
method Overview of security threats, demonstrations using LeNet and VGGNet, proposed attack.
result Demonstrated security threats and proposed mitigation techniques.

Research creates a taxonomy to bridge AI security and regulatory gaps.

problem Disciplinary disconnect between technical and legal teams in AI risk assessment.
method Developed an AI System Threat Vector Taxonomy with 9 domains and 53 sub-threats.
result Empirically validated and aligned with ISO/IEC 42001 controls and NIST AI RMF functions.

New approach detects and ranks novel and developing cyber threats in Twitter.

problem Detecting and ranking novel and developing cyber threats in Twitter streams.
method Unsupervised machine learning approach focusing on novelty and trendiness.
result Ranking of cyber threat events based on importance score using extracted terms.

Neural networks predict substructures from mass spectra to identify chemical threats.

problem Identifying unknown chemical threats from mass spectra and formulas.
method Data-driven approach using neural networks to rank and match substructures.
result Substructure classifiers achieve over 90% micro F1-score and correctly identify structures in 88-71% of cases.

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.

TinyML models detect RF and cyber threats in spacecraft with low latency.

problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.

CCAT improves model robustness to various adversarial attacks.

problem Robustness to adversarial attacks does not generalize to unseen threat models.
method CCAT biases models towards low confidence predictions on adversarial examples.
result CCAT increases robustness against multiple adversarial attack norms and types.

New attacks fool black-box classifiers under limited query and partial information settings.

problem Adversarial attacks on black-box neural networks with limited query access and partial information.
method Developed new attacks for query-limited, partial-information, and label-only threat models.
result Effective attacks against real-world classifiers under realistic threat models.

This work introduces a new threat model for adversarial attacks using perceptual metrics.

problem Insufficient threat models for capturing imperceivable adversarial examples.
method Leverage quantitative perceptual metrics (LPIPS, SSIM) to define a novel threat model.
result Combined attacks retain perceptual distortion but induce higher misclassification rates.

A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is proved to be optimum in the Neyman-Pearson sense. The algorithm is defined by a …

2013-11-21abs ↗pdf ↗

Evaluates SHIELD's effectiveness against adaptive adversaries in various threat models.

problem Evaluating SHIELD's efficacy against adaptive adversaries in different threat models.
method Empirical analysis of SHIELD's robustness against adaptive attacks using Projected Gradient Descent (PGD) attacks in various threat models (white-box, gray-box).
result The targeted PGD attack success rate drops from 64.3% to 48.9% when models are trained from scratch instead of retrained.

Defense against Wasserstein adversarial attacks using randomized smoothing.

problem Certified robustness against Wasserstein adversarial attacks.
method Randomized smoothing applied to the space of flows between images, bounding Wasserstein distance by L_1 distance.
result Significantly improved accuracy under Wasserstein adversarial attacks compared to unprotected models.

New method protects whistleblowers from retaliation by ensuring their reports remain private.

problem Whistleblowers face retaliation, and current protections are insufficient.
method Formalizes protection against strong-adversary threat model as per-report (0,δ)(0, δ)-differential privacy, and provides a generic mechanism to reduce private auditing to private continual counting.
result Demonstrates a reduction in selection error and improved utility over randomized response.

Localized uncertainty attacks target uncertain regions to create imperceptible adversarial examples.

problem Adversarial examples that are imperceptible to humans and strong under deterministic classifiers.
method Localized uncertainty attacks by perturbing uncertain regions, using predictive uncertainty or surrogate models.
result Localized uncertainty attacks produce strong adversarial examples that retain input similarity.

Confidential Guardian prevents model abstention from being used to discriminate.

problem Dishonest institutions can exploit machine learning model abstention to unfairly deny services.
method Confidential Guardian uses zero-knowledge proofs to verify model confidence and detect suppression.
result Confidential Guardian effectively prevents the misuse of cautious predictions.

We present an extension of sparse Canonical Correlation Analysis (CCA) designed for finding multiple-to-multiple linear correlations within a single set of variables. Unlike CCA, which finds correlations between two sets of data where the rows are matched exactly but the columns represent separate sets of variables, th…

2015-11-19abs ↗pdf ↗

Study finds stocks with higher cyber risk scores outperform others, indicating a market-wide cyber risk premium.

problem Identifying and quantifying firms' cyber risks and their impact on stock performance.
method Machine learning algorithm to analyze disclosures and a dedicated cyber corpus.
result High cyber risk stocks significantly outperform others, indicating a market-wide cyber risk premium.

Model for optimal cybersecurity investment considering clustered cyberattacks.

problem Optimal investment in cybersecurity to reduce system vulnerability under clustered cyberattacks.
method Developed a continuous-time stochastic model using a Hawkes process, extended Gordon-Loeb model, solved as a Markovian stochastic optimal control problem.
result Investment policies that account for attack clustering lead to more effective and responsive strategies, improving upon static and Poisson-based approaches.