<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main"></title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">8ADEB3B735A71B620F9EF98C79592D24</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-04-29T07:04+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract/>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Preface</head><p>QPP++ 2023: Query Performance Prediction and Its Evaluation in New Tasks is the first edition of a workshop that aims to foster a discussion within the community on how Query Performance Prediction (QPP) can be applied to new techniques in Information Retrieval (IR) and how such techniques can be exploited to define new QPP models. This first edition was hosted by the European Conference on Information Retrieval (ECIR) 2023 in Dublin (Ireland).</p><p>QPP++ 2023 received nine scientific submissions, of which seven papers (four long and three short) were accepted. Two to three program committee members reviewed each submission, and the program chairs oversaw the reviewing. The accepted papers included authors from 8 countries and 14 institutions, as some publications resulted from international collaborations. Researchers addressed the following challenges: QPP for conversational search, known-item search and passage retrieval, QPP in the learning-to-rank and neural information retrieval domains, issues with using correlation metrics to evaluate QPP, QPP evaluation using pointwise approaches, continuous evaluation, and using information theory for QPP.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Motivation</head><p>The advent of large language models and the rise of new tasks, such as conversational search, semantic search and question answering, enabled by the availability of new powerful technological tools, have led to a previously unseen rapid growth in the variety and quality of Information Retrieval (IR) systems. Several ancillary research fields have also flourished due to the scientific uptake of new Natural Language Processing (NLP) methodologies, facilitating advancement in new IR tasks. The Query Performance Prediction and Its Evaluation in New Tasks (QPP++ 2023) workshop <ref type="bibr" target="#b2">[3]</ref> aimed to further fuel such growth in the renowned and important area of Query Performance Prediction (QPP).</p><p>The QPP task is defined as estimating search effectiveness in the absence of human relevance judgments <ref type="bibr" target="#b0">[1]</ref>. Since its introduction at the beginning of the 21st century, QPP has established itself as an essential tool in numerous tasks, including model selection <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b13">14]</ref>, query suggestion <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b13">14]</ref>, and rank fusion <ref type="bibr" target="#b10">[11]</ref>. The QPP++ 2023 workshop was a collaborative effort of researchers to master the new tools made available by the NLP community and learn how to effectively use them for the QPP task. The workshop focused on applying QPP in traditional scenarios, such as ad-hoc retrieval, and in new domains, including conversational and semantic search, passage retrieval, and question answering. QPP++ 2023 also allowed the community to reexamine past weaknesses and challenges linked to the QPP task, such as its evaluation, while establishing a roadmap to organize and guide the community's future efforts to advance the QPP research field.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>QPP and Novel Search Paradigms</head><p>Given the recent developments in IR, the prediction quality of existing QPP approaches may be significantly affected in new domains and scenarios for the following three reasons. First, some of the traditional predictors exploit statistics derived from the collection <ref type="bibr" target="#b5">[6]</ref>, while new IR models often use indexes of embeddings or apply machine learning to re-rank documents <ref type="bibr" target="#b7">[8]</ref>. Second, the vast majority of the recently developed retrieval models in IR utilize semantic information that, with a few notable exceptions <ref type="bibr" target="#b8">[9,</ref><ref type="bibr" target="#b12">13]</ref>, is rarely exploited by QPP models. This, in turn, impairs the performance of traditional QPP models applied on IR systems based on new paradigms <ref type="bibr" target="#b3">[4]</ref>. Finally, QPP can be used for new processes such as selective query processing <ref type="bibr" target="#b1">[2]</ref>.</p><p>The QPP++ 2023 workshop aimed to provide a platform for the community to jointly discuss ways to address these challenges and create a better alignment between the latest technologies, retrieval models, and QPP approaches. Along with the challenges mentioned above, the recent advances in NLP present great opportunities for enhancing the state of the art in QPP. The workshop also sought to encourage collaboration between researchers to exploit these opportunities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>QPP and its Evaluation on New Tasks</head><p>The quality of QPP methods is typically evaluated by computing the correlation between the scores assigned to queries by a QPP method and the true performance values, e.g., Average Precision (AP), attained for these queries using relevance judgements. Previous research demonstrated the unreliability of this approach when multiple experimental factors (i.e., IR models, corpora, and predictors) are considered <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b11">12,</ref><ref type="bibr" target="#b4">5]</ref>. In addition, researchers demonstrated that high correlation does not necessarily translate to improved retrieval effectiveness <ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b6">7]</ref>. These issues are further exacerbated in new domains, such as question answering or conversational search, where the evaluation of the retrieval models is often more challenging. The QPP++ 2023 workshop aimed at fostering discussion in the community regarding these challenges.</p><p>The workshop provided a forum for researchers and practitioners to discuss the following key research challenges emerging following the recent advances in IR:</p><p>-Can existing QPP techniques be exploited, or which new QPP theories and models need to be devised, for new tasks, such as image retrieval, passageretrieval, question answering, and conversational search? -How can new technologies, such as contextualized embeddings, large language models, and neural networks be exploited to improve QPP? -How should QPP techniques be evaluated, including best practices, datasets, and resources? -Should QPP be evaluated in the same manner for different IR tasks? -What changes should we make to the QPP evaluation paradigm to accommodate new domains and IR techniques?</p><p>The workshop is expected to have two main outcomes:</p><p>-We intend to compile the workshop proceedings from the submitted papers. The proceedings will be published in the CEUR-WS.org proceedings series. -We intend to draft a position paper describing the roadmap identified during the discussions and submit it to the SIGIR forum. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Organization</head></div><figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head></head><label></label><figDesc>University of Padova, Italy Nicola Ferro, University of Padova, Italy Josiane Mothe, IRIT UMR5505 CNRS, INSPE, Univ. de Toulouse, France Fiana Raiber, Yahoo Research, Israel Program Committee Members PC members have been carefully chosen to represent the community, including representatives from the industry and academia. Negar Arabzadeh, University of Waterloo, Canada Fabio Giachelle, University of Padova, Italy Claudia Hauff, Spotify, Netherlands Ornella Irrera, University of Padova, Italy Stefano Marchesin, University of Padova, Italy Jian-Yun Nie, University de Montreal, Canada Haggai Roitman, eBay Research, Israel Laure Soulier, Sorbonne Université-ISIR, France Ellen Voorhees, NIST, US</figDesc><table><row><cell>Workshop Organizers</cell></row><row><cell>Guglielmo Faggioli,</cell></row></table></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>The QPP++ workshop would not have been possible without the tremendous effort of several people including the program committee members and the participants who contributed their time to making the workshop a success.</p><p>Thank you all very much! April, 2023 Guglielmo Faggioli, Nicola Ferro, Josiane Mothe, Fiana Raiber</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Estimating the query difficulty for information retrieval</title>
		<author>
			<persName><forename type="first">D</forename><surname>Carmel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Yom-Tov</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Synthesis Lectures on Information Concepts, Retrieval, and Services</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="89" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Learning to adaptively rank document retrieval system configurations</title>
		<author>
			<persName><forename type="first">R</forename><surname>Deveaud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">Z</forename><surname>Ullah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">Y</forename><surname>Nie</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Transactions on Information Systems (TOIS)</title>
		<imprint>
			<biblScope unit="volume">37</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="41" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">QPP++ 2023: Query-performance prediction and its evaluation in new tasks</title>
		<author>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Raiber</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3</idno>
		<idno>-031-28241-6\_42</idno>
		<ptr target="https://doi.org/10.1007/978-3-031-28241-6_42" />
	</analytic>
	<monogr>
		<title level="m">Advances in Information Retrieval -45th European Conference on Information Retrieval, ECIR 2023</title>
		<title level="s">Proceedings, Part III. Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Goeuriot</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Crestani</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Maistro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Joho</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Davis</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Gurrin</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">U</forename><surname>Kruschwitz</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Caputo</surname></persName>
		</editor>
		<meeting><address><addrLine>Dublin, Ireland</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">April 2-6, 2023. 2023</date>
			<biblScope unit="volume">13982</biblScope>
			<biblScope unit="page" from="388" to="391" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Query Performance Prediction for Neural IR: Are We There Yet?</title>
		<author>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Formal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Marchesin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Clinchant</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Benjamin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. ECIR</title>
				<meeting>ECIR</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">An Enhanced Evaluation Framework for Query Performance Prediction</title>
		<author>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Zendel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">S</forename><surname>Culpepper</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Scholer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. ECIR</title>
				<meeting>ECIR</meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="115" to="129" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Predicting the effectiveness of queries and retrieval systems</title>
		<author>
			<persName><forename type="first">C</forename><surname>Hauff</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="1" to="179" />
		</imprint>
		<respStmt>
			<orgName>University of Twente</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. Dissertation</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">The Combination and Evaluation of Query Performance Prediction Methods</title>
		<author>
			<persName><forename type="first">C</forename><surname>Hauff</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Azzopardi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Hiemstra</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. ECIR</title>
				<meeting>ECIR</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="301" to="312" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">An Introduction to Neural Information Retrieval</title>
		<author>
			<persName><forename type="first">B</forename><surname>Mitra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Craswell</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Foundations and Trends in Information Retrieval</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="126" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Linguistic Features to Predict Query Difficulty</title>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Tanguy</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. SIGIR</title>
				<meeting>SIGIR</meeting>
		<imprint>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="7" to="10" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Query-Performance Prediction: Setting the Expectations Straight</title>
		<author>
			<persName><forename type="first">F</forename><surname>Raiber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kurland</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. SIGIR</title>
				<meeting>SIGIR</meeting>
		<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="13" to="22" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Enhanced performance prediction of fusion-based retrieval</title>
		<author>
			<persName><forename type="first">H</forename><surname>Roitman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ICTIR &apos;</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="page" from="195" to="198" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">A Case for Improved Evaluation of Query Difficulty Prediction</title>
		<author>
			<persName><forename type="first">F</forename><surname>Scholer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Garcia</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. SIGIR</title>
				<meeting>SIGIR</meeting>
		<imprint>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="640" to="641" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Using Statistical Decision Theory and Relevance Models for Query-Performance Prediction</title>
		<author>
			<persName><forename type="first">A</forename><surname>Shtok</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Kurland</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Carmel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. SIGIR</title>
				<meeting>SIGIR</meeting>
		<imprint>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="259" to="266" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Tasks, queries, and rankers in preretrieval performance prediction</title>
		<author>
			<persName><forename type="first">P</forename><surname>Thomas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Scholer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bailey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Moffat</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ADCS</title>
		<imprint>
			<biblScope unit="page" from="1" to="4" />
			<date type="published" when="2017">2017. 2017</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
