I gave a chat, entitled "Explainability as being a provider", at the above mentioned party that discussed expectations with regards to explainable AI And just how can be enabled in applications.
Weighted model counting generally assumes that weights are only specified on literals, frequently necessitating the necessity to introduce auxillary variables. We contemplate a new technique based on psuedo-Boolean features, bringing about a more normal definition. Empirically, we also get SOTA outcomes.
The Lab carries out analysis in synthetic intelligence, by unifying Discovering and logic, having a modern emphasis on explainability
The paper discusses the epistemic formalisation of generalised setting up during the existence of noisy performing and sensing.
Gave a talk this Monday in Edinburgh to the ideas & observe of device learning, masking motivations & insights from our survey paper. Essential concerns lifted integrated, ways to: extract intelligible explanations + modify the design to suit altering requires.
I’ll be supplying a chat in the conference on reasonable and dependable AI in the cyber physical methods session. Because of Ram & Christian to the invitation. Backlink to party.
We have now a different paper approved on Mastering best linear programming aims. We just take an “implicit“ hypothesis construction approach that yields nice theoretical bounds. Congrats to Gini and Alex on getting this paper recognized. Preprint below.
A journal paper has long been acknowledged on prior constraints in tractable probabilistic models, readily available within the papers tab. Congratulations Giannis!
A recent collaboration Together with the NatWest Team on explainable machine Understanding is reviewed within the Scotsman. Url to posting right here. A preprint on the outcome are going to be produced offered Soon.
Along with colleagues from Edinburgh and Herriot Watt, Now we have set out the demand a whole new investigation agenda.
Paulius' Focus on algorithmic strategies for randomly generating logic programs and probabilistic logic programs has been recognized to the concepts and practise of constraint programming (CP2020).
The framework is relevant to a sizable course of formalisms, such as probabilistic relational styles. The paper also scientific studies the synthesis problem in that context. Preprint listed here.
If you are attending AAAI this year, you could possibly have an interest in trying https://vaishakbelle.com/ out our papers that touch on fairness, abstraction and generalized sum-merchandise difficulties.
Our paper on synthesizing strategies with loops while in the presence of probabilistic sounds, recognized the journal of approximate reasoning, has also been recognized to your ICAPS journal observe. Preprint to the total paper right here.