Patents by Inventor Martin Szummer
Martin Szummer has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20210073638Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using a machine learning model that has been trained through reinforcement learning to select a content item. One of the methods includes receiving first data characterizing a first context in which a first content item may be presented to a first user in a presentation environment; and providing the first data as input to a long-term engagement machine learning model, the model having been trained through reinforcement learning to: receive a plurality of inputs, and process each of the plurality of inputs to generate a respective engagement score for each input that represents a predicted, time-adjusted total number of selections by the respective user of future content items presented to the respective user in the presentation environment if the respective content item is presented in the respective context.Type: ApplicationFiled: November 16, 2020Publication date: March 11, 2021Inventors: Benjamin Kenneth Coppin, Mustafa Suleyman, Thomas Chadwick Walters, Timothy Mann, Chia-Yueh Carlton Chu, Martin Szummer, Luis Carlos Cobo Rus, Jean-Francois Crespo
-
Patent number: 10839310Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using a machine learning model that has been trained through reinforcement learning to select a content item. One of the methods includes receiving first data characterizing a first context in which a first content item may be presented to a first user in a presentation environment; and providing the first data as input to a long-term engagement machine learning model, the model having been trained through reinforcement learning to: receive a plurality of inputs, and process each of the plurality of inputs to generate a respective engagement score for each input that represents a predicted, time-adjusted total number of selections by the respective user of future content items presented to the respective user in the presentation environment if the respective content item is presented in the respective context.Type: GrantFiled: July 15, 2016Date of Patent: November 17, 2020Assignee: Google LLCInventors: Benjamin Kenneth Coppin, Mustafa Suleyman, Thomas Chadwick Walters, Timothy Mann, Chia-Yueh Carlton Chu, Martin Szummer, Luis Carlos Cobo Rus, Jean-Francois Crespo
-
Publication number: 20180018580Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using a machine learning model that has been trained through reinforcement learning to select a content item. One of the methods includes receiving first data characterizing a first context in which a first content item may be presented to a first user in a presentation environment; and providing the first data as input to a long-term engagement machine learning model, the model having been trained through reinforcement learning to: receive a plurality of inputs, and process each of the plurality of inputs to generate a respective engagement score for each input that represents a predicted, time-adjusted total number of selections by the respective user of future content items presented to the respective user in the presentation environment if the respective content item is presented in the respective context.Type: ApplicationFiled: July 15, 2016Publication date: January 18, 2018Inventors: Benjamin Kenneth Coppin, Mustafa Suleyman, Thomas Chadwick Walters, Timothy Mann, Chia-Yueh Carlton Chu, Martin Szummer, Luis Carlos Cobo Rus, Jean-Francois Crespo
-
Patent number: 8380723Abstract: Inferring query intent in information retrieval is described. In an example reformulations of an initial query by a user are used to create a query neighborhood. In the example, the query neighborhood is used to identify a set of possibly related queries. First and higher order reformulations of the initial query may be used to expand the query neighborhood. In an example precision can be improved by reducing the query neighborhood to more closely related queries for example, two queries can be connected if they are often clicked for the same document. In an example two queries can be connected using a random walk and all pairs of queries that are not connected by a random walk of less than a fixed threshold are removed. The connected queries can be used to form clusters and weights can be applied in order to determine the most likely related queries.Type: GrantFiled: May 21, 2010Date of Patent: February 19, 2013Assignee: Microsoft CorporationInventors: Filip Radlinski, Martin Szummer, Nick Craswell
-
Patent number: 8346800Abstract: Content-based information retrieval is described. In an example, a query item such as an image, document, email or other item is presented and items with similar content are retrieved from a database of items. In an example, each time a query is presented, a classifier is formed based on that query and using a training set of items. For example, the classifier is formed in real-time and is formed in such a way that a limit on the proportion of the items in the database that will be retrieved is set. In an embodiment, the query item is analyzed to identify tokens in that item and subsets of those tokens are selected to form the classifier. For example, the subsets of tokens are combined using Boolean operators in a manner which is efficient for searching on particular types of database.Type: GrantFiled: April 2, 2009Date of Patent: January 1, 2013Assignee: Microsoft CorporationInventors: Martin Szummer, Andrew Fitzgibbon, Lorenzo Torresani
-
Publication number: 20110289063Abstract: Inferring query intent in information retrieval is described. In an example reformulations of an initial query by a user are used to create a query neighborhood. In the example, the query neighborhood is used to identify a set of possibly related queries. First and higher order reformulations of the initial query may be used to expand the query neighborhood. In an example precision can be improved by reducing the query neighborhood to more closely related queries for example, two queries can be connected if they are often clicked for the same document. In an example two queries can be connected using a random walk and all pairs of queries that are not connected by a random walk of less than a fixed threshold are removed. The connected queries can be used to form clusters and weights can be applied in order to determine the most likely related queries.Type: ApplicationFiled: May 21, 2010Publication date: November 24, 2011Applicant: Microsoft CorporationInventors: Filip Radlinski, Martin Szummer, Nick Craswell
-
Patent number: 8037043Abstract: An information retrieval system is described for retrieving a list of documents such as web pages or other items from a document index in response to a user query. In an embodiment a prediction engine is used to predict both explicit relevance information such as judgment labels and implicit relevance information such as click data. In an embodiment the predicted relevance information is applied to a stored utility function that describes user satisfaction with a search session. This produces utility scores for proposed lists of documents. Using the utility scores one of the lists of documents is selected. In this way different sources of relevance information are combined into a single information retrieval system in a principled and effective manner which gives improved performance.Type: GrantFiled: September 9, 2008Date of Patent: October 11, 2011Assignee: Microsoft CorporationInventors: Onno Zoeter, Michael J. Taylor, Edward Lloyd Snelson, John P. Guiver, Nicholas Craswell, Martin Szummer
-
Patent number: 7877385Abstract: Information retrieval using query-document pair information is described. In an embodiment, a click record is accessed having information about queries and documents where user clicks have been observed for query-document pairs. A click graph is either formed or accessed. This has nodes connected by edges, each node representing any of a document and a query and each edge representing at least one observed click. Given at least one first node in the click graph, a similarity measure is determined between that first node and each of one or more second nodes. The second nodes are then ranked on the basis of the similarity measure results and the ranking is used to retrieve information from the click record.Type: GrantFiled: September 21, 2007Date of Patent: January 25, 2011Assignee: Microsoft CorporationInventors: Nicholas Craswell, Martin Szummer
-
Publication number: 20100257202Abstract: Content-based information retrieval is described. In an example, a query item such as an image, document, email or other item is presented and items with similar content are retrieved from a database of items. In an example, each time a query is presented, a classifier is formed based on that query and using a training set of items. For example, the classifier is formed in real-time and is formed in such a way that a limit on the proportion of the items in the database that will be retrieved is set. In an embodiment, the query item is analyzed to identify tokens in that item and subsets of those tokens are selected to form the classifier. For example, the subsets of tokens are combined using Boolean operators in a manner which is efficient for searching on particular types of database.Type: ApplicationFiled: April 2, 2009Publication date: October 7, 2010Applicant: Microsoft CorporationInventors: Martin Szummer, Andrew Fitzgibbon, Lorenzo Torresani
-
Patent number: 7720773Abstract: We set out a graphical model for describing probability distributions over labeled partitions of an undirected graph which are conditioned on observed data. We show how to efficiently perform exact inference in these models, by exploiting the structure of the graph and adapting the sum-product and max-product algorithms. The method can be used for partitioning and labeling hand-drawn ink fragments, image data, speech data and natural language data amongst other types of data elements. A significant performance increase is obtained by labeling and partitioning simultaneously. It is also possible to partition without labeling.Type: GrantFiled: December 29, 2005Date of Patent: May 18, 2010Assignee: Microsoft CorporationInventors: Martin Szummer, Philip Cowans
-
Publication number: 20100076949Abstract: An information retrieval system is described for retrieving a list of documents such as web pages or other items from a document index in response to a user query. In an embodiment a prediction engine is used to predict both explicit relevance information such as judgment labels and implicit relevance information such as click data. In an embodiment the predicted relevance information is applied to a stored utility function that describes user satisfaction with a search session. This produces utility scores for proposed lists of documents. Using the utility scores one of the lists of documents is selected. In this way different sources of relevance information are combined into a single information retrieval system in a principled and effective manner which gives improved performance.Type: ApplicationFiled: September 9, 2008Publication date: March 25, 2010Applicant: Microsoft CorporationInventors: Onno Zoeter, Michael J. Taylor, Edward Lloyd Snelson, John P. Guiver, Nicholas Craswell, Martin Szummer
-
Patent number: 7512273Abstract: Digital ink strokes may be fragmented to form a training data set. A neighborhood graph may be formed as a plurality of connected nodes. Relevant features of the training data may be determined in each fragment such as local site features, interaction features, and/or part-label interaction features. Using a conditional random field which may include a hidden random field modeling parameters may be developed to provide a training model to determine a posterior probability of the labels given observed data. In this manner, the training model may be used to predict a label for an observed ink stroke. The modeling parameters may be learned from only a portion of the set of ink strokes in an unsupervised way. For example, many compound objects may include compositional parts. In some cases, appropriate compositional parts may be discovered or inferred during training of the model based on the training data.Type: GrantFiled: October 21, 2005Date of Patent: March 31, 2009Assignee: Microsoft CorporationInventor: Martin Szummer
-
Publication number: 20090083222Abstract: Information retrieval using query-document pair information is described. In an embodiment, a click record is accessed having information about queries and documents where user clicks have been observed for query-document pairs. A click graph is either formed or accessed. This has nodes connected by edges, each node representing any of a document and a query and each edge representing at least one observed click. Given at least one first node in the click graph, a similarity measure is determined between that first node and each of one or more second nodes. The second nodes are then ranked on the basis of the similarity measure results and the ranking is used to retrieve information from the click record.Type: ApplicationFiled: September 21, 2007Publication date: March 26, 2009Applicant: Microsoft CorporationInventors: Nicholas Craswell, Martin Szummer
-
Publication number: 20070156617Abstract: We set out a graphical model for describing probability distributions over labeled partitions of an undirected graph which are conditioned on observed data. We show how to efficiently perform exact inference in these models, by exploiting the structure of the graph and adapting the sum-product and max-product algorithms. The method can be used for partitioning and labeling hand-drawn ink fragments, image data, speech data and natural language data amongst other types of data elements. A significant performance increase is obtained by labeling and partitioning simultaneously. It is also possible to partition without labeling.Type: ApplicationFiled: December 29, 2005Publication date: July 5, 2007Applicant: Microsoft CorporationInventors: Martin Szummer, Philip Cowans
-
Publication number: 20060115145Abstract: A Bayesian approach to training in conditional random fields takes a prior distribution over the modeling parameters of interest. These prior distributions may be used to generate an approximate form of a posterior distribution over the parameters, which may be trained with example or training data. Automatic relevance determination (ARD) may be integrated in the training to automatically select relevant features of the training data. From the trained posterior distribution of the parameters, a posterior distribution over the parameters based on the training data and the prior distributions over parameters may be approximated to form a training model. Using the developed training model, a given image may be evaluated by integrating over the posterior distribution over parameters to obtain a marginal probability distribution over the labels given that observational data.Type: ApplicationFiled: November 30, 2004Publication date: June 1, 2006Applicant: Microsoft CorporationInventors: Christopher Bishop, Martin Szummer, Tonatiuh Centeno, Markus Svensen, Yuan Qi
-
Publication number: 20060098871Abstract: Digital ink strokes may be fragmented to form a training data set. A neighborhood graph may be formed as a plurality of connected nodes. Relevant features of the training data may be determined in each fragment such as local site features, interaction features, and/or part-label interaction features. Using a conditional random field which may include a hidden random field modeling parameters may be developed to provide a training model to determine a posterior probability of the labels given observed data. In this manner, the training model may be used to predict a label for an observed ink stroke. The modeling parameters may be learned from only a portion of the set of ink strokes in an unsupervised way. For example, many compound objects may include compositional parts. In some cases, appropriate compositional parts may be discovered or inferred during training of the model based on the training data.Type: ApplicationFiled: October 21, 2005Publication date: May 11, 2006Applicant: Microsoft CorporationInventor: Martin Szummer