EP3455795A1 - Deep learning of bots through examples and experience - Google Patents
Deep learning of bots through examples and experienceInfo
- Publication number
- EP3455795A1 EP3455795A1 EP17723910.0A EP17723910A EP3455795A1 EP 3455795 A1 EP3455795 A1 EP 3455795A1 EP 17723910 A EP17723910 A EP 17723910A EP 3455795 A1 EP3455795 A1 EP 3455795A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- features
- neural network
- selected action
- action
- indication
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/088—Non-supervised learning, e.g. competitive learning
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/042—Knowledge-based neural networks; Logical representations of neural networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/279—Recognition of textual entities
- G06F40/289—Phrasal analysis, e.g. finite state techniques or chunking
- G06F40/295—Named entity recognition
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/044—Recurrent networks, e.g. Hopfield networks
- G06N3/0442—Recurrent networks, e.g. Hopfield networks characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/09—Supervised learning
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/092—Reinforcement learning
Definitions
- the embodiments of the disclosure include methods and systems for using, creating and maintaining goal-oriented, dialog systems (i.e., "transactional bots” or “bots”) that provide interfaces to application functionality such as, for example, interfaces to application functionality for ordering a taxi, controlling devices in the home, banking, or shopping.
- the methods and systems of the embodiments provide a bot that may learn in supervised learning and reinforcement learning from conversational examples provided by domain experts and from interaction with users.
- the embodiments provide conversational bots that may be created to interact using both text and/or application programming interface (API) calls.
- API application programming interface
- Use of the embodiments allows a developer to configure a bot that interfaces with an application back-end and allows the behavior of the bot to be configured by use of masking actions.
- Use of the embodiments also allows flexible design of a specification for the bot that specifies how developer code may be organized, for example, as masking operations on the possible actions the bot may execute. Additionally, the methods and systems may automatically infer the best state representation during a dialog so a state variable need not be predefined.
- the methods and systems may be implemented as a bot using a Long Short-Term memory (LSTM) recurrent neural network model.
- the LSTM recurrent neural network may be optimized with supervised learning and/or using reinforcement learning via a specialized policy gradient method.
- bot behavior may be specified with example dialogs. Bot behavior also may be improved autonomously from interactions with users without human intervention using a controller that makes use of business rules to gate exploration.
- An example implementation may comprise a system including one or more processors that control an interactive dialog with a user.
- the system may include memory that includes programs or code, that when executed, causes the one or more processor to control the system to perform entity extraction on input text generated from a user input.
- the user input may generate the text directly from text input by a user or generate the text by converting audio input from a user into text.
- the entity extraction may identify entities in the text using custom models for specific domains or generic models suitable for use with multiple domains.
- the system may determine marked-up text from the input text and use the marked up text to determine a mask over available actions.
- the mask may comprise an indication of which actions of a set of actions are allowed and disallowed.
- the system may then provide the mask and a set of features to a recurrent neural network.
- the set of features may include the input text generated from the user input and the indications of a types of entities extracted in the entity extraction.
- the system may then receive an indication of a selected action from the recurrent neural network, update an internal state in the system based on the indication of the selected action, and initiate the selected action for the dialog.
- the system and recurrent neural network may perform operations in a loop type behavior while the interactive dialog occurs by varying the configuration of the set of features provided to the recurrent neural network.
- the system may include features generated by the system, features returned from an API call (if the previous action was an API call), or an indication of a previous action taken by the system (if there was a previous action), when providing the set of features to the recurrent neural network.
- the system may include one or more processors that control a supervised learning process.
- the system may include memory that includes programs or code, that when executed, causes the one or more processor to control the system to receive one or more sample dialogs created by a developer, determine if any action in the one or more sample dialogs is masked out, and, in response to a determination that no action in the one or more sample dialogs is masked out, incorporate the one or more sample dialogs into a training set.
- the system may also create a log including a set of features and entity extractions for the training.
- the system may then apply training to a recurrent neural network using the training set and the log, score the one or more sample dialogs using the recurrent neural network to generate a score result based on the training, and, determine if a target action in the one or more sample dialogs was not assigned a highest probability in the score result.
- the determination of whether a target action was not assigned a highest probability may then be used to further refine the training. For example, if it is determined that a target action in the one or more sample dialogs was not assigned a highest probability in the score result, the system may provide an indication of a dialog of the one or more sample dialogs in which the target action was not assigned a highest probability to the developer. If it is determined that each target action in the one or more sample dialogs was assigned a highest probability in the score result, the system may provide an indication that all of the one or more sample dialogs were reconstructed successfully to the developer.
- the system may include one or more processors that control a reinforcement learning process.
- the system may include memory that includes programs or code, that when executed, causes the one or more processors to control the system to receive a definition for a reward signal and a return for one or more dialogs, perform the one or more dialogs using a recurrent neural network, create a log of rewards, features, available actions, and selected actions from the performed one or more dialogs, provide the return for the performed one or more dialogs to the neural network for use in improvement of the neural network, and provide the log for output at a user interface.
- FIGURE 1 is a simplified block diagram illustrating example functions according to an embodiment of the disclosure
- FIGURE 2 is a flow diagram illustrating example signal flows between functional blocks of an operational loop in an implementation according to FIGURE 1;
- FIGURE 3 is a flow diagram illustrating runtime operations performed by an example system
- FIGURE 4 is a flow diagram illustrating supervised learning operations performed by an example system
- FIGURE 5A is a flow diagram illustrating reinforcement learning operations performed by an example system
- FIGURE 5B is a flow diagram illustrating improvement operations for reinforcement learning operations performed by an example system.
- FIGURE 6 is a simplified block diagram illustrating an example computing device.
- the disclosed embodiments provide a technical advantage as compared to currently used methods for using and creating transactional bots (bots) for dialog systems.
- the embodiments provide a system that allows a neural network to be optimized both with supervised learning and using reinforcement learning via a specialized policy gradient method.
- bot behavior may be specified with example dialogs.
- Bot behavior also may be improved autonomously from interactions with users without human intervention using a controller that reinforces business rules to gate exploration by the neural network.
- use of the embodiments with a recurrent neural network allows inference of a latent representation of state of the system.
- rule languages used to define behavior in rule based systems are often not easy to use by non-experts. It is often difficult for a program manager, designer, or marketing executive to build or maintain a bot without support from a software developer expert in rules languages. Also, as the number of rules for defining a system grows, the rules begin to interact and, as a result, rule changes have unforeseen consequences, so fixing one bug can introduce many other bugs. This makes maintenance of non-trivial rule based systems slow and extremely difficult. Additionally, rule-based methods do not learn automatically from experience. Even if a bot conducts a million dialogs a day, no automatic improvement is possible. Improvements to bot behavior can only be made through time-consuming human analysis.
- Use of the embodiments of the disclosure allows bot behavior to be specified using example dialogs without the need to know a specialized rules language. For example, designers, program managers, or marketing executives may configure the system without help from specialized software developers who know the rules language.
- Use of the embodiments also allows bot behavior to be improved autonomously through interactions with users without human intervention.
- the embodiments also provide the advantage that exploration performed by a neural network can be gated or restricted in scope by optional code that enforces rules for bot behavior.
- SL supervised learning
- a domain expert provides example dialogs that the bot should imitate, and a machine learning algorithm ingests these and builds a model which attempts to generalize to new dialogs.
- SL methods do not have the ability to make improvements automatically through experience or through reinforcement learning.
- a domain expert In order to make improvements in bot behavior, a domain expert must manually examine and label dialogs.
- the embodiments of the disclosure also provide advantages over currently used reinforcement learning (RL) methods in which an RL algorithm explores different actions in different states, and over time makes progress toward finding the mapping from state to action that maximizes a reward signal.
- RL learns automatically, without input from system designers.
- RL systems are difficult to create and, typically, for the first 100s or 1000s of dialogs, RL systems usually perform very badly because an RL system explores all possible actions, including spurious actions.
- the capability to gate exploration using optional code that enforces business rules may be used to prevent exploration of spurious actions and improve system behavior as compared to the current RL systems.
- careful definition of the state variable is needed. The embodiments of the disclosure remove the need to define the state variable that is present in current RL systems.
- FIGURE 1 illustrates functional blocks of an example network 100 including an example system 104.
- system 104 may implement functionality for a bot and include entity extractor 106, recurrent neural network 108, and controller 110.
- System 104 may also include a developer interface 112.
- System 104 may interact with device 102 and application server 114.
- Device 102 may include an application that allows a user to interact with and receive services from application server 114 through system 104.
- System 104 may communicate with a user of device 102 via one or more channels.
- the one or more channels may be any type of communication channels carrying communications for applications including short messaging services (SMS), email services, messaging platforms such as conferencing platforms, social network platforms, text messaging platforms, or any other type of application using text communication.
- SMS short messaging services
- the applications may also include any type of application using voice or spoken communications, or web browsers.
- text may be typed in by the user, or transcribed text produced by a speech recognizer, or, also may be translated from another language using an automatic translation service.
- the user could engage in a one to one dialog with the bot, or the bot could be participating in a dialog with a plurality of users.
- the bot could be addressed directly, or the bot could monitor a conversation and respond when it determines a response would be relevant
- the applications may include, for example, reservation applications, retail/purchasing applications, information retrieval applications, or any other type of application that may interact with a user through a dialog.
- Device 102 may be any type of device configured to allow a user to use an application such as, for example, a smartphone, a tablet computer, a desktop computer, laptop computer device, gaming devices, media devices, smart televisions, multimedia cable/television boxes, smart phone accessory devices, industrial machinery, home appliances, thermostats, tablet accessory devices, personal digital assistants (PDAs), or other internet of things (IOT) devices.
- the functions of entity extractor 104, recurrent neural network 108 and controller 110 of system 104 may be implemented using a one or more servers. In alternative embodiments of FIGURE 1, the functions described for a particular functional block in relation to FIGURE 1 may be performed in another of the functional blocks of FIGURE 1 or divided up between the functional blocks in a different way.
- FIGURE 2 therein is a flow diagram illustrating example signal flows for data exchange between functions of an operational loop 200 in an implementation according to FIGURE 1.
- the functions of FIGURE 1 may be described with reference to FIGURE 2.
- Block text input/text output 202 may represent functions performed at device 102
- blocks entity input 206, action mask 222, entity output 228, and API call 218, may represent function performed by controller 1 10
- block entity extraction 204 may represent functions performed at entity extractor 106.
- Long short-term memory recurrent neural network (LSTM) may represent functions performed at recurrent neural network 108.
- Softmax 224 represents a conversion of LSTM 220 output values into action probabilities for communication to controller 1 10.
- entity extraction is performed and entities are identified in the text. For example, in the query "Will it rain in Sacramento on Friday?", entity extraction at 204 may identify “Sacramento” as a city, “Friday” as a day, and “rain” as a weather event.
- entity extractor 106 sends signal 208 to pass marked up text at 206 to the controller 1 10.
- Entity extractor 106 may also pass the input text and entities to recurrent neural network 108 through signal 208 at block 210.
- Controller 1 10 is configured to perform a defined set of operations and the developer may be further guided in what to write through the user-interface design.
- the controller 1 10 may resolve the text of entities to ontology within the domain of a particular application. For example, it might resolve the user's input of "town car" to a canonical indication like
- Controller 1 10 code may also maintain its own internal state, for example, tracking entities that have been input or output over the course of the dialog. Controller 1 10 implemented in a variety of ways, including as a web service (e.g. in C# or node.j s), or run locally.
- a web service e.g. in C# or node.j s
- run locally e.g. in C# or node.j s
- the controller 1 10 may optionally return a "mask" over actions, i.e., an indication of which actions in the text are allowed and disallowed at action mask 222 through signal 223 to recurrent neural network 108.
- the code may also optionally return other features at block 210 which can be used by recurrent neural network 108.
- the other features input to neural network by signals 214 and 216 depend on whether any previous operations were performed in the loop 200 and what those operations were.
- the list of actions returned may include wildcards.
- the indication of available actions may indicate that any text output action is allowed with a wildcard indication for text output, but only certain API calls are allowed.
- Masking in the masking over available actions may take into account which entity types are available to controller 110. For example, if the entity for
- controller 110 returns additional features to neural network 108, these can be implemented as a programmatic dictionary, like ⁇ "estimated wait minutes”: 10, "user logged in”: false ⁇
- the set of features is then passed to recurrent neural network 108 along with the mask over available actions, if provided at 222.
- the set of features may include the text of the user's input at 202, an indication of which entities or types of entities were detected at 204, features returned from the developer code at 206, features returned from an API call (if the previous action was an API call), and an indication of the previous system action taken (if a previous system action was taken).
- the features can also include other items from previous time steps, however, the stateful nature of the recurrent neural network should prevent the need to do this.
- the recurrent neural network 108 performs the function of a LSTM recurrent neural network and generates a distribution over actions to take.
- the distribution may be based on the received set of features and a received mask over available actions.
- the output actions may be represented as a "flat" list, or as a generative process.
- a generative process might use a second neural network which can generate text, along with the probability of that text.
- the output actions may include references to entity types, such as
- the mask may be implemented by multiplying the raw (unmasked) action probabilities by an array of Is and 0s, with Is for allowed actions and 0s for disallowed actions. This array may then be re- normalized so the non-zero actions sum to 1. The gradients of weights with respect to these masked outputs may be well-defined, so gradient descent methods may be applied.
- Recurrent neural network 108 samples an action from the (masked) distribution of actions. The action may be sampled from the distribution in the traditional sense. This type of sampling may provide an advantage when exploring for reinforcement learning in the neural network, at the expense of some performance. In another
- the action with the maximum probability may be selected. This type sampling may provide an advantage for maximizing performance, at the expense of not exploring.
- the controller 110 is sent an indication of which action has been selected. Controller 110 may update its internal state at this point. Controller 110 may also send an indication of the selected action to recurrent neural network through signal 216 for use in as a feature. If the chosen action contains references to entity types, they are populated by the developer code at 228. For example, DESTINATION CITY in "Going to DESTINATION CITY, is that right?" may be changed to "Seattle". The selected action, with entity substitution, is then executed.
- the action type is determined. If the action is a textual action, it is output to the user as text output at 202 through signal 234. If the action is an API call, the API call is invoked at 218 through signal 232. The API call at 218 may optionally return features related to the API call to neural network 108 through signal 214. If the action is a special "LISTEN” action, control returns to 202 and the system waits for user input. Other special actions may be defined, such as “QUIT” (which causes the system to abandon the conversation), "ESCALTE” (which causes a human agent to step in on behalf of the agent). The special actions may be defined to include any other appropriate action.
- API calls may interact with external services, or may interact with the user.
- an API call could show a map, picture, or contact card to the user.
- FIGURE 3 is a flow diagram illustrating runtime operations performed by example system 104.
- FIGURE 3 illustrates operations performed by system 104 of FIGURE 1 during execution of runtime loop 200.
- FIGURE 3 is similar to FIGURE 2 but shows operations in a linear manner.
- the process begins at 302 where user input is received.
- entity extraction is performed on the user input by entity extractor 106.
- marked up text is passed to the controller 110.
- the input text and entities may also be passed to the recurrent neural network (LSTM).
- controller 110 determines the mask over actions, and at 310 the set of features and the mask are passed to the recurrent neural network 108.
- the set of features may include features as described for FIGURE 2.
- the recurrent neural network 108 provides controller 110 with the selected action based on the set of features and the mask.
- controllerl 10 updates its internal state. Controller 110 may also send an indication of the selected action to recurrent neural network 108 for use as part of a feature set, or, if the selected action contains references to entity types, populate the references.
- controller 110 determines if the selected action includes entity references. If the selected action includes entity references, controller 110 populates the references at 324 as was described in relation to FIGURE 2 and moves to operation 326. If the selected action does not include entity references the process moves from 322 to 326.
- controller 110 initiates the performance of text output at device 102 and returns to operation 308. If the selected action is not a textual action the process moves from 326 to 332.
- controller 110 performs the appropriate API call. Controller 110 may also send an indication of the API call to recurrent neural network as part of the feature set. Next at 336 the process returns to operation 308. If the selected action is not an API call the process moves to 338.
- the selected action is a "listen" action. If the selected action is a listen action, the controller 110 initiates listening for user input at 340. When user input is received the process returns from 342 to 302.
- controller 110 may direct the process appropriately depending on which of the actions is selected.
- FIGURE 4 therein is a flow diagram illustrating supervised learning operations performed by an example system according to the embodiments.
- the process of FIGURE 4 may be performed for supervised learning operations in the system 104 of FIGURE 1.
- the process of FIGURE 4 may be used improved performance of system 104 by providing example dialogs, and training the recurrent neural network 108 to mimic the example dialogs.
- the process begins at 402 where one or more sample dialogs are created.
- the dialogs maybe created by persons who are non-experts in rules languages.
- a domain expert such as a designer, program manager, marketing executive, or developer may create the one or more new sample dialogs.
- the sample dialogs may include an indication of where API calls are made and may be created in entirety by the domain expert through interaction with the current bot.
- the one or more sample dialogs also may be drawn from an existing corpus of interactions with real users or may be synthesized through interaction with a simulated user.
- the one or more sample dialogs may also be created by interacting with crowd workers, or taking existing dialogs and scrambling them.
- a supervised learning training flag is passed to controller 110.
- the run-time loop which was described in relation to FIGURE 2, is run on the one or sample dialogs in a modified loop form in performing the supervised learning (SL) of FIGURE 4.
- the controller determines if any action in the one or more sample dialogs is masked out.
- the process moves to 410. If any action in the sample dialog is masked out, this means the dialog could not be produced with the existing developer code, i.e., the dialog is inconsistent with the developer code.
- the inconsistency is reported, for example, to the developer.
- the developer may then edit the dialogs or controller code at 412.
- the process may then return from 414 to 402 to begin again.
- the SL training is then applied using recurrent neural network 108 and the entire corpus of training dialogs.
- the inputs are as described for the runtime loop of FIGURE 2, and the target outputs are the actions which appear in the training dialogs.
- the recurrent neural network 110 may use gradient descent to train the model. If the model is a distribution over a flat list of actions, categorical cross-entropy between the model output and the one-hot vector encoding of the target action may be used by the recurrent neural network as the loss function. After SL training is applied, at 422, all of the dialogs in the training corpus are then scored using the new sequence model. At 424, a check is then performed to see whether any of the target actions in the training dialogs were not assigned the highest probability by the model.
- the process moves to 428.
- the dialog turns of any disagreement are provided to the developer.
- the developer may then resolve the disagreement at 430 by changing, deleting, or adding an example dialog in the training corpus, modifying the developer code, modifying the SL learning algorithm or parameters, or modifying the entity extraction model.
- the process moves from 432 to 434.
- the developer may be provided with an indication that the new sequence model has successfully re-constructed the training dialogs.
- the SL learning cycle may then be repeated. At any time, the developer may "deploy" the trained bot, so it is available for interaction with users in the runtime loop.
- FIGURE 5A therein is a flow diagram illustrating reinforcement learning operations performed by an example system.
- FIGURE 5A shows operations to optimize performance of system 104 of FIGURE 1 in the runtime loop of FIGURE 2 through interaction with users, and adjustment of the model using reinforcement learning.
- the process of FIGURE 5 A begins at 502 where the developer defines a reward signal.
- the reward signal may be a real -valued number that indicates how "good" a system action is in a particular context.
- the rewards signal may be inferred from usage. For example, the signal may indicate whether the user achieved a desired task.
- the rewards signal may also be provided by the user providing an answer to a question at the end of a dialog such as "Did I do OK?"
- the reward signal may also be exogenous to the dialog, for example, whether the user later made a purchase sometime after the dialog completed.
- the rewards signal may be provided by a labeler who examines dialogs and scores their quality.
- the reward signal may indicate a property of the whole dialog, a portion of a dialog, or a specific turn of dialog.
- a reward at the end of the dialog might indicate a task completion for the whole dialog and a reward at a specific turn in the middle of a dialog might indicate the quality for that specific action.
- the developer defines a return for the dialog.
- the overall return for the whole dialog may be a discounted sum of the rewards at each turn.
- the discount factor may be defined by the developer, or may be set to a standard value. For example the discount factor may be set to a value such as 0.95.
- system 104 conducts a batch of dialogs.
- the batch may include one or more dialogs with one or more users.
- the users may be real users, crowd workers, or user simulations.
- the rewards, features, available actions, and actions selected from the batch are logged.
- recurrent neural network 108 makes improvements based on the rewards received during the batch. The improvement at 510 may be made using a policy gradient.
- the recurrent neural network 108 is updated and deployed.
- the batch of dialogs used for improvement may include dialogs collected in previous batches.
- some iterations of FIGURE 5A may skip collecting new dialogs, and instead rely on dialogs collected from past batches.
- FIGURE 5B is a flow diagram illustrating improvement operations for RL operations performed by an example system at operation 510 of FIGURE 5 A.
- the probabilities of masked actions are set to zero.
- a constant is added to all of the probabilities.
- the constant is added to prevent the logarithm and its derivative of the masked actions from being zero and undefined later in the process.
- the constant may be added to all action probabilities prior to taking the logarithm. This causes weights to have a zero derivative, i.e., no effect, with respect to masked actions, and other actions to be unaffected because the derivative of an additive constant is zero.
- the gradients of the action probabilities for each turn with respect to weights are determined.
- adjustment of the weights is performed in view of gradients, the return of dialog, and the estimated average of the current model.
- the gradients for each dialog may be multiplied by a "step".
- the step may correspond to the quantity (R_n-B) where R_n is the observed return for dialog n, and B is the estimated average return of the current neural network.
- B may be computed by averaging R_n in the current batch, choosing a constant, or using some form of importance sampling, such as weighted importance sampling. When importance sampling is used, either the dialogs in the current batch may be used, the most recent K dialogs, or all dialogs observed to date.
- the updated recurrent neural network is deployed as neural network 108 at operation 512 of FIGURE 5A.
- Performance of reinforcement learning may be periodically reported to the domain expert. Also, constraints may be added which ensure that the training dialogs in the corpus are always re-constructed. For example, if the updated neural network 108 fails to re-generate a training dialog, then SL gradient descent can be applied on that dialog until it is re-generated.
- FIGURE 6 therein is a simplified block diagram of an example computing device 600.
- System 104 of FIGURE 1 may be implemented on a device such as computing device 104.
- Computing device 600 may include a server 604 having processing unit 606, a memory 610, network interfaces 602, and developer interfaces 608.
- Memory 610 may be implemented as any type of computer readable storage media, including non-volatile and volatile memory. Memory 610 is shown as including extraction programs 612, controller code 614, and neural network code 616.
- Server 604 and processing unit 606 may comprise one or more processors, or other control circuitry, or any combination of processors and control circuitry.
- Server 604 and processing unit 606 provide overall control of computing device 600 to implement the functions of an entity extractor, recurrent neural network, and controller according to the disclosed embodiments.
- Computing device 600 may also be configured to provide developer interface 608 which may be configured, for example, as developer interface 112 of FIGURE 1.
- Developer interface 608 may be configured to allow a developer overall control of management and training of computing device 600.
- Developer interface 608 may be a user interface, such as a web interface, or any other application which guides the developer.
- developer interface 608 allows the developer to enter a new dialog. As the dialog is entered, the developer interface 608 may indicate what the next system response under the current model would be, or may indicate a ranking of multiple system responses ordered by their scores. Differences between the model output and the desired output help the developer to understand the strengths and weaknesses of the current model.
- Another section of the developer interface 608 may allow the developer to browse through the dialogs which have been entered so far, highlighting dialogs which disagree with the current model.
- Developer interface 608 may also handle entity extraction.
- the developer interface 608 may provide a pointer to an external entity extraction service.
- entity extraction labeling and refinement may be performed, for example by labeling entities using the same developer interface 608 used for entering sample dialogs.
- the developer interface 608 may also allow a developer to interface computing device 600 with custom computer code.
- the custom code can be entered directly into the developer interface 608 on server 604.
- the custom code may run on a separate server, for example, on a server hosted by the developer. This latter implementation involves the developer hosting their own webserver, but provides additional control, and allows the developer to avoid disclosing the implementation of their code at the developer interface.
- example starter code may show how to structure the code and what functions to implement.
- the developer interface 608 may also allow the developer to manage the RL training.
- the developer may specify properties of reward signals, indicate whether the RL should be active or not, view graphs of performance over time, or mange other functions of the RL training.
- the developer interface 608 may allow the developer to set configuration options. These configuration options may specify the set of API calls that are available. (The API calls may also be provided or discovered programmatically). The configuration options may also include details about the HTTP endpoint on which the bot is available, authentication and subscription options, and general administration configuration options, such as which users have access to edit the bot.
- System 600 is shown as an implementation that includes server 604 as a single server for performing operations of the embodiments according to programs and code in memory 610.
- server 604 and memory 610 may be understood as representative of server functions or memory provided by one or more servers or computing devices, or storage devices, that may be co-located or geographically dispersed and that may provide the functions of the entity extraction 106, the neural network 108, and the controller 110 for other implementations of system 104.
- the controller code may be implemented on a separate server separate from the server on which the extractor and neural network code are implemented.
- server as used in this disclosure is used generally to include any computing devices or communications equipment.
- FIG. 610 The example embodiments disclosed herein may be described in the general context of processor-executable code or instructions stored on memory that may comprise one or more computer readable storage media (e.g., tangible non-transitory computer-readable storage media such as memory 610).
- computer readable storage media e.g., tangible non-transitory computer-readable storage media such as memory 610.
- the terms "computer-readable storage media” or “non-transitory computer-readable media” include the media for storing of data, code and program instructions, such as memory 610, and do not include portions of the media for storing transitory propagated or modulated data communication signals.
- processors or processing units controllers, and memory including instructions and code
- the functions and processes of the embodiments may be implemented and performed using any type of processor, circuitry or combinations of processors and/or circuitry and code.
- This may include, at least in part, one or more hardware logic components.
- illustrative types of hardware logic components include field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-a-chip systems (SOCs), complex programmable logic devices (CPLDs), etc.
- FPGAs field programmable gate arrays
- ASICs application specific integrated circuits
- ASSPs application specific standard products
- SOCs system-on-a-chip systems
- CPLDs complex programmable logic devices
- the disclosed embodiments include a system comprising one or more processor and memory in communication with the one or more processors.
- the memory comprises code, that when executed, causes the one or more processor to control the system to perform entity extraction on input text generated from a user input, determine marked-up text from the input text, determine a mask over available actions from the marked-up text, provide the mask and a set of features to a recurrent neural network, the set of features including the input text generated from the user input and an indication of a type of entity extracted in the entity extraction, the set of features further including, if a previous action of the system took place, at least one feature associated with the previous action, receive an indication of a selected action from the recurrent neural, update an internal state based on the indication of a selected action, and initiate the selected action.
- the selected action may comprise a first selected action and the first selected action comprise an application programming interface call
- the set of features may comprise a first set of features
- the code may further cause the one or more processors to control the system to provide a second set of features to the recurrent neural network, the second set of features including a feature returned from the application programming interface call, receive an indication of a second selected action from the recurrent neural network, update the internal state based on the indication of the second selected action, and initiate the second selected action.
- the set of features may comprise a first set of features and the code may further cause the one or more processors to control the system to provide a second set of features to the recurrent neural network, the second set of features including an indication of the selected action.
- the at least one feature associated with the previous action may include features that are associated with actions based on a previous set of features provided to the recurrent neural network.
- the recurrent neural network may comprise a long short term memory neural network, a standard recurrent neural network, or any other neural network or machine learning method capable of inferring a representation of state given a sequence of past observations.
- the code may control the system to initiate the selected action by controlling the one or more processors to control the system to determine that the selected action includes one or more entity references, populate the one or more entity references, and initiate the selected action based on the populated references.
- the disclosed embodiments also include method comprising performing entity extraction on input text received from a user input, determining marked-up text from the input text, determining a mask over available actions from the marked-up text, providing the mask and a set of features to a recurrent neural network, the set of features including the input text received from the user input and an indication of a type of entity extracted in the entity extraction, the set of features further including, if a previous action of the system took place, at least one feature associated with the previous action, receiving an indication of a selected action from the recurrent neural network, updating an internal state based on the indication of a selected action, and initiating the selected action.
- the selected action may comprise a first selected action and the first selected action may comprise an application programming interface call
- the set of features may comprise a first set of features
- the method may further comprise providing a second set of features to the recurrent neural network, the second set of features including a feature returned from the application programming interface call, receiving an indication of a second selected action from the recurrent neural network, updating the internal state based on the indication of the second selected action, and initiating the second selected action.
- the set of features may comprise a first set of features and the method may further comprises providing a second set of features to the recurrent neural network, the second set of features including an indication of the selected action.
- the at least one feature associated with the previous action may include features that are associated with actions based on a previous set of features provided to the recurrent neural network.
- the recurrent neural network comprises a long short term memory neural network.
- the initiating the selected action may comprise determining that the selected action includes one or more entity references, populating the one or more entity references, and initiating the selected action based at least in part on the populated references.
- the disclosed embodiments also include a system comprising one or more processors and memory in communication with the one or more processors.
- the memory may comprise code, that when executed, causes the one or more processor to control the system to receive one or more sample dialogs, determine if any action in the one or more sample dialogs is masked out, and, in response to a determination that no action in the one or more sample dialogs is masked out, incorporate the one or more sample dialogs into a training set, create a log including a set of features and entity extractions, apply training using the training set and the log in a recurrent neural network, score the one or more sample dialogs using the recurrent neural network to generate a score result based on the training, and determine if a target action in the one or more sample dialogs was not assigned a highest probability in the score result.
- the code may further cause the one or more processors to control the system to provide, in response to a determination that a target action in the one or more sample dialogs was not assigned a highest probability in the score result, an indication of a dialog of the one or more sample dialogs in which the target action was not assigned a highest probability.
- the code further causes the one or more processors to control the system to provide, in response to a determination that each target action in the one or more sample dialogs was assigned a highest probability in the score result, an indication that the one or more sample dialogs were reconstructed successfully.
- the code further causes the one or more processor to control the system to provide, in response to a determination that an action in the one or more sample dialogs is masked out, an indication of the action in the one or more sample dialogs that is masked out at a user output.
- the disclosed embodiments also include a system comprising one or more processors and memory in communication with the one or more processors.
- the memory may comprise code, that when executed, causes the one or more processor to control the system to receive a definition for a reward signal and a return for one or more dialogs, perform the one or more dialogs using a recurrent neural network, create a log including rewards, features, available actions, and actions for the performed one or more dialogs, provide the rewards for the performed one or more dialogs to the neural network for use in improvement of the neural network, and provide the log for output at a user interface.
- the reward signal may be a real valued number indicating a quality of a system action at each of a plurality of turns of the one or more dialogs for a selected context and the return is a discounted sum of the rewards at each turn of the one or more dialogs.
- the one or more dialogs may comprise a first one or more dialogs
- the log may comprise a first log
- the code further may causes the one or more processor to control the system to perform a second one or more dialogs using the recurrent neural network subsequent to providing the return for the performed first one or more dialogs, create a second log including rewards, features, available actions, and actions for the performed second one or more dialogs, and provide the rewards for the performed second one or more dialogs to the neural network based on the second log for use in improvement of the neural network.
- the code may further cause the one or more processor to control the recurrent neural network to set an action probability of each masked action to zero, add a constant to an action probability of each available action and the action probability of each masked action, determine a gradient of each of the action probabilities for each turn of dialog with respect to a weight of the action probability, and adjust the weight of each of the action probabilities in view of its gradient, the return of the one or more dialogs, and an estimated average of the current model.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- General Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Evolutionary Computation (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Biophysics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Life Sciences & Earth Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Machine Translation (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US15/154,017 US10949748B2 (en) | 2016-05-13 | 2016-05-13 | Deep learning of bots through examples and experience |
| PCT/US2017/031460 WO2017196689A1 (en) | 2016-05-13 | 2017-05-06 | Deep learning of bots through examples and experience |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP3455795A1 true EP3455795A1 (en) | 2019-03-20 |
| EP3455795B1 EP3455795B1 (en) | 2025-01-01 |
Family
ID=58709650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP17723910.0A Active EP3455795B1 (en) | 2016-05-13 | 2017-05-06 | Deep learning of bots through examples and experience |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US10949748B2 (en) |
| EP (1) | EP3455795B1 (en) |
| CN (1) | CN109074514B (en) |
| WO (1) | WO2017196689A1 (en) |
Families Citing this family (40)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6461058B2 (en) * | 2016-09-06 | 2019-01-30 | 国立大学法人京都大学 | Voice dialogue apparatus and automatic dialogue method using voice dialogue apparatus |
| CN107885756B (en) * | 2016-09-30 | 2020-05-08 | 华为技术有限公司 | Dialogue method, device and device based on deep learning |
| US10824798B2 (en) | 2016-11-04 | 2020-11-03 | Semantic Machines, Inc. | Data collection for a new conversational dialogue system |
| US10713288B2 (en) | 2017-02-08 | 2020-07-14 | Semantic Machines, Inc. | Natural language content generator |
| US11069340B2 (en) * | 2017-02-23 | 2021-07-20 | Microsoft Technology Licensing, Llc | Flexible and expandable dialogue system |
| WO2018156978A1 (en) * | 2017-02-23 | 2018-08-30 | Semantic Machines, Inc. | Expandable dialogue system |
| US10762892B2 (en) | 2017-02-23 | 2020-09-01 | Semantic Machines, Inc. | Rapid deployment of dialogue system |
| US11763143B2 (en) | 2017-04-19 | 2023-09-19 | AIBrain Corporation | Adding deep learning based AI control |
| US10802453B2 (en) * | 2017-06-02 | 2020-10-13 | Bank Of America Corporation | Robotics process automation macro bot |
| US11132499B2 (en) | 2017-08-28 | 2021-09-28 | Microsoft Technology Licensing, Llc | Robust expandable dialogue system |
| US10424302B2 (en) * | 2017-10-12 | 2019-09-24 | Google Llc | Turn-based reinforcement learning for dialog management |
| CN110730952B (en) * | 2017-11-03 | 2021-08-31 | 腾讯科技(深圳)有限公司 | Method and system for handling audio communications over a network |
| US11568236B2 (en) | 2018-01-25 | 2023-01-31 | The Research Foundation For The State University Of New York | Framework and methods of diverse exploration for fast and safe policy improvement |
| US20190340527A1 (en) * | 2018-05-07 | 2019-11-07 | Microsoft Technology Licensing, Llc | Graphical user interface features for updating a conversational bot |
| CN108763565B (en) * | 2018-06-04 | 2022-06-14 | 广东京信软件科技有限公司 | Deep learning-based data automatic association matching construction method |
| US11257254B2 (en) * | 2018-07-20 | 2022-02-22 | Google Llc | Data compression using conditional entropy models |
| CN109068350B (en) * | 2018-08-15 | 2021-09-28 | 西安电子科技大学 | Terminal autonomous network selection system and method for wireless heterogeneous network |
| US10832659B2 (en) | 2018-08-31 | 2020-11-10 | International Business Machines Corporation | Intent authoring using weak supervision and co-training for automated response systems |
| US20200081939A1 (en) * | 2018-09-11 | 2020-03-12 | Hcl Technologies Limited | System for optimizing detection of intent[s] by automated conversational bot[s] for providing human like responses |
| US10831799B2 (en) | 2018-12-05 | 2020-11-10 | International Business Machines Corporation | External action execution with conversational agent |
| US11521114B2 (en) | 2019-04-18 | 2022-12-06 | Microsoft Technology Licensing, Llc | Visualization of training dialogs for a conversational bot |
| US11106875B2 (en) | 2019-05-20 | 2021-08-31 | International Business Machines Corporation | Evaluation framework for intent authoring processes |
| US11144727B2 (en) | 2019-05-20 | 2021-10-12 | International Business Machines Corporation | Evaluation framework for intent authoring processes |
| KR102917009B1 (en) | 2019-07-26 | 2026-01-23 | 삼성전자주식회사 | Learning method of artificial intelligence model and electronic apparatus |
| US11593709B2 (en) * | 2019-10-15 | 2023-02-28 | UiPath, Inc. | Inserting and/or replacing machine learning models in a pipeline for robotic process automation workflows |
| US11380306B2 (en) | 2019-10-31 | 2022-07-05 | International Business Machines Corporation | Iterative intent building utilizing dynamic scheduling of batch utterance expansion methods |
| US11429869B2 (en) | 2019-11-21 | 2022-08-30 | International Business Machines Corporation | Artificially intelligent interaction agent |
| US11481267B2 (en) | 2020-05-28 | 2022-10-25 | International Business Machines Corporation | Reinforcement learning approach to root cause analysis |
| US12283270B2 (en) * | 2020-12-04 | 2025-04-22 | Google Llc | Example-based voice bot development techniques |
| US11804211B2 (en) * | 2020-12-04 | 2023-10-31 | Google Llc | Example-based voice bot development techniques |
| US11735165B2 (en) * | 2020-12-11 | 2023-08-22 | Beijing Didi Infinity Technology And Development Co., Ltd. | Task-oriented dialog system and method through feedback |
| US11902222B2 (en) | 2021-02-08 | 2024-02-13 | Google Llc | Updating trained voice bot(s) utilizing example-based voice bot development techniques |
| US12277190B2 (en) | 2021-04-29 | 2025-04-15 | Karan Walia | Web task automation with vectorization |
| US12282801B2 (en) | 2021-08-05 | 2025-04-22 | Karan Walia | Instruction interpretation for web task automation |
| US12236191B2 (en) | 2021-08-05 | 2025-02-25 | Karan Walia | Workflow instruction interpretation for web task automation |
| US11889153B2 (en) | 2022-05-11 | 2024-01-30 | Bank Of America Corporation | System and method for integration of automatic response generating systems with non-API applications |
| US12147788B2 (en) | 2022-05-11 | 2024-11-19 | Bank Of America Corporation | System and method for intelligently generating code for use in integrating automated response generating systems with non-API applications |
| US11977779B2 (en) | 2022-05-11 | 2024-05-07 | Bank Of America Corporation | Smart queue for distributing user requests to automated response generating systems |
| US12332730B2 (en) | 2022-10-11 | 2025-06-17 | Cisco Technology, Inc. | Error context for bot optimization |
| US12334049B2 (en) | 2022-12-05 | 2025-06-17 | Google Llc | Unstructured description-based chatbot development techniques |
Family Cites Families (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4686905B2 (en) * | 2000-07-21 | 2011-05-25 | パナソニック株式会社 | Dialog control method and apparatus |
| US8015143B2 (en) | 2002-05-22 | 2011-09-06 | Estes Timothy W | Knowledge discovery agent system and method |
| US7606714B2 (en) * | 2003-02-11 | 2009-10-20 | Microsoft Corporation | Natural language classification within an automated response system |
| US20070203869A1 (en) * | 2006-02-28 | 2007-08-30 | Microsoft Corporation | Adaptive semantic platform architecture |
| US20140279050A1 (en) | 2008-05-21 | 2014-09-18 | The Delfin Project, Inc. | Dynamic chatbot |
| WO2010078614A1 (en) | 2009-01-08 | 2010-07-15 | Relevancenow Pty Limited | Chatbots |
| US8793119B2 (en) | 2009-07-13 | 2014-07-29 | At&T Intellectual Property I, L.P. | System and method for generating manually designed and automatically optimized spoken dialog systems |
| JP6084037B2 (en) * | 2009-12-14 | 2017-02-22 | アビニシオ テクノロジー エルエルシー | Specifying user interface elements |
| CA2747153A1 (en) | 2011-07-19 | 2013-01-19 | Suleman Kaheer | Natural language processing dialog system for obtaining goods, services or information |
| US9558275B2 (en) * | 2012-12-13 | 2017-01-31 | Microsoft Technology Licensing, Llc | Action broker |
| CN107112013B (en) | 2014-09-14 | 2020-10-23 | 谷歌有限责任公司 | Platform for creating customizable dialog system engines |
| CN105068661B (en) * | 2015-09-07 | 2018-09-07 | 百度在线网络技术(北京)有限公司 | Man-machine interaction method based on artificial intelligence and system |
| CN105224502A (en) * | 2015-09-28 | 2016-01-06 | 浪潮(北京)电子信息产业有限公司 | A kind of degree of depth learning method based on GPU and system |
| CN105354375A (en) * | 2015-10-27 | 2016-02-24 | 利诚服装集团股份有限公司 | Design method of expert knowledge base oriented to intelligent garment manufacturing |
| WO2017096079A1 (en) * | 2015-12-01 | 2017-06-08 | Google Inc. | Selecting action slates using reinforcement learning |
-
2016
- 2016-05-13 US US15/154,017 patent/US10949748B2/en active Active
-
2017
- 2017-05-06 CN CN201780028527.7A patent/CN109074514B/en active Active
- 2017-05-06 EP EP17723910.0A patent/EP3455795B1/en active Active
- 2017-05-06 WO PCT/US2017/031460 patent/WO2017196689A1/en not_active Ceased
Also Published As
| Publication number | Publication date |
|---|---|
| CN109074514B (en) | 2022-04-15 |
| EP3455795B1 (en) | 2025-01-01 |
| US20170330077A1 (en) | 2017-11-16 |
| US10949748B2 (en) | 2021-03-16 |
| CN109074514A (en) | 2018-12-21 |
| WO2017196689A1 (en) | 2017-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10949748B2 (en) | Deep learning of bots through examples and experience | |
| JP7851913B2 (en) | Techniques for providing explanations about text classification | |
| CN115398437B (en) | Improved Out-of-Domain (OOD) Detection Technology | |
| CN114424185B (en) | Stop word data augmentation for natural language processing | |
| CN116724305B (en) | Integration of contextual tags with named entity recognition models | |
| CN112567394B (en) | Techniques for building knowledge graphs in limited knowledge domains | |
| US20210304075A1 (en) | Batching techniques for handling unbalanced training data for a chatbot | |
| CN116583837B (en) | Distance-based LOGIT values for natural language processing | |
| CN116547676B (en) | Augmented logit for natural language processing | |
| US9495331B2 (en) | Advanced system and method for automated-context-aware-dialog with human users | |
| WO2022159461A1 (en) | Multi-factor modelling for natural language processing | |
| JP2026062684A (en) | Out-of-Domain Data Augmentation for Natural Language Processing | |
| CN118140230A (en) | Fine-tuning a multi-head network of a single transformer layer of a pre-trained language model | |
| JP2023544328A (en) | Chatbot automatic out-of-scope transition | |
| CN118265981B (en) | Systems and techniques for handling long text for pre-trained language models | |
| CN116490879A (en) | Method and system for overprediction in neural networks | |
| CN118235143A (en) | Path deactivation for natural language processing | |
| CN119183573A (en) | Entity-aware data enhancement technology | |
| CN119129646A (en) | Information interaction method, device, electronic device and storage medium | |
| KR20240091214A (en) | Rule-based techniques for extracting question and answer pairs from data | |
| Le et al. | Generating predictable and adaptive dialog policies in single-and multi-domain goal-oriented dialog systems | |
| CN116235164B (en) | Automatic conversion outside the scope of chatbots | |
| JP2025530343A (en) | Objective function optimization in target-based hyperparameter tuning | |
| CN121072665A (en) | Training method and device of intelligent collecting robot and electronic equipment | |
| JP2025528391A (en) | Adaptive training data augmentation to facilitate training of named entity recognition models |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
| PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
| 17P | Request for examination filed |
Effective date: 20181015 |
|
| AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| AX | Request for extension of the european patent |
Extension state: BA ME |
|
| DAV | Request for validation of the european patent (deleted) | ||
| DAX | Request for extension of the european patent (deleted) | ||
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
| 17Q | First examination report despatched |
Effective date: 20210701 |
|
| RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Free format text: PREVIOUS MAIN CLASS: G06N0003040000 Ipc: G06N0003042000 Ref document number: 602017087073 Country of ref document: DE |
|
| GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
| RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06N 3/092 20230101ALI20240423BHEP Ipc: G06N 3/09 20230101ALI20240423BHEP Ipc: G06N 3/0442 20230101ALI20240423BHEP Ipc: G06N 3/006 20230101ALI20240423BHEP Ipc: G06N 3/042 20230101AFI20240423BHEP |
|
| INTG | Intention to grant announced |
Effective date: 20240527 |
|
| GRAJ | Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
| P01 | Opt-out of the competence of the unified patent court (upc) registered |
Free format text: CASE NUMBER: APP_38147/2024 Effective date: 20240626 |
|
| GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
| INTC | Intention to grant announced (deleted) | ||
| INTG | Intention to grant announced |
Effective date: 20240830 |
|
| GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
| GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
| AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602017087073 Country of ref document: DE |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG9D |
|
| REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20250101 |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1757034 Country of ref document: AT Kind code of ref document: T Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20250423 Year of fee payment: 9 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20250423 Year of fee payment: 9 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250401 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250501 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250502 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250402 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602017087073 Country of ref document: DE |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: L10 Free format text: ST27 STATUS EVENT CODE: U-0-0-L10-L00 (AS PROVIDED BY THE NATIONAL OFFICE) Effective date: 20251112 |
|
| 26N | No opposition filed |
Effective date: 20251002 |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: H13 Free format text: ST27 STATUS EVENT CODE: U-0-0-H10-H13 (AS PROVIDED BY THE NATIONAL OFFICE) Effective date: 20251223 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250506 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250531 |
|
| REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20250531 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250101 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250506 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250531 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250531 |