Drew, Dave, Larissa And that i had the opportunity to explore the motivatons and foundations for instigating The brand new study concept of Experiential AI inside of a 90 minute discuss.
Thinking about synthesizing the semantics of programming languages? We now have a different paper on that, recognized at OOPSLA.
The paper tackles unsupervised method induction above blended discrete-constant information, and is particularly approved at ILP.
If you are attending NeurIPS this 12 months, you might have an interest in checking out our papers that touch on morality, causality, and interpretability. Preprints are available within the workshop page.
We evaluate the question of how generalized plans (ideas with loops) may be deemed correct in unbounded and continuous domains.
A consortia task on reliable units and goverance was acknowledged late past yr. Information hyperlink in this article.
Keen on schooling neural networks with sensible constraints? Now we have a completely new paper that aims to full gratification of Boolean and linear arithmetic constraints on schooling at AAAI-2022. Congrats to Nick and Rafael!
The posting introduces a normal rational framework for reasoning about discrete and steady probabilistic models in dynamical domains.
We study arranging in relational Markov decision processes involving discrete and continual states and actions, and an unfamiliar range of objects (through probabilistic programming).
Along with colleagues from Edinburgh and Herriot Watt, we have put out the call for a fresh exploration agenda.
Paulius' Focus on algorithmic techniques for randomly creating logic plans and probabilistic logic plans is acknowledged towards the principles and practise of constraint programming (CP2020).
The paper discusses how to manage nested features and quantification in relational probabilistic graphical models.
I https://vaishakbelle.com/ gave an invited tutorial the Tub CDT Artwork-AI. I included present developments and foreseeable future tendencies on explainable equipment learning.
Meeting backlink Our work on symbolically interpreting variational autoencoders, as well as a new learnability for SMT (satisfiability modulo idea) formulas got recognized at ECAI.