Maarten de Rijke

Information retrieval

Author: mdr (page 2 of 11)

Special issue on Neural Information Retrieval

The Information Retrieval Journal has put out a call for contributions to a special issue on neural information retrieval. Topics for this issue include the application of neural network models in IR tasks, including but not limited to:

  • Full text document retrieval, passage retrieval, question answering
  • Web search, paid search, searching social media, entity search
  • Learning to rank combined with neural network based representation learning
  • User and task modelling, personalized search and recommendations, diversity
  • Query formulation assistance, query recommendation, conversational search
  • Multimedia and cross-media retrieval

The deadline is October 15, 2016. Here’s a PDF with the call.

We’re hiring: 3 PhD positions in Academic Search

As part of a collaborative project between the University of Amsterdam, the VU University Amsterdam, the Royal Netherlands Academy of Arts and Sciences, and Elsevier, we are looking to fill three fully funded PhD student positions in the area of academic search. Please visit the University’s vacancy page for details on the project and on how and where to apply.

Algoritmen zijn niet neutraal. En dat is maar goed ook.

David Graus en ik schreven een stukje over neutraliteit en algoritmen voor NRC en NRC.Next onder de titel “Algoritmen zijn niet neutraal. En dat is maar goed ook.” Helaas meende de redactie er een andere titel boven te moeten plakken, een titel die nogal afleidt van onze boodschap.


(NRC Handelsblad, 17 juni 2016, pagina 16.)

Neu-IR: The SIGIR 2016 Workshop on Neural Information Retrieval

The deadline for submissions to Neu-IR: The SIGIR 2016 Workshop on Neural Information Retrieval is less than three weeks away. Neu-IR will be a highly interactive full day workshop, featuring a mix of presentation and interaction formats. We welcome application papers, papers that address fundamental modeling challenges, and best practices papers. Please see for details and submission instructions.

New flyer for WSDM 2017

The important dates for WSDM 2017 (paper submission deadline, notification date) are fixed. Here’s a new flyer with the details.

WSDM 2017 Flyer 3

SIGIR 2016 tutorial on online learning to rank

Artem Grotov and I will be teaching a half-day tutorial on online learning to rank for information retrieval at SIGIR 2016.

During the past 10–15 years offline learning to rank has had a tremendous influence on information retrieval, both scientifically and in practice. Recently, as the limitations of offline learning to rank for information retrieval have become apparent, there is increased attention for online learning to rank methods for information retrieval in the community. Such methods learn from user interactions rather than from a set of labeled data that is fully available for training up front.

Today’s search engines have developed into complex systems that combines hundreds of ranking criteria with the aim of producing the optimal result list in response to users’ queries. For automatically tuning optimal combinations of large numbers of ranking criteria, learning to rank (LTR) has proved invaluable. For a given query, each document is represented by a feature vector. The features may be query dependent, document dependent or capture the relationship between the query and documents. The task of the learner is to find a model that combines these features such that, when this model is used to produce a ranking for an unseen query, user satisfaction is maximized.

Traditionally, learning to rank algorithms are trained in batch mode, on a complete dataset of query and document pairs with their associated manually created relevance labels. This setting has a number of disadvantages and is impractical in many cases. First, creating such datasets is expensive and therefore infeasible for smaller search engines, such as small web-store search engines. Second, it may be impossible for experts to annotate documents, as in the case of personalized search. Third, the relevance of documents to queries can change over time, like in a news search engine.

Online learning to rank addresses all of these issues by incrementally learning from user feedback in real time. Online learning is closely related to active learning, incremental learning, and counterfactual learning. However, online learning is more difficult because the agent has to balance exploration and exploitation: actions with unknown performance have to be explored to learn better solutions.

There is a growing body of established methods for online learning to rank for information retrieval. The time is right to organize and present this material to a broad audience of interested information retrieval researchers, whether junior or senior, whether academic or industrial. The online learning to rank methods available today have been proposed by different communities, in machine learning and information retrieval. A key aim of the tutorial is to bring these together and offer a unified perspective. To achieve this we illustrate the core and state of the art methods in online learning to rank, their theoretical foundations and real-world applications, as well as existing online learning algorithms that have not been used by information retrieval community so far.

Neu-IR: SIGIR 2016 Workshop on Neural Information Retrieval

SIGIR 2016 will feature a workshop on Neural Information Retrieval. In recent years, deep neural networks have yielded significant performance improvements in application areas such as speech recognition and computer vision. They have also had an impact in natural language applications such as machine translation, image caption generation and conversational agents. Our focus with the Neu-IR workshop is on the applicability of deep neural networks to information retrieval. There are two complementary dimensions to this: one involves demonstrating performance improvements on public or private information retrieval datasets, the other concerns thinking about deep neural network architectures and what they tell us about information retrieval problems. Neu-IR (pronounced “new IR”) will be a highly interactive full day workshop that focuses on advances and challenges along both dimensions.

See, where further information will be shared.

We’re hiring: PhD students and postdoc in learning to rank for IR

We’re looking for two PhD students and a postdoc to work on a project on learning to rank for information retrieval. The goal of the project is to lay the foundations for contextual LTR methods, which automatically construct the right ranking features based on the query context. The project will use data collected through natural interactions with a live system to extract features that might not be obvious to researchers who manually design the ones currently used for LTR.


We’re hiring: PhD student or postdoc Citizen Data Science

We’re looking to hire a PhD student or postdoc to work on citizen data science. Citizens increasingly share their lives online. Through social media experiences, opinions and reports of events are shared. In parallel, residents of cities such as Amsterdam collect data using widely available sensor technologies, to measure air quality, traffic, or trash on the street. The main question driving this project is how to make sense of these diverse types of citizen signals.

Details on how to how apply can be found on

WWW 2016 papers online

We have three full papers at WWW this year. They are all online now:

  • Alexey Borisov, Pavel Serdyukov, and Maarten de Rijke. Using metafeatures to increase the effectiveness of latent semantic models in web search. In WWW 2016: 25th International World Wide Web Conference, pages 1081-1091. ACM, April 2016. Bibtex, PDF
    Author = {Borisov, Alexey and Serdyukov, Pavel and de Rijke, Maarten},
    Booktitle = {WWW 2016: 25th International World Wide Web Conference},
    Date-Added = {2015-12-15 21:51:14 +0000},
    Date-Modified = {2016-05-22 18:00:45 +0000},
    Month = {April},
    Pages = {1081--1091},
    Publisher = {ACM},
    Title = {Using metafeatures to increase the effectiveness of latent semantic models in web search},
    Year = {2016}}

In web search, latent semantic models have been proposed to bridge the lexical gap between queries and documents that is due to the fact that searchers and content creators often use different vocabularies and language styles to express the same concept. Modern search engines simply use the outputs of latent semantic models as features for a so-called global ranker. We argue that this is not optimal, because a single value output by a latent semantic model may be insufficient to describe all aspects of the model’s prediction, and thus some information captured by the model is not used effectively by the search engine.

To increase the effectiveness of latent semantic models in web search, we propose to create metafeatures—feature vectors that describe the structure of the model’s prediction for a given query-document pair—and pass them to the global ranker along with the models’ scores. We provide simple guidelines to represent the latent semantic model’s prediction with more than a single number, and illustrate these guidelines using several latent semantic models.

We test the impact of the proposed metafeatures on a web document ranking task using four latent semantic models. Our experiments show that (1) through the use of metafeatures, the performance of each individual latent semantic model can be improved by 10.2% and 4.2% in NDCG scores at truncation levels 1 and 10; and (2) through the use of metafeatures, the performance of a combination of latent semantic models can be improved by 7.6% and 3.8% in NDCG scores at truncation levels 1 and 10, respectively.

  • Alexey Borisov, Ilya Markov, Maarten de Rijke, and Pavel Serdyukov. A neural click model for web search. In WWW 2016: 25th International World Wide Web Conference, pages 531-541. ACM, April 2016. Bibtex, PDF
    Author = {Borisov, Alexey and Markov, Ilya and de Rijke, Maarten and Serdyukov, Pavel},
    Booktitle = {WWW 2016: 25th International World Wide Web Conference},
    Date-Added = {2015-12-15 21:48:25 +0000},
    Date-Modified = {2016-05-22 18:00:26 +0000},
    Month = {April},
    Pages = {531--541},
    Publisher = {ACM},
    Title = {A neural click model for web search},
    Year = {2016}}

Understanding user browsing behavior in web search is key to improving web search effectiveness. Many click models have been proposed to explain or predict user clicks on search engine results. They are based on the probabilistic graphical model (PGM) framework, in which user behavior is represented as a sequence of observable and hidden events. The PGM framework provides a mathematically solid way to reason about a set of events given some information about other events. But the structure of the dependencies between the events has to be set manually. Different click models use different hand-crafted sets of dependencies.

We propose an alternative based on the idea of distributed representations: to represent the user’s information need and the information available to the user with a vector state. The components of the vector state are learned to represent concepts that are useful for modeling user behavior. And user behavior is modeled as a sequence of vector states associated with a query session: the vector state is initialized with a query, and then iteratively updated based on information about interactions with the search engine results. This approach allows us to directly understand user browsing behavior from click-through data, i.e., without the need for a predefined set of rules as is customary for PGM-based click models.

We illustrate our approach using a set of neural click models. Our experimental results show that the neural click model that uses the same training data as traditional PGM-based click models, has better performance on the click prediction task (i.e., predicting user click on search engine results) and the relevance prediction task (i.e., ranking documents by their relevance to a query). An analysis of the best performing neural click model shows that it learns similar concepts to those used in traditional click models, and that it also learns other concepts that cannot be designed manually.

  • Christophe Van Gysel, Maarten de Rijke, and Marcel Worring. Unsupervised, efficient and semantic expertise retrieval. In WWW 2016: 25th International World Wide Web Conference, pages 1069-1079. ACM, April 2016. Bibtex, PDF
    Author = {Van Gysel, Christophe and de Rijke, Maarten and Worring, Marcel},
    Booktitle = {WWW 2016: 25th International World Wide Web Conference},
    Date-Added = {2015-12-15 21:52:52 +0000},
    Date-Modified = {2016-05-22 18:01:03 +0000},
    Month = {April},
    Pages = {1069--1079},
    Publisher = {ACM},
    Title = {Unsupervised, efficient and semantic expertise retrieval},
    Year = {2016}}

We introduce an unsupervised discriminative model for the task of retrieving experts in online document collections. We exclusively employ textual evidence and avoid explicit feature engineering by learning distributed word representations in an unsupervised way. We compare our model to state-of-the-art unsupervised statistical vector space and probabilistic generative approaches. Our proposed log-linear model achieves the retrieval performance levels of state-of-the-art document-centric methods with the low inference cost of so-called profile-centric approaches. It yields a statistically significant improved ranking over vector space and generative models in most cases, matching the performance of supervised methods on various benchmarks. That is, by using solely text we can do as well as methods that work with external evidence and/or relevance feedback. A contrastive analysis of rankings produced by discriminative and generative approaches shows that they have complementary strengths due to the ability of the unsupervised discriminative model to perform semantic matching.

Older posts Newer posts

© 2018 Maarten de Rijke

Theme by Anders NorenUp ↑