Quilladin

Summary
This paper introduces Model-Based Diffusion Optimal Control (MDOC), a training-free diffusion planner for multi-robot motion planning that enforces dynamic feasibility and hard safety constraints during sampling—using known dynamics models and Control Barrier Function (CBF)-constrained projections inside the denoising loop. It integrates MDOC into Conflict-Based Search (CBS) as MDOC-CBS, enabling scalable multi-robot coordination. Experiments across 6 map types (e.g., Narrow, Conveyor, Drop-Region) and up to 40 robots show consistent improvements in success rate, path length, geometric smoothness, and planning time over baselines like KCBS and MMD-CBS.

Mathematical/empirical assessment
The core method is grounded: Algorithm 2 implements Monte Carlo Score Ascent (MCSA) with CBF projections per rollout step (Eq. 15), ensuring all candidate trajectories used in Eq. 16 satisfy both dynamics and safety constraints. The extension to CBS (Algorithm 1) is algorithmically precise—each conflict spawns new nodes where inter-robot constraints are encoded as time-indexed forbidden spheres, then enforced via the same CBF projection mechanism. Empirically, results are demonstrated across Figures 1–5: MDOC-CBS achieves ≥95% success on 2×2 maps up to 20 robots (Fig. 1), maintains >85% success on 4×4 and 6×6 maps up to 40 robots (Fig. 2), and attains 100% “Pass&Free” yield in narrow passages (Table 5), outperforming CEM, MPPI, and RRT*. However, no ablation isolates the contribution of CBF projection vs. MCSA vs. CBS integration; nor is failure mode analysis provided (e.g., what causes the 5% failures in Random maps?).

Strengths
MDOC eliminates reliance on demonstration data—a clear advance over model-free diffusion planners like MMD-CBS. Its use of CBF projections inside diffusion rollouts (not as post-hoc fixes) is principled and directly enables hard constraint satisfaction during sampling. The CBS integration is clean and empirically effective: MDOC-CBS reduces CT expansions and planning time while improving trajectory quality (Table 4, Fig. 4). Visual evidence (Fig. 5) convincingly shows how diffusion progressively refines from broad exploration to safe, bottleneck-traversing paths.

Concerns
The paper claims MDOC “naturally scales to multi-robot planning settings through Conflict-Based Search”, but scaling is empirical—not proven. No theoretical bound is given on constraint set growth, worst-case CT size, or convergence under CBF tightening. Also, while Table 4 reports path length (P) and Laplacian smoothness (G), it omits raw collision counts or safety violation rates—despite claiming “collision-free trajectories” as a key outcome. Figure 1 shows success rate, but not whether failures involved constraint violations or timeouts. Finally, the “geometric smoothness” metric (G) is defined only as “Laplacian” in the caption—no formula or validation is provided.

Final decision
Weak accept

Summary
This paper proposes a meta-learning framework for aligning multilingual large language models (LLMs) by leveraging preference data from other languages to improve performance in low-resource settings. The approach, called MAML-DPO and MAML-RLHF, is evaluated on multiple languages and demonstrates significant improvements over baseline methods, especially with limited target-language data. Theoretical guarantees are provided for both reward modeling and policy optimization settings.

Mathematical/empirical assessment
The paper provides empirical results showing that the proposed method achieves up to 28% win-rate improvements over baselines when only 100 target-language samples are available. The experiments include detailed comparisons across different languages, model sizes, and adaptation stages. Theoretical analysis supports the convergence of the meta-learning process for both DPO and RLHF settings. The paper also includes ablation studies and out-of-distribution evaluations, demonstrating robustness and generalization.

Strengths
- The paper addresses a critical challenge in multilingual LLM alignment: the scarcity of human preference data in low-resource languages.
- The proposed framework shows consistent improvements across various languages and model scales, even with minimal target-language data.
- Theoretical guarantees for convergence and strong empirical validation support the effectiveness of the approach.
- The paper includes comprehensive experimental results, including ablation studies and out-of-distribution evaluations.

Concerns
- The paper lacks detailed discussion on the computational cost and scalability of the proposed methods, particularly for larger models or more languages.
- Some technical details, such as the exact implementation of LoRA adapters and hyperparameter tuning, are not fully described.
- The theoretical analysis is somewhat abstract and may be challenging to interpret without deeper context.

Final decision
Strong accept