Organizations: School of New Media and Communication, Tianjin University, Tianjin, China · School of Computer Science and Engineering, University of New South Wales, Sydney, Australia · School of Sports Training, Tianjin University of Sport, Tianjin, China · School of Artificial Intelligence, Tianjin University, Tianjin, China · School of Automation, Southeast University, Nanjing, China · School of Computer Science and Technology, Tianjin University, Tianjin, China · Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China · School of Electronic Science, National University of Defense Technology, Hunan, China
Object detection knowledge is fragmented across independently trained, heterogeneous detectors with complementary category supports. In socialized learning, this knowledge resides in a society, and learning aims to evolve the society collectively through exchange. However, aggregation-based socialization does not explicitly plan transfer order, whereas progressive multi-teacher distillation considers order but remains a one-way student enhancement in a shared category space. Building on Socialized Learning, we formulate Socialized Detector Learning (SDL) for heterogeneous, category-specialized object detectors and propose Trajectory-Guided and Reciprocal Distillation (TGRD).TGRD estimates directed operational Inter-Detector Transfer Difficulty (IDTD) from held-out feature-alignment residuals, precomputes a fixed score table, and greedily constructs a carrier trajectory. Along the trajectory, knowledge is progressively consolidated into a union-category carrier and then returned to experts through reciprocal transfer. A conditional proxy-certificate analysis shows that, under stated assumptions, the progressive certificate is no larger than an aggregated-target counterpart. On MS COCO with four heterogeneous experts and two carrier initializations, final carriers outperform epoch-matched simultaneous aggregation controls by 2.6 AP in both settings. Reciprocal detectors attain 20.8--28.4 AP on previously unsupported categories while remaining within 1.3 AP of original expert-specific performance. These results support order-aware progressive consolidation followed by reciprocal transfer as a viable mechanism for detector-society evolution.
Figures & tables
Figure 1: Detector-society evolution under SDL. TGRD progressively consolidates complementary expertise and reciprocally transfers it back, broadening category coverage while preserving specialization.
Figure 2: Compatibility-guided carrier trajectory planning. Held-out alignment residuals define a fixed table of directed operational scores D(A,B) over ordered anchor–candidate pairs, from which greedy selection determines the expert order and carrier trajectory.
Figure 3: Progressive and reciprocal knowledge transfer in TGRD. Left: Along the planned trajectory, experts transfer knowledge via AFD to a carrier whose prediction head expands over accumulated categories, yielding SK . Right: A reciprocal detector initialized from each expert is guided by the corresponding frozen original expert and the frozen SK ; the updated detectors form T(r+1) .
(a) Operational IDTD scores D(ak−1,ti)
Candidate next expert ti
Planning anchor ak−1
t1
t2
t3
t4
S0 (RetinaNet)
0.5463
1.2115
0.5588
0.6411
S0 (Faster R-CNN)
0.5148
1.1658
0.2318
0.5473
t1 (RetinaNet)
–
1.1792
0.5514
0.4862
t2 (FCOS)
1.1392
–
1.0478
1.1748
Table 1: Operational IDTD scores and fixed-table greedy trajectories under two carrier initializations. Detector architectures are given in parentheses; all configurations use R50–FPN.
Carrier state / control
AP
APC0
APΔκ1
APΔκ2
APΔκ3
APΔκ4
(a) RetinaNet as initial carrier S0
S0
37.3
37.3
–
–
–
–
S1[t1]
35.9
39.2
22.8
–
–
–
S2[t1,t4]
35.1
40.5
22.6
26.4
–
–
S3[t1,t4,t3]
34.5
39.6
19.8
39.4
24.1
–
S4[t1,t4,t3,t2]
32.8
39.5
21.0
22.2
38.7
22.0
Table 2: Stage-wise carrier performance from S0 along two fixed-table trajectories versus simultaneous aggregation (Avg-FPN KD). Overall AP is evaluated on Kk for Sk and on C∪ for the control, with K0=C0 . APΔκj denotes AP over the categories introduced by tπ(j) that are absent from Kj−1 ; control columns follow the same trajectory-specific order. Brackets list the incorporated experts.
Initial support Ci
Expert-specific support Ci∖C0
Knowledge expansion
Expert
Original
Reciprocal
Δ
Original
Reciprocal
Δ
APC∪∖Ci
APC∪
(a) Final RetinaNet carrier S4
t1
35.5
35.9
+0.4
22.5
22.3
−0.2
25.8
32.1
t2
40.0
39.2
−0.8
31.7
30.6
−1.1
25.6
34.1
t3
39.8
40.1
+0.3
40.2
40.7
+0.5
23.2
33.7
t4
38.8
38.9
+0.1
26.5
27.8
+1.3
28.4
35.0
Table 3: Expert retention and knowledge expansion after reciprocal updates jointly guided by the original experts and final (a) RetinaNet or (b) Faster R-CNN carriers. Δ denotes the reciprocal-minus-original AP change.
State Key Laboratory of Integrated Services Networks, School of Telecommunications Engineering, Xidian University, Xi’an, China · School of Electronic Engineering, Xidian University, Xi’an, China