Goto

Collaborating Authors

 aij


Robustnessvia Uncertainty-awareCycleConsistency

Neural Information Processing Systems

Existing methods learn deterministic mappings without explicitly modelling the robustness to outliers or predictive uncertainty,leading to performance degradation when encountering unseen perturbations attest time. Toaddress this, we propose anovelprobabilistic method based on Uncertainty-aware Generalized AdaptiveCycle Consistency(UGAC), which models the per-pixel residual by generalized Gaussian distribution, capable of modelling heavy-tailed distributions.



VariationalInferenceforGraphConvolutional NetworksintheAbsenceofGraphDataand AdversarialSettings

Neural Information Processing Systems

We formulate a joint probabilistic model that considers a prior distribution over graphs along with a GCN-based likelihood and develop a stochastic variational inference algorithm to estimate the graph posterior and the GCN parameters jointly.


TemporalPositive-unlabeledLearningforBiomedical HypothesisGenerationviaRiskEstimation

Neural Information Processing Systems

Then, the key is to capture the temporal evolution of node pair (term pair) relations from just the positive and unlabeled data. We propose a variational inference model to estimate the positive prior, and incorporate it in the learning of node pairembeddings, which arethenused forlinkprediction.


244edd7e85dc81602b7615cd705545f5-Supplemental.pdf

Neural Information Processing Systems

We begin by proving the lower bound on coverage. The formal proof of this statement is standard at this point, so we simply refer to [3] for the remaining technical details. The proof for the upper bound also immediatelyfollowsfrom(S6)byapplyingLemma2in[3]. The proof is essentially an application of the main result in [2]. This will become apparent after we reduce our claim to the setting in the aforementioned paper.


Adapting Resilient Propagation for Deep Learning

arXiv.org Machine Learning

The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In this paper, we propose a modification of the Rprop that combines standard Rprop steps with a special drop out technique. We apply the method for training Deep Neural Networks as standalone components and in ensemble formulations. Results on the MNIST dataset show that the proposed modification alleviates standard Rprop's problems demonstrating improved learning speed and accuracy.