Zobrazeno 1 - 10
of 276
pro vyhledávání: '"ARENAS, MARCELO"'
Probabilistic circuits (PCs) is a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits. Existing m
Externí odkaz:
http://arxiv.org/abs/2411.12256
The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this subset is t
Externí odkaz:
http://arxiv.org/abs/2408.01657
Autor:
Amarilli, Antoine, Arenas, Marcelo, Choi, YooJung, Monet, Mikaël, Broeck, Guy Van den, Wang, Benjie
This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of their variants studied in the setting of knowledge compilation. Last,
Externí odkaz:
http://arxiv.org/abs/2404.09674
The formal XAI community has studied a plethora of interpretability queries aiming to understand the classifications made by decision trees. However, a more uniform understanding of what questions we can hope to answer about these models, traditional
Externí odkaz:
http://arxiv.org/abs/2310.11636
Formal XAI (explainable AI) is a growing area that focuses on computing explanations with mathematical guarantees for the decisions made by ML models. Inside formal XAI, one of the most studied cases is that of explaining the choices taken by decisio
Externí odkaz:
http://arxiv.org/abs/2207.12213