Drew, Dave, Larissa and I had the chance to discuss the motivatons and foundations for instigating the new exploration topic of Experiential AI inside a 90 minute converse.
Keen on synthesizing the semantics of programming languages? We have a fresh paper on that, acknowledged at OOPSLA.
The paper tackles unsupervised application induction about mixed discrete-ongoing knowledge, and it is accepted at ILP.
The paper discusses the epistemic formalisation of generalised planning from the presence of noisy acting and sensing.
We think about the issue of how generalized strategies (options with loops) is usually considered correct in unbounded and continuous domains.
I’ll be giving a talk within the conference on good and accountable AI within the cyber Bodily systems session. As a result of Ram & Christian for your invitation. Link to party.
Now we have a fresh paper recognized on Understanding exceptional linear programming objectives. We acquire an “implicit“ speculation construction technique that yields awesome theoretical bounds. Congrats to Gini and Alex on acquiring this paper recognized. Preprint right here.
A journal paper is acknowledged on prior constraints in tractable probabilistic versions, obtainable within the https://vaishakbelle.com/ papers tab. Congratulations Giannis!
Link In the final week of October, I gave a chat informally talking about explainability and moral accountability in artificial intelligence. Thanks to the organizers for the invitation.
Jonathan’s paper considers a lifted approached to weighted product integration, which includes circuit design. Paulius’ paper develops a measure-theoretic point of view on weighted model counting and proposes a method to encode conditional weights on literals analogously to conditional probabilities, which results in substantial general performance improvements.
With the University of Edinburgh, he directs a investigate lab on synthetic intelligence, specialising inside the unification of logic and machine Discovering, by using a latest emphasis on explainability and ethics.
The framework is relevant to a sizable course of formalisms, such as probabilistic relational products. The paper also scientific studies the synthesis problem in that context. Preprint below.
If you are attending AAAI this year, you could possibly have an interest in trying out our papers that touch on fairness, abstraction and generalized sum-merchandise challenges.
Our paper on synthesizing plans with loops in the presence of probabilistic sounds, approved the journal of approximate reasoning, has also been approved to your ICAPS journal observe. Preprint to the complete paper below.