Abstract: Disclosed implementations relate to using mutual constraint satisfaction to sample from different stochastic processes and identify coherent inferences across domains. In some implementations, a first domain representation of a semantic concept may be used to conditionally sample a first set of candidate second domain representations of the semantic concept from a first stochastic process. Based on second domain representation(s) of the first set, candidate third domain representations of the semantic concept may be conditionally sampled from a second stochastic process. Based on candidate third domain representation(s), a second set of candidate second domain representations of the semantic concept may be conditionally sampled from a third stochastic process. Pairs of candidate second domain representations sampled across the first and second sets may be evaluated. Based on the evaluation, second domain representation(s) of the semantic concept are selected, e.g., as input for a downstream computer process.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for determining segments from a sequence of text. One of the methods includes obtaining data representing a sequence of text; dividing the sequence of text into a plurality of sentence fragments; determining split scores comprising determining a split score for each of a plurality of pairs of sentence fragments formed from the plurality of sentence fragments; assigning one or more split positions based on the split scores; and combining the plurality of sentence fragments back into at least two segments, with a boundary of at least one of the at least two segments being identified by one of the one or more split positions, and wherein each segment comprises one or more sentence fragments.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for determining segments from a sequence of text. One of the methods includes obtaining data representing a sequence of text; dividing the sequence of text into a plurality of sentence fragments; determining classification scores comprising determining a classification score using a machine learning model for each of a plurality of pairs of sentence fragments formed from the plurality of sentence fragments; assigning one or more split positions based on the classification scores; and combining the plurality of sentence fragments back into at least two segments, with a boundary of at least one of the at least two segments being identified by one of the one or more split positions, and wherein each segment comprises one or more sentence fragments.

Abstract: An amino acid sequence of a protein is tokenized into amino acid sequence tokens. A structure of the protein is tokenized into structure tokens. At least a portion of the amino acid sequence tokens and at least a portion of the structure tokens are combined into a combined training sequence data set having an amino acid sequence track and a structure track, wherein at least a portion of the structure track of the combined training sequence data set is masked. A language machine learning model is trained using the combined training sequence data set to predict one or more identities of the masked structure track portion of the combined training sequence data set.

Abstract: Disclosed implementations relate to using mutual constraint satisfaction to sample from different stochastic processes and identify coherent inferences across domains. In some implementations, a first domain representation of a semantic concept may be used to conditionally sample a first set of candidate second domain representations of the semantic concept from a first stochastic process. Based on second domain representation(s) of the first set, candidate third domain representations of the semantic concept may be conditionally sampled from a second stochastic process. Based on candidate third domain representation(s), a second set of candidate second domain representations of the semantic concept may be conditionally sampled from a third stochastic process. Pairs of candidate second domain representations sampled across the first and second sets may be evaluated. Based on the evaluation, second domain representation(s) of the semantic concept are selected, e.g., as input for a downstream computer process.