Upload 5 files

.gitattributes

@@ -33,4 +33,6 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
-tokenizer.json filter=lfs diff=lfs merge=lfs -text
+tokenizer.json filter=lfs diff=lfs merge=lfs -textimgs/apps.png filter=lfs diff=lfs merge=lfs -text
+imgs/codecontests.png filter=lfs diff=lfs merge=lfs -text
+imgs/reflection.png filter=lfs diff=lfs merge=lfs -text

README.md

@@ -1,3 +1,57 @@
 ---
-license: apache-2.0
+license: bigscience-openrail-m
+metrics:
+- code_eval
+library_name: transformers
+tags:
+- code
 ---
+
+<p style="font-size:28px;" align="center">
+🏠 MoTCoder
+</p>
+
+<p align="center">
+• 🤗 <a href="https://huggingface.co/datasets/JingyaoLi/MoTCode-Data" target="_blank">Data </a> • 🤗 <a href="https://huggingface.co/JingyaoLi/MoTCoder-15B-v1.0" target="_blank">Model </a> • 🐱 <a href="https://github.com/dvlab-research/MoTCoder" target="_blank">Code</a> • 📃 <a href="https://arxiv.org/abs/2312.15960" target="_blank">Paper</a> <br>
+</p>
+
+[![PWC](https://img.shields.io/endpoint?url=https%3A%2F%2Fpaperswithcode.com%2Fbadge%2Fmotcoder-elevating-large-language-models-with%2Fcode-generation-on-apps%3Fmetric%3DIntroductory%2520Pass%25401)](https://paperswithcode.com/sota/code-generation-on-apps?metric=Introductory%20Pass%401/motcoder-elevating-large-language-models-with) 
+[![PWC](https://img.shields.io/endpoint?url=https%3A%2F%2Fpaperswithcode.com%2Fbadge%2Fmotcoder-elevating-large-language-models-with%2Fcode-generation-on-codecontests%3Fmetric%3DTest%2520Set%2520pass%25401)](https://paperswithcode.com/sota/code-generation-on-codecontests?metric=Test%20Set%20pass%401)
+
+Large Language Models (LLMs) have showcased impressive capabilities in handling straightforward programming tasks. However, their performance tends to falter when confronted with more challenging programming problems. We observe that conventional models often generate solutions as monolithic code blocks, restricting their effectiveness in tackling intricate questions. To overcome this limitation, we present Module-of-Thought Coder (MoTCoder). We introduce a framework for MoT instruction tuning, designed to promote the decomposition of tasks into logical sub-tasks and sub-modules. Our investigations reveal that, through the cultivation and utilization of sub-modules, MoTCoder significantly improves both the modularity and correctness of the generated solutions, leading to substantial pass@1 improvements of 2.4% on APPS and 4.5% on CodeContests. MoTCoder also achieved significant improvements in self-correction capabilities, surpassing the current SOTA by 3.3%. Additionally, we provide an analysis of between problem complexity and optimal module decomposition and evaluate the maintainability index, confirming that the code generated by MoTCoder is easier to understand and modify, which can be beneficial for long-term code maintenance and evolution. Our codes are available at https://github.com/dvlab-research/MoTCoder.
+
+<div style="text-align: center;">
+    <img src="./imgs/impression.png" alt="impression" />
+</div>
+
+## Performance
+
+### APPS
+<div style="text-align: center;">
+    <img src="./imgs/apps.png" alt="Performance on APPS" />
+</div>
+
+### CodeContests
+<div style="text-align: center;">
+    <img src="./imgs/codecontests.png" alt="Performance on CodeContests" width="500px" />
+</div>
+
+### Reflection
+<div style="text-align: center;">
+    <img src="./imgs/reflection.png" alt="Performance on Reflection" />
+</div>
+
+## Citation 
+If you find our work useful, please consider citing it.
+```
+@misc{li2025motcoderelevatinglargelanguage,
+      title={MoTCoder: Elevating Large Language Models with Modular of Thought for Challenging Programming Tasks}, 
+      author={Jingyao Li and Pengguang Chen and Bin Xia and Hong Xu and Jiaya Jia},
+      year={2025},
+      eprint={2312.15960},
+      archivePrefix={arXiv},
+      primaryClass={cs.LG},
+      url={https://arxiv.org/abs/2312.15960}, 
+}
+```
+