- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies adaptation of deployed heterogeneous multi-agent satellite tasking policies when mission reward priorities change. It proposes DRS-LoRA on top of HAPPO. A shared adapter rank budget is allocated across agents using the mean squared agent-specific advantage signal. Within each adapted layer, singular value decomposition of the adapter-induced output drift ranks directions for retention; adapters are reprojected and resized periodically, with fresh directions added when capacity is available. A volatility-based coefficient also scales parameter updates. Adapters are merged into the base policy after adaptation. Evaluation uses a simulated four-satellite constellation in Basilisk/BSK-RL, with policy inference and adaptation performed on a Jetson Orin Nano. Across ten reward-weight transfers, Table 1 reports an average completion rate of 37.4% using 13.7% trainable parameters, compared with 40.6% for full fine-tuning. This corresponds to 92.1% of the reference completion rate. The appendix establishes optimal reconstruction of the current batch's single-layer output drift under a rank constraint; it does not establish a corresponding bound on policy return.
Critical strengths
- A concrete and useful adaptation problem. Updating satellite tasking policies between ground-contact opportunities is a meaningful motivation for parameter-efficient reinforcement learning. The combination of a heterogeneous constellation simulator and execution on an edge device gives the work a practical evaluation setting.
- A promising empirical trade-off with a principled local compression rule. In Table 1, DRS-LoRA at 13.7% trainable parameters achieves 37.4% average completion, versus 40.6% for full fine-tuning and 35.7% for the Fisher-ranked adapter at the same parameter percentage. Its reported mean exceeds all listed onboard baselines on each transfer at sparsity 0.5. The output-drift projection has a valid batchwise reconstruction interpretation, and physically shrinking adapter tensors can reduce their gradient and optimizer-state storage. These observations support further investigation, although statistical reliability and total device savings remain insufficiently established.
Critical weaknesses
- The experimental evidence does not yet establish reliable adaptation to the specified target objective. For the Balanced-to-(1.0, 0.0) transfer, Table 1 gives DRS-LoRA completion of 37.3 +/- 4.0, whereas Table 2 gives 38.0 +/- 4.0; the Balanced average changes from 37.3 to 37.5. Using Table 1's per-target values and Table 2's zero-shot values gives aggregate gap recovery of approximately 81.4%, rather than the reported 82.7%. The two tables also use differently named LoRA baselines without explaining their relationship. More fundamentally, completion rate does not directly measure the reward-weighted mission objective: capturing more low-priority or low-utility targets can increase completion without improving target return. Equation (1), the appendix reward in Equation (19), and the resource-randomization description need reconciliation. Missing seed counts, a definition of the reported variability, and essential training settings prevent a reliable assessment of the 1.7 percentage-point gain over Fisher ranking. These issues materially weaken the main empirical claim.
- The incremental contribution and resource-constrained feasibility are not sufficiently isolated. E2-LoRA already develops output-drift spectral ordering, adapter transformation, and rank truncation, while LoRASA already applies low-rank adapters to multi-agent policies. The potentially distinctive parts here are online reallocation across agents, repeated truncation during policy training, and the pacing rule, but the paper lacks component ablations and a same-budget ordinary LoRA or directly adapted E2-LoRA comparison. It also does not establish why the squared reweighted HAPPO signal predicts the marginal value of additional rank. Although device figures are reported, there is no complete comparative measurement of peak training memory, adaptation time, energy, or SVD/reallocation overhead. Initial rank-16 adapters and rebuilding tensors may have higher peak costs than the final parameter percentage suggests. Unspecified handling of zero ranks, rank caps, newly added directions, Adam state after reparameterization, and the Algorithm 1 merge scale further obscures the implemented method. These gaps prevent attributing the reported gains and verifying operation within the claimed budget.
Questions for authors
- Which DRS-LoRA results are authoritative for the Balanced source: Table 1 or Table 2? Please explain the 37.3 versus 38.0 discrepancy, identify any differing settings, and reconcile the gap-recovery calculation. Are non-uniform LoRA in Table 1 and Vanilla LoRA in Table 2 different implementations? What are the seed count and meaning of +/-?
- What exact reward and source/target sampling distributions were used in the experiments? How do Equation (1), Equation (19), and the resource-randomization description correspond? Are weighted target returns and their priority/cloud components available alongside completion rate, and do they preserve the reported method ordering?
- How is the allocation advantage estimated, normalized, and ordered within HAPPO? How are zero-energy denominators, zero ranks, rank caps, and unused rounded budget handled? Are all fresh directions trained? Please reconcile the retained-set update and merge in Algorithm 1 with Equations (8)-(9), and specify how Adam moments are handled after reprojection.
- What evidence separates the effects of cross-agent allocation, dynamic output-drift ranking, and trust-adaptive pacing? Are results available for equal-budget fixed-rank LoRA, uniform allocation, and removal of the pacing or reranking component, or for a directly adapted E2-LoRA baseline? Please also provide the network dimensions and full optimization/reallocation settings.
- What are the measured peak training memory, wall-clock adaptation time, and energy per adaptation window on the Jetson, including initialization, SVD, and tensor rebuilding? How is centralized critic or cross-agent information obtained in the intended deployment? Given identical network shapes after merging, what explains the reported 10.4% inference-latency improvement over Full FT?