Abstract: Systems and methods for training machine learning models based on domain constraints are disclosed. An example method includes receiving a plurality of images, each image associated with a cluster of a plurality of clusters, the plurality of clusters representing an output of a second machine learning model, assigning a label to each cluster of the plurality of clusters based at least in part on a plurality of constraints, identifying, based at least in part on the plurality of constraints, a first label mismatch for a first image, the first label mismatch indicating that the first image belongs to a first cluster but should be assigned to a second cluster different from the first cluster, reassigning the first image to the second cluster, and training the first machine learning model, based on the labeled clusters of the plurality of clusters, to predict labels associated with subsequently received image data.

Abstract: Systems and methods are disclosed for model based document image enhancement. Instead of requiring paired dirty and clean images for training a model to clean document images (which may cause privacy concerns), two models are trained on the unpaired images such that only the dirty images are accessed or only the clean images are accessed at one time. One model is a first implicit model to translate the dirty images from a source space to a latent space, and the other model is a second implicit model to translate the images from the latent space to clean images in a target space. The second implicit model is trained based on translating electronic document images in the target space to the latent space. In some implementations, the implicit models are diffusion models, such as denoising diffusion implicit models based on solving ordinary differential equations.

Abstract: A method implements hybrid artificial intelligence generated actionable recommendations. The method includes processing an event to identify an action of an event action set. The event includes an event value. The method further includes processing the event action set to generate an objective value, corresponding to the action, and a probability, corresponding to the action, and to form a model action set from the event action set. The method further includes filtering the model action set using action rule data and rule user data to generate a filtered action set. The method further includes processing, using the objective value and the probability, the filtered action set with an optimization controller to generate suggested action sets from which a selected action set is selected. The selected action set corresponds to a combined action value that satisfies the event value.

Abstract: A method optimizes questions to retain engagement. The method includes generating, using a machine learning model, a churn risk from user interaction data. The method includes selecting, when the churn risk satisfies a threshold, a field, from multiple fields, using multiple prediction confidences corresponding to multiple prediction values generated for the multiple fields. The method includes obtaining a prediction value for the field and obtaining a question, corresponding to the field, using the prediction value. The method includes presenting the question and receiving a user input in response to the question.

Abstract: A computer implemented method includes obtaining an original graph data structure including multiple stored nodes connected by multiple edges. The stored nodes include multiple operation stored nodes and multiple data stored nodes. The method further includes generating an auxiliary graph data structure from the original graph data structure. The auxiliary graph data structure includes the operation stored nodes. The method further includes executing a pattern mining tool on the auxiliary graph data structure to obtain a pattern list, traversing the auxiliary graph data structure to identify multiple instances of identified patterns in the pattern list, and presenting the instances.

Abstract: A method implements verifiable cacheable calculations. A result is calculated. The result is hashed to generate a name of the result. The result is an input of a set of inputs from which the name is generated. Each input of the set of inputs identifies one of a data set, a query, and a function. The result is stored in a cache using the name generated from hashing the result. A request is received to access the result using the name. The result is retrieved from the cache using the name generated from hashing the result corresponding to the input. The result is presented in response to the request.