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

Trend · papers per month

120240360480 · Jun 202019922001200920172026
48 results for Adversarial Dynamics

EI-MTD defends edge intelligence against adversarial attacks with dynamic scheduling.

problem Adversarial attacks on edge intelligence models.
method EI-MTD uses differential knowledge distillation to create robust member models and a dynamic scheduling policy based on a Bayesian Stackelberg game.
result EI-MTD effectively protects edge intelligence from black-box adversarial attacks.

The recent advances in deep transfer learning reveal that adversarial learning can be embedded into deep networks to learn more transferable features to reduce the distribution discrepancy between two domains. Existing adversarial domain adaptation methods either learn a single domain discriminator to align the global …

2019-09-18abs ↗pdf ↗

Improves adversarial robustness of DEQ models by regulating neural dynamics.

problem Limited adversarial robustness of DEQ models.
method Interprets DEQs as neural dynamics, uses entropy reduction and random intermediate states.
result Significantly increases adversarial robustness of DEQ models.

The paper tackles adversarial attacks on recurrent neural networks.

problem Adversarial attacks on recurrent neural networks are easy and lack theoretical guarantees.
method Inspired by dynamical systems theory, the paper dynamically computes adversarial perturbations for each timestep of the input sequence.
result The paper provides theoretical guarantees on the existence of adversarial examples and robustness margins.

Algorithm tackles adaptive discretization in adversarial Lipschitz bandits for dynamic pricing and auctions.

problem Adaptive discretization in adversarial Lipschitz bandits.
method Adversarial Zooming algorithm for adaptive discretization.
result First algorithm for adversarial Lipschitz bandits with instance-dependent regret bounds.

Study on adversarial training dynamics in high dimensions using SGD.

problem Analyzing adversarial training of models in high-dimensional settings.
method Deriving deterministic equivalents for SGD iterates under Gaussian mixtures.
result No constant learning rate guarantees monotone descent in adversarial training.

New algorithm achieves both static and dynamic regret optimally against an oblivious adversary for deterministic losses.

problem Achieving optimal static and dynamic regret simultaneously in adversarial bandits.
method Extends impossibility result to deterministic losses, uses negative static regret and Blackwell approachability.
result First algorithm achieving optimal static and dynamic regret simultaneously against an oblivious adversary.

Study analyzes adversarial training dynamics without data distribution assumptions.

problem Understanding training dynamics of adversarial training without data distribution assumptions.
method Mean field theory approach to analyze adversarial training in random deep neural networks.
result Upper bounds of adversarial loss derived empirically and theoretically.

Paper proposes a new method to attack Bayesian forecasting models.

problem Lack of research on adversarial attacks against time series forecasting systems.
method Decision analysis based attacking strategy for Bayesian forecasting models.
result Demonstrates the vulnerability of Bayesian forecasting models to adversarial attacks.

A method to minimize regret in multi-agent control systems with adversarial disturbances.

problem Optimal control of dynamical systems with adversarial disturbances and multiple agents.
method Reduction from online convex optimization to a distributed algorithm for multi-agent control.
result The resulting distributed algorithm has low regret relative to the optimal precomputed joint policy.

This work addresses dynamic KDE data structures with robustness to adversarial queries.

problem Efficient KDE data structures for dynamic changing data distributions.
method Developed a theoretical framework for KDE data structures that support subquadratic space, sublinear updates, and adaptive queries.
result Theoretical framework and practical implementation of KDE data structures robust to adversarial queries.

I describe an optimal control view of adversarial machine learning, where the dynamical system is the machine learner, the input are adversarial actions, and the control costs are defined by the adversary's goals to do harm and be hard to detect. This view encompasses many types of adversarial machine learning, includi…

2018-11-11abs ↗pdf ↗

Adversarial training leads to clean data generalization with significant robust overfitting gap.

problem Significant robust generalization gap in adversarial training.
method Two theoretical views: representation complexity and training dynamics.
result ReLU nets with O(ND)O(N D) extra parameters can achieve CGRO.

EBMs trained with ML are shown to behave like GANs with a self-adversarial loss.

problem Training EBMs with ML is intractable due to intractable unnormalized distributions.
method Replaced MCMC with deterministic gradient descent ODE solutions to study density induced by dynamics.
result EBM training is effectively a self-adversarial procedure rather than ML estimation.

We study the control of a linear dynamical system with adversarial disturbances (as opposed to statistical noise). The objective we consider is one of regret: we desire an online control procedure that can do nearly as well as that of a procedure that has full knowledge of the disturbances in hindsight. Our main result…

2019-02-23abs ↗pdf ↗

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

New algorithm reduces dynamic regret for MDPs with unknown transition and adversarial rewards.

problem Episodic linear mixture MDPs with unknown transition and adversarial rewards.
method Combines occupancy-measure-based global optimization and policy-based variance-aware value-targeted regression.
result Achieves near-optimal dynamic regret of O~(dH3K+HK(H+PˉK))\widetilde{\mathcal{O}}(d \sqrt{H^3 K} + \sqrt{HK(H + \bar{P}_K)}).

This paper examines how adversarial perturbations affect model performance and equilibrium learning.

problem Adversarial perturbations and covariate shifts impact model performance and equilibrium learning.
method Characterizes the extrapolation region in regression and classification, analyzes dynamics of adversarial learning games.
result Establishes two directional convergence results: a blessing in regression and a curse in classification.

New bounds show complexity of adversarial decision making.

problem Understanding sample efficiency in adversarial decision making.
method New upper and lower bounds on Decision-Estimation Coefficient.
result Decision-Estimation Coefficient is necessary and sufficient for low regret in adversarial decision making.

We propose to incorporate adversarial dropout in generative multi-adversarial networks, by omitting or dropping out, the feedback of each discriminator in the framework with some probability at the end of each batch. Our approach forces the single generator not to constrain its output to satisfy a single discriminator,…

2018-07-30abs ↗pdf ↗

Generative adversarial network for probabilistic forecasting of random systems.

problem Forecasting random dynamical systems without distributional assumptions.
method Recurrent neural network and generative adversarial network (GAN) with regularization based on maximum mean discrepancy (MMD).
result The proposed model successfully forecasts complex stochastic processes with multiple-step predictions.

New algorithms improve contextual search in the presence of adversarial corruptions.

problem Improving search accuracy in dynamic pricing settings with corrupted responses.
method Two algorithms based on binary search and gradient descent methods.
result Achieve near-optimal regret in the absence of adversarial corruptions and gracefully degrade with corrupted agents.

New method learns population dynamics from snapshots using JKO scheme and inverse optimization.

problem Recovering underlying process governing particle evolution from discrete time samples.
method Combines JKO scheme with inverse optimization techniques for end-to-end adversarial training.
result Improved performance over prior JKO-based methods with theoretical guarantees.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.

Adversarial RL recovers agent rewards from financial market data simulations.

problem Recovering agent rewards in volatile financial markets with unknown dynamics.
method Adversarial inverse reinforcement learning in latent space simulations.
result Adversarial RL can robustly recover agent rewards from latent space representations of real market data.