Abstract: Methods, systems, and computer program products are provided for coordinated analysis of output scores and input features of machine learning models in different environments. An example method includes receiving a plurality of first data records and a plurality of second data records. A first plot is generated based on a first score generated by a machine learning model for each first data record and a second score generated by the machine learning model for each second data record. The first plot is displayed. A plurality of second plots associated with at least a subset of the plurality of features are generated. Each respective second plot is generated based on a respective first field associated with a respective feature from the first data records and a respective second field associated with the respective feature from the second data records. The second plots are displayed.

Abstract: Provided is a system for analyzing features associated with entities using an embedding tree, the system including at least one processor programmed or configured to receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for a plurality of entities. The processor may be programmed or configured to generate at least two embeddings based on the dataset and determine split criteria for partitioning an embedding space of at least one embedding tree associated with the dataset based on feature data associated with an entity and embedding data associated with the at least two embeddings. The processor may be programmed or configured to generate at least one embedding tree having a plurality of nodes based on the split criteria. Methods and computer program products are also provided.

Abstract: Provided is a method for detecting group activities in a network. The method may include receiving interaction data associated with a plurality of interactions. For each account identifier associated with at least one interaction, a value may be determined for each of a first set of categories, and a vector may be generated based on the value for each category. The length of each vector may be determined. At least one relational graph may be generated based on the interaction data. Each relational graph may be associated with a respective category of a second set of categories. At least one cluster of nodes may be determined based on the relational graph(s). A score for each cluster may be determined based on the length of the vector associated with the account identifier of each node of the cluster of nodes. A system and computer program product are also disclosed.

Abstract: Provided is a method for detecting group activities in a network. The method may include receiving interaction data associated with a plurality of interactions. For each account identifier associated with at least one interaction, a value may be determined for each of a first set of categories, and a vector may be generated based on the value for each category. The length of each vector may be determined. At least one relational graph may be generated based on the interaction data. Each relational graph may be associated with a respective category of a second set of categories. At least one cluster of nodes may be determined based on the relational graph(s). A score for each cluster may be determined based on the length of the vector associated with the account identifier of each node of the cluster of nodes. A system and computer program product are also disclosed.

Abstract: Described are a system, method, and computer program product for multivariate event prediction using multi-stream recurrent neural networks. The method includes receiving event data from a sample time period and generating feature vectors for each subperiod of each day. The method also includes providing the feature vectors as inputs to a set of first recurrent neural network (RNN) models and generating first outputs for each RNN node. The method further includes merging the first outputs for each same subperiod to form aggregated time-series layers. The method further includes providing the aggregated time-series layers as an input to a second RNN model and generating final outputs for each RNN node of the second RNN model.

Abstract: Systems, methods, and computer program products that obtain a plurality of features associated with a plurality of samples and a plurality of labels for the plurality of samples; generate a plurality of first predictions for the plurality of samples with a first machine learning model; generate a plurality of second predictions for the plurality of samples with a second machine learning model; generate, based on the plurality of first predictions, the plurality of second predictions, the plurality of labels, and a plurality of groups of samples of the plurality of samples; determine, based on the plurality of groups of samples, a first success rate associated with the first machine learning model and a second success rate associated with the second machine learning model; and identify, based on the first success rate and the second success rate, a weak point in the machine learning first model or the second model.

Abstract: Methods, systems, and computer program products are provided for embedding learning to provide uniformity and orthogonality of embeddings. A method may include receiving a dataset that includes a plurality of data points including a first plurality of data points having a first classification and a second plurality of data points having a second classification, generating a first normalized class mean vector of the first plurality of data instances having the first classification, generating a second normalized class mean vector of the second plurality of data instances having the second classification, performing a class rectification operation on the first plurality of data instances having the first classification and the second plurality of data instances having a second classification, and generating embeddings of the dataset based on original embedding space projections of the dataset.

Abstract: A method performed by a server computer is disclosed. The method comprises generating a binary compositional code matrix from an input matrix. The binary compositional code matrix is then converted into an integer code matrix. Each row of the integer code matrix is input into a decoder, including plurality of codebooks, to output a summed vector for each row. The method then includes inputting a derivative of each summed vector into a downstream machine learning model to output a prediction.

Abstract: Provided is a method for detecting group activities in a network. The method may include receiving interaction data associated with a plurality of interactions. For each account identifier associated with at least one interaction, a value may be determined for each of a first set of categories, and a vector may be generated based on the value for each category. The length of each vector may be determined. At least one relational graph may be generated based on the interaction data. Each relational graph may be associated with a respective category of a second set of categories. At least one cluster of nodes may be determined based on the relational graph(s). A score for each cluster may be determined based on the length of the vector associated with the account identifier of each node of the cluster of nodes. A system and computer program product are also disclosed.

Abstract: Described are a system, method, and computer program product for multivariate event prediction using multi-stream recurrent neural networks. The method includes receiving event data from a sample time period and generating feature vectors for each subperiod of each day. The method also includes providing the feature vectors as inputs to a set of first recurrent neural network (RNN) models and generating first outputs for each RNN node. The method further includes merging the first outputs for each same subperiod to form aggregated time-series layers. The method further includes providing the aggregated time-series layers as an input to a second RNN model and generating final outputs for each RNN node of the second RNN model.

