activity
20102023
most citedXGBoost: A Scalable Tree Boosting System

54k citations · 58.7k across the 46 of their papers we have counts for

collaborators
Showing 2012Show all

9 papers · 1 filter

cs.AI2012★ 59 cited

Distributed Planning in Hierarchical Factored MDPs

Carlos E. Guestrin, Geoffrey Gordon

We present a principled and efficient planning algorithm for collaborative multiagent dynamical systems. All computation, during both the planning and the execution phases, is dist…

cs.AI2012★ 2 cited

Robust Probabilistic Inference in Distributed Systems

Mark Paskin, Carlos E. Guestrin

Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natu…

cs.AI2012

Solving Factored MDPs with Continuous and Discrete Variables

Carlos E. Guestrin, Milos Hauskrecht, Branislav Kveton

Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods c…

cs.AI2012★ 357 cited

Near-optimal Nonmyopic Value of Information in Graphical Models

Andreas Krause, Carlos E. Guestrin

A fundamental issue in real-world systems, such as sensor networks, is the selection of observations which most effectively reduce uncertainty. More specifically, we address the lo…

cs.LG2012★ 14 cited

Hierarchical Exploration for Accelerating Contextual Bandits

Yisong Yue, Sue Ann Hong, Carlos Guestrin

Contextual bandit learning is an increasingly popular approach to optimizing recommender systems via user feedback, but can be slow to converge in practice due to the need for expl…

cs.AI2012

Distributed Parallel Inference on Large Factor Graphs

Joseph E. Gonzalez, Yucheng Low, Carlos E. Guestrin +1

As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms…