I gave a chat, entitled "Explainability for a provider", at the above mentioned occasion that talked over expectations concerning explainable AI And just how could be enabled in programs.
Keen on synthesizing the semantics of programming languages? We have a brand new paper on that, acknowledged at OOPSLA.
The Lab carries out investigation in artificial intelligence, by unifying Mastering and logic, using a current emphasis on explainability
When you are attending NeurIPS this yr, you may be interested in testing our papers that touch on morality, causality, and interpretability. Preprints can be found over the workshop webpage.
An report on the preparing and inference workshop at AAAI-eighteen compares two unique methods for probabilistic planning through probabilistic programming.
I gave a chat on our current NeurIPS paper in Glasgow while also masking other methods at the intersection of logic, Mastering and tractability. Because of Oana for the invitation.
The issue we tackle is how the learning needs to be outlined when There exists missing or incomplete knowledge, bringing about an account based on imprecise probabilities. Preprint here.
A journal paper has long been accepted on prior constraints in tractable probabilistic designs, accessible on the papers tab. Congratulations Giannis!
A recent collaboration Along with the NatWest Group on explainable equipment Understanding is discussed while in the Scotsman. Hyperlink to posting right here. A preprint on the effects is going to be made readily available shortly.
Jonathan’s paper considers a lifted approached to weighted product integration, such as circuit development. Paulius’ paper develops a evaluate-theoretic standpoint on weighted model counting and proposes a way to encode conditional weights on literals analogously to conditional probabilities, which ends up in major overall performance improvements.
Paulius' Focus on algorithmic tactics for randomly making logic systems and probabilistic logic systems has actually been acknowledged for the https://vaishakbelle.com/ principles and practise of constraint programming (CP2020).
The framework is relevant to a sizable course of formalisms, such as probabilistic relational styles. The paper also research the synthesis trouble in that context. Preprint right here.
If you are attending AAAI this year, you could be interested in looking at our papers that touch on fairness, abstraction and generalized sum-solution troubles.
Our paper on synthesizing strategies with loops from the existence of probabilistic sound, acknowledged the journal of approximate reasoning, has also been accepted to the ICAPS journal track. Preprint to the full paper here.