Method and apparatus of converting schema in deep learning framework, and computer storage medium

Patent metadata

Field	Value
Publication number	US-11604774-B2
Application number	US-202117480294-A
Country	US
Kind code	B2
Filing date	Sep 21, 2021
Priority date	Nov 9, 2020
Publication date	Mar 14, 2023
Grant date	Mar 14, 2023

Abstract

A method and apparatus of converting a schema in a deep learning framework, an electronic device, and a computer storage medium are provided. The method of converting the schema in the deep learning framework includes: updating a first schema, based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema, so as to obtain an updated first schema; generating second syntax elements corresponding to updated first syntax elements in the updated first schema, based on a mapping relationship between the updated first syntax elements in the updated first schema and second syntax elements in a second schema system; and combining the second syntax elements according to a context relationship between the updated first syntax elements, so as to generate a second schema.

First claim

What is claimed is:

1. A method of converting a schema in a deep learning framework, comprising:
updating a first schema, based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema, so as to obtain an updated first schema;
generating second syntax elements corresponding to updated first syntax elements, the updated first schema comprising the updated first syntax elements;
combining the second syntax elements according to a context relationship between the updated first syntax elements, so as to generate a second schema; and
executing the second schema, wherein a machine overhead cost required for an execution of the first schema is greater than that required for an execution of the second schema, wherein
generating the second syntax elements corresponding to the updated first syntax elements comprises inputting abstract syntax trees of the updated first syntax elements to converters corresponding to the updated first syntax elements, so that the converters convert and output abstract syntax trees corresponding to the abstract syntax trees of the updated first syntax elements as the second syntax elements.

2. The method of claim 1 , wherein a number of the updated first syntax elements is less than that of the first syntax elements.

3. The method of claim 1 , wherein the first syntax elements comprise a first operator, and the second syntax elements comprise a second operator, and wherein the method further comprises:
allowing the second schema to be executed by the first operator corresponding to the second operator.

4. The method of claim 1 , wherein a first identifier of the first schema is stored in a high-speed storage device, and wherein the method further comprises:
acquiring the first identifier of the first schema;
determining a second identifier of an another first schema; and
determining the second schema as a schema corresponding to the further first schema in response to determining that the first identifier matches the second identifier.

5. The method of claim 1 , wherein the first syntax elements comprise a loop operator and a conditional operator; and
wherein the updating a first schema based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema comprises:
updating the conditional operator and the loop operator as an another loop operator, in response to determining that a context relationship between the conditional operator and the loop operator is to be adjacent in the first schema.

6. The method of claim 1 , wherein the first syntax elements comprise constants, and wherein the updating a first schema based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema comprises:
removing repetitive constants in the first schema.

7. The method of claim 1 , wherein the first schema is implemented by imperative programming, and the second schema is implemented by declarative programming.

8. An electronic device, comprising:
one or more processors; and
a storage device for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement operations of converting a schema in a deep learning framework, comprising:
updating a first schema, based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema, so as to obtain an updated first schema;
generating second syntax elements corresponding to updated first syntax elements, the updated first schema comprising the updated first syntax elements;
combining the second syntax elements according to a context relationship between the updated first syntax elements, so as to generate a second schema; and
executing the second schema, wherein a machine overhead cost required for an execution of the first schema is greater than that required for an execution of the second schema, wherein
generating the second syntax elements corresponding to the updated first syntax elements comprises inputting abstract syntax trees of the updated first syntax elements to converters corresponding to the updated first syntax elements, so that the converters convert and output abstract syntax trees corresponding to the abstract syntax trees of the updated first syntax elements as the second syntax elements.

9. A non-transitory computer-readable storage medium having computer programs stored thereon, wherein the computer programs, when executed by a processor, cause the processor to implement operations of converting a schema in a deep learning framework, comprising:
updating a first schema, based on first syntax elements in the first schema and a context relationship between the first syntax elements in the first schema, so as to obtain an updated first schema;
generating second syntax elements corresponding to updated first syntax elements, the updated first schema comprising the updated first syntax elements;
combining the second syntax elements according to a context relationship between the updated first syntax elements, so as to generate a second schema; and
executing the second schema, wherein a machine overhead cost required for an execution of the first schema is greater than that required for an execution of the second schema, wherein
generating the second syntax elements corresponding to the updated first syntax elements comprises inputting abstract syntax trees of the updated first syntax elements to converters corresponding to the updated first syntax elements, so that the converters convert and output abstract syntax trees corresponding to the abstract syntax trees of the updated first syntax elements as the second syntax elements.

Assignees

• Beijing Baidu Netcom Sci & Tech Co Ltd

Inventors

• Zhang Liujie
• Li Yamei
• Zheng Huihuang
• Liu Hongyu
• Lan Xiang
• Yu Dianhai
• Ma Yanjun
• Wu Tian
• Wang Haifeng

Classifications

• G06F16/211 Primary

  Schema design and management · CPC title

• G06F16/2246

  Trees, e.g. B+trees · CPC title

• G06N3/08 Primary

  Learning methods · CPC title

• G06N3/045

  Combinations of networks · CPC title

• G06F40/253 Primary

  Grammatical analysis; Style critique · CPC title