No canal da Inteligência Artificial - Nova temporada de desgrenhados e empertigados

RESUMO O estudo de Inteligência Artificial (IA) tem sido perseguido, desde seu início, segundo dois estilos diferentes, jocosamente referidos como scruffy (desgrenhado) e neat (empertigado). Esses estilos na verdade refletem distintas visões sobre a disciplina e seus objetivos. Neste artigo revisamos a tensão entre desgrenhados e empertigados ao longo da história da IA. Analisamos o impacto do atual desempenho de métodos de aprendizado profundo nesse debate, sugerindo que o desenvolvimento de arquiteturas computacionais amplas é um caminho particularmente promissor para a IA

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm

AbstractA credal network is a graphical representation for a set of joint probability distributions. In this paper we discuss algorithms for exact and approximate inferences in credal networks. We propose a branch-and-bound framework for inference, and focus on inferences for polytree-shaped networks. We also propose a new algorithm, A/R+, for outer approximations in polytree-shaped credal networks

Interpreting Embedding Models of Knowledge Bases: A Pedagogical Approach

Knowledge bases are employed in a variety of applications from natural language processing to semantic web search; alas, in practice their usefulness is hurt by their incompleteness. Embedding models attain state-of-the-art accuracy in knowledge base completion, but their predictions are notoriously hard to interpret. In this paper, we adapt "pedagogical approaches" (from the literature on neural networks) so as to interpret embedding models by extracting weighted Horn rules from them. We show how pedagogical approaches have to be adapted to take upon the large-scale relational aspects of knowledge bases and show experimentally their strengths and weaknesses.Comment: presented at 2018 ICML Workshop on Human Interpretability in Machine Learning (WHI 2018), Stockholm, Swede