Regularized Conditional Diffusion Model for Multi-Task Preference Alignment

Sequential decision-making is desired to align with human intents and exhibit versatility across various tasks. Previous methods formulate it as a conditional generation process, utilizing return-conditioned diffusion models to directly model trajectory distributions. Nevertheless, the return-conditioned paradigm relies on pre-defined reward functions, facing challenges when applied in multi-task settings characterized by varying reward functions (versatility) and showing limited controllability concerning human preferences (alignment). In this work, we adopt multi-task preferences as a unified condition for both single- and multi-task decision-making, and propose preference representations aligned with preference labels. The learned representations are used to guide the conditional generation process of diffusion models, and we introduce an auxiliary objective to maximize the mutual information between representations and corresponding generated trajectories, improving alignment between trajectories and preferences. Extensive experiments in D4RL and Meta-World demonstrate that our method presents favorable performance in single- and multi-task scenarios, and exhibits superior alignment with preferences.

Paper

Similar papers

Peer review

Reviewer Y24x5/10 · confidence 2/52024-06-28

Summary

This paper presents a novel approach using a regularized conditional diffusion model to align with preferences in multi-task reinforcement learning (RL) scenarios. The proposed method generates preference representations that effectively distinguish between various task trajectories and returns. By maximizing mutual information between conditions and generated trajectories, the model regularizes existing diffusion frameworks, enabling it to produce optimal task-specific trajectories aligned with given preferences.

Strengths

- The motivation is clear - generating preference representations for various tasks to differentiate them and taking them as the conditions in the diffusion model so that we could consider preference learning in the multi-task scenario. - The method and all the designs in this method are reasonable to me.

Weaknesses

My main concern is about the results. It seems that CAMP doesn't perform better than existing methods. For details, please refer to the Questions part. Thanks.

Questions

- Could you provide an additional ablation study on the influence of the number of tasks? Specifically, does the representation for task A differ when learning tasks {A, B} together versus tasks {A, B, C} together? Additionally, does the number of tasks impact the accuracy of task A? - Could you highlight the best results in each row of Table 1? It appears that CAMP's performance is not consistently better than existing methods across these environments, and its average result is not particularly strong. Does this imply that CAMP struggles to learn a good task representation? Alternatively, do you have any other explanations for these observations? - Regarding the multi-task dataset case, Tables 4 and 5 indicate that CAMP performs well on some tasks but poorly on others. Could you explain why this is the case? Is it due to an imbalance in the training of the multi-task scenario?

Rating

5

Confidence

2

Soundness

2

Presentation

3

Contribution

3

Limitations

N/A

Authorsrebuttal2024-08-13

Looking forward to your feedback

Dear Reviewer Y24x, We first would like to thank the reviewer's efforts and time in reviewing our work. We were wondering if our responses have resolved your concerns. Since the discussion period is ending soon, we would like to express our sincere gratitude if you could check our reply to your comments. We will be happy to have further discussions with you if there are still some remaining questions! We sincerely look forward to your kind reply! Best regards, The authors

Reviewer 3Xmu6/10 · confidence 3/52024-07-10

Summary

The paper proposes a novel method called the Regularized Conditional Diffusion Model for multi-task preference alignment, addressing the challenge of generating trajectories that align with human preferences in multi-task settings. This method introduces preference-based representations and a mutual information regularization technique to improve the alignment between generated trajectories and preferences.

Strengths

1. The method effectively captures and utilizes versatile preference representations, allowing for better alignment with human intents across multiple tasks. 2. The introduction of a mutual information regularization objective enhances the consistency between conditions and generated trajectories, improving performance. 3. The diffusion model guided by learned preference representations generates trajectories that align closely with desired preferences.

Weaknesses

1. The authors’ proposed method shares a similar motivation with OPPO. In the appendix, they explain the differences between their method and other approaches like OPPO and MTDiff. Their method improves upon OPPO and MTDiff by incorporating Diffusion and other techniques such as regularization for multi-task preferences. It is recommended that the authors emphasize these distinctions in the main text and update the contribution list to highlight their unique contributions. 2. From the comparative experimental results presented in the figures and tables, it is evident that the authors’ method does not achieve the best performance across all metrics. It is suggested that the authors provide a corresponding discussion instead of merely describing the contents of the figures and tables. 3. The authors’ method involves computationally intensive modules such as mutual information and diffusion models. It is advised to include a discussion on the computational costs of the model, such as space complexity and time complexity, to enable a comprehensive comparison with related models. 4. Given that the authors’ model addresses multi-task preferences, it would be beneficial to discuss the impact of the quality of the provided preference data on the results.

Questions

Please see the weaknesses

Rating

6

Confidence

3

Soundness

3

Presentation

3

Contribution

3

Limitations

n/a

Authorsrebuttal2024-08-13

Looking forward to your feedback

Dear Reviewer 3Xmu, We first would like to thank the reviewer's efforts and time in reviewing our work. We were wondering if our responses have resolved your concerns. Since the discussion period is ending soon, we would like to express our sincere gratitude if you could check our reply to your comments. We will be happy to have further discussions with you if there are still some remaining questions! We sincerely look forward to your kind reply! Best regards, The authors

Reviewer L2wb6/10 · confidence 4/52024-07-12

Summary

