Andreas Krause 0001

149 publications

19 venues

H Index51


Technical University of Munich, Germany
ETH Zurich, Switzerland
California Institute of Technology, Pasadena, CA, USA


Name Venue Year Citations
Distributed and Provably Good Seedings for k-Means in Constant Rounds. ICML 2017 6
Learning Probabilistic Submodular Diversity Models Via Noise Contrastive Estimation. AISTATS 2016 18
Nonmyopic Adaptive Informative Path Planning for Multiple Robots. IJCAI 2009 76
Near-optimal Nonmyopic Value of Information in Graphical Models. UAI 2005 296
Strong Coresets for Hard and Soft Bregman Clustering with Applications to Exponential Family Mixtures. AISTATS 2016 38
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization. AAAI 2016 35
Safe Exploration in Finite Markov Decision Processes with Gaussian Processes. NIPS/NeurIPS 2016 51
Evaluating Task-Dependent Taxonomies for Navigation. HCOMP 2016 2
Learning User Preferences to Incentivize Exploration in the Sharing Economy. AAAI 2018 4
Fast Gaussian process based gradient matching for parameter identification in systems of nonlinear ODEs. AISTATS 2019 8
Projection Free Online Learning over Smooth Sets. AISTATS 2019 3
Robot navigation in dense human crowds: the case for cooperation. ICRA 2013 94
Scalable Training of Mixture Models via Coresets. NIPS/NeurIPS 2011 75
Actively Learning Hemimetrics with Applications to Eliciting User Preferences. ICML 2016 11
Online Variance Reduction for Stochastic Optimization. COLT 2018 7
Near-optimal sensor placements in Gaussian processes. ICML 2005 373
Submodularity on Hypergraphs: From Sets to Sequences. AISTATS 2018 4
Learning to Hire Teams. HCOMP 2015 5
Safe Contextual Bayesian Optimization for Sustainable Room Temperature PID Control Tuning. IJCAI 2019 2
Incentives for Privacy Tradeoff in Community Sensing. HCOMP 2013 58
Online Variance Reduction with Mixtures. ICML 2019 4
Adaptive Sequence Submodularity. NIPS/NeurIPS 2019 1
Robust landmark selection for mobile robot navigation. IROS 2013 12
Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization. ICML 2013 70
Nonmyopic active learning of Gaussian processes: an exploration-exploitation approach. ICML 2007 136
Discriminative Clustering by Regularized Information Maximization. NIPS/NeurIPS 2010 138
Efficient visual exploration and coverage with a micro aerial vehicle in unknown environments. ICRA 2015 58
Differentiable Submodular Maximization. IJCAI 2018 8
Discrete Sampling using Semigradient-based Product Mixtures. UAI 2018 0
Efficient Informative Sensing using Multiple Robots. JAIR 2009 213
Learning Fourier Sparse Set Functions. AISTATS 2012 23
Discovering Valuable items from Massive Data. KDD 2015 19
Data association for topic intensity tracking. ICML 2006 49
Efficient Planning of Informative Paths for Multiple Robots. IJCAI 2007 144
Distributed Submodular Cover: Succinctly Summarizing Massive Data. NIPS/NeurIPS 2015 27
Optimal Nonmyopic Value of Information in Graphical Models - Efficient Algorithms and Theoretical Limits. IJCAI 2005 79
Improving Optimization-Based Approximate Inference by Clamping Variables. UAI 2017 0
No-Regret Bayesian Optimization with Unknown Hyperparameters. JMLR 2019 2
Selecting Observations against Adversarial Objectives. NIPS/NeurIPS 2007 36
Inferring networks of diffusion and influence. KDD 2010 788
Deletion-Robust Submodular Maximization: Data Summarization with "the Right to be Forgotten". ICML 2017 28
Proper Proxy Scoring Rules. AAAI 2017 8
Scalable Variational Inference in Log-supermodular Models. ICML 2015 26
Building Hierarchies of Concepts via Crowdsourcing. IJCAI 2015 21
Optimal Value of Information in Graphical Models. JAIR 2009 94
Fast and Provably Good Seedings for k-Means. NIPS/NeurIPS 2016 54
Joint Optimization and Variable Selection of High-dimensional Gaussian Processes. ICML 2012 44
Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces. ICML 2019 16
Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation. NIPS/NeurIPS 2016 26
Contextual Procurement in Online Crowdsourcing Markets. HCOMP 2014 0
Differentiable Learning of Submodular Functions. NIPS/NeurIPS 2017 2
Near-Optimal Bayesian Active Learning with Noisy Observations. NIPS/NeurIPS 2010 128
Submodular Dictionary Selection for Sparse Representation. ICML 2010 86
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization. COLT 2010 82
Explore-exploit in top-N recommender systems via Gaussian processes. RecSys 2014 42
A Utility-Theoretic Approach to Privacy in Online Services. JAIR 2010 73
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies. JMLR 2008 899
Incentivizing Users for Balancing Bike Sharing Systems. AAAI 2015 81
Differentially Private Submodular Maximization: Data Summarization in Disguise. ICML 2017 6
Uniform Deviation Bounds for k-Means Clustering. ICML 2017 6
Coresets for Nonparametric Estimation - the Case of DP-Means. ICML 2015 40
Crowdclustering. NIPS/NeurIPS 2011 90
Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning. AISTATS 2015 11
Safe controller optimization for quadrotors with Gaussian processes. ICRA 2016 85
Contextual Gaussian Process Bandit Optimization. NIPS/NeurIPS 2011 143
Sequential Information Maximization: When is Greedy Near-optimal? COLT 2015 21
Trading off Prediction Accuracy and Power Consumption for Context-Aware Wearable Computing. ISWC 2005 112
Safe Exploration for Interactive Machine Learning. NIPS/NeurIPS 2019 0
Probabilistic Submodular Maximization in Sub-Linear Time. ICML 2017 10
Virtual vs. real: Trading off simulations and physical experiments in reinforcement learning with Bayesian optimization. ICRA 2017 41
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains. AISTATS 2017 66
Near Optimal Bayesian Active Learning for Decision Making. AISTATS 2014 45
Stochastic Submodular Maximization: The Case of Coverage Functions. NIPS/NeurIPS 2017 17
Learning Sparse Additive Models with Interactions in High Dimensions. AISTATS 2016 7
A Domain Agnostic Measure for Monitoring and Evaluating GANs. NIPS/NeurIPS 2019 1
Efficient Minimization of Decomposable Submodular Functions. NIPS/NeurIPS 2010 98
From MAP to Marginals: Variational Inference in Bayesian Submodular Models. NIPS/NeurIPS 2014 56
No-Regret Learning in Unknown Games with Correlated Payoffs. NIPS/NeurIPS 2019 3
SenSay: A Context-Aware Mobile Phone. ISWC 2003 272
Streaming submodular maximization: massive data summarization on the fly. KDD 2014 134
Near-optimal Bayesian Active Learning with Correlated and Noisy Tests. AISTATS 2017 13
Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms. NIPS/NeurIPS 2017 7
Randomized Sensing in Adversarial Environments. IJCAI 2011 16
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization. ICML 2016 8
Better safe than sorry: Risky function exploitation through safe optimization. Cognitive Science 2016 9
Sampling from Probabilistic Submodular Models. NIPS/NeurIPS 2015 21
e-PAL: An Active Learning Approach to the Multi-Objective Optimization Problem. JMLR 2016 10
Distributed Submodular Maximization. JMLR 2016 36
Learning Generative Models across Incomparable Spaces. ICML 2019 15
Learning and Feature Selection under Budget Constraints in Crowdsourcing. HCOMP 2016 8
Efficient Partial Monitoring with Prior Information. NIPS/NeurIPS 2014 9
Higher-Order Inference for Multi-class Log-Supermodular Models. ICCV 2015 12
A Utility-Theoretic Approach to Privacy and Personalization. AAAI 2008 59
Active Learning for Multi-Objective Optimization. ICML 2013 66
Near-optimal Observation Selection using Submodular Functions. AAAI 2007 232
Selecting Sequences of Items via Submodular Maximization. AAAI 2017 15
Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting. UAI 2017 3
Safe Convex Learning under Uncertain Constraints. AISTATS 2019 5
Active Detection via Adaptive Submodularity. ICML 2014 28
Safe Exploration for Optimization with Gaussian Processes. ICML 2015 94
Learning to Interact With Learning Agents. AAAI 2018 5
Training Gaussian Mixture Models at Scale via Coresets. JMLR 2017 16
Linear-Time Outlier Detection via Sensitivity. IJCAI 2016 10
Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization. ICML 2012 185
Variational Inference in Mixed Probabilistic Submodular Models. NIPS/NeurIPS 2016 19
Non-Monotone Adaptive Submodular Maximization. IJCAI 2015 11
Dynamic Resource Allocation in Conservation Planning. AAAI 2011 24
Approximate K-Means++ in Sublinear Time. AAAI 2016 47
Provable Variational Inference for Constrained Log-Submodular Models. NIPS/NeurIPS 2018 1
Budgeted Nonparametric Learning from Data Streams. ICML 2010 66
Nonmyopic Informative Path Planning in Spatio-Temporal Models. AAAI 2007 65
High-Dimensional Gaussian Process Bandits. NIPS/NeurIPS 2013 88
Distributed Submodular Maximization: Identifying Representative Elements in Massive Data. NIPS/NeurIPS 2013 160
Guarantees for Greedy Maximization of Non-submodular Functions with Applications. ICML 2017 71
Fully autonomous focused exploration for robotic environmental monitoring. ICRA 2014 0
Generalization and Search in Risky Environments. Cognitive Science 2018 4
Submodular Surrogates for Value of Information. AAAI 2015 28
Information Directed Sampling and Bandits with Heteroscedastic Noise. COLT 2018 10
Crowd Access Path Optimization: Diversity Matters. HCOMP 2015 10
Unfreezing the robot: Navigation in dense, interacting crowds. IROS 2010 250
SFO: A Toolbox for Submodular Function Optimization. JMLR 2010 67
Scalable k -Means Clustering via Lightweight Coresets. KDD 2018 18
Efficient High Dimensional Bayesian Optimization with Additivity and Quadrature Fourier Features. NIPS/NeurIPS 2018 24
Horizontally Scalable Submodular Maximization. ICML 2016 8
Near-Optimally Teaching the Crowd to Classify. ICML 2014 62
Informative path planning for an autonomous underwater vehicle. ICRA 2010 79
Bounding Inefficiency of Equilibria in Continuous Actions Games using Submodularity and Curvature. AISTATS 2019 0
Unsupervised, Dynamic Identification of Physiological and Activity Context in Wearable Computing. ISWC 2003 126
Safe Model-based Reinforcement Learning with Stability Guarantees. NIPS/NeurIPS 2017 153
Efficient Sampling for Learning Sparse Additive Models in High Dimensions. NIPS/NeurIPS 2014 8
Cooperative Graphical Models. NIPS/NeurIPS 2016 1
Optimal Continuous DR-Submodular Maximization and Applications to Provable Mean Field Inference. ICML 2019 1
Stochastic Bandits with Context Distributions. NIPS/NeurIPS 2019 1
Cost-effective outbreak detection in networks. KDD 2007 1329
Active Learning for Level Set Estimation. IJCAI 2013 72
Online Learning of Assignments. NIPS/NeurIPS 2009 45
Incentive-Compatible Forecasting Competitions. AAAI 2018 5
Information Gathering in Networks via Active Exploration. IJCAI 2015 9
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. WWW 2013 176
Lazier Than Lazy Greedy. AAAI 2015 127
Interactive Submodular Bandit. NIPS/NeurIPS 2017 3
Teaching Multiple Concepts to a Forgetful Learner. NIPS/NeurIPS 2019 6
Streaming Non-Monotone Submodular Maximization: Personalized Video Summarization on the Fly. AAAI 2018 0
Information Gathering With Peers: Submodular Optimization With Peer-Prediction Constraints. AAAI 2018 0
The Lyapunov Neural Network: Adaptive Stability Certification for Safe Learning of Dynamical Systems. CoRL 2018 0
AReS and MaRS Adversarial and MMD-Minimizing Regression for SDEs. ICML 2019 0
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design. ICML 2010 0
Parallelizing exploration-exploitation tradeoffs in Gaussian process bandit optimization. JMLR 2014 0
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. JAIR 2011 0
Copyright ©2019 Universit├Ąt W├╝rzburg
Website created in context of the REGIO Project
Impressum | Privacy | FAQ