Deep neural network (DNN) has demonstrated its success in multiple domains. However, DNN models are inherently vulnerable to adversarial examples, which are generated by adding adversarial perturbations to benign inputs to fool the DNN model to misclassify. In this paper, we present a cross-layer strategic ensemble fra…
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
48 results for “strategic attackers”
The results of a learning process depend on the input data. There are cases in which an adversary can strategically tamper with the input data to affect the outcome of the learning process. While some datasets are difficult to attack, many others are susceptible to manipulation. A resourceful attacker can tamper with l…
We introduce two tactics to attack agents trained by deep reinforcement learning algorithms using adversarial examples, namely the strategically-timed attack and the enchanting attack. In the strategically-timed attack, the adversary aims at minimizing the agent's reward by only attacking the agent at a small subset of…
Study assesses how much security restaking protocols need to pay for.
problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.
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.
This research tackles backdoor attacks on audio data using a stochastic investment approach.
problem The threat of backdoor attacks on audio data, especially in voice-activated systems.
method A Stochastic investment-based backdoor attack (MarketBack) approach.
result MarketBack can achieve an average attack success rate close to 100% with less than 1% of poisoned data.
Gradient-based adversarial attacks on neural networks can be crafted in a variety of ways by varying either how the attack algorithm relies on the gradient, the network architecture used for crafting the attack, or both. Most recent work has focused on defending classifiers in a case where there is no uncertainty about…
FGSV defends against shell company attacks in group data valuation.
problem Shell company attacks on group-level data valuation.
method Developed a provably fast and accurate approximation algorithm for FGSV.
result Empirical results show significant improvement in computational efficiency and accuracy.
This research discovers model architecture and training dataset characteristics through strategic input probing.
problem Discovering model architecture and training dataset characteristics in black box models.
method Structured input probes and model outputs are used to train a deep classifier for image and text classification.
result The approach successfully distinguishes between different image and text datasets and architectures.
This paper optimizes attacks on stochastic bandits and proposes defenses against them.
problem Optimizing adversarial attacks on stochastic bandit algorithms.
method Designs optimal attack strategies and proposes defense algorithms.
result Optimal attack strategies and defense algorithms achieve near perfect performance.
Paper introduces timing-based adversarial attacks on DRL-based navigation systems.
problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.
New method defends RL agents from poisoning attacks without MDP knowledge.
problem Poisoning attacks on RL systems can cause learning failures.
method Generic poisoning framework for online RL, Vulnerability-Aware Adversarial Critic Poison (VA2C-P).
result Successfully prevents RL agents from learning good policies or converging to target policies.
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.
Bayesian models can be tricked into believing false data.
problem Vulnerability of Bayesian inference to data poisoning attacks.
method Developed attacks to manipulate Bayesian posterior through deletion and replication of data.
result Demonstrated that Bayesian inference can be steered to target distributions.
In Autonomous Vehicles (AVs), one fundamental pillar is perception, which leverages sensors like cameras and LiDARs (Light Detection and Ranging) to understand the driving environment. Due to its direct impact on road safety, multiple prior efforts have been made to study its the security of perception systems. In cont…
Improved -greedy handles strategic bidding in PPC auctions.
problem Strategic bidding in PPC auctions with personalization and corruptions.
method Extended -greedy to handle strategic arms in contextual multi-arm bandit.
result -greedy is robust to adversarial corruptions and degrades linearly with corruption.
Efficiently preserves privacy in logistic regression for IoT data.
problem Balancing data privacy and utility in collaborative learning.
method Matrix encryption approach for secure multi-party computation.
result Proposes a privacy-preserving logistic regression model with fast convergence.
This study analyzes global oil trade networks to assess their efficiency and robustness.
problem Dynamic monitoring and warning of international trade risks in global oil trade.
method Constructing unweighted and weighted global oil trade networks (OTNs) using UN Comtrade data from 1988 to 2017, and applying complex network theories.
result Efficiency of oil flows increases with complexity of OTNs, and weighted efficiency indicators highlight major events.
This paper analyzes privacy risks in neural network pruning and proposes a defense mechanism.
problem Privacy risks in neural network pruning due to membership inference attacks.
method Investigates the impact of pruning on prediction divergence and proposes a self-attention membership inference attack.
result Proposed defense mechanism mitigates privacy risks while maintaining sparsity and accuracy.
Machine learning models leak information about the datasets on which they are trained. An adversary can build an algorithm to trace the individual members of a model's training dataset. As a fundamental inference attack, he aims to distinguish between data points that were part of the model's training set and any other…
Paper analyzes robustness of non-Lipschitz networks, proving powerful adversarial attacks but offering solutions.
problem Adversarial attacks on deep networks, especially non-Lipschitz networks.
method Developed an attack model that abstracts the challenge of adversarial robustness, proving the power of such attacks and offering solutions.
result Proves powerful adversarial attacks on non-Lipschitz networks but offers solutions with abstention.
Study on costs of manipulating AMM-based price oracles.
problem Cost of manipulation in AMM-based on-chain price oracles.
method Analyzes the robustness of AMM-based oracles to strategic manipulation, considering different aggregation methods and market conditions.
result Manipulation costs depend on the total quote depth and can be minimized by optimal liquidity weights.
Framework detects and mitigates data-poisoning attacks in causal effect estimation.
problem Vulnerability to append-only attacks in observational causal analyses.
method Develops a data-poisoning audit for augmented inverse-probability-weighted estimation.
result Proposes a greedy scan to compute exact worst-case movement at every append budget.
New framework for robust uncertainty quantification in strategic settings.
problem Machine learning model predictions can be strategically altered by informed agents.
method Strategic Conformal Prediction framework
result Theoretical guarantees and experimental validation show remarkable effectiveness.
Paper generalizes strategic classification framework and introduces SVC for PAC-learning.
problem Strategic manipulation of testing data to fool classifiers.
method Unified framework for strategic classification, strategic VC-dimension (SVC).
result Characterizes the learnability and computational tractability of linear classifiers.
Study strategic dynamic pricing for buyers with unknown manipulation costs.
problem Strategic buyers manipulate their features to get lower prices, hindering profit maximization.
method Proposes a strategic dynamic pricing policy that incorporates strategic behavior and binary response data.
result Achieves sublinear regret bound of compared to linear regret of non-strategic policies.
New framework reduces strategic manipulation cost for minority groups in fair classification.
problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.
Study compares employers with and without anticipating strategic labor force responses.
problem Understanding and optimizing strategic interactions in labor markets.
method Formulation of causal strategic classification, theory, and experiments.
result Performatively optimal hiring policies improve employer and labor outcomes, but can also harm labor force utility.
This paper tackles fair online decision-making in contextual bandits, achieving optimal performance and fairness.
problem Fairness in online decision-making systems under strategic manipulation.
method Develops algorithms for linear and smooth reward functions, maintaining fairness and optimal regret.
result Achieves nearly minimax-optimal regret with strong fairness guarantees, even in the presence of attacks.
Industry lacks tools to secure ML systems, study finds.
problem Insufficient security tools for ML systems in industry.
method Interviews with 28 organizations to identify gaps.
result Need revised Security Development Lifecycle for ML.
New algorithm learns optimal policies in strategic MDPs with private types.
problem Optimal policy learning in strategic MDPs with private types and information asymmetry.
method PLAN algorithm using instrumental variable regression and pessimism principle.
result PLAN achieves near-optimal policy with optimality.
Gaming-Resistant Insurance Contracts for Autonomous AI Agents: Strategy-Proof Toll Mechanism Designcs.GT
Insurance contracts for autonomous AI agents must be actuarially sound and resistant to gaming.
problem Designing insurance contracts for autonomous AI agents that are actuarially sound and resistant to gaming.
method Characterizing a five-attack space and proving the actuarial runtime is gaming-resistant.
result An incentive-compatible layer for actuarial control of autonomous-agent side effects.
New findings show strategic interactions can undermine model expressiveness in machine learning.
problem How strategic interactions affect model performance in machine learning.
method Analyzing model expressiveness and strategic interactions in various machine learning settings.
result Optimizing over less expressive model classes can lead to better equilibrium outcomes in strategic environments.
CEGA addresses GNN security by enabling cost-effective model acquisition.
problem Vulnerability of Graph Neural Networks (GNNs) to model extraction attacks (MEAs).
method Proposes an adaptive node querying strategy to refine node selection over multiple learning cycles.
result Demonstrates superior performance in accuracy, fidelity, and F1 score under strict query-size constraints.
Consequential decision-making typically incentivizes individuals to behave strategically, tailoring their behavior to the specifics of the decision rule. A long line of work has therefore sought to counteract strategic behavior by designing more conservative decision boundaries in an effort to increase robustness to th…
A new algorithm for efficiently removing specific classes from a model without retraining.
problem Class forgetting in machine learning models.
method Estimating retain and forget spaces using SVD, removing shared information, and updating weights.
result Achieved up to 1.38% accuracy improvement on ImageNet dataset with minimal samples.
Strategic feature selection in high-stakes domains like healthcare.
problem Strategic manipulation of input features in algorithmic predictors.
method Formal study of strategic classification through feature selection and ridge regularization.
result Excluding individual features based on manipulability is generally suboptimal.
The ASVspoof challenge series was born to spearhead research in anti-spoofing for automatic speaker verification (ASV). The two challenge editions in 2015 and 2017 involved the assessment of spoofing countermeasures (CMs) in isolation from ASV using an equal error rate (EER) metric. While a strategic approach to assess…
Study allocates resources to strategic agents while balancing cost and incentives.
problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves social welfare regret, satisfies all cost constraints, and ensures incentive alignment.
The paper analyzes trading strategies in a competitive market with incomplete information.
problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.
Algorithm learns optimal coordination for strategic agents in uncertain settings.
problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of for learning optimal policy.
Randomised classifiers outperform deterministic ones in strategic classification.
problem Strategic modification of features by agents in classification tasks.
method Theoretical analysis of randomised classifiers in strategic classification.
result Randomised classifiers can achieve better accuracy than deterministic ones under certain conditions.
Study one-shot strategic classification under unknown costs, improving worst-case accuracy.
problem Learning robust decision rules in strategic settings with unknown user costs.
method Formal study of one-shot strategic classification, framing as a minimax problem, designing efficient algorithms for full-batch and stochastic settings.
result Proves efficient algorithms converge to minimax solution, revealing dual norm regularization's value.
Consequential decision-making incentivizes individuals to strategically adapt their behavior to the specifics of the decision rule. While a long line of work has viewed strategic adaptation as gaming and attempted to mitigate its effects, recent work has instead sought to design classifiers that incentivize individuals…
We consider a symmetric multi-players zero-sum game with two strategic variables. There are players, . Each player is denoted by . Two strategic variables are and , . They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…
Quantum computing offers new solutions for financial optimization, pricing, risk, and security.
problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.
We study a strategic version of the multi-armed bandit problem, where each arm is an individual strategic agent and we, the principal, pull one arm each round. When pulled, the arm receives some private reward and can choose an amount to pass on to the principal (keeping for itself). All non-pulle…
COBRA addresses strategic behavior in online platforms by ensuring truthful reporting without monetary incentives.
problem Ensuring truthful reporting from strategic agents in online platforms.
method Proposes COBRA, an algorithm for contextual bandits involving strategic agents that disincentivizes strategic behavior.
result COBRA achieves sub-linear regret guarantee and incentive compatibility without monetary incentives.