批量生成函数注释

这个提交包含在:
Your Name
2023-03-24 16:14:25 +08:00
父节点 32f36a609e
当前提交 77408f795e
共有 20 个文件被更改,包括 1744 次插入2 次删除

查看文件

@@ -0,0 +1,9 @@
"In practice, we found that a high-entropy initial state is more likely to increase the speed of training.
The entropy is calculated by:
$$H=-\sum_{k= 1}^{n_k} p(k) \cdot \log p(k), p(k)=\frac{|A_k|}{|\mathcal{A}|}$$
where $H$ is the entropy, $|A_k|$ is the number of agent nodes in $k$-th cluster, $|\mathcal{A}|$ is the total number of agents.
To ensure the Cooperation Graph initialization has higher entropy,
we will randomly generate multiple initial states,
rank by their entropy and then pick the one with maximum $H$."