Abstract: Machine learning techniques are disclosed for predicting a task event such as a service completion event based on a predefined workflow. In one aspect a method includes obtaining initial data for a service request (e.g., an account application), enriching the initial data with data from one or more repositories of an enterprise executing the service request, generating a data structure comprising independent variables extracted from the enriched data, receiving a request for a prediction of a completion time for the service request (e.g., an account opening event) at a first time during processing of the service request in accordance with each workflow, in response to receiving the request for the prediction, inputting the data structure into a machine-learning regression model, predicting, using the machine-learning regression model, a completion time for the service request, and providing the completion time for the service request.

Abstract: Machine learning techniques are disclosed for rebuilding transactions to predict cash position. In one aspect a method includes obtaining data for an original transaction, classifying the original transaction into a class of multiple classes based on the data, predicting first tranche delay days for the original transaction based on the class and the data, predicting a tranche count for the original transaction based on the class and the data, predicting a tranche interval for the original transaction based on the class and the data; and rebuilding the original transaction as one or more future transactions based on the class, the first tranche delay days, the tranche count, and tranche interval. Each of the one or more future transactions comprise an updated amount of the original transaction, an updated date upon which the original transaction is anticipated, or both.

Abstract: Techniques are disclosed as an optimization data system for eliminating correlated independent variables programmatically from data with ranked exclusion scores. The system can obtain an initial dataset comprising variables, determine a set of correlation values by analyzing linear correlation between the variables, generate a correlation matrix using at least in part the set of correlation values and corresponding variables from the initial data, calculate exclusion scores for the variables in the correlation matrix that exhibit multicollinearity, and update the initial dataset by removing at least one variable with the highest exclusion score from the variables to generate an updated dataset comprising optimized variables. The steps for correlation and elimination of variables are iterated until an updated dataset without any correlation is obtained and then a machine learning model may be trained using the updated dataset.

Abstract: A machine-learning recommendation system implemented based on game theory for providing recommendations to a first party based on their requirements while also ensuring the recommendation makes sense to a second party. The system can obtain historical data and train a machine-learning model using the historical data. The training includes playing a game between a first player and a second player. The game is played using a minmax theorem that is evaluated with a loss function comprising a first component that represents error in a prediction of a user and product combination and a second component that represents error in a prediction of a value of a product. The game is played until an equilibrium point has been reached at which a final value corresponding to a product to be recommended is determined and the machine-learning model is adapted to minimize the difference between the final value and ground truth information.