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

Trend · papers per month

150300450600 · Jun 202019922001200920172026
48 results for adversarial dynamics embedding

Adversarial dynamics embedding improves MLE of exponential family models.

problem Maximum likelihood estimation of exponential family models with neural network parametrization.
method Adversarial dynamics embedding to estimate the dual sampler and primal model simultaneously.
result Adversarial dynamics embedding leads to more effective learning and improved estimators compared to existing methods.

DAAN dynamically adapts adversarial learning for better domain adaptation.

problem Dynamic evaluation of global vs local domain distributions for adversarial learning.
method Dynamic Adversarial Adaptation Network (DAAN) that dynamically learns domain-invariant representations.
result DAAN achieves better classification accuracy compared to state-of-the-art methods.

New algorithm tackles dynamic query routing to multiple embedding models.

problem Dynamic query routing to multiple embedding models under adversarial conditions.
method Formalized as adversarial contextual linear bandit with low-rank experts, proposed HPG algorithm.
result HPG algorithm achieves linearized policy regret of ildeO(sMT) ilde{\mathcal O}(s\sqrt{M T}).

Adversarial training adds dynamic perturbations to neural networks for robustness.

problem Accuracy trade-off and lack of diversity in adversarial examples.
method Dynamic adversarial perturbations in the parameter space of neural networks, updating perturbation biases during training.
result Adversarial training with negligible cost and reduced accuracy trade-off.

AROS uses Lyapunov-stabilized embeddings to improve out-of-distribution detection robustness against adversarial attacks.

problem Robust out-of-distribution (OOD) detection against adversarial attacks.
method Neural Ordinary Differential Equations (NODEs) with Lyapunov stability theory for generating robust embeddings.
result Improves robust detection performance significantly, e.g., from 37.8% to 80.1% on CIFAR-10 vs. CIFAR-100.

IDGL learns better graph structure and embeddings iteratively.

problem Improving graph neural network node embeddings and graph structure.
method Iterative Deep Graph Learning framework that dynamically stops when graph structure optimizes for downstream tasks.
result IDGL consistently outperforms state-of-the-art baselines on nine benchmarks.

New method for black-box adversarial attacks using pretrained model embeddings.

problem Efficiently attacking unknown target networks with high-level semantic patterns.
method Learn a low-dimensional embedding using a pretrained model, then search within the embedding space.
result Significant reduction in the number of queries for black-box adversarial attacks.

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the laten…

2018-02-13abs ↗pdf ↗

Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction errors for graph data. They have mostly overlooked the embedding dis…

2019-01-04abs ↗pdf ↗

NewsNet-SDF uses deep learning to integrate financial news with financial data for better asset pricing.

problem Combining unstructured text with structured financial data for accurate asset pricing.
method Adversarial networks and pretrained language model embeddings.
result Substantially outperforms alternatives with a Sharpe ratio of 2.80.

Paper proposes a black-box adversarial attack method for graph embedding models.

problem Robustness of graph embedding models against adversarial attacks.
method GF-Attack constructs a generalized adversarial attacker by the graph filter and feature matrix, performing the attack on the graph filter in a black-box fashion.
result GF-Attack can consistently make strong attacks on different graph embedding models even with small perturbations.

This paper improves continuous adversarial training for LLMs using in-context learning theory.

problem Efficiently defending large language models (LLMs) against jailbreak attacks.
method The paper presents a theoretical analysis of continuous adversarial training (CAT) for LLMs based on in-context learning (ICL) theory, proving a robust generalization bound and proposing an improved regularization term.
result The robust generalization bound explains why CAT can defend against jailbreak prompts and shows that LLM robustness is related to embedding matrix singular values.

The goal of network representation learning is to learn low-dimensional node embeddings that capture the graph structure and are useful for solving downstream tasks. However, despite the proliferation of such methods, there is currently no study of their robustness to adversarial attacks. We provide the first adversari…

2018-09-04abs ↗pdf ↗

Adversarial training improves graph autoencoder generalization.

problem Improving graph autoencoder generalization.
method Formulated L2 and L1 adversarial training for graph autoencoders and variational graph autoencoders.
result Adversarial training boosts graph autoencoder and variational graph autoencoder generalization.

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.

AVDA transfers knowledge from source to target domains using embeddings.

problem Transferring knowledge from a source domain to a target domain with limited labeled data.
method Adversarial Variational Domain Adaptation (AVDA) with deep embeddings and Gaussian Mixture Model.
result AVDA outperforms previous methods in semi-supervised few-shot domain adaptation.

In a graph convolutional network, we assume that the graph GG is generated wrt some observation noise. During learning, we make small random perturbations ΔGΔG of the graph and try to improve generalization. Based on quantum information geometry, ΔGΔG can be characterized by the eigendecomposition of the graph Laplaci…

2019-03-11abs ↗pdf ↗

Quantized neural networks are vulnerable to adversarial attacks.

problem Adversarial robustness of quantized neural networks.
method Investigated adversarial robustness of quantized neural networks under different threat models.
result Quantization does not offer robust protection and results in gradient masking.

Generative model solves financial market equilibria with stable reinforcement learning.

problem Financial market equilibria under realistic frictions and multiple agents.
method Generative adversarial reinforcement learning with decoupling feedback.
result Algorithm learns and predicts asset returns and volatilities.

Adversarial training provides a means of regularizing supervised learning algorithms while virtual adversarial training is able to extend supervised learning algorithms to the semi-supervised setting. However, both methods require making small perturbations to numerous entries of the input vector, which is inappropriat…

2016-05-25abs ↗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.

DADI framework dynamically discovers fair information using reinforcement learning.

problem Discovering fair information from third-party features with unknown objectives.
method Adversarial reinforcement learning agent that balances accuracy and fairness.
result Achieves group fairness by rewarding the agent with the adversary's loss.

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.

Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…

2018-12-06abs ↗pdf ↗

ADEC addresses feature randomness and drift in autoencoder-based clustering.

problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.

Paper proposes a new method for predicting drug interactions using adversarial autoencoders.

problem Predicting drug interactions to prevent adverse events.
method Introduces adversarial autoencoders based on Wasserstein distances and Gumbel-Softmax relaxation to generate high-quality negative samples.
result Significant improvements in link prediction and DDI classification tasks.