This paper proposes a regularized conditional diffusion model which aligns with preferences for multi-task scenarios. To achieve this, learnable representations for preferences are aligned with preference labels, which can be adopted as condition inputs to guide the generation process of diffusion models. Meanwhile, in order to keep consistency between conditions and generated trajectories, a mutual information regularization method is utilized to improve their alignment with preferences. To verify its effectiveness, extensive experiments have been conducted on two datasets D4RL & Meta-World which cover both single- and multiple-task scenarios, and the results demonstrate the superior performance and generalization ability of the proposed method in aligning preferences across different tasks.

Strengths

1. This paper is well-written and detailed. The authors provide sufficient technical principles and experimental details for readers to understand and be able to reproduce their work. 2. This paper gives a novelty idea in human preferences alignment and combines it with diffusion models in multi-task scenarios, which can be conducive to further foundation models finetuning. 3. Conducting extensive experiments on public datasets and comparing them with different state-of-the-art methods makes the proposed method more practical and convincing.

Weaknesses

1. From Table 1, we can see a large variation in performance for different tasks with the same implementation method. 2. The proposed method seems to have high computational complexity. 3. From Table 2, although the generalization ability for unseen tasks is somewhat improved by this approach compared to the baseline methods, the average performance is still not very good.

Questions

1. I wonder what factors contribute to this phenomenon and how we choose the optimal approach for a given task. 2. I would like to know whether the method proposed in the paper receives a greater impact on efficiency as the type and number of tasks increase. 3. Is the generalization ability of this approach feasible in practical applications?

Rating

6

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

N/A

Authorsrebuttal2024-08-13

Looking forward to your feedback

Dear Reviewer L2wb, We first would like to thank the reviewer's efforts and time in reviewing our work. We were wondering if our responses have resolved your concerns. Since the discussion period is ending soon, we would like to express our sincere gratitude if you could check our reply to your comments. We will be happy to have further discussions with you if there are still some remaining questions! We sincerely look forward to your kind reply! Best regards, The authors

Reviewer Y24x2024-08-09

Response to the author

Thanks for the response. Q1: Can I understand that the non-significant superiority of CAMP in Table is because the baseline IQL is too strong? If so, why do we just use IQL? Q2: Do we have any solution for the different difficulties of the tasks in MTL? It's indeed the imbalance problem in MTL and should be solved carefully.

Authorsrebuttal2024-08-10

Thanks for your valuable feedback. **A1**: We do not intend to suggest that IQL is excessively strong. Instead, it serves as a representative reward-based offline RL method that can be extended to multi-task scenarios. The performance discrepancy between IQL and CAMP primarily arises from their different utilization of reward signals and preference data. We compare CAMP with IQL to demonstrate that our approach, which relies solely on preference data, can achieve performance comparable to reward-based methods in multi-task scenarios. **A2**: Thanks for your correction. The varying difficulty levels among tasks indeed lead to training imbalances in MTL. In our current work on using diffusion models for multi-task trajectory generation, we did not account for conflicts between tasks, which could result in uneven performance in MetaWorld. To address this problem, previous MTL methods have employed strategies such as weighted summation of multi-task losses, gradient manipulation of each loss , and Pareto optimal solutions. These strategies optimize multiple losses simultaneously and may prevent performance degradation due to task conflicts. However, these approaches mainly focus on vision tasks and have been barely investigated in diffusion models or trajectory generation for decision-making. Our method can be combined with these strategies to further enhance multi-task decision-making performance. Recently, several methods, including uncertainty weighting [1] and PCgrad [2], have been integrated to mitigate the negative transfer problem in image generation using diffusion models [3]. These approaches can provide valuable guidance for future work and be extended to our mutli-task decision-making scenarios, mitigating the imbalance in our conditional trajectory generation. [1] Kendall A, Gal Y, Cipolla R. Multi-task learning using uncertainty to weigh losses for scene geometry and semantics, CVPR 2018. [2] Yu T, Kumar S, Gupta A, et al. Gradient surgery for multi-task learning, NeurIPS 2020. [3] Go H, Lee Y, Lee S, et al. Addressing negative transfer in diffusion models, NeurIPS 2023.

Authorsrebuttal2024-08-14

Thanks for your valuable feedback. The construction of positive and negative samples is illustrated in Figure 2. Here, we provide a further explanation. In the $m$ tasks, before calculating the loss and updating the gradients each time, a task $i \in [m]$ is randomly sampled. Then, from the trajectory data of task $i$, two batches of data with batch size are sampled. These are divided into two groups based on their preferences, with one group having higher preference and the other having lower preference. The batch with higher preference is taken as the positive samples, and the batch with lower preference as the negative samples. Additionally, trajectory data with batch size are sampled from all other tasks $j \in [m], j \neq i$, and all these trajectories are considered as negative samples in this gradient update. In summary, for each update, $(m+1)\times batchsize$ trajectories are sampled, where the batch size trajectories are positive samples from the sampled task $i$, and $m\times batchsize$ trajectories are negative samples from task $i$ and other tasks $j$. We hope that our responses have addressed your concerns.

Reviewer 3Xmu2024-08-14

Thank you very much for the further clarifications. I will increase my score.

Authorsrebuttal2024-08-14

We are glad that our response has addressed your concerns, and we commend your effort in evaluating our paper and raising the score. Your valuable suggestions are greatly appreciated and very helpful in improving the quality of our paper. We will incorporate discussions on contributions, experiments, and computational complexity in the next version based on your suggestions.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC