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

111222332443 · Jun 202019922001200920172026
48 results for variational graph auto-encoder

DGA and DVGA learn disentangled graph representations to improve graph analysis.

problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.

We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model us…

2016-11-21abs ↗pdf ↗

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

2019-08-19abs ↗pdf ↗

The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph structure by only considering two nodes at a time, thus ignoring possible interaction…

2019-11-26abs ↗pdf ↗

Enhances graph modeling with hyperbolic geometry and variational inference.

problem Challenges in modeling relational data with complex dependencies.
method Semi-implicit hierarchical variational Bayes with Poincaré embedding and mutual information regularization.
result Improves graph representation quality and flexibility in edge prediction and node classification.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

We present two instances, L-GAE and L-VGAE, of the variational graph auto-encoding family (VGAE) based on separating feature propagation operations from graph convolution layers typically found in graph learning methods to a single linear matrix computation made prior to input in standard auto-encoder architectures. Th…

2019-10-18abs ↗pdf ↗

Variational Auto-Encoders (VAEs) are capable of learning latent representations for high dimensional data. However, due to the i.i.d. assumption, VAEs only optimize the singleton variational distributions and fail to account for the correlations between data points, which might be crucial for learning latent representa…

2019-05-14abs ↗pdf ↗

iGCL preserves graph semantics in latent space augmentations.

problem Manual tuning of augmentation ratios and unexpected graph changes.
method iGCL uses a Variational Graph Auto-Encoder to learn augmentations in the latent space, optimizing an upper bound for contrastive loss.
result iGCL achieves state-of-the-art performance on graph-level and node-level tasks.

Proposes a new model for directed graphs combining deep learning and latent variable models.

problem Graph representation learning for directed graphs.
method Deep Latent Space Model (DLSM) integrating GCN encoder and stochastic decoder with hierarchical variational auto-encoder architecture.
result Achieves state-of-the-art performance on link prediction and community detection tasks.

CFRecs uses counterfactual reasoning to improve graph-based recommendations in real estate.

problem Improving model interpretability and actionable insights in graph-based recommender systems.
method A two-stage architecture combining GNN and Graph-VAE to propose minimal yet impactful changes in graph structure and node attributes.
result Demonstrates effectiveness in delivering actionable recommendations for home buyers and sellers.

Learning network representations is a fundamental task for many graph applications such as link prediction, node classification, graph clustering, and graph visualization. Many real-world networks are interpreted as dynamic networks and evolve over time. Most existing graph embedding algorithms were developed for stati…

2019-10-04abs ↗pdf ↗

Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reco…

2019-05-26abs ↗pdf ↗

Improved reliability of machine learning predictions using variational auto-encoders.

problem Individual unreliability of machine learning models.
method Modified variational auto-encoders to identify a low-dimensional space for reliable classification.
result Improved reliability of predictions and robust identification of adversarial samples.

Unbiased gradient estimation improves VAE performance.

problem Training VAEs via maximum likelihood is difficult due to intractable integrals.
method Introduced unbiased estimators of the log-likelihood gradient using coupled Markov chains.
result Unbiased estimators lead to better predictive performance in VAEs.

Variational Auto-Encoders (VAEs) have been widely applied for learning compact, low-dimensional latent representations of high-dimensional data. When the correlation structure among data points is available, previous work proposed Correlated Variational Auto-Encoders (CVAEs), which employ a structured mixture model as …

2019-06-14abs ↗pdf ↗

Graph auto-encoders predict stock market instability by measuring graph structure changes.

problem Forecasting stock market instability and volatility.
method Use graph auto-encoders to reconstruct graph structure and measure changes.
result Higher GAE reconstruction error correlates with higher volatility.

This paper proposes a method to train energy-based models using variational auto-encoders for efficient sampling.

problem Training energy-based models by maximum likelihood is challenging due to intractable partition functions and difficult sampling from the model distribution.
method The authors propose using a variational auto-encoder to initialize finite-step MCMC sampling, specifically Langevin dynamics, to train the energy-based model.
result The proposed method enables training energy-based models using maximum likelihood, generating samples comparable to GANs and EBMs.

