A semantic loss function for deep learning with symbolic knowledge

J Xu, Z Zhang, T Friedman, Y Liang… - … on machine learning, 2018 - proceedings.mlr.press
This paper develops a novel methodology for using symbolic knowledge in deep learning.
From first principles, we derive a semantic loss function that bridges between neural output …

[PDF][PDF] Probabilistic sentential decision diagrams

D Kisa, G Van den Broeck, A Choi… - … Conference on the …, 2014 - cdn.aaai.org
Abstract We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and
canonical representation of probability distributions defined over the models of a given …

SampleSearch: Importance sampling in presence of determinism

V Gogate, R Dechter - Artificial Intelligence, 2011 - Elsevier
The paper focuses on developing effective importance sampling algorithms for mixed
probabilistic and deterministic graphical models. The use of importance sampling in such …

[PDF][PDF] Tractable learning for structured probability spaces: A case study in learning preference distributions

A Choi, G Van den Broeck, A Darwiche - Twenty-Fourth International Joint …, 2015 - ijcai.org
Probabilistic sentential decision diagrams (PSDDs) are a tractable representation of
structured probability spaces, which are characterized by complex logical constraints on …

Probabilistic inference modulo theories

RDS Braz, C O'Reilly, V Gogate, R Dechter - arXiv preprint arXiv …, 2016 - arxiv.org
We present SGDPLL (T), an algorithm that solves (among many other problems)
probabilistic inference modulo theories, that is, inference problems over probabilistic models …

[PDF][PDF] Saul: Towards declarative learning based programming

P Kordjamshidi, D Roth, H Wu - 2015 AAAI Fall Symposium Series, 2015 - cdn.aaai.org
We present Saul, a new probabilistic programming language designed to address some of
the shortcomings of programming languages that aim at advancing and simplifying the …

Combining perception and knowledge processing for everyday manipulation

D Pangercic, M Tenorth, D Jain… - 2010 IEEE/RSJ …, 2010 - ieeexplore.ieee.org
This paper describes and discusses the K-COPMAN (Knowledge-enabled Cognitive
Perception for Manipulation) system, which enables autonomous robots to generate …

Combining stochastic constraint optimization and probabilistic programming: from knowledge compilation to constraint solving

ALD Latour, B Babaki, A Dries, A Kimmig… - Principles and Practice …, 2017 - Springer
We show that a number of problems in Artificial Intelligence can be seen as Stochastic
Constraint Optimization Problems (SCOPs): problems that have both a stochastic and a …

Surrogate Bayesian Networks for Approximating Evolutionary Games

V Hsiao, DS Nau, B Pezeshki… - … Conference on Artificial …, 2024 - proceedings.mlr.press
Spatial evolutionary games are used to model large systems of interacting agents. In earlier
work, a method was developed using Bayesian Networks to approximate the population …

Towards performing everyday manipulation activities

M Beetz, D Jain, L Mösenlechner, M Tenorth - Robotics and Autonomous …, 2010 - Elsevier
This article investigates fundamental issues in scaling autonomous personal robots towards
open-ended sets of everyday manipulation tasks which involve high complexity and vague …