Optimizing Query Evaluations Using Reinforcement Learning for Web Search-Reference-Cited by-同舟云学术

Optimizing Query Evaluations Using Reinforcement Learning for Web Search

Published:2018-06-27 Issue: Volume: Page:
ISSN:
Container-title:The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
language:
Short-container-title:

Author:

Rosset Corby¹,Jose Damien¹,Ghosh Gargi¹,Mitra Bhaskar²,Tiwary Saurabh¹

Affiliation:

1. Microsoft AI & Research, Bellevue, WA, USA

2. Microsoft AI & Research, Cambridge, United Kingdom

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3209978.3210127

Reference29 articles.

1. Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien . 2003. Efficient query evaluation using a two-level retrieval process Proc. CIKM. ACM 426--434. 10.1145/956863.956944 Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien . 2003. Efficient query evaluation using a two-level retrieval process Proc. CIKM. ACM 426--434. 10.1145/956863.956944

2. Jake Brutlag . 2009. Speed matters for Google web search. (2009). Jake Brutlag . 2009. Speed matters for Google web search. (2009).

3. B Barla Cambazoglu Hugo Zaragoza Olivier Chapelle Jiang Chen Ciya Liao Zhaohui Zheng and Jon Degenhardt . 2010. Early exit optimizations for additive machine learned ranking systems Proc. WSDM. ACM 411--420. 10.1145/1718487.1718538 B Barla Cambazoglu Hugo Zaragoza Olivier Chapelle Jiang Chen Ciya Liao Zhaohui Zheng and Jon Degenhardt . 2010. Early exit optimizations for additive machine learned ranking systems Proc. WSDM. ACM 411--420. 10.1145/1718487.1718538

4. Dynamic Cutoff Prediction in Multi-Stage Retrieval Systems

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RLStop: A Reinforcement Learning Stopping Method for TAR;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10

2. trie-nlg: trie context augmentation to improve personalized query auto-completion for short and unseen prefixes;Data Mining and Knowledge Discovery;2023-08-07

3. Neural Network Guided Fast and Efficient Query-Based Stemming by Predicting Term Co-occurrence Statistics;SN Computer Science;2022-03-24

4. Using Conjunctions for Faster Disjunctive Top-k Queries;Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining;2022-02-11

5. Fast Semantic Matching via Flexible Contextualized Interaction;Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining;2022-02-11