INFORMATION-AWARE GRAPH CONTRASTIVE LEARNING
    92.
    发明公开

    公开(公告)号:US20240037402A1

    公开(公告)日:2024-02-01

    申请号:US18484862

    申请日:2023-10-11

    CPC classification number: G06N3/08

    Abstract: A method for performing contrastive learning for graph tasks and datasets by employing an information-aware graph contrastive learning framework is presented. The method includes obtaining two semantically similar views of a graph coupled with a label for training by employing a view augmentation component, feeding the two semantically similar views into respective encoder networks to extract latent representations preserving both structure and attribute information in the two views, optimizing a contrastive loss based on a contrastive mode by maximizing feature consistency between the latent representations, training a neural network with the optimized contrastive loss, and predicting a new graph label or a new node label in the graph.

    INTERPRETING CONVOLUTIONAL SEQUENCE MODEL BY LEARNING LOCAL AND RESOLUTION-CONTROLLABLE PROTOTYPES

    公开(公告)号:US20240028898A1

    公开(公告)日:2024-01-25

    申请号:US18479372

    申请日:2023-10-02

    CPC classification number: G06N3/08 G06N3/04

    Abstract: A method interprets a convolutional sequence model. The method converts an input data sequence having input segments into output features. The method clusters the input segments into clusters using respective resolution-controllable class prototypes allocated to each of classes. Each respective class prototype includes a respective output feature subset characterizing a respective associated class. The method calculates, using the clusters, similarity scores that indicate a similarity of an output feature to a respective class prototypes responsive to distances between the output feature and the respective class prototypes. The method concatenates the similarity scores to obtain a similarity vector. The method performs a prediction and prediction support operation that provides a value of prediction and an interpretation for the value responsive to the input segments and similarity vector. The interpretation for the value of prediction is provided using only non-negative weights and lacking a weight bias in the fully connected layer.

    PERSONALIZED FEDERATED LEARNING VIA HETEROGENEOUS MODULAR NETWORKS

    公开(公告)号:US20230394323A1

    公开(公告)日:2023-12-07

    申请号:US18311984

    申请日:2023-05-04

    CPC classification number: H04L41/16 H04L41/142

    Abstract: A computer-implemented method for personalizing heterogeneous clients is provided. The method includes initializing a federated modular network including a plurality of clients communicating with a server, maintaining, within the server, a heterogenous module pool having sub-blocks and a routing hypernetwork, partitioning the plurality of clients by modeling a joint distribution of each client into clusters, enabling each client to make a decision in each update to assemble a personalized model by selecting a combination of sub-blocks from the heterogenous module pool, and generating, by the routing hypernetwork, the decision for each client.

    SEMI-SUPERVISED FRAMEWORK FOR EFFICIENT TIME-SERIES ORDINAL CLASSIFICATION

    公开(公告)号:US20230252302A1

    公开(公告)日:2023-08-10

    申请号:US18152238

    申请日:2023-01-10

    CPC classification number: G06N3/0895 G06N3/0442

    Abstract: A computer-implemented method for ordinal prediction is provided. The method includes encoding time series data with a temporal encoder to obtain latent space representations. The method includes optimizing the temporal encoder using semi-supervised learning to distinguish different classes in the labeled space using labeled data, and augment the latent space representations using unlabeled training data, to obtain semi-supervised representations. The method further includes discarding a linear layer after the temporal encoder and fixing the temporal encoder. The method also includes training k−1 binary classifiers on top of the semi-supervised representations to obtain k−1 binary predictions. The method additionally includes identifying and correcting inconsistent ones of the k−1 binary predictions by matching the inconsistent ones to consistent ones of the k−1 binary predictions. The method further includes aggregating the k−1 binary predictions to obtain an ordinal prediction.

    SUPERCLASS-CONDITIONAL GAUSSIAN MIXTURE MODEL FOR PERSONALIZED PREDICTION ON DIALYSIS EVENTS

    公开(公告)号:US20230094623A1

    公开(公告)日:2023-03-30

    申请号:US17950203

    申请日:2022-09-22

    Abstract: A computer-implemented method for model building is provided. The method includes receiving a training set of medical records and model hyperparameters. The method further includes initializing an encoder as a Dual-Channel Combiner Network (DCNN) and initialize distribution related parameters. The method also includes performing, by a hardware processor, a forward computation to (1) the DCNN to obtain the embeddings of the medical records, and (2) the distribution related parameters to obtain class probabilities. The method additionally includes checking by a convergence evaluator if the iterative optimization has converged. The method further includes performing model personalization responsive to model convergence by encoding the support data of a new patient and using the embeddings and event subtype labels to train a personalized classifier.

    Node classification in dynamic networks using graph factorization

    公开(公告)号:US11606393B2

    公开(公告)日:2023-03-14

    申请号:US17004547

    申请日:2020-08-27

    Abstract: Methods and systems for detecting and responding to anomalous nodes in a network include inferring temporal factors, using a computer-implemented neural network, that represent changes in a network graph across time steps, with a temporal factor for each time step depending on a temporal factor for a previous time step. An invariant factor is inferred that represents information about the network graph that does not change across the time steps. The temporal factors and the invariant factor are combined into a combined temporal-invariant representation. It is determined that an unlabeled node is anomalous, based on the combined temporal-invariant representation. A security action is performed responsive to the determination that unlabeled node is anomalous.

Patent Agency Ranking