Abstract: A method, system, and computer program product is provided for embedding compression and reconstruction. The method includes receiving embedding vector data comprising a plurality of embedding vectors. A beta-variational autoencoder is trained based on the embedding vector data and a loss equation. The method includes determining a respective entropy of a respective mean and a respective variance of each respective dimension of a plurality of dimensions. A first subset of the plurality of dimensions is determined based on the respective entropy of the respective mean and the respective variance for each respective dimension of the plurality of dimensions. A second subset of the plurality of dimensions is discarded based on the respective entropy of the respective mean and the respective variance for each respective dimension of the plurality of dimensions. The method includes generating a compressed representation of the embedding vector data based on the first subset of dimensions.

Abstract: A method is disclosed. The method comprises determining a time series, a subsequence length. The length of the time series may then be determined, and an initial matrix profile may then be computed. The method may then form a processed matrix profile for a first subsequence of the subsequence length by applying the first subsequence to the initial matrix profile. A second subsequence may then be determined from the processed matrix profile. The method may then include comparing the second subsequence to other subsequences in a dictionary and adding it to the dictionary. The subsequences in the dictionary may be used to generate a plurality of subsequence matrix profiles. The method may then include forming an approximate matrix profile using the plurality of subsequence matrix profiles and then determining one or more anomalies in the time series or another time series using the approximate matrix profile.

Abstract: Methods, systems, and computer program products are provided for optimizing training loss of a graph neural network machine learning model using bi-level optimization. An example method includes receiving a training dataset comprising graph data associated with a graph, training a graph neural network (GNN) machine learning model using a loss equation according to a bi-level optimization problem and based on the training dataset, where training the GNN machine learning model using the loss equation according to the bi-level optimization problem includes determining a solution to an inner loss problem and a solution to an outer loss problem, and providing a trained GNN machine learning model based on training the GNN machine learning model.

Abstract: Systems, methods, and computer program products may compare machine learning models by identifying data instances with disagreed predictions and learning from the disagreement. Based on a model interpretation technique, differences between the compared machine learning models may be interpreted. Multiple metrics to prioritize meta-features from different perspectives may also be provided.

Abstract: A method, system, and computer program product is provided for embedding compression and reconstruction. The method includes receiving embedding vector data comprising a plurality of embedding vectors. A beta-variational autoencoder is trained based on the embedding vector data and a loss equation. The method includes determining a respective entropy of a respective mean and a respective variance of each respective dimension of a plurality of dimensions. A first subset of the plurality of dimensions is determined based on the respective entropy of the respective mean and the respective variance for each respective dimension of the plurality of dimensions. A second subset of the plurality of dimensions is discarded based on the respective entropy of the respective mean and the respective variance for each respective dimension of the plurality of dimensions. The method includes generating a compressed representation of the embedding vector data based on the first subset of dimensions.

Abstract: Described are a system, method, and computer program product for debiasing embedding vectors of machine learning models. The method includes receiving embedding vectors and generating two clusters thereof. The method includes determining a first mean vector of the first cluster and a second mean vector of the second cluster. The method includes determining a bias associated with each of a plurality of first candidate vectors and replacing the first mean vector with a first candidate vector based on the bias. The method includes determining a bias associated with each of a plurality of second candidate vectors and replacing the second mean vector with a second candidate vector based on the bias. The method includes repeatedly replacing the first and second mean vectors until an extremum of the bias score is reached, and debiasing the embedding vectors by linear projection using a direction defined by the first and second mean vectors.

Abstract: Provided is a system for analyzing features associated with entities using an embedding tree, the system including at least one processor programmed or configured to receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for a plurality of entities. The processor may be programmed or configured to generate at least two embeddings based on the dataset and determine split criteria for partitioning an embedding space of at least one embedding tree associated with the dataset based on feature data associated with an entity and embedding data associated with the at least two embeddings. The processor may be programmed or configured to generate at least one embedding tree having a plurality of nodes based on the split criteria. Methods and computer program products are also provided.

Abstract: Provided is a method for normalizing embeddings for cross-embedding alignment. The method may include applying mean centering to the at least one embedding set, applying spectral normalization to the at least one embedding set, and/or applying length normalization to the at least one embedding set. Spectral normalization may include decomposing the at least one embedding set, determining an average singular value of the at least one embedding set, determining a respective substitute singular value for each respective singular value of a diagonal matrix, and/or replacing the at least one embedding set with a product of the at least one embedding set, a right singular vector, and an inverse of the substitute diagonal matrix. The mean centering, spectral normalization, and/or length normalization may be iteratively repeated for a configurable number of iterations. A system and computer program product are also disclosed.

Abstract: A method performed by a computer is disclosed. The method comprises receiving interaction data between electronic devices of a plurality of entities. The interaction data is used to form an entity interaction vector containing a number of interactions between the electronic devices of a chosen entity and an entity time series containing a plurality of metrics per unit time of the interactions. An interaction encoder of the computer can generate an interaction hidden representation of the entity interaction vector using embeddings of the plurality of entities. A temporal encoder of the computer can generate a temporal hidden representation of the entity time series. The interaction hidden representation and the temporal hidden representation can be used to generate a predicted scale and a shape estimation of a target interaction metric. The computer can then generate an estimated interaction metric of a time period using the predicted scale and the shape estimation.

Abstract: Provided is a method for normalizing embeddings for cross-embedding alignment. The method may include applying mean centering to the at least one embedding set, applying spectral normalization to the at least one embedding set, and/or applying length normalization to the at least one embedding set. Spectral normalization may include decomposing the at least one embedding set, determining an average singular value of the at least one embedding set, determining a respective substitute singular value for each respective singular value of a diagonal matrix, and/or replacing the at least one embedding set with a product of the at least one embedding set, a right singular vector, and an inverse of the substitute diagonal matrix. The mean centering, spectral normalization, and/or length normalization may be iteratively repeated for a configurable number of iterations. A system and computer program product are also disclosed.