activity
20182022
most citedOptimal Continual Learning has Perfect Memory and is NP-hard

33 citations · 70 across the 7 of their papers we have counts for

collaborators

9 papers

stat.ME20209 cited

Generalized Posteriors in Approximate Bayesian Computation

Sebastian M Schmon, Patrick W Cannon, Jeremias Knoblauch

Complex simulators have become a ubiquitous tool in many scientific disciplines, providing high-fidelity, implicit probabilistic models of natural and social phenomena. Unfortunate…

cs.LG20209 cited

Transforming Gaussian Processes With Normalizing Flows

Juan Maroñas, Oliver Hamelijnck, Jeremias Knoblauch +1

Gaussian Processes (GPs) can be used as flexible, non-parametric function priors. Inspired by the growing body of work on Normalizing Flows, we enlarge this class of priors through…

stat.ME20202 cited

Robust Bayesian Inference for Discrete Outcomes with the Total Variation Distance

Jeremias Knoblauch, Lara Vomfell

Models of discrete-valued outcomes are easily misspecified if the data exhibit zero-inflation, overdispersion or contamination. Without additional knowledge about the existence and…

cs.LG202033 cited

Optimal Continual Learning has Perfect Memory and is NP-hard

Jeremias Knoblauch, Hisham Husain, Tom Diethe

Continual Learning (CL) algorithms incrementally learn a predictor or representation across multiple sequentially observed tasks. Designing CL algorithms that perform reliably and…

math.ST20194 cited

Frequentist Consistency of Generalized Variational Inference

Jeremias Knoblauch

This paper investigates Frequentist consistency properties of the posterior distributions constructed via Generalized Variational Inference (GVI). A number of generic and novel str…

stat.ML20198 cited

Robust Deep Gaussian Processes

Jeremias Knoblauch

This report provides an in-depth overview over the implications and novelty Generalized Variational Inference (GVI) (Knoblauch et al., 2019) brings to Deep Gaussian Processes (DGPs…