- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
PONIX uses frozen multimodal features and online statistics to select and expand a pool of LoRA experts. It addresses continual VLA adaptation from task-homogeneous batches without task IDs, boundary signals, or stored examples.
Critical strengths
-
The router uses online feature statistics without training an additional network or retaining past demonstrations.
-
Experiments cover three VLA backbones and two simulation benchmarks, with additional evaluations of task revisits and real robot manipulation.
Critical weaknesses
-
Sec. 3.1 motivates PONIX through inconsistent task identities across demonstration collections. The discussion of prior work mainly lists dependencies on task labels, boundaries, or stored data. It does not explain which failures in the intended collection workflow make these methods inadequate, or why adding a simple task-identification module to an existing adapter framework would not suffice.
-
A central practical claim is avoiding task-ID annotation, yet the paper provides no estimate of the annotation burden or savings. It reports the number of experts without measuring the storage and routing costs of maintaining them. The evaluation therefore does not establish the practical trade-off between annotation effort and the resources needed by the proposed workflow.
-
The expert-adaptation framework has limited novelty. Lora experts, automatic routing, and dynamic expansion have close precedents, including DMPEL and CLARE. PONIX's incremental contribution is concentrated in its statistical routing and expansion rules for homogeneous batches without boundary signals. The paper does not demonstrate that these rules offer a substantive advantage over simple online clustering and expert reuse.
-
Tab. 1 mainly compares PONIX with Seq and TAIL, yet these baselines do not test whether PONIX allocates experts better than another method given the same information and resources.
-
The paper provides no ablations of variance-normalized routing, the requirement that every sample increase spread before expansion, or the joint use of visual and language features. Success curves and activation maps cannot demonstrate which design choices account for its performance. The results cannot distinguish the benefits of these rules from those of pretrained feature separability and parameter isolation across LoRA experts.
Questions for authors
-
What concrete failures do existing adapter methods encounter in the intended collection workflow? Could collection metadata or a simple module that infers task IDs from visual and language inputs make these methods applicable? Please explain what remains unresolved by such alternatives.
-
How much annotation or coordination effort does PONIX save? Please report parameter storage and routing overhead as experts accumulate, and evaluate retention under a fixed expert budget.
-
What specific difficulty introduced by removing task boundaries is addressed by PONIX's statistical rules? Please clarify the advance over DMPEL and CLARE, accounting for their access to boundary signals or retained data, and explain why simpler expert-assignment rules would be inadequate.
9 comments
Comment 2: Methodological novelty relative to DMPEL and CLARE
The expert-adaptation framework has limited novelty. Lora experts, automatic routing, and dynamic expansion have close precedents, including DMPEL and CLARE. ... What specific difficulty introduced by removing task boundaries is addressed by PONIX's statistical rules? Please clarify the advance over DMPEL and CLARE, accounting for their access to boundary signals or retained data ...
Authors’ response:
We agree that PONIX is intentionally simple, as explicitly emphasized in the Abstract and Section 1. We do not claim novelty in the individual components, such as LoRA, Gaussian kernels, or online moment updates. Rather, our contribution lies in a lightweight expert-management mechanism that enables continual VLA adaptation without task identities, boundary signals, or stored exemplars.
-
Different training assumptions. DMPEL and CLARE both assume task-boundary signals. DMPEL initializes new experts at task stages, while CLARE performs task-level discriminator creation and adapter expansion. Their original training procedures therefore depend on identifying task transitions. In contrast, PONIX receives only incoming mini-batches, without task or collection identities or boundary indicators (Section 3.2, Algorithm 1).
-
Boundary-free expansion and expert reuse. Without task boundaries, the learner must distinguish a genuinely new task from a recurring task using only the current batch and accumulated statistics. PONIX addresses this through variance-aware Gaussian routing and a unanimous spread-based expansion criterion. A new expert is created only when every sample in the incoming task-homogeneous batch would individually increase the selected expert's spread. Otherwise, the existing expert is reused and updated (Sections 4.1–4.2).
-
Empirical validation of expert reuse. Under paraphrased task revisitation, PONIX achieves 61.7% mean SR, compared with 50.1% for instruction-based TAIL, while using approximately half as many experts (Table 3). Our real-robot experiments further demonstrate expert reuse under both unchanged and paraphrased instructions (Section 5.4, Figure 3).
Table R1. Task revisitation under paraphrased instructions, averaged across four LIBERO suites (Section 5.3, Table 3).
| Method | Mean FWT ↑ | Mean SR ↑ | Mean NBT ↓ | Mean AUC ↑ | Mean experts ↓ |
|---|---|---|---|---|---|
| Instruction-based TAIL | 56.5% | 50.1% | 1.9 pp | 58.6% | 20 |
| PONIX | 61.6% | 61.7% | 0.3 pp | 60.8% | 10.25 |
Thus, PONIX demonstrates that a simple, lightweight mechanism can support effective expert assignment, expansion, and reuse under PTFCL, without introducing additional trained routers or relying on task-boundary supervision.
Comment 3: Insufficient comparison with baselines under matched information constraints
The paper does not demonstrate that these rules offer a substantive advantage over simple online clustering and expert reuse. ... Tab. 1 mainly compares PONIX with Seq and TAIL, yet these baselines do not test whether PONIX allocates experts better than another method given the same information and resources.
Authors’ response:
We have extended the evaluation with reservoir experience replay (RER) and Euclidean-distance (ED) expert assignment, providing additional comparisons under the PTFCL setting.
-
Task-free replay baseline. We added RER with a 5,000-example reservoir buffer, requiring neither task identities nor boundary signals. Across 24 backbone–suite settings, PONIX achieves a 10.8 percentage-point mean AUC improvement over RER and outperforms it in 21 of 24 settings (Section 5.2, Table 2).
-
Comparison with simple distance-based assignment. We additionally evaluate nearest-centroid ED routing with distance-threshold-based expert expansion. The ED baseline exhibits substantial threshold sensitivity: small thresholds lead to excessive expert creation, while large thresholds merge distinct tasks (Section 5.5, Table 6; Appendix E.4, Tables 20–21). This comparison evaluates the complete distance-based assignment and expansion strategy, rather than treating ED as a variance-aware expansion method. The routing studies use cached representations and evaluate expert allocation rather than full policy success.
-
Oracle performance as a reference. We retain TAIL as an oracle-task-ID reference, not as an information-matched baseline. Despite receiving no task identities, PONIX achieves 67.9% mean SR and 66.9% mean AUC, compared with 66.4% and 66.4% for TAIL, respectively, across the 24 settings (Table 2). In contrast, Seq suffers substantial forgetting despite its competitive acquisition success.
Table R2. Continual-learning performance across 24 backbone–suite settings (Section 5.2, Table 2).
| Method | Task-ID / boundary information | Mean SR ↑ | Mean AUC ↑ | Mean NBT ↓ |
|---|---|---|---|---|
| TAIL | Oracle task ID | 66.4% | 66.4% | −0.1 pp |
| Seq | Neither | 67.3% | 21.9% | 58.0 pp |
| RER | Neither | 62.8% | 56.1% | 8.5 pp |
| PONIX | Neither | 67.9% | 66.9% | 1.9 pp |
All values are equally weighted averages across 24 backbone–suite settings. The reported variability in Table 2 reflects evaluation seeds using the same trained checkpoints.
These results demonstrate that PONIX achieves strong acquisition and retention without oracle task information or exemplar replay. The ED experiments further characterize the sensitivity of simpler distance-based expert-assignment strategies.
We thank the reviewer for the constructive feedback and for recognizing the efficiency of our online statistical router, which requires neither an additional trained network nor stored demonstrations. We also appreciate the acknowledgment of our extensive evaluation across three VLA backbones, two simulation benchmarks, task revisitation, and real-robot manipulation. We have strengthened the manuscript with additional baselines, routing ablations, robustness analyses, and computational measurements. We address the concerns point by point below.
Comment 1: Motivation for PTFCL and task-ID inference alternatives
Authors’ response:
We have clarified the practical motivation in Section 3.1 and Figure 1. Task annotation itself requires interpreting multimodal demonstration data, while maintaining globally consistent task identities across independently collected demonstrations introduces an additional coordination burden, particularly when tasks recur.
Task annotation is nontrivial. Identifying a robot task requires interpreting language instructions, visual observations, and demonstration trajectories, rather than relying on language alone. Existing annotation frameworks, such as RoboAnnotatorX (Kou et al., 2025) and NILS (Blank et al., 2024), address the challenge of generating language descriptions and temporally grounded annotations. However, such annotations do not inherently establish globally consistent latent task identities across collections (Section 3.1).
Collection metadata does not guarantee consistent task identity. Collection identifiers distinguish recording sessions, not underlying tasks. As illustrated in Figure 1, the same task may appear under different instructions, while distinct tasks may share an identical instruction. Maintaining consistent IDs therefore requires semantic comparison across demonstrations and coordination on a common criterion for task equivalence.
Empirical evidence of inconsistent instructions. We explicitly evaluate both failure cases in Sections 5.3–5.4:
No additional task-ID inference model is required. A separately trained task-identification module is a possible alternative, but would introduce another inference and model-maintenance component, potentially requiring supervision to establish task equivalence. PONIX instead reuses frozen multimodal features already computed by the VLA, requiring only lightweight online statistics and no additional VLM forward pass (Section 4.1).
These clarifications are now incorporated into Section 3.1, which explains both the difficulty of multimodal task annotation and the additional burden of maintaining globally consistent task identities.