Efficient and Effective Tree-based and Neural Learning to Rank

被引:10
|
作者
Bruch, Sebastian [1 ]
Lucchese, Claudio [2 ]
Nardini, Franco Maria [3 ]
机构
[1] Pinecone, San Francisco, CA 94104 USA
[2] Ca Foscari Univ, Venice, Italy
[3] CNR, ISTI, Pisa, Italy
来源
FOUNDATIONS AND TRENDS IN INFORMATION RETRIEVAL | 2023年 / 17卷 / 01期
关键词
INFORMATION-RETRIEVAL; TRAVERSAL; ENSEMBLES;
D O I
10.1561/1500000071
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As information retrieval researchers, we not only develop algorithmic solutions to hard problems, but we also insist on a proper, multifaceted evaluation of ideas. The literature on the fundamental topic of retrieval and ranking, for instance, has a rich history of studying the effectiveness of indexes, retrieval algorithms, and complex machine learning rankers, while at the same time quantifying their computational costs, from creation and training to application and inference. This is evidenced, for example, by more than a decade of research on efficient training and inference of large decision forest models in Learning to Rank (LtR). As we move towards even more complex, deep learning models in a wide range of applications, questions on efficiency have once again resurfaced with renewed urgency. Indeed, efficiency is no longer limited to time and space; instead it has found new, challenging dimensions that stretch to resource-, sample- and energy-efficiency with ramifications for researchers, users, and the environment. This monograph takes a step towards promoting the study of efficiency in the era of neural information retrieval by offering a comprehensive survey of the literature on efficiency and effectiveness in ranking, and to a limited extent, retrieval. This monograph was inspired by the parallels that exist between the challenges in neural network-based ranking solutions and their predecessors, decision forest-based LtR models, as well as the connections between the solutions the literature to date has to offer. We believe that by understanding the fundamentals underpinning these algorithmic and data structure solutions for containing the contentious relationship between efficiency and effectiveness, one can better identify future directions and more efficiently determine the merits of ideas. We also present what we believe to be important research directions in the forefront of efficiency and effectiveness in retrieval and ranking.
引用
收藏
页码:1 / 123
页数:123
相关论文
共 50 条
  • [31] A tree-based approach for efficient and accurate conjunction analysis
    Mercurio, Michael
    Singla, Puneet
    CMES - Computer Modeling in Engineering and Sciences, 2016, 111 (03): : 229 - 256
  • [32] TPOT-NN: augmenting tree-based automated machine learning with neural network estimators
    Romano, Joseph D.
    Le, Trang T.
    Fu, Weixuan
    Moore, Jason H.
    GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2021, 22 (02) : 207 - 227
  • [33] TPOT-NN: augmenting tree-based automated machine learning with neural network estimators
    Joseph D. Romano
    Trang T. Le
    Weixuan Fu
    Jason H. Moore
    Genetic Programming and Evolvable Machines, 2021, 22 : 207 - 227
  • [34] Protein pKa Prediction by Tree-Based Machine Learning
    Chen, Ada Y.
    Lee, Juyong
    Damjanovic, Ana
    Brooks, Bernard R.
    JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 2022, 18 (04) : 2673 - 2686
  • [35] Runtime Optimizations for Tree-based Machine Learning Models
    Asadi, Nima
    Lin, Jimmy
    de Vries, Arjen P.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (09) : 2281 - 2292
  • [36] A Novel Tree-Based Method for Interpretable Reinforcement Learning
    Li, Yifan
    Qi, Shuhan
    Wang, Xuan
    Zhang, Jiajia
    Cui, Lei
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2024, 18 (09)
  • [37] Tree-based interpretable machine learning of the thermodynamic phases
    Yang, Jintao
    Cao, Junpeng
    PHYSICS LETTERS A, 2021, 412
  • [38] Learning Tree-based Deep Model for Recommender Systems
    Zhu, Han
    Li, Xiang
    Zhang, Pengye
    Li, Guozheng
    He, Jie
    Li, Han
    Gai, Kun
    KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 1079 - 1088
  • [39] Tree-based Machine Learning Methods for Survey Research
    Kern, Christoph
    Klausch, Thomas
    Kreuter, Frauke
    SURVEY RESEARCH METHODS, 2019, 13 (01): : 73 - 93
  • [40] Efficient tree traversal to reduce code growth in tree-based genetic programming
    Bart Wyns
    Luc Boullart
    Journal of Heuristics, 2009, 15 : 77 - 104