Drew, Dave, Larissa and I experienced the chance to discuss the motivatons and foundations for instigating the new exploration topic of Experiential AI within a 90 moment communicate.
I are going to be supplying a tutorial on logic and learning with a concentrate on infinite domains at this year's SUM. Hyperlink to event here.
Will be Talking on the AIUK event on concepts and follow of interpretability in machine Discovering.
I attended the SML workshop inside the Black Forest, and mentioned the connections among explainable AI and statistical relational learning.
An short article with the organizing and inference workshop at AAAI-18 compares two distinctive techniques for probabilistic organizing by way of probabilistic programming.
I gave a chat on our new NeurIPS paper in Glasgow although also covering other techniques on the intersection of logic, Studying and tractability. Owing to Oana to the invitation.
The condition we deal with is how the training should be defined when There is certainly missing or incomplete info, resulting in an account determined by imprecise probabilities. Preprint below.
The posting introduces a normal rational framework for reasoning about discrete and continuous probabilistic products in dynamical domains.
A latest collaboration with the NatWest Team on explainable machine Discovering is talked about within the Scotsman. Backlink to write-up in this https://vaishakbelle.com/ article. A preprint on the outcome will be designed accessible Soon.
Along with colleagues from Edinburgh and Herriot Watt, we have put out the call for a different investigate agenda.
Paulius' work on algorithmic strategies for randomly generating logic programs and probabilistic logic programs has been recognized to your rules and practise of constraint programming (CP2020).
The framework is applicable to a significant class of formalisms, together with probabilistic relational types. The paper also research the synthesis trouble in that context. Preprint listed here.
In case you are attending AAAI this 12 months, it's possible you'll have an interest in testing our papers that contact on fairness, abstraction and generalized sum-product issues.
Our paper on synthesizing options with loops from the existence of probabilistic sound, acknowledged the journal of approximate reasoning, has also been acknowledged for the ICAPS journal track. Preprint to the full paper here.