activity
20112020
most citedSum-Product Networks: A New Deep Architecture

376 citations · 1.1k across the 17 of their papers we have counts for

collaborators

18 papers

cs.LG2020★ 49 cited

Every Model Learned by Gradient Descent Is Approximately a Kernel Machine

Pedro Domingos

Deep learning's successes are often attributed to its ability to automatically discover new representations of the data, rather than relying on handcrafted features like other lear…

cs.RO2020★ 9 cited

Amodal 3D Reconstruction for Robotic Manipulation via Stability and Connectivity

William Agnew, Christopher Xie, Aaron Walsman +4

Learning-based 3D object reconstruction enables single- or few-shot estimation of 3D object models. For robotics, this holds the potential to allow model-based methods to rapidly a…

cs.LG2020

Relevance-Guided Modeling of Object Dynamics for Reinforcement Learning

William Agnew, Pedro Domingos

Current deep reinforcement learning (RL) approaches incorporate minimal prior knowledge about the environment, limiting computational and sample efficiency. \textit{Objects} provid…

cs.AI2017★ 241 cited

Neural-Symbolic Learning and Reasoning: A Survey and Interpretation

Tarek R. Besold, Artur d'Avila Garcez, Sebastian Bader +11

The study and understanding of human behaviour is relevant to computer science, artificial intelligence, neural computation, cognitive science, philosophy, psychology, and several…

cs.LG2017★ 17 cited

Deep Learning as a Mixed Convex-Combinatorial Optimization Problem

Abram L. Friesen, Pedro Domingos

As neural networks grow deeper and wider, learning networks with hard-threshold activations is becoming increasingly important, both for network quantization, which can drastically…

cs.LG2016★ 8 cited

The Sum-Product Theorem: A Foundation for Learning Tractable Models

Abram L. Friesen, Pedro Domingos

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep…

cs.AI2016★ 26 cited

Recursive Decomposition for Nonconvex Optimization

Abram L. Friesen, Pedro Domingos

Continuous optimization is an important problem in many areas of AI, including vision, robotics, probabilistic inference, and machine learning. Unfortunately, most real-world optim…

cs.AI2016

On the Latent Variable Interpretation in Sum-Product Networks

Robert Peharz, Robert Gens, Franz Pernkopf +1

One of the central themes in Sum-Product networks (SPNs) is the interpretation of sum nodes as marginalized latent variables (LVs). This interpretation yields an increased syntacti…

cs.SE2015

Learning Tractable Probabilistic Models for Fault Localization

Aniruddh Nath, Pedro Domingos

In recent years, several probabilistic techniques have been applied to various debugging problems. However, most existing probabilistic debugging systems use relatively simple stat…

cs.LG2014★ 12 cited

Exchangeable Variable Models

Mathias Niepert, Pedro Domingos

A sequence of random variables is exchangeable if its joint distribution is invariant under variable permutations. We introduce exchangeable variable models (EVMs) as a novel class…

cs.AI2013★ 4 cited

Structured Message Passing

Vibhav Gogate, Pedro Domingos

In this paper, we present structured message passing (SMP), a unifying framework for approximate inference algorithms that take advantage of structured representations such as alge…

cs.AI2012★ 50 cited

Markov Logic in Infinite Domains

Parag Singla, Pedro Domingos

Combining first-order logic and probability has long been a goal of AI. Markov logic (Richardson & Domingos, 2006) accomplishes this by attaching weights to first-order formulas an…

cs.AI2012★ 73 cited

Learning Arithmetic Circuits

Daniel Lowd, Pedro Domingos

Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, bec…

cs.AI2012★ 27 cited

Formula-Based Probabilistic Inference

Vibhav Gogate, Pedro Domingos

Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. S…

cs.LG2012★ 376 cited

Sum-Product Networks: A New Deep Architecture

Hoifung Poon, Pedro Domingos

The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are general conditions under which the…

cs.AI2012★ 135 cited

Probabilistic Theorem Proving

Vibhav Gogate, Pedro Domingos

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower…

cs.AI2012★ 9 cited

Approximation by Quantization

Vibhav Gogate, Pedro Domingos

Inference in graphical models consists of repeatedly multiplying and summing out potentials. It is generally intractable because the derived potentials obtained in this way can be…

cs.AI2011★ 45 cited

Relational Dynamic Bayesian Networks

P. Domingos, S. Sanghai, D. Weld

Stochastic processes that involve the creation of objects and relations over time are widespread, but relatively poorly studied. For example, accurate fault diagnosis in factory as…