Abstract: A computer-implemented method, system and computer program product for generating in-distribution samples of data for a neighborhood distribution to be used by post-hoc local explanation methods. An autoencoder is trained to generate in-distribution samples of input data for the neighborhood distribution to be used by a post-hoc local explanation method. Such training includes mapping the input data (e.g., time series data) into a latent dimension (or latent space) forming a first and a second latent code. A mixed code is then obtained by convexly combining the first and second latent codes with a random coefficient. The mixed code is then decoded with the input data masked with interpretable features to obtain conditional mixed reconstructions. Adversarial training is then performed against a discriminator in order to promote in-distribution samples by computing the reconstruction losses of the conditional mixed reconstructions as well as the discriminator losses and then minimizing such losses.

Abstract: An example operation may include one or more of generating a plurality of successive data points of an iterative simulation based on predefined checkpoints, each data point identifying an evolving state of the iterative simulation with respect to a previous data point among the successive data points, transmitting a blockchain request for validating state data within a first data point among the plurality of successive data points to a first subset of endorsing nodes of a blockchain network, and transmitting a blockchain request for validating state data within a second data point among the plurality of successive data points to a second subset of endorsing nodes which are mutually exclusive from the first subset of endorsing nodes of the blockchain network for parallel endorsement of the first and second data points.

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: An example system includes a processor to prune a machine learning model based on an importance of neurons or weights. The processor is to further permute and pack remaining neurons or weights of the pruned machine learning model to reduce an amount of ciphertext computation under a selected constraint.

Abstract: An example operation may include one or more of obtaining data of a simulation, identifying checkpoints within the simulation data, generating a plurality of sequential data structures based on the identified checkpoints, where each data structure identifies an evolving state of the simulation with respect to a previous data structure among the sequential data structures, and transmitting the generated sequential data structures to nodes of a blockchain network for inclusion in one or more data blocks within a hash-linked chain of data blocks.

Abstract: An example operation may include one or more of obtaining data of a simulation, identifying checkpoints within the simulation data, generating a plurality of sequential data structures based on the identified checkpoints, where each data structure identifies an evolving state of the simulation with respect to a previous data structure among the sequential data structures, and transmitting the generated sequential data structures to nodes of a blockchain network for inclusion in one or more data blocks within a hash-linked chain of data blocks.

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: Anomaly detection in industrial dynamic process can include receiving a set of multivariate time series data representative of sensor data obtained over time. The set of multivariate time series data can be transformed into a set of signature vectors in an embedding space. A neural network can be trained to estimate a probability distribution of the set of signature vectors in the embedding space. Streaming data can be received. The streaming data can be appended with a previously stored time series data. The appended streaming data can be transformed into an embedding. The embedding can be input into the trained neural network, the trained neural network outputting a first probability distribution score. A second probability distribution score associated with the embedding can be determined based on a given proposed probability distribution. Anomaly score can be determined based on the first probability distribution score and the second probability distribution score.

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: 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: 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, apparatus and computer program product that provides multi-phase privacy-preserving inferencing in a high throughput data environment, e.g., to facilitate fraud prediction, detection and prevention. In one embodiment, two (2) machine learning models are used, a first model that is trained in the clear on first transaction data, and a second model that is trained in the clear but on the first transaction data, and user data. The first model is used to perform inferencing in the clear on the high throughput received data. In this manner, the first model provides a first level evaluation of whether a particular transaction might be fraudulent. If a transaction is flagged in this first phase, a second more secure inference is then carried out using the second model. The inferencing performed by the second model is done on homomorphically encrypted data. Thus, only those transactions marked by the first model are passed to the second model for secure evaluation.

Abstract: Privacy-preserving homomorphic inferencing utilizes batch processing on encrypted data records. Each data record has a private data portion of interest against which the inferencing is carried out. Batch processing is enabled with respect to a set of encrypted data records by techniques that ensure that each encrypted data record has its associated private data portion in a unique location relative to the other data records. The set of encrypted data records are then summed to generate a single encrypted data record against which the inferencing is done. In a first embodiment, the private data portions of interest are selectively and uniquely positioned at runtime (when the inferencing is being applied). In a second embodiment, the private data portions of interest are initially positioned with the data-at-rest, preferably in an off-line process; thereafter, at runtime individual encrypted data records are processed as necessary to adjust the private data portions to unique positions prior to batching.

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.

Abstract: An example operation includes one or more of computing, by a data owner node, updated gradients on a loss function based on a batch of private data and previous parameters of a machine learning model associated with a blockchain, encrypting, by the data owner node, update information, recording, by the data owner, the encrypted update information as a new transaction on the blockchain, and providing the update information for an audit.

Abstract: Techniques for outside-in mapping for corpus pairs are provided. In one example, a computer-implemented method comprises: inputting first keywords associated with a first domain corpus; extracting a first keyword of the first keywords; inputting second keywords associated with a second domain corpus; generating an embedded representation of the first keyword via a trained model and generating an embedded representation of the second keywords via the trained model; and scoring a joint embedding affinity associated with a joint embedding.

Abstract: An example operation may include one or more of receiving, via a network, tag data that is read from a tag associated with a physical object and signed with a key assigned to the tag, determining, via a blockchain peer, that the signed tag data is validly signed based on a corresponding key pair of the tag which is accessible to the blockchain peer, determining, via the blockchain peer, whether the tag data satisfies of one or more predefined conditions of the physical object, and storing the determination via a blockchain database.

Abstract: A method verifies an authenticity, integrity, and provenance of outputs from steps in a process flow. One or more processor(s) validate one or more inputs to each step in a process flow by verifying at least one of a hash and a digital signature of each of the one or more inputs. The processor(s) then generate digital signatures that cover outputs of each step and the one or more inputs to each step, such that the digital signatures result in a chain of digital signatures that are used to verify an authenticity, an integrity and a provenance of outputs of the one or more steps in the process flow.

Abstract: An example operation may include one or more of generating a data frame storing content of a simulation, compressing the simulation content within the data frame based on previous simulation content stored in another data frame to generate a compressed data frame, and transmitting the compressed data frame via a blockchain request to one or more endorsing peer nodes of a blockchain network for inclusion of the compressed data frame within a hash-linked chain of blocks of the blockchain network.

Abstract: Techniques that facilitate time series analysis using machine learning are provided. In one example, a system includes a matrix generation component, a matrix factorization component and a machine learning component. The matrix generation component converts at least a first stream of time series data and a second stream of time series data (e.g., raw time series data) into a data matrix (e.g., a partially-observed similarity matrix) that comprises void data and numerical data associated with the first stream of time series data and the second stream of time series data. The matrix factorization component factorizes the data matrix into a first factorization data matrix and a second factorization data matrix. The machine learning component processes a machine learning model based on first matrix data associated with the first factorization data matrix and second matrix data associated with the second factorization data matrix.