Balancing Exploration and Exploitation in Learning to Rank Online

No abstract is available for this paper.

• Publication year

  2011

• Venue

  European Conference on Information Retrieval

• Publication date

  2011-04-18

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-20161-5_25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The K-armed Dueling Bandits Problem

  2012influential reference
• Reducing the Probability of Bankruptcy Through Supply Chain Coordination

  2010cited by this paper
• Test Collection Based Evaluation of Information Retrieval Systems

  2010cited by this paper
• Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes

  2010cited by this paper
• Comparing the sensitivity of information retrieval metrics

  2010cited by this paper
• Developing a Test Collection for the Evaluation of Integrated Search

  2010cited by this paper
• Interactively optimizing information retrieval systems as a dueling bandits problem

  2009influential reference
• Active Sampling for Rank Learning via Optimizing the Area under the ROC Curve

  2009cited by this paper
• Efficient multiple-click models in web search

  2009influential reference
• Tailoring click models to user goals

  2009influential reference
• Learning to rank for information retrieval

  2009influential reference
• Evaluation of methods for relative comparison of retrieval systems based on clickthroughs

  2009cited by this paper
• A user browsing model to predict search engine click data from past observations.

  2008cited by this paper
• An experimental comparison of click position-bias models

  2008influential reference
• How does clickthrough data reflect retrieval quality?

  2008cited by this paper
• Learning diverse rankings with multi-armed bandits

  2008cited by this paper
• Exploration scavenging

  2008cited by this paper
• Active exploration for learning rankings from clickthrough data

  2007cited by this paper
• The Epoch-Greedy algorithm for contextual multi-armed bandits

  2007cited by this paper
• Incorporating Diversity and Density in Active Learning for Relevance Feedback

  2007cited by this paper
• LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval

  2007influential reference
• The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information

  2007cited by this paper
• Accurately interpreting clickthrough data as implicit feedback

  2005cited by this paper
• Optimizing search engines using clickthrough data

  2002cited by this paper
• A taxonomy of web search

  2002cited by this paper
• Analysis of a very large web search engine query log

  1999cited by this paper
• Learning from delayed rewards

  1995cited by this paper
• Associative search network: A reinforcement learning associative memory

  1981cited by this paper

• Measuring Service-Level Learning Effects in Search Via Query-Randomized Experiments

  2023cites this paper
• Reinforcement online learning to rank with unbiased reward shaping

  2022cites this paper
• Learning-to-learn efficiently with self-learning

  2022cites this paper
• Personalized and Dynamic top-k Recommendation System using Context Aware Deep Reinforcement Learning

  2021cites this paper
• Standing in Your Shoes: External Assessments for Personalized Recommender Systems

  2021cites this paper
• Mixture-Based Correction for Position and Trust Bias in Counterfactual Learning to Rank

  2021cites this paper
• How do Online Learning to Rank Methods Adapt to Changes of Intent?

  2021influential citation
• Optimizing Interactive Systems via Data-Driven Objectives

  2020cites this paper
• Semi-supervised Learning to Rank with Nonlinear Preference Model

  2020cites this paper
• Learning from user interactions with rankings

  2020influential citation
• Safe Exploration for Optimizing Contextual Bandits

  2020cites this paper
• Counterfactual Online Learning to Rank

  2020cites this paper
• A Contextual-Bandit Approach to Online Learning to Rank for Relevance and Diversity

  2019cites this paper
• Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity

  2019cites this paper
• Document Distance Metric Learning in an Interactive Exploration Process

  2019cites this paper
• Optimizing Ranking Models in an Online Setting

  2019influential citation
• Diverse Relevance Feedback for Time Series with Autoencoder Based Summarizations

  2018cites this paper
• Learning Data-Driven Objectives to Optimize Interactive Systems

  2018cites this paper
• Online Evaluation of Rankers Using Multileaving

  2018cites this paper
• Optimizing Interactive Systems with Data-Driven Objectives

  2018cites this paper
• Session search modeling by partially observable Markov decision process

  2018influential citation
