- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes a decentralized lifelong-adaptive collaborative learning framework based on numerical optimization and algorithm unrolling. Experiments on image classification tasks and multi-robot mapping tasks show that the proposed method achieves superior performance compared with several collaborative learning approaches.
Critical strengths
- The proposed method is well‑motivated and addresses an important challenge for decentralized lifelong‑adaptive multi‑agent collaboration.
- The study appears to be theoretically sound.
Critical weaknesses
-
Collaboration weights are determined based on pairwise model‑parameter similarity. However, parameter similarity may not indicate beneficial collaboration, especially in early training phases. Additionally, Section 2 is hard to follow. Many symbols are used before being formally defined when presenting the optimization problem, and the motivation for each term in the objective function is insufficiently explained. Readability would be improved if all notations were defined first and the rationale of each component articulated prior to introducing the full optimization formulation.
-
The baselines are relatively outdated, and the evaluation tasks seems to be simple with small scale and little agents. More challenging scenarios, such as larger-scale datasets, systems with more agents or unseen task, would better demonstrate the method's effectiveness in complex collaborative settings. Moreover, the method lacks evaluation on communication efficiency.
Questions for authors
- What types of tasks is the parameter-similarity-based partner selection mainly suited for?
- Could you provide results or analysis comparing against more recent approaches?
- How does DeLAMA improve communication efficiency compared with existing methods?