I gave a chat, entitled "Explainability as being a company", at the above mentioned event that reviewed anticipations with regards to explainable AI And exactly how could possibly be enabled in purposes.
Last week, I gave a chat in the pint of science on automated methods and their impact, referring to the subjects of fairness and blameworthiness.
I gave a talk entitled "Views on Explainable AI," at an interdisciplinary workshop concentrating on creating believe in in AI.
I attended the SML workshop during the Black Forest, and discussed the connections between explainable AI and statistical relational Finding out.
An post at the scheduling and inference workshop at AAAI-eighteen compares two unique methods for probabilistic planning through probabilistic programming.
I gave a chat on our modern NeurIPS paper in Glasgow although also covering other techniques with the intersection of logic, Understanding and tractability. Thanks to Oana with the invitation.
We've a whole new paper recognized on Studying ideal linear programming aims. We take an “implicit“ hypothesis building technique that yields nice theoretical bounds. Congrats to Gini and Alex on receiving this paper recognized. Preprint here.
A journal paper continues to be accepted on prior constraints in tractable probabilistic models, available on the papers tab. Congratulations Giannis!
A modern collaboration With all the NatWest Team on explainable device Understanding is discussed from the Scotsman. Backlink to write-up here. A preprint on the final results will likely be made available shortly.
Jonathan’s paper considers a lifted approached to weighted product integration, which includes circuit design. Paulius’ paper develops a measure-theoretic viewpoint on weighted design counting and proposes a means to encode conditional weights on literals analogously to conditional probabilities, which leads to considerable performance improvements.
Paulius' Focus on algorithmic approaches for randomly creating logic packages and probabilistic logic packages has actually been approved on the rules and practise of constraint programming (CP2020).
The framework https://vaishakbelle.com/ is relevant to a big course of formalisms, which include probabilistic relational designs. The paper also studies the synthesis challenge in that context. Preprint listed here.
Our work on synthesizing strategies with loops from the existence of sounds will appear within the Worldwide journal of approximate reasoning.
Our paper on synthesizing strategies with loops while in the existence of probabilistic sound, accepted the journal of approximate reasoning, has also been accepted to the ICAPS journal track. Preprint to the full paper here.