• A I ] 8 M ay 2 01 8 Optimizing Interactive Systems with Data-Driven Objectives

  2018cites this paper
• Multi Page Search with Reinforcement Learning to Rank

  2018cites this paper
• Differentiable Unbiased Online Learning to Rank

  2018cites this paper
• Online Ranking Learning on Clusters

  2018cites this paper
• Optimizing web search engines with interactions

  2018cites this paper
• Relevance feedback and sparsity handling methods for temporal data (Zamansal veriler için ilgililik geri bildirimi ve seyreklik ele alma metotları)

  2018cites this paper
• Dynamic Search Models and Applications

  2018influential citation
• On the Collaboration Support in Information Retrieval

  2017cites this paper
• Online Learning to Rank

  2017cites this paper
• Balancing Speed and Quality in Online Learning to Rank for Information Retrieval

  2017cites this paper
• Multileaving for Online Evaluation of Rankers

  2017cites this paper
• Towards Learning Reward Functions from User Interactions

  2017cites this paper
• Diversity-based interactive learning meets multimodality

  2017cites this paper
• Probabilistic modeling in dynamic information retrieval

  2016cites this paper
• Online Evaluation for Information Retrieval

  2016cites this paper
• Online training of concept detectors for image retrieval using streaming clickthrough data

  2016cites this paper
• Click-based Hot Fixes for Underperforming Torso Queries

  2016cites this paper
• Learning to rank: new approach with the layered multi-population genetic programming on click-through features

  2016cites this paper
• Towards a game-theoretic framework for text data retrieval

  2016cites this paper
• Learning to Rank with Selection Bias in Personal Search

  2016cites this paper
• On interactive learning-to-rank for IR: Overview, recent advances, challenges, and directions

  2016cites this paper
• Online Learning to Rank for Information Retrieval: SIGIR 2016 Tutorial

  2016cites this paper
• Multi-Dueling Bandits and Their Application to Online Ranker Evaluation

  2016cites this paper
• Dynamic Information Retrieval Modeling

  2015cites this paper
• Designing States, Actions, and Rewards for Using POMDP in Session Search

  2015cites this paper
• Web pages ranking algorithm based on reinforcement learning and user feedback

  2015cites this paper
• Transfer Learning for Information Retrieval

  2015cites this paper
• Session Search by Direct Policy Learning

  2015cites this paper
• Browsing Hierarchy Construction by Minimum Evolution

  2015cites this paper
• Online Experimentation for Information Retrieval

  2014cites this paper
• Spider Monkey Optimization algorithm for numerical optimization

  2014cites this paper
• Learning to Rank

  2014cites this paper
• Online Exploration for Detecting Shifts in Fresh Intent

  2014cites this paper
• RLRAUC: Reinforcem ent learning based ranking algorithm using user clicks

  2014cites this paper
• Self-adaptive artificial bee colony

  2014cites this paper
• Incorporating query-specific feedback into learning-to-rank models

  2014cites this paper
• Diversity-driven learning for multimodal image retrieval with relevance feedback

  2014cites this paper
• "Learning to rank for information retrieval from user interactions" by K. Hofmann, S. Whiteson, A. Schuth, and M. de Rijke with Martin Vesely as coordinator

  2014influential citation
• Interactive exploratory search for multi page search results

  2013cites this paper
• Fast and reliable online learning to rank for information retrieval

  2013cites this paper
• Adaptive domain modelling for information retrieval

  2013cites this paper
• Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval

  2012cites this paper
• Search engines that learn online

  2011cites this paper
• Adapting Rankers Online

  2011cites this paper
• Contextual Bandits for Information Retrieval

  2011cites this paper
• A probabilistic method for inferring preferences from clicks

  2011cites this paper
• The University of Amsterdam at the TREC 2011 Session Track

  2011cites this paper
• UvA-DARE (Digital Academic Repository) A Contextual-Bandit Approach to Online Learning to Rank for Relevance and Diversity

  year unknowncites this paper