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

4284126168 · Jun 202019922001200920172026
48 results for deception detection

Artificial intelligence (AI) comes with great opportunities but can also pose significant risks. Automatically generated explanations for decisions can increase transparency and foster trust, especially for systems based on automated predictions by AI models. However, given, e.g., economic incentives to create dishones…

2020-01-21abs ↗pdf ↗

The study detects deceptive language in business communication using AI.

problem Deceptive language in business communication.
method Combining classical rhetoric, communication psychology, and linguistic theory with computational textual analysis and transformer models.
result Detection accuracies of over 99% achieved in controlled settings.

Systematic review of ML models for detecting social media deception.

problem Detecting fake news, spam, and fake accounts on social media.
method 36 studies evaluated using PROBAST tool, identifying biases and limitations.
result Over-reliance on accuracy in imbalanced data settings is a flaw.

In online discussion communities, users can interact and share information and opinions on a wide variety of topics. However, some users may create multiple identities, or sockpuppets, and engage in undesired behavior by deceiving others or manipulating discussions. In this work, we study sockpuppetry across nine discu…

2017-03-21abs ↗pdf ↗

Framework detects covert financial market manipulation using LOB representations.

problem Detecting covert financial market manipulation (spoofing) from complex anomaly patterns in multilevel prices.
method Cascaded contrastive representation learning of LOB data.
result Transformer-based architectures achieve state-of-the-art results in detection performance.

This work challenges the assumption that shorter conformal prediction intervals are always better.

problem The conventional evaluation of conformal prediction metrics (coverage and interval length) may not fully capture the quality of predictions.
method The Prejudicial Trick (PT) is introduced, which probabilistically returns either a null interval or a longer one to maintain valid coverage while potentially reducing interval length.
result The Prejudicial Trick can yield deceptively shorter intervals without compromising coverage, but introduces practical vulnerabilities.

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 ↗

Computational paralinguistic analysis is increasingly being used in a wide range of cyber applications, including security-sensitive applications such as speaker verification, deceptive speech detection, and medical diagnostics. While state-of-the-art machine learning techniques, such as deep neural networks, can provi…

2017-11-09abs ↗pdf ↗

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 ↗

RLHF fails when humans only partially observe, leading to inflated or overjustified feedback.

problem Failure of reinforcement learning from human feedback in partially observable environments.
method Formal definition of failure cases, modeling human as Boltzmann rational, analyzing information provided by feedback.
result RLHF can deceptively inflate or overjustify feedback when humans have partial observations.

This paper introduces a new method to deceive causal structure learning by omitting data.

problem Deceiving causal structure learning algorithms with incompletely observed data.
method Adversarial missingness attack to bias the learned causal structures.
result Theoretical and practical attack mechanisms are developed for various SCMs.

Study shows integrating acoustic features in financial forecasting models can degrade performance.

problem Predicting stock market volatility from corporate earnings calls using speech features.
method Empirical investigation of acoustic feature extraction in teleconference environments using a two-stream late-fusion architecture.
result Integrating acoustic features via late fusion significantly degraded performance, reducing recall to 47.08%.

Historically, machine learning in computer security has prioritized defense: think intrusion detection systems, malware classification, and botnet traffic identification. Offense can benefit from data just as well. Social networks, with their access to extensive personal data, bot-friendly APIs, colloquial syntax, and …

2018-02-14abs ↗pdf ↗

SVHN dataset's split affects generative models but not digit classification.

problem Distribution mismatch between SVHN training and test sets impacts generative models.
method Empirically showed distribution mismatch affects generative models; proposed mixing and re-splitting.
result Distribution mismatch in SVHN dataset significantly impacts probabilistic generative models.

The study tackles forgery in machine unlearning, showing that forging is limited and can be detected.

problem Adversarial crafting of data to mimic model behavior without removing information.
method Developed a framework to analyze εε-forging sets and proved their measure decay.
result The forging set measure decays as ε(dr)/2ε^{(d-r)/2}, providing evidence against false unlearning claims.

Q*BERT learns to navigate text-based games by building a knowledge graph.

problem Text-based games have bottlenecks that standard RL agents struggle to overcome.
method Q*BERT learns a knowledge graph and uses intrinsic motivation to detect and overcome bottlenecks.
result Q*BERT outperforms state-of-the-art agents in text games, including Zork.

Gradient-based methods are often used for policy optimization in deep reinforcement learning, despite being vulnerable to local optima and saddle points. Although gradient-free methods (e.g., genetic algorithms or evolution strategies) help mitigate these issues, poor initialization and local optima are still concerns …

2019-12-23abs ↗pdf ↗

Efficient exploration remains a challenging research problem in reinforcement learning, especially when an environment contains large state spaces, deceptive local optima, or sparse rewards. To tackle this problem, we present a diversity-driven approach for exploration, which can be easily combined with both off- and o…

2018-02-13abs ↗pdf ↗

Deep reinforcement learning has achieved great successes in recent years, however, one main challenge is the sample inefficiency. In this paper, we focus on how to use action guidance by means of a non-expert demonstrator to improve sample efficiency in a domain with sparse, delayed, and possibly deceptive rewards: the…

2019-07-25abs ↗pdf ↗

Recently, adversarial deception becomes one of the most considerable threats to deep neural networks. However, compared to extensive research in new designs of various adversarial attacks and defenses, the neural networks' intrinsic robustness property is still lack of thorough investigation. This work aims to qualitat…

2019-05-10abs ↗pdf ↗

In this work, we present a reinforcement learning algorithm that can find a variety of policies (novel policies) for a task that is given by a task reward function. Our method does this by creating a second reward function that recognizes previously seen state sequences and rewards those by novelty, which is measured u…

2019-05-13abs ↗pdf ↗

Study optimal transport for robust optimization, showing how adversary's strategy relates to regularization.

problem Optimizing under uncertain parameters with a fictitious adversary reshaping a reference distribution.
method Introduces optimal transport and regularization to relate robustification to variation and Lipschitz norms.
result Conditions for existence and computability of Nash equilibrium between decision-maker and adversary.

Practical or scientific considerations often lead to selecting a subset of parameters as ``important.'' Inferences about those parameters often are based on the same data used to select them in the first place. That can make the reported uncertainties deceptively optimistic: confidence intervals that ignore selection g…

2019-06-02abs ↗pdf ↗

Image segmentation is one of the most fundamental tasks of computer vision. In many practical applications, it is essential to properly evaluate the reliability of individual segmentation results. In this study, we propose a novel framework to provide the statistical significance of segmentation results in the form of …

2019-06-03abs ↗pdf ↗

New framework reduces private mean estimation error with optimal efficiency.

problem Locally private mean estimation of high-dimensional vectors.
method ProjUnit framework: random projections, normalization, and optimal algorithm execution in lower dimensions.
result Optimal error up to a 1+o(1)-factor with computational efficiency and low communication complexity.

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

3D BF theory on certain 3-manifolds evaluated via residues and large k limits.

problem Singular and ill-defined partition function of 3D BF theory.
method Direct evaluation of path integral for specific 3-manifolds, using residues and large k limits of Chern-Simons matrix integrals.
result 3 definitions of the integral offer insights into the sum/integral over all flat connections.

Paper exposes vulnerabilities in interpreting machine learning models using adversarial attacks on PD plots.

problem Vulnerability of permutation-based interpretation methods, particularly PD plots, to adversarial attacks.
method Adversarial framework to manipulate black-box models and produce deceptive PD plots.
result It is possible to hide discriminatory behaviors in machine learning models through interpretation tools like PD plots.