Microsoft Technology Licensing, LLC

Haiyuan Cao

Jianfeng Gao

Yu Wang

Xinying Song

Jinchao Li

Hui Su

Jaideep Sarkar

Yu Hu

Karan Srivastava

Prabhdeep Singh

Kunal Mukerjee

Jian-guang Lou

Weizhu Chen

Kuralmani Elango

PalaniRaj Kaliyaperumal

Zeqi Lin

Ah Young Kim

Yi Liu

Shahina Ferdous

Examples described herein generate training data for machine learning (ML) for natural language (NL) processing (such as semantic parsing for translating NL). A formula tree is generated based on sampling both a formula grammar and NL templates. Using the formula tree, an ML training data instance pair is generated comprising a formula example and an NL example. A context example may also be used during instantiation of the formula tree. An ML model is trained with training data including the ML training data instance pair, and ML output is generated from NL input. The ML output includes, for example, a machine-interpretable formula, a database querying language command, or a general programming language instruction. Some examples support context-free grammar, probabilistic context-free grammar, and/or non-context-free production rules.

Generating model training data from a domain specification

Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

Resource scheduling using machine learning

A workflow engine tool is disclosed that enables scientists and engineers to programmatically author workflows (e.g., a directed acyclic graph, 'DAG') with nearly no overhead, using a simpler script that needs almost no modifications for portability among multiple different workflow engines. This permits users to focus on the business logic of the project, avoiding the distracting tedious overhead related to workflow management (such as uploading modules, drawing edges, setting parameters, and other tasks). The workflow engine tool provides an abstraction layer on top of workflow engines, introducing a binding function that converts a programming language function (e.g., a normal python function) into a workflow module definition. The workflow engine tool infers module instances and induces edge dependencies automatically by inferring from a programming language script to build a DAG.

Workflow engine tool

Systems and methods are disclosed for intelligent scheduling of calls to sales leads, leveraging machine learning (ML) to optimize expected results. One exemplary method includes determining, using a connectivity prediction model, call connectivity rate predictions; determining timeslot resources; allocating, based at least on the call connectivity rate predictions and timeslot resources, leads to timeslots in a first time period; determining, within a timeslot and using a lead scoring model, lead prioritization among leads within the timeslot; configuring, based at least on the lead prioritization, the telephone unit with lead information for placing a phone call; and applying a contextual bandit (ML) process to update the connectivity prediction model, the lead scoring model, or both. During subsequent time periods, the updated connectivity prediction and lead scoring models are used, thereby improving expected results over time.

Intelligent scheduling tool

Growing community of inventors

Bellevue, WA, United States of America

Haiyuan Cao