Method and apparatus for efficacious tree search for llm

An apparatus comprising:

• at least one memory configured to store program code;
• and
• at least one processor configured to read the program code and operate as instructed by the program code, the program code including:
• receiving code configured to cause the at least one processor to receive a text string corresponding to a mathematical question;
• generating code configured to cause the at least one processor to generate a search tree comprising a plurality of nodes by inputting the text string into a large language model (LLM) N different times, wherein the text string is the root of the search tree, wherein each node other than the root node corresponds to a search trajectory related to the mathematical question, wherein N is an integer greater than zero;
• first determining code configured to cause the at least one processor to determine an expansion score to each node from the plurality of nodes;
• selecting code configured to cause the at least one processor to select a node from the plurality of nodes having a highest expansion score;
• second determining code configured to cause the at least one processor to determine a budget for expanding the selected node;
• expanding code configured to cause the at least one processor to expand the selected node in accordance with the budget by inputting the node and the mathematical questions into the one or more mathematical tasks.

A non-transitory computer readable medium having instructions stored therein, which when executed by a processor cause the processor to execute a method comprising:

• receiving a text string corresponding to a mathematical question;
• generating a search tree comprising a plurality of nodes by inputting the text string into a large language model (LLM) N different times, wherein the text string is the root of the search tree, wherein each node other than the root node corresponds to a search trajectory related to the mathematical question, wherein N is an integer greater than zero;
• determining an expansion score to each node from the plurality of nodes;
• selecting a node from the plurality of nodes having a highest expansion score;
• determining a budget for expanding the selected node;
• expanding the selected node in accordance with the budget by inputting the node and the mathematical questions into the one or more mathematical tasks.