CNIPA.AI
검색으로 돌아가기
기록

OPTIMIZING SEQUENCES OF FEW-SHOT EXAMPLES FOR LARGE LANGUAGE MODELS

발명심사 중
6조회수
20청구항 · 3 독립항
§ Ⅰ

개요

IPC 분류

G6N 3/8

CPC 분류

G6N3/8

Aspects of the present disclosure relate to automated determination of an optimized sequence of examples for few-shot learning. Embodiments include generating, via a text encoder of an embedding model, embedding representations of training examples and a query. Embodiments further include generating, via a sequence encoder of the embedding model, embedding representations of two or more sequences of the training examples based on the training example embeddings. Embodiments further include determining, based on comparing the embedding representations of the sequences to the embedding representation of the query, probabilities that each sequence of the two or more sequences is a most optimized sequence for the query. Embodiments further include modifying parameters of the embedding model through a supervised contrastive learning process that involves evaluating the determined probabilities based on a label that indicates the most optimized sequence of the two or more sequences for the query.

원문 (중국어)

Aspects of the present disclosure relate to automated determination of an optimized sequence of examples for few-shot learning. Embodiments include generating, via a text encoder of an embedding model, embedding representations of training examples and a query. Embodiments further include generating, via a sequence encoder of the embedding model, embedding representations of two or more sequences of the training examples based on the training example embeddings. Embodiments further include determining, based on comparing the embedding representations of the sequences to the embedding representation of the query, probabilities that each sequence of the two or more sequences is a most optimized sequence for the query. Embodiments further include modifying parameters of the embedding model through a supervised contrastive learning process that involves evaluating the determined probabilities based on a label that indicates the most optimized sequence of the two or more sequences for the query.