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

80159239318 · Jun 202019922001200920172026
48 results for adversarial flow

Flow-based generative models leverage invertible generator functions to fit a distribution to the training data using maximum likelihood. Despite their use in several application domains, robustness of these models to adversarial attacks has hardly been explored. In this paper, we study adversarial robustness of flow-b…

2019-11-20abs ↗pdf ↗

Gradient flow in ReLU networks biases towards generalization but makes them vulnerable to adversarial attacks.

problem Generalization vs. Adversarial Robustness in ReLU Networks
method Analysis of gradient flow in two-layer ReLU networks with clustered data.
result Gradient flow biases towards generalization but also makes networks vulnerable to adversarial attacks.

NTK neural networks are robust to adversarial attacks in nonparametric regression.

problem Adversarial robustness of neural networks in nonparametric regression.
method Gradient flow with early stopping for NTK neural networks, proving robustness in Sobolev spaces.
result NTK neural networks achieve optimal adversarial robustness rates in Sobolev spaces.

Proposes a new method to improve deep model security against adversarial deformations.

problem Deep neural networks' resistance to adversarial attacks, especially location perturbations.
method Regularizes flow gradients to provide a tighter bound and improve model resistance.
result Models trained with flow gradient regularization show better resistance to adversarial deformations compared to input gradient regularization and adversarial training.

Gradient-trained shallow networks can generalize well but are vulnerable to small-radius adversarial attacks.

problem Adversarial robustness of gradient-trained shallow networks.
method Analysis of neuron alignment and polynomial ReLU activation.
result Gradient-trained shallow networks with polynomial ReLU activation are robust to small-radius adversarial attacks.

Study adversarial classification with data corruption up to ε, deriving geometric flows.

problem Optimizing classifiers against adversarial data corruption.
method Variational analysis, geometric flows, mean curvature equations.
result Rigorous proof of initial value problem for small ε, global minimizer of adversarial problem.

Generative model simulates financial market price variations from order flow.

problem Simulating intra-day price variations driven by order flow.
method Sequence Generative Adversarial Networks framework applied to model order flow.
result Generated price sequences from generative model better match real price variations.

Novel algorithm solves optimal transport using evolving probability distributions and convolution.

problem Sample-based optimal transport problem.
method Adversarial formulation with convolution of adaptive kernel and evolving measure.
result Algorithm robust to dimensionality and produces complex maps.

This paper studies a training method to jointly estimate an energy-based model and a flow-based model, in which the two models are iteratively updated based on a shared adversarial value function. This joint training method has the following traits. (1) The update of the energy-based model is based on noise contrastive…

2019-12-02abs ↗pdf ↗

FCI method uses flow-based techniques to improve prediction confidence.

problem Limited applicability of exchangeable assumptions in predicting contaminated data.
method Adversarial flow to transform data into known distributions, then map to low-dimensional space.
result FCI produces effective predictive sets and accurate outlier detection.

sFML learns stochastic dynamical systems from data.

problem Learning unknown stochastic dynamical systems from measurement data.
method sFML extends FML for deterministic systems, using a stochastic flow map composed of deterministic and stochastic sub-maps.
result sFML constructs a stochastic evolution model approximating unknown stochastic systems.

This paper shows equivalence between SVGD and BBVI using kernel gradient flows.

problem Bayesian inference methods and their equivalence.
method Formalizes equivalence between SVGD and BBVI using kernel gradient flows.
result BBVI corresponds precisely to SVGD when using the neural tangent kernel.

GeneraLight improves traffic signal control models' generalization ability.

problem Overfitting and lack of generalization ability in RL TSC models.
method GeneraLight uses a meta-RL framework with a traffic flow generator based on GANs.
result GeneraLight significantly boosts generalization performance across different traffic flows.

Most random ReLU networks are vulnerable to small, Euclidean adversarial perturbations.

problem Vulnerability of ReLU networks to adversarial attacks.
method Analysis of random ReLU networks with decreasing dimensions, using gradient flow and descent.
result Most examples can be perturbed by small Euclidean distances via gradient methods.

Generative Adversarial Networks have been shown to be powerful in generating content. To this end, they have been studied intensively in the last few years. Nonetheless, training these networks requires solving a saddle point problem that is difficult to solve and slowly converging. Motivated from techniques in the reg…

