Abstract: A method for learning disentangled representations of videos is presented. The method includes feeding each frame of video data into an encoder to produce a sequence of visual features, passing the sequence of visual features through a deep convolutional network to obtain a posterior of a dynamic latent variable and a posterior of a static latent variable, sampling static and dynamic representations from the posterior of the static latent variable and the posterior of the dynamic latent variable, respectively, concatenating the static and dynamic representations to be fed into a decoder to generate reconstructed sequences, and applying three regularizers to the dynamic and static latent variables to trigger representation disentanglement. To facilitate the disentangled sequential representation learning, orthogonal factorization in generative adversarial network (GAN) latent space is leveraged to pre-train a generator as a decoder in the method.

Abstract: A method for measuring experience quality. The method including: receiving key experience aspects (“KEAs”); administering pre-surveys to a representative subset of the experience audience, including an importance pre-survey requesting relative importance between the KEAs; and perception pre-survey requesting how closely perceptions align with each KEAs; calculating importance weights and perception weights based on the pre-surveys; performing a general survey process that includes surveying the experience audience to provide a quality rating indicating how well each of the KEAs was delivered based on their own experience; and calculating an Experience Index score as a measure of the quality of the experience that is an aggregation of the received quality ratings weighted by at least one of the importance weights or the perception weights.

Abstract: An optical element for incorporation into a holding device for forming an assembly for constructing an optical system comprises a body transparent to light from a used wavelength range, on which a first light passage surface and an opposing second light passage surface are formed. Each light passage surface has an optical used region for arrangement in a used beam path of the optical system and an edge region outside the optical used region and designated as an engagement region for holding elements of the holding device. Each light passage surface is of optical quality in the optical used region and has a surface shape designed in accordance with a used region specification specified by the function of the optical element in the used beam path. Light deflection structures with a geometrically defined surface design are in the edge region of at least one of the light passage surfaces.

Abstract: A computer-implemented method is provided for action localization. The method includes converting one or more video frames into person keypoints and object keypoints. The method further includes embedding position, timestamp, instance, and type information with the person keypoints and object keypoints to obtain keypoint embeddings. The method also includes predicting, by a hierarchical transformer encoder using the keypoint embeddings, human actions and bounding box information of when and where the human actions occur in the one or more video frames.

Abstract: A method for implementing deep reinforcement learning with T-cell receptor (TCR) mutation policies to generate binding TCRs recognizing target peptides for immunotherapy is presented. The method includes extracting peptides to identify a virus or tumor cells, collecting a library of TCRs from target patients, predicting, by a deep neural network, interaction scores between the extracted peptides and the TCRs from the target patients, developing a deep reinforcement learning (DRL) framework with TCR mutation policies to generate TCRs with maximum binding scores, defining reward functions based on a reconstruction-based score and a density estimation-based score, randomly sampling batches of TCRs and following a policy network to mutate the TCRs, outputting mutated TCRs, and ranking the outputted TCRs to utilize top-ranked TCR candidates to target the virus or the tumor cells for immunotherapy.

Abstract: A method for implementing deep reinforcement learning with T-cell receptor (TCR) mutation policies to generate binding TCRs recognizing target peptides for immunotherapy is presented. The method includes extracting peptides to identify a virus or tumor cells, collecting a library of TCRs from target patients, predicting, by a deep neural network, interaction scores between the extracted peptides and the TCRs from the target patients, developing a deep reinforcement learning (DRL) framework with TCR mutation policies to generate TCRs with maximum binding scores, defining reward functions based on a reconstruction-based score and a density estimation-based score, randomly sampling batches of TCRs and following a policy network to mutate the TCRs, outputting mutated TCRs, and ranking the outputted TCRs to utilize top-ranked TCR candidates to target the virus or the tumor cells for immunotherapy.

Abstract: A method for implementing deep reinforcement learning with T-cell receptor (TCR) mutation policies to generate binding TCRs recognizing target peptides for immunotherapy is presented. The method includes extracting peptides to identify a virus or tumor cells, collecting a library of TCRs from target patients, predicting, by a deep neural network, interaction scores between the extracted peptides and the TCRs from the target patients, developing a deep reinforcement learning (DRL) framework with TCR mutation policies to generate TCRs with maximum binding scores, defining reward functions based on a reconstruction-based score and a density estimation-based score, randomly sampling batches of TCRs and following a policy network to mutate the TCRs, outputting mutated TCRs, and ranking the outputted TCRs to utilize top-ranked TCR candidates to target the virus or the tumor cells for immunotherapy.

Abstract: A method for generating binding peptides presented by any given Major Histocompatibility Complex (MHC) protein is presented. The method includes, given a peptide and an MHC protein pair, enabling a Reinforcement Learning (RL) agent to interact with and exploit a peptide mutation environment by repeatedly mutating the peptide and observing an observation score of the peptide, learning to form a mutation policy, via a mutation policy network, to iteratively mutate amino acids of the peptide to obtain desired presentation scores, and generating, based on the desired presentation scores, qualified peptides and binding motifs of MHC Class I proteins.

Abstract: Methods and systems for image generation include generating a latent representation of an image, modifying the latent representation of the image based on a trained attribute classifier and a specified attribute input, and decoding the modified latent representation to generate an output image that matches the specified attribute input.

Abstract: Methods and systems for training a model include training an encoder in an unsupervised fashion based on a backward latent flow between a reference frame and a driving frame taken from a same video. A diffusion model is trained that generates a video sequence responsive to an input image and a text condition, using the trained encoder to determine a latent flow sequence and occlusion map sequence of a labeled training video.

Abstract: A method for generating binding peptides presented by any given Major Histocompatibility Complex (MHC) protein is presented. The method includes, given a peptide and an MHC protein pair, enabling a Reinforcement Learning (RL) agent to interact with and exploit a peptide mutation environment by repeatedly mutating the peptide and observing an observation score of the peptide, learning to form a mutation policy, via a mutation policy network, to iteratively mutate amino acids of the peptide to obtain desired presentation scores, and generating, based on the desired presentation scores, qualified peptides and binding motifs of MHC Class I proteins.

Abstract: A computer-implemented method for learning disentangled representations for T-cell receptors to improve immunotherapy is provided. The method includes optionally introducing a minimal number of mutations to a T-cell receptor (TCR) sequence to enable the TCR sequence to bind to a peptide, using a disentangled Wasserstein autoencoder to separate an embedding space of the TCR sequence into functional embeddings and structural embeddings, feeding the functional embeddings and the structural embeddings to a long short-term memory (LSTM) or transformer decoder, using an auxiliary classifier to predict a probability of a positive binding label from the functional embeddings and the peptide, and generating new TCR sequences with enhanced binding affinity for immunotherapy to target a particular virus or tumor.

Abstract: A system for binding peptide search for immunotherapy is presented. The system includes employing a deep neural network to predict a peptide presentation given Major Histocompatibility Complex allele sequences and peptide sequences, training a Variational Autoencoder (VAE) to reconstruct peptides by converting the peptide sequences into continuous embedding vectors, running a Monte Carlo Tree Search to generate a first set of positive peptide vaccine candidates, running a Bayesian Optimization search with the trained VAE and a Backpropagation search with the trained VAE to generate a second set of positive peptide vaccine candidates, using a sampling from a Position Weight Matrix (sPWM) to generate a third set of positive peptide vaccine candidates, screening and merging the first, second, and third sets of positive peptide vaccine candidates, and outputting qualified peptides for immunotherapy from the screened and merged sets of positive peptide vaccine candidates.

Abstract: A system for binding peptide search for immunotherapy is presented. The system includes employing a deep neural network to predict a peptide presentation given Major Histocompatibility Complex allele sequences and peptide sequences, training a Variational Autoencoder (VAE) to reconstruct peptides by converting the peptide sequences into continuous embedding vectors, running a Monte Carlo Tree Search to generate a first set of positive peptide vaccine candidates, running a Bayesian Optimization search with the trained VAE and a Backpropagation search with the trained VAE to generate a second set of positive peptide vaccine candidates, using a sampling from a Position Weight Matrix (sPWM) to generate a third set of positive peptide vaccine candidates, screening and merging the first, second, and third sets of positive peptide vaccine candidates, and outputting qualified peptides for immunotherapy from the screened and merged sets of positive peptide vaccine candidates.

