Drew, Dave, Larissa And that i experienced the chance to go over the motivatons and foundations for instigating The brand new research theme of Experiential AI in the ninety moment speak.
Previous week, I gave a talk on the pint of science on automated programs and their affect, concerning the matters of fairness and blameworthiness.
The paper tackles unsupervised program induction around blended discrete-constant data, which is acknowledged at ILP.
I attended the SML workshop in the Black Forest, and discussed the connections between explainable AI and statistical relational Mastering.
An report on the preparing and inference workshop at AAAI-eighteen compares two unique methods for probabilistic preparing through probabilistic programming.
I gave a chat on our latest NeurIPS paper in Glasgow whilst also masking other ways on the intersection of logic, learning and tractability. Owing to Oana to the invitation.
The situation 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.
A journal paper continues to be accepted on prior constraints in tractable probabilistic products, out there to the papers tab. Congratulations Giannis!
Link In the final week of October, I gave https://vaishakbelle.com/ a chat informally talking about explainability and moral accountability in artificial intelligence. Thanks to the organizers with the invitation.
Jonathan’s paper considers a lifted approached to weighted model integration, which include circuit construction. Paulius’ paper develops a measure-theoretic standpoint on weighted model counting and proposes a method to encode conditional weights on literals analogously to conditional probabilities, which results in important general performance enhancements.
Paulius' Focus on algorithmic strategies for randomly generating logic applications and probabilistic logic plans has become recognized for the rules and practise of constraint programming (CP2020).
The framework is relevant to a large course of formalisms, which include probabilistic relational designs. The paper also studies the synthesis trouble in that context. Preprint here.
If you are attending AAAI this year, you could possibly have an interest in testing our papers that touch on fairness, abstraction and generalized sum-solution challenges.
Our paper on synthesizing designs with loops in the existence of probabilistic sounds, recognized the journal of approximate reasoning, has also been recognized into the ICAPS journal keep track of. Preprint to the entire paper in this article.