View source for 18481803. PROMPT COMPLEXITY FOR LARGE LANGUAGE MODELS (Google LLC)

=PROMPT COMPLEXITY FOR LARGE LANGUAGE MODELS=


==Organization Name==

[[:Category:Google LLC|Google LLC]]


[[Category:Google LLC]]

==Inventor(s)==

[[:Category:Swaroop Mishra of Mountain View CA (US)|Swaroop Mishra of Mountain View CA (US)]][[Category:Swaroop Mishra of Mountain View CA (US)]]

[[:Category:Ragha Kotikalapudi of San Jose CA (US)|Ragha Kotikalapudi of San Jose CA (US)]][[Category:Ragha Kotikalapudi of San Jose CA (US)]]

[[:Category:Obaid Sarvana of Chicago IL (US)|Obaid Sarvana of Chicago IL (US)]][[Category:Obaid Sarvana of Chicago IL (US)]]

[[:Category:Sahitya Potluri of Sunnyvale CA (US)|Sahitya Potluri of Sunnyvale CA (US)]][[Category:Sahitya Potluri of Sunnyvale CA (US)]]

[[:Category:YaGuang Li of Sunnyvale CA (US)|YaGuang Li of Sunnyvale CA (US)]][[Category:YaGuang Li of Sunnyvale CA (US)]]

[[:Category:Taylor Bos of Santa Clara CA (US)|Taylor Bos of Santa Clara CA (US)]][[Category:Taylor Bos of Santa Clara CA (US)]]

[[:Category:Steven Zheng of San Bruno CA (US)|Steven Zheng of San Bruno CA (US)]][[Category:Steven Zheng of San Bruno CA (US)]]

[[:Category:Hanzhao Lin of Cupertino CA (US)|Hanzhao Lin of Cupertino CA (US)]][[Category:Hanzhao Lin of Cupertino CA (US)]]

[[:Category:Chenkai Kuang of Sunnyvale CA (US)|Chenkai Kuang of Sunnyvale CA (US)]][[Category:Chenkai Kuang of Sunnyvale CA (US)]]

[[:Category:Heng-Tze Cheng of Mountain View CA (US)|Heng-Tze Cheng of Mountain View CA (US)]][[Category:Heng-Tze Cheng of Mountain View CA (US)]]

[[:Category:Ed H. Chi of Los Altos CA (US)|Ed H. Chi of Los Altos CA (US)]][[Category:Ed H. Chi of Los Altos CA (US)]]

[[:Category:Quoc Le of Sunnyvale CA (US)|Quoc Le of Sunnyvale CA (US)]][[Category:Quoc Le of Sunnyvale CA (US)]]

==PROMPT COMPLEXITY FOR LARGE LANGUAGE MODELS==


This abstract first appeared for US patent application 18481803 titled 'PROMPT COMPLEXITY FOR LARGE LANGUAGE MODELS

==Original Abstract Submitted==

Some implementations relate to generating a training and/or evaluation dataset with LLM prompts (e.g., derived from user queries) based on a prompt complexity. An input prompt, for example derived from a user query, is received. The input prompt is decomposed into a prompt tree comprising a plurality of nodes. The plurality of nodes comprise: a plurality of leaf nodes corresponding to simple sub-prompts of the input query; a plurality of branch nodes of sub-prompts each corresponding to multiple simple sub-prompts; and a root node corresponding to the input prompt. A prompt complexity is determined based on a path length of the prompt tree. The prompt complexity is compared to a threshold complexity. If the prompt complexity is above the threshold complexity, the input prompt is included in a set of training prompts and/or a set of evaluation prompts.



[[Category:G06F40/40]]
[[Category:G06N3/08]]
[[Category:CPC_G06F40/40]]