Abstract: A system for binding peptide search for immunotherapy is presented. The system includes employing a deep neural network to predict a peptide presentation given Major Histocompatibility Complex allele sequences and peptide sequences, training a Variational Autoencoder (VAE) to reconstruct peptides by converting the peptide sequences into continuous embedding vectors, running a Monte Carlo Tree Search to generate a first set of positive peptide vaccine candidates, running a Bayesian Optimization search with the trained VAE and a Backpropagation search with the trained VAE to generate a second set of positive peptide vaccine candidates, using a sampling from a Position Weight Matrix (sPWM) to generate a third set of positive peptide vaccine candidates, screening and merging the first, second, and third sets of positive peptide vaccine candidates, and outputting qualified peptides for immunotherapy from the screened and merged sets of positive peptide vaccine candidates.

Abstract: A method for generating binding peptides presented by any given Major Histocompatibility Complex (MHC) protein is presented. The method includes, given a peptide and an MHC protein pair, enabling a Reinforcement Learning (RL) agent to interact with and exploit a peptide mutation environment by repeatedly mutating the peptide and observing an observation score of the peptide, learning to form a mutation policy, via a mutation policy network, to iteratively mutate amino acids of the peptide to obtain desired presentation scores, and generating, based on the desired presentation scores, qualified peptides and binding motifs of MHC Class I proteins.

Abstract: Methods and systems for disentangled data generation include accessing a dataset including pairs, each formed from a given input text structure and a given style label for the input text structures. An encoder is trained to disentangle a sequential text input into disentangled representations, including a content embedding and a style embedding, based on a subset of the dataset, using an objective function that includes a regularization term that minimizes mutual information between the content embedding and the style embedding. A generator is trained to generate a text output that includes content from the style embedding, expressed in a style other than that represented by the style embedding of the text input.

Abstract: A computer-implemented method is provided for generating new binding peptides to Major Histocompatibility Complex (MHC) proteins. The method includes training, by a processor device, a Generative Adversarial Network GAN having a generator and a discriminator only on a set of binding peptide sequences given training data comprising the set of binding peptide sequences and a set of non-binding peptide sequences. A GAN training objective includes the discriminator being iteratively updated to distinguish generated peptide sequences from sampled binding peptide sequences as fake or real and the generator being iteratively updated to fool the discriminator. The training includes optimizing the GAN training objective while learning two projection vectors for a binding class with two cross-entropy losses. A first loss discriminating binding peptide sequences in the training data from non-binding peptide sequences in the training data.

Abstract: A computer-implemented method is provided for generating new binding peptides to Major Histocompatibility Complex (MHC) proteins. The method includes training, by a processor device, a Generative Adversarial Network GAN having a generator and a discriminator only on a set of binding peptide sequences given training data comprising the set of binding peptide sequences and a set of non-binding peptide sequences. A GAN training objective includes the discriminator being iteratively updated to distinguish generated peptide sequences from sampled binding peptide sequences as fake or real and the generator being iteratively updated to fool the discriminator. The training includes optimizing the GAN training objective while learning two projection vectors for a binding class with two cross-entropy losses. A first loss discriminating binding peptide sequences in the training data from non-binding peptide sequences in the training data.

Abstract: A computer-implemented method is provided for generating new binding peptides to Major Histocompatibility Complex (MHC) proteins. The method includes training, by a processor device, a Generative Adversarial Network GAN having a generator and a discriminator only on a set of binding peptide sequences given training data comprising the set of binding peptide sequences and a set of non-binding peptide sequences. A GAN training objective includes the discriminator being iteratively updated to distinguish generated peptide sequences from sampled binding peptide sequences as fake or real and the generator being iteratively updated to fool the discriminator. The training includes optimizing the GAN training objective while learning two projection vectors for a binding class with two cross-entropy losses. A first loss discriminating binding peptide sequences in the training data from non-binding peptide sequences in the training data.