2019-10-03abs ↗pdf ↗

Bayesian adversaries can outsmart traditional adversarial attacks.

problem Bayesian adversaries can manipulate machine learning models through small perturbations.
method Developed a continuous-time particle system (Abram) to approximate the gradient flow of the Bayesian adversarial robustness problem.
result Abram approximates the minimizer of the Bayesian adversarial robustness problem under certain assumptions.

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these …

2017-11-28abs ↗pdf ↗

Study compares adversarial regularization to sole supervision in machine learning.

problem Understanding when adversarial regularization outperforms sole supervision.
method Examines vanishing gradient, iteration complexity, gradient flow, and convergence in both paradigms.
result Adversarial regularization accelerates gradient descent and improves generalization.

Generative Adversarial Networks (GAN) training process, in most cases, apply Uniform or Gaussian sampling methods in the latent space, which probably spends most of the computation on examples that can be properly handled and easy to generate. Theoretically, importance sampling speeds up stochastic optimization in supe…

2019-10-06abs ↗pdf ↗

A new framework solves complex optimization problems with continuous worst-case distributions.

problem Optimizing under uncertain distributions with continuous worst-case scenarios.
method Flow-based distributionally robust optimization (DRO) with Wasserstein uncertainty sets and invertible transport maps.
result The framework finds continuous worst-case distributions and samples efficiently.

Generative adversarial networks reconstruct MRI images without full data.

problem Lack of fully-sampled ground truth data for supervised MRI reconstruction.
method Generative adversarial networks for unsupervised MRI reconstruction.
result Reconstructed images show more anatomical structure than conventional methods.

Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\it generative adversarial networks} GAN [3]. GAN trade…

2018-07-19abs ↗pdf ↗

Recurrent Neural Networks (RNNs) yield attractive properties for constructing Intrusion Detection Systems (IDSs) for network data. With the rise of ubiquitous Machine Learning (ML) systems, malicious actors have been catching up quickly to find new ways to exploit ML vulnerabilities for profit. Recently developed adver…

2019-12-20abs ↗pdf ↗

A method for estimating signal distributions from inverse problems using normalizing flows.

problem Estimating the distribution of the underlying signal from observations in inverse problems.
method A framework for approximate inference on a pre-trained unconditional flow model, using a composition of two flow models for stable variational inference.
result Our method produces high-quality samples with uncertainty quantification and can be amortized for zero-shot inference.

Diffusion LLMs can efficiently generate harmful prompts for adversarial testing.

problem Generating harmful prompts for adversarial testing is resource-intensive and costly.
method Transformed adversarial prompt optimization into an efficient inference task using pretrained Diffusion LLMs.
result Only a few conditional samples are required to generate harmful prompts with high reward.

Unified framework for SDMs and GANs with improved sampling and quality.

problem Limitations of SDMs and GANs in achieving fast sampling and high sample quality.
method Introducing a novel SDE named DiffFlow to describe the learning dynamics of SDMs and GANs, and proving the asymptotic optimality and maximal likelihood training scheme.
result Unified framework allows smooth transition between SDMs and GANs with flexible trade-off between sample quality and speed.

This paper proposes a new method to approximate posterior distributions using generative neural networks trained via scoring rule minimization.

problem Bayesian Likelihood-Free Inference for models with intractable likelihood.
method Approximate posterior with generative neural networks trained via scoring rule minimization, avoiding the instability of adversarial training.
result Scoring Rule minimization leads to better performance and uncertainty quantification compared to adversarial training.

Method learns PDE dynamics via evolving latent manifold using Ricci flow.

problem Learning dynamics in time, especially PDEs, with low-dimensional representations.
method Parameterizes latent manifold, simulates Ricci flow physics-informedly, matching manifold quantities.
result Ricci flow facilitates learning for out-of-distribution data and adversarial robustness.

In its simplest form, the traffic flow prediction problem is restricted to predicting a single time-step into the future. Multi-step traffic flow prediction extends this set-up to the case where predicting multiple time-steps into the future based on some finite history is of interest. This problem is significantly mor…

2018-03-04abs ↗pdf ↗