activity
20092026
most citedBatch Bayesian Optimization via Local Penalization

214 citations · 1.8k across the 88 of their papers we have counts for

collaborators
Showing 2020Show all

15 papers · 1 filter

stat.ML2020★ 7 cited

Stable Implementation of Probabilistic ODE Solvers

Nicholas Krämer, Philipp Hennig

Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty associated with simulation of dynamical systems. Their co…

math.NA2020

Calibrated Adaptive Probabilistic ODE Solvers

Nathanael Bosch, Philipp Hennig, Filip Tronarp

Probabilistic solvers for ordinary differential equations assign a posterior measure to the solution of an initial value problem. The joint covariance of this distribution provides…

cs.LG2020★ 1 cited

Self-Tuning Stochastic Optimization with Curvature-Aware Gradient Filtering

Ricky T. Q. Chen, Dami Choi, Lukas Balles +2

Standard first-order stochastic optimization algorithms base their updates solely on the average mini-batch gradient, and it has been shown that tracking additional quantities such…

cs.LG2020★ 3 cited

Probabilistic Linear Solvers for Machine Learning

Jonathan Wenger, Philipp Hennig

Linear systems are the bedrock of virtually all numerical computation. Machine learning poses specific challenges for the solution of such systems due to their scale, characteristi…

cs.RO2020★ 24 cited

Robot Learning with Crash Constraints

Alonso Marco, Dominik Baumann, Majid Khadiv +3

In the past decade, numerous machine learning algorithms have been shown to successfully learn optimal policies to control real robotic systems. However, it is common to encounter…

cs.LG2020★ 3 cited

Learnable Uncertainty under Laplace Approximations

Agustinus Kristiadi, Matthias Hein, Philipp Hennig

Laplace approximations are classic, computationally lightweight means for constructing Bayesian neural networks (BNNs). As in other approximate BNNs, one cannot necessarily expect…