The paper uses a graph autoencoder to learn unbiased plant-pollinator interaction embeddings.

problem Sampling bias in citizen science data affects ecological network analysis.
method Bipartite graph variational autoencoder with HSIC for fairness.
result The method mitigates sampling bias and provides unbiased embeddings.

EGAE improves graph clustering by utilizing GAE's representations in a way consistent with relaxed k-means theory.

problem Improving graph clustering performance using unsupervised methods.
method Designing an Embedding Graph Auto-Encoder (EGAE) that aligns with theoretical relaxed k-means to learn explainable representations.
result EGAE achieves superior graph clustering results compared to existing methods.

The paper evaluates variational auto-encoders using model criticism methods.

problem Evaluating the quality of variational auto-encoders (VAEs).
method Statistical model criticism, focusing on reproducing statistics of unknown data generating processes.
result The proposed framework offers possibilities for model selection beyond intrinsic metrics.

A brain can detect outlier just by using only normal samples. Similarly, one-class classification (OCC) also uses only normal samples to train the model and trained model can be used for outlier detection. In this paper, a multi-layer architecture for OCC is proposed by stacking various Graph-Embedded Kernel Ridge Regr…

2019-04-13abs ↗pdf ↗

We provide theoretical and empirical evidence that using tighter evidence lower bounds (ELBOs) can be detrimental to the process of learning an inference network by reducing the signal-to-noise ratio of the gradient estimator. Our results call into question common implicit assumptions that tighter ELBOs are better vari…

2018-02-13abs ↗pdf ↗

Paper formalizes and analyzes a new bound for variational inference.

problem Lack of theoretical guarantees in variational algorithms.
method Introduces VR-IWAE bound, a generalization of IWAE.
result VR-IWAE bound leads to unbiased gradient estimators.

This paper proposes a new method to learn combinatorial patterns for airline crew pairing optimization.

problem Enhancing airline crew pairing optimization for large-scale, complex flight networks.
method Variational Graph Auto-Encoder for learning combinatorial patterns among flight-connection graphs.
result The proposed method generates new pairings for the optimizer, improving the efficacy of airline crew pairing optimization.

Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…

2017-10-30abs ↗pdf ↗

DIVA clusters dynamic data without needing cluster count, outperforming baselines.

problem Clustering complex, dynamic data without prior knowledge of cluster count.
method Nonparametric Dirichlet Process Mixtures with memoized online variational inference.
result DIVA outperforms state-of-the-art in classifying complex data with changing features.

We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…

2017-11-05abs ↗pdf ↗

Generative models improve causal effect estimation from observational data.

problem Estimating causal effects from observational data, especially when confounding factors are present.
method Proposes a progressive sequence of Variational Auto-Encoder models to learn underlying factors and causal effects.
result Empirical results show superior performance compared to state-of-the-art approaches.

Develops scalable autoencoder for document networks.

problem Sparse and skewed latent node representations in document relational networks.
method Combines graph Poisson factor analysis with Weibull-based graph inference networks.
result Extracts high-quality hierarchical latent document representations.

Variational auto-encoders (VAE) are scalable and powerful generative models. However, the choice of the variational posterior determines tractability and flexibility of the VAE. Commonly, latent variables are modeled using the normal distribution with a diagonal covariance matrix. This results in computational efficien…

2016-11-29abs ↗pdf ↗

In this paper we propose a model that combines the strengths of RNNs and SGVB: the Variational Recurrent Auto-Encoder (VRAE). Such a model can be used for efficient, large scale unsupervised learning on time series data, mapping the time series data to a latent vector representation. The model is generative, such that …

2014-12-20abs ↗pdf ↗

MIAEAD detects anomalies in mixed data types.

problem Challenges of heterogeneity in feature subsets for anomaly detection.
method Multiple-Input Variational Auto-Encoder (MIVAE) for simultaneous feature subset anomaly scoring.
result MIVAE outperforms conventional methods and state-of-the-art unsupervised models in AUC score.