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.

169,051 papers · 148 categories

Trend · papers per month

count % of corpus

5 results for “self-adversarial”

Self-Adversarially Learned Bayesian Samplingstat.ML

Self-adversarial learning improves Bayesian sampling efficiency and quality.

problem Highly correlated and inefficient samples from scalable Bayesian sampling methods.

method Proposes a self-adversarial learning framework to learn a conditional generator.

result Efficiently generated samples that progressively approach a target distribution.

Bayesian sampling self-adversarial learning Markov kernel sample quality sampling efficiency

2018-11-21abs ↗pdf ↗

adVAE: A self-adversarial variational autoencoder with Gaussian anomaly prior knowledge for anomaly detectioncs.LG

Proposes a self-adversarial variational autoencoder for anomaly detection.

problem Anomaly detection in deep generative models.

method Self-adversarial Variational Autoencoder with Gaussian anomaly prior.

result Significant improvements in anomaly detection performance compared to SOTA baselines.

anomaly detection self-adversarial variational autoencoder Gaussian prior deep generative models

2019-03-03abs ↗pdf ↗

EBMs Trained with Maximum Likelihood are Generator Models Trained with a Self-adverserial Losscs.LG

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.

Energy-based models Maximum likelihood Gradient descent GANs Self-adversarial loss

2021-02-23abs ↗pdf ↗

RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecs.LG

RotatE embeds knowledge graphs using rotations in complex space for better link prediction.

problem Predicting missing links in knowledge graphs.

method RotatE models relations as rotations in complex vector space, using self-adversarial negative sampling.

result RotatE models and infers various relation patterns, outperforming existing models.

knowledge graph embedding link prediction complex vector space rotations negative sampling

2019-02-26abs ↗pdf ↗

DGSAN: Discrete Generative Self-Adversarial Networkcs.LG

Proposes a new GAN framework for discrete data generation.

problem Difficulty in passing gradients from discriminator to generator for discrete data.

method Adversarial approach with iterative generator definition based on discriminator.

result Improves discrete data generation quality and diversity compared to GANs and ML.

GAN Discrete Data Gradient Passing Adversarial Learning Discreteness

2019-08-24abs ↗pdf ↗