Category Archives: Activity




This is a summary of the group meetings on 7 April, 2021

L*- Based Learning of Markov Decision Processes

They provide two algorithms to learn a given black-box Markov decision processes based on Angluin’s L* algorithm. They are exact learning and sample-based learning, respectively.

Q: What is for unambiguous?
A: The compatibility relation is not an equivalence relation, and a state may belong to more than one classes, which we call an ambiguous state, so for an unambiguous state, there is only one class whose representation is compatible with it.

Q: How to check equivalence in exact learning?
A: First it checks whether the hypothesis is isomophic to the model. If so, we only need finitely many output distribution queries to determine all the transition probabilities.

Q: Is there a quantitative description of the convergence?
A: Not yet in the paper. In the paper it only gives a convergence description based on Borel-Cantelli Lemma. It is interesting to consider its PAC guarantee description.

Q: Can MDP learning used for model checking and other field in software engineering?
A: There are some experiments in the paper. We need more investigation on this part.


This is a summary of the group meetings on 24 March, 2021

Efficient Certification of Spatial Robustness

这篇文章提出了一种计算范数约束向量场攻击的紧区间界限的新方法,使神经网络能够对向量场攻击进行验证。 首先是对每个像素的变换计算一个很紧的区间界,然后提出一个方法用线性平面去拟合这个上界和下界,也就是用线性平面计算它的凸松弛。并且展示了如何通过flow constraints来提供一个更紧的凸松弛。这种方法可以收紧对光滑向量场的松弛,并且可以和目前主流的鲁棒性验证器集成。


  1. 在二范数的情况下,如何通过平面去约束球体呢?


  1. 这个向量场攻击有什么实际意义吗?


  1. 文章有说可以解决什么样的流约束吗?或者这个流约束是怎么定义的?