Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for scalable matrix factorization. A method includes obtaining a Structured Query Language (SQL) query to create a matrix factorization model based on a set of training data, generating SQL sub-queries that don't include non-scalable functions, obtaining the set of training data, and generating a matrix factorization model based on the set of training data and the SQL sub-queries that don't include non-scalable functions.

Abstract: A method includes receiving a model analysis request from a user. The model analysis requests requesting the data processing hardware to provide one or more statistics of a model trained on a dataset. The method also includes obtaining the trained model. The trained model includes a plurality of weights. Each weight is assigned to a feature of the trained model. The model also includes determining, using the dataset and the plurality of weights, the one or more statistics of the trained model based on a linear regression of the trained model. The method includes reporting the one or more statistics of the trained model to the user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for scalable matrix factorization. A method includes obtaining a Structured Query Language (SQL) query to create a matrix factorization model based on a set of training data, generating SQL sub-queries that don't include non-scalable functions, obtaining the set of training data, and generating a matrix factorization model based on the set of training data and the SQL sub-queries that don't include non-scalable functions.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable storage media for generating personalized user models. The method includes receiving automatic speech recognition (ASR) output of speech interactions with a user, receiving an ASR transcription error model characterizing how ASR transcription errors are made, generating guesses of a true transcription and a user model via an expectation maximization (EM) algorithm based on the error model and the respective ASR output where the guesses will converge to a personalized user model which maximizes the likelihood of the ASR output. The ASR output can be unlabeled. The method can include casting speech interactions as a dynamic Bayesian network with four variables: (s), (u), (r), (m), and encoding relationships between (s), (u), (r), (m) as conditional probability tables. At each dialog turn (r) and (m) are known and (s) and (u) are hidden.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable storage media for generating personalized user models. The method includes receiving automatic speech recognition (ASR) output of speech interactions with a user, receiving an ASR transcription error model characterizing how ASR transcription errors are made, generating guesses of a true transcription and a user model via an expectation maximization (EM) algorithm based on the error model and the respective ASR output where the guesses will converge to a personalized user model which maximizes the likelihood of the ASR output. The ASR output can be unlabeled. The method can include casting speech interactions as a dynamic Bayesian network with four variables: (s), (u), (r), (m), and encoding relationships between (s), (u), (r), (m) as conditional probability tables. At each dialog turn (r) and (m) are known and (s) and (u) are hidden.

Abstract: Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.

Abstract: Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.