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

Trend · papers per month

5101520 · Jul 202019922001200920172026
48 results for malicious websites

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.

Botnet, a group of coordinated bots, is becoming the main platform of malicious Internet activities like DDOS, click fraud, web scraping, spam/rumor distribution, etc. This paper focuses on design and experiment of a new approach for botnet detection from streaming web server logs, motivated by its wide applicability, …

2018-12-19abs ↗pdf ↗

This paper introduces Zap, a generic machine learning pipeline for making predictions based on online user behavior. Zap combines well known techniques for processing sequential data with more obscure techniques such as Bloom filters, bucketing, and model calibration into an end-to-end solution. The pipeline creates we…

2018-07-16abs ↗pdf ↗

Online advertising is an important and huge industry. Having knowledge of the website attributes can contribute greatly to business strategies for ad-targeting, content display, inventory purchase or revenue prediction. Classical inferences on users and sites impose challenge, because the data is voluminous, sparse, hi…

2014-10-24abs ↗pdf ↗

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.

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.

Model predicts price polarity of real estate properties using website information.

problem Predicting price polarity of real estate properties.
method Uses doc2vec and xgboost to learn correlations between price and text descriptions of properties.
result Text descriptions provide slightly higher accuracy than features alone.

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 ↗

Classifies privacy policy segments for better user understanding.

problem Difficulty in understanding privacy policies due to legal jargon.
method Uses machine learning and deep learning techniques to classify privacy policy segments.
result Identifies data practices in privacy policies for better user comprehension.

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.

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.

We present a database of parliamentary debates that contains the complete record of parliamentary speeches from Dáil Éireann, the lower house and principal chamber of the Irish parliament, from 1919 to 2013. In addition, the database contains background information on all TDs (Teachta Dála, members of parliament), such…

2017-08-15abs ↗pdf ↗

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 as one of the most well-known cybercrime activities is a deception of online users to steal their personal or confidential information by impersonating a legitimate website. Several machine learning-based strategies have been proposed to detect phishing websites. These techniques are dependent on the features …

2019-03-13abs ↗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.

Neural network detects sex trafficking ads from escort websites.

problem Manual identification of sex trafficking ads from escort websites is inefficient and resource-intensive.
method Ordinal regression neural network with a modified cost function and deep learning enhancements.
result Significantly improved detection accuracy on Trafficking-10K dataset.

Deep Learning predicts e-commerce activity from Italian enterprise websites.

problem Predicting e-commerce activity from Italian enterprise websites.
method Developed a sophisticated processing pipeline using Convolutional Neural Networks and Word Embeddings.
result Deep Learning outperforms traditional Machine Learning methods for text classification.

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.

This is an introductory article about the Boy surface. Boy found 1901 that RP2\mathbb{R}P^2 can be immersed into R3\mathbb{R}^3, and published it. (The image of) the immersion is called the Boy surface after Boy's discovery. We have created a way to construct the Boy surface by using a pair of scissors, a piece of paper…

2013-03-26abs ↗pdf ↗

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.