← Search

Gunnar Rätsch

7 accepted papers

2022

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

AISTATS 2022poster

We propose a stochastic conditional gradient method (CGM) for minimizing convex finite-sum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or require carefully increasing the batch size over the course of t…

2021

Boosting Variational Inference With Locally Adaptive Step-Sizes

IJCAI 2021poster

Variational Inference makes a trade-off between the capacity of the variational family and the tractability of finding an approximate posterior distribution. Instead, Boosting Variational Inference allows practitioners to obtain increasingly good posterior approximations by spending more compute. Th…

2021

Neighborhood Contrastive Learning Applied to Online Patient Monitoring

ICML 2021spotlight

Intensive care units (ICU) are increasingly looking towards machine learning for methods to provide online monitoring of critically ill patients. In machine learning, online monitoring is often formulated as a supervised learning problem. Recently, contrastive learning approaches have demonstrated p…

2021

Scalable Gaussian Process Variational Autoencoders

AISTATS 2021poster

Conventional variational autoencoders fail in modeling correlations between data points due to their use of factorized priors. Amortized Gaussian process inference through GP-VAEs has led to significant improvements in this regard, but is still inhibited by the intrinsic complexity of exact GP infer…

2021

Scalable Marginal Likelihood Estimation for Model Selection in Deep Learning

ICML 2021spotlight

Marginal-likelihood based model-selection, even though promising, is rarely used in deep learning due to estimation difficulties. Instead, most approaches rely on validation data, which may not be readily available. In this work, we present a scalable marginal-likelihood estimation method to select…

2020

Disentangling Factors of Variations Using Few Labels

ICLR 2020poster

Learning disentangled representations is considered a cornerstone problem in representation learning. Recently, Locatello et al. (2019) demonstrated that unsupervised disentanglement learning without inductive biases is theoretically impossible and that existing inductive biases and unsupervised met…

Cited by 210SourceScholar
2019

SOM-VAE: Interpretable Discrete Representation Learning on Time Series

ICLR 2019poster

High-dimensional time series are common in many domains. Since human cognition is not optimized to work well in high-dimensional spaces, these areas could benefit from interpretable low-dimensional representations. However, most representation learning algorithms for time series data are difficult t…