Abstract: An embodiment for generating causal association rankings for candidate events within a window of candidate events using dynamic deep neural network generated embeddings. The embodiment may automatically receive a window of candidate events including events of a first type preceding one or more target events of interest. The embodiment may automatically generate contrastive windows of candidate events, each of the contrastive windows of candidate events of the first type corresponding to a different dropped candidate event from the received window of candidate events. The embodiment may automatically identify matching historical windows of events having resulting embeddings that are close in distance to the embeddings corresponding to the embeddings of the contrastive windows and calculate a first score for each match. The embodiment may automatically identify matching incident windows and calculate a corresponding second score.

Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to a process for providing an explanation result for an analytical model. A system can comprise a memory that stores computer executable components, and a processor that executes the computer executable components stored in the memory, wherein the computer executable components can comprise an uncertainty component that determines an uncertainty score for a distribution of samples that neighbor a selected input to an analytical model, a sampling component that identifies a subset of the distribution of samples based on the uncertainty score, and an explanation component that generates an explanation of an output of the analytical model, corresponding to the selected input, based on use of a sample from the subset of the distribution of samples.

Abstract: Techniques regarding root cause analyses based on time series data are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise maintenance component that can detect a cause of failure for a mechanical system by employing a greedy hill climbing process to perform a polynomial number of conditional independence tests to determine a Granger causality between variables from time series data of the mechanical system given a conditioning set.

Abstract: An example operation may include one or more of generating, by a training participant client, a plurality of transaction proposals, each of the plurality of transaction proposals corresponding to a training iteration for machine learning model training related to stochastic gradient descent, the machine learning model training comprising a plurality of training iterations, the transaction proposals comprising a gradient calculation performed by the training participant client, transferring the plurality of transaction proposals to one or more endorser nodes or peers each comprising a verify gradient smart contract, executing, by each of the endorser nodes or peers, the verify gradient smart contract; and providing endorsements corresponding to the plurality of transaction proposals to the training participation client.

Abstract: A method, system, and computer program product, including generating, using a linear probe, confidence scores through flattened intermediate representations and theoretically-justified weighting of samples during a training of the simple model using the confidence scores of the intermediate representations.

Abstract: An example operation may include one or more of generating a hashed summary including hashes of one or more of a validation data set and hashes of data points chosen in previous iterations from producer nodes, and exposing the hashed summary to a plurality of producer nodes, receiving, iteratively, a plurality of requests from the plurality of producer nodes, respectively, where each request identifies a marginal value provided by a hash of a data sample available to a producer node, selecting a request received from a producer node based on a marginal value associated with the request, retrieving hashed data of the producer node associated with the selected request, and aggregating the hashed data of the producer node with the summary of hashes generated at one or more previous iterations to produce an updated summary, and storing the updated summary via a data block of a distributed ledger.

Abstract: In an approach to improve the efficiency of solving problem instances by utilizing a machine learning model to solve a sequential optimization problem. Embodiments of the present invention receive a sequential optimization problem for solving and utilize a random initialization to solve a first instance of the sequential optimization problem. Embodiments of the present invention learning, by a computing device a machine learning model, based on a previously stored solution to the first instance of the sequential optimization problem. Additionally, embodiments of the present invention generate, by the machine learning model, one or more subsequent approximate solutions to the sequential optimization problem; and output, by a user interface on the computing device, the one or more subsequent approximate solutions to the sequential optimization problem.

Abstract: A method, a neural network, and a computer program product are provided that provide training of neural networks with continued fractions architectures. The method includes receiving, as input to a neural network, input data and training the input data through a plurality of continued fractions layers of the neural network to generate output data. The input data is provided to each of the continued fractions layers as well as output data from a previous layer. The method further includes outputting, from the neural network, the output data. Each continued fractions layer of the continued fractions layers is configured to calculate one or more linear functions of its respective input and to generate an output that is used as the input for a subsequent continued fractions layer, each continued fractions layer configured to generate an output that is used as the input for a subsequent layer.

Abstract: Techniques regarding root cause analyses based on time series data are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise maintenance component that can detect a cause of failure for a mechanical system by employing a greedy hill climbing process to perform a polynomial number of conditional independence tests to determine a Granger causality between variables from time series data of the mechanical system given a conditioning set.

Abstract: A method, apparatus and computer program product for homomorphic inference on a decision tree (DT) model. In lieu of HE-based inferencing on the decision tree, the inferencing instead is performed on a neural network (NN), which acts as a surrogate. To this end, the neural network is trained to learn DT decision boundaries, preferably without using the original DT model data training points. During training, a random data set is applied to the DT, and expected outputs are recorded. This random data set and the expected outputs are then used to train the neural network such that the outputs of the neural network match the outputs expected from applying the original data set to the DT. Preferably, the neural network has low depth, just a few layers. HE-based inferencing on the decision tree is done using HE inferencing on the shallow neural network. The latter is computationally-efficient and is carried without the need for bootstrapping.

Abstract: An example operation may include one or more of generating, by a plurality of training participant clients, gradient calculations for machine learning model training, each of the training participant clients comprising a training dataset, converting, by a training aggregator coupled to the plurality of training participant clients, the gradient calculations to a plurality of transaction proposals, receiving, by one or more endorser nodes or peers of a blockchain network, the plurality of transaction proposals, executing, by each of the endorser nodes or peers, a verify gradient smart contract, and providing endorsements corresponding to the plurality of transaction proposals to the training aggregator.

Abstract: In an embodiment, a method for generating contrastive information for a classifier prediction comprises receiving image data representative of an input image, using a deep learning classifier model to predict a first classification for the input image, evaluating the input image using a plurality of classifier functions corresponding to respective high-level features to identify one or more of the high-level features absent from the input image, and identifying, from among the high-level features absent from the input image, a pertinent-negative feature that, if added to the input image, will result in the deep learning classifier model predicting a second classification for the modified input image, the second classification being different from the first classification. In an embodiment, the method includes creating a pertinent-positive image that is a modified version of the input image that has the first classification and fewer than all superpixels of the input image.

Abstract: Estimator mechanisms for automated computer causal effect estimation are provided. An input dataset is received that includes an initial set of covariate data. An estimation of the relevance of covariates in the initial set is performed where relevance is to one or more causal effect relationships between a given at least one action and an outcome. Based on results of the execution of the estimation, a subset of the initial set of covariates is determined that are covariates relevant to one or more causal effect relationships. A modified dataset, comprising the subset of relevant covariates and at least a portion of the input dataset is generated. The modified dataset is input to a causal effect estimator that processes the modified dataset to generate causal effect relationship estimates for specifying causal effects between the given set of actions and the outcome.

Abstract: This disclosure provides a method, apparatus and computer program product to create a full homomorphic encryption (FHE)-friendly machine learning model. The approach herein leverages a knowledge distillation framework wherein the FHE-friendly (student) ML model closely mimics the predictions of a more complex (teacher) model, wherein the teacher model is one that, relative to the student model, is more complex and that is pre-trained on large datasets. In the approach herein, the distillation framework uses the more complex teacher model to facilitate training of the FHE-friendly model, but using synthetically-generated training data in lieu of the original datasets used to train the teacher.

Abstract: A computer-implemented method, system, and non-transitory computer-readable storage medium for enhancing performance of a first model. The first model is trained with a training data set. A second model receives the training data set associated with the first model. The second model provides the first model with a hardness value associated with prediction of each data point of the training data set. The first model determines a confidence value regarding predicting each data point based on the training data set, and determines a ratio of the hardness value of a prediction of each data point by the second model with respect to the confidence value of the first model. The first model is retrained with a re-weighted training data set when the determined ratio is lower than a value of ?.

Abstract: A computer-implemented method is provided that includes learning causal relationships between two or more application micro-services, and applying the learned causal relationships to dynamically localize an application fault. First micro-service error log data corresponding to selectively injected errors is collected. A learned causal graph is generated based on the collected first micro-service error log data. Second micro-service error log data corresponding to a detected application and an ancestral matrix is built using the learned causal graph and the second micro-service error log data. The ancestral matrix is leveraged to identify the source of the error, and the micro-service associated with the identified error source is also subject to identification. A computer system and a computer program product are also provided.

Abstract: A method for training a machine learning system using conditionally independent training data includes receiving an input dataset (p(x, y, z)). A generative adversarial network, that includes a generator and a first discriminator, uses the input dataset to generate a training data (ps (xf, yf, zf)) by generating the values (xf, yf, zf). The first discriminator determines a first loss (L1) based on (xf, yf, zf) and (x, y, z). A divergence calculator modifies the training data based on a dependence measure (?). The divergence calculator includes a second discriminator and a third discriminator. Modifying the training data includes receiving a reference value ({tilde over (y)}), and computing, by the second discriminator, a second loss (L2) based on (xf, yf, zf) and (xf, {tilde over (y)}, zf). The third discriminator computes a third loss (L3) based on (yf, zf) and ({tilde over (y)}, zf). Further, a fourth loss (L4) is computed based on L2 and L3.

Abstract: An example operation may include one or more of generating, by a training participant client comprising a training dataset, a plurality of transaction proposals that each correspond to a training iteration for machine learning model training related to stochastic gradient descent, the machine learning model training comprising a plurality of training iterations, the transaction proposals comprising a gradient calculation performed by the training participant client, a batch from the private dataset, a loss function, and an original model parameter, receiving, by one or more endorser nodes of peers of a blockchain network, the plurality of transaction proposals, and evaluating each transaction proposal.

Abstract: A method, system, and computer program product, including generating a contrastive explanation for a decision of a classifier trained on structured data, highlighting an important feature that justifies the decision, and determining a minimal set of new values for features that alter the decision.

Abstract: A technique for computationally-efficient privacy-preserving homomorphic inferencing against a decision tree. Inferencing is carried out by a server against encrypted data points provided by a client. Fully homomorphic computation is enabled with respect to the decision tree by intelligently configuring the tree and the real number-valued features that are applied to the tree. To that end, and to the extent the decision tree is unbalanced, the server first balances the tree. A cryptographic packing scheme is then applied to the balanced decision tree and, in particular, to one or more entries in at least one of: an encrypted feature set, and a threshold data set, that are to be used during the decision tree evaluation process. Upon receipt of an encrypted data point, homomorphic inferencing on the configured decision tree is performed using a highly-accurate approximation comparator, which implements a “soft” membership recursive computation on real numbers, all in an oblivious manner.