To promote better performance-bandwidth trade-off for multi-agent perception, weproposeanovel distilledcollaborationgraph (DiscoGraph)tomodeltrainable, pose-aware, and adaptive collaboration among agents. Our key novelties lie in twoaspects.

We derive a tighter inequality than Cauchy-Schwarz Inequality, leverage it to refine Pearson's

Let = argm 2 CF ( )denote (2). T ( )+ log ( 1/ )+( 1) log ( 1/ ) log ( ) 1 , (5) where ( )isthe RDPof 2. Convergence:IfwerunAcldpwith t = DGpt, whereG2 = max{d1 Substitutingtheboundon4 into Lemma 2 together manipulationgivesproves Theorem 1; see Appendix E.2 fordetails.

Lemma A.2. Algorithm ϕ gives a lower bound on the query γ . That is, ϕ (x, R) γ (x, R).