output
20022013
most citedDiscrete Signal Processing on Graphs

1.5k citations

Showing 2012 · cs.AIShow all

13 papers · 2 filters

cs.AI20129 cited

Alternating Directions Dual Decomposition

Andre F. T. Martins, Mario A. T. Figueiredo, Pedro M. Q. Aguiar +2

We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposi…

cs.AI20128 cited

Real-valued All-Dimensions search: Low-overhead rapid searching over subsets of attributes

Andrew Moore, Jeff Schneider

This paper is about searching the combinatorial space of contingency tables during the inner loop of a nonlinear statistical optimization. Examples of this operation in various dat…

cs.AI201259 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.AI201269 cited

Strong Faithfulness and Uniform Consistency in Causal Inference

Jiji Zhang, Peter L. Spirtes

A fundamental question in causal inference is whether it is possible to reliably infer manipulation effects from observational data. There are a variety of senses of asymptotic rel…

cs.AI2012153 cited

Decentralized Sensor Fusion With Distributed Particle Filters

Matthew Rosencrantz, Geoffrey Gordon, Sebastian Thrun

This paper presents a scalable Bayesian technique for decentralized state estimation from multiple platforms in dynamic environments. As has long been recognized, centralized archi…

cs.AI201235 cited

A Maximum Likelihood Approach For Selecting Sets of Alternatives

Ariel D. Procaccia, Sashank J. Reddi, Nisarg Shah

We consider the problem of selecting a subset of alternatives given noisy evaluations of the relative strength of different alternatives. We wish to select a k-subset (for a given…