nlp phd candidate @UIUC_NLP | nsf grfp fellow
prev: cs'22 @berkeley_ai | @IntelAI | @IBMResearch
It then dynamically constructs a question tree based on its interactions with the student, navigating the knowledge state space till the student comprehends & fixes all misunderstandings &bugs.
It then dynamically constructs a question tree based on its interactions with the student, navigating the knowledge state space till the student comprehends & fixes all misunderstandings &bugs.
We apply TreeInstruct to code debugging. Prior works directly give away bugs/fixes, assume single-turn conversations, and only work for one bug. We create a realistic, multi-bug dataset, where the bugs can be either mutually independent or dependent.
We apply TreeInstruct to code debugging. Prior works directly give away bugs/fixes, assume single-turn conversations, and only work for one bug. We create a realistic, multi-bug dataset, where the bugs can be either mutually independent or dependent.