Search Results for author:
Found 16 papers, 9 papers with code
Graph Condensation via Receptive Field Distribution Matching
Thus, we propose Graph Condesation via Receptive Field Distribution Matching (GCDM), which is accomplished by optimizing the synthetic graph through the use of a distribution matching loss quantified by maximum mean discrepancy (MMD).
uGLAD: Sparse graph recovery by optimizing deep unrolled networks
Our model, uGLAD, builds upon and extends the state-of-the-art model GLAD to the unsupervised setting.
Multi-task Learning of Order-Consistent Causal Graphs
We consider the problem of discovering $K$ related Gaussian directed acyclic graphs (DAGs), where the involved graph structures share a consistent causal order and sparse unions of supports.
Provable Learning-based Algorithm For Sparse Recovery
In this work, we propose PLISA (Provable Learning-based Iterative Sparse recovery Algorithm) to learn algorithms automatically from data.
A Framework For Differentiable Discovery Of Graph Algorithms
Recently there is a surge of interests in using graph neural networks (GNNs) to learn algorithms.
Learning Two-Time-Scale Representations For Large Scale Recommendations
We propose a surprisingly simple but effective two-time-scale (2TS) model for learning user representations for recommendation.
Understanding Deep Architecture with Reasoning Layer
Recently, there is a surge of interest in combining deep learning models with reasoning in order to handle more sophisticated learning tasks.
Understanding Deep Architectures with Reasoning Layer
Recently, there has been a surge of interest in combining deep learning models with reasoning in order to handle more sophisticated learning tasks.
Learning to Stop While Learning to Predict
Similar to algorithms, the optimal depth of a deep architecture may be different for different input instances, either to avoid ``over-thinking'', or because we want to compute less for operations converged already.
RNA Secondary Structure Prediction By Learning Unrolled Algorithms
The key idea of E2Efold is to directly predict the RNA base-pairing matrix, and use an unrolled algorithm for constrained programming as the template for deep architectures to enforce constraints.
Efficient Probabilistic Logic Reasoning with Graph Neural Networks
In this paper, we explore the combination of MLNs and GNNs, and use graph neural networks for variational inference in MLN.
Review: Ordinary Differential Equations For Deep Learning
Finally, two applications of using a continuous model will be shown in Section 5 and 6 to demonstrate some of its advantages over traditional neural networks.
Can Graph Neural Networks Help Logic Reasoning?
Effectively combining logic reasoning and probabilistic inference has been a long-standing goal of machine learning: the former has the ability to generalize with small training data, while the latter provides a principled framework for dealing with noisy data.
GLAD: Learning Sparse Graph Recovery
Recently, there is a surge of interest to learn algorithms directly based on data, and in this case, learn to map empirical covariance to the sparse precision matrix.
Particle Flow Bayes' Rule
We present a particle flow realization of Bayes' rule, where an ODE-based neural operator is used to transport particles from a prior to its posterior after a new observation.
Generative Adversarial User Model for Reinforcement Learning Based Recommendation System
There are great interests as well as many challenges in applying reinforcement learning (RL) to recommendation systems.
Generative Adversarial Network
Model-based Reinforcement Learning
+4
