989 citations · 4.1k across the 80 of their papers we have counts for
4 papers · 2 filters
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann +1
Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate…
Safe Exploration in Finite Markov Decision Processes with Gaussian Processes
Matteo Turchetta, Felix Berkenkamp, Andreas Krause
In classical reinforcement learning, when exploring an environment, agents accept arbitrary short term loss for long term gain. This is infeasible for safety critical applications,…
Near-optimal Bayesian Active Learning with Correlated and Noisy Tests
Yuxin Chen, S. Hamed Hassani, Andreas Krause
We consider the Bayesian active learning and experimental design problem, where the goal is to learn the value of some unknown target variable through a sequence of informative, no…
Learning Sparse Additive Models with Interactions in High Dimensions
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner +1
A function is referred to as a Sparse Additive Model (SPAM), if it is of the form , whe…