<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Guglielmo Faggioli, University of Padova, Italy Nicola Ferro, University of Padova, Italy Josiane Mothe, IRIT UMR5505 CNRS, INSPE, Univ. de Toulouse, France Fiana Raiber, Yahoo Research</institution>
          ,
          <country country="IL">Israel</country>
        </aff>
      </contrib-group>
      <abstract>
        <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). 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>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Motivation</title>
      <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 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] 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 efectiveness in the absence of
human relevance judgments [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Since its introduction at the beginning of the
21st century, QPP has established itself as an essential tool in numerous tasks,
including model selection [
        <xref ref-type="bibr" rid="ref1 ref14">1, 14</xref>
        ], query suggestion [
        <xref ref-type="bibr" rid="ref1 ref14">1, 14</xref>
        ], and rank fusion [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
The QPP++ 2023 workshop was a collaborative efort of researchers to master
the new tools made available by the NLP community and learn how to
efectively 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 eforts to advance the
QPP research field.
QPP and Novel Search Paradigms Given the recent developments in IR, the
prediction quality of existing QPP approaches may be significantly afected in
new domains and scenarios for the following three reasons. First, some of the
traditional predictors exploit statistics derived from the collection [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], while new
IR models often use indexes of embeddings or apply machine learning to re-rank
documents [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Second, the vast majority of the recently developed retrieval
models in IR utilize semantic information that, with a few notable exceptions [
        <xref ref-type="bibr" rid="ref13 ref9">9,
13</xref>
        ], is rarely exploited by QPP models. This, in turn, impairs the performance
of traditional QPP models applied on IR systems based on new paradigms [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
Finally, QPP can be used for new processes such as selective query processing [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </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>
      <p>
        QPP and its Evaluation on New Tasks 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 [
        <xref ref-type="bibr" rid="ref12 ref5 ref7">7, 12, 5</xref>
        ]. In addition,
researchers demonstrated that high correlation does not necessarily translate to
improved retrieval efectiveness [
        <xref ref-type="bibr" rid="ref10 ref7">10, 7</xref>
        ]. 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:
– 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 diferent IR tasks?
– What changes should we make to the QPP evaluation paradigm to
accommodate new domains and IR techniques?</p>
      <sec id="sec-1-1">
        <title>The workshop is expected to have two main outcomes:</title>
        <p>– We intend to compile the workshop proceedings from the submitted papers.</p>
        <p>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>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Organization</title>
      <sec id="sec-2-1">
        <title>Workshop Organizers</title>
      </sec>
      <sec id="sec-2-2">
        <title>Program Committee Members</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Acknowledgments</title>
      <p>The QPP++ workshop would not have been possible without the tremendous
efort of several people including the program committee members and the
participants who contributed their time to making the workshop a success.</p>
      <sec id="sec-3-1">
        <title>Thank you all very much! April, 2023 Guglielmo Faggioli, Nicola Ferro,</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Carmel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yom-Tov</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Estimating the query dificulty for information retrieval</article-title>
          .
          <source>Synthesis Lectures on Information Concepts</source>
          ,
          <source>Retrieval, and Services</source>
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>89</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Deveaud</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ullah</surname>
            ,
            <given-names>M.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          :
          <article-title>Learning to adaptively rank document retrieval system configurations</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS) 37(1)</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>41</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Faggioli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raiber</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          : QPP++
          <year>2023</year>
          :
          <article-title>Query-performance prediction and its evaluation in new tasks</article-title>
          . In: Kamps,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Goeuriot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Crestani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Maistro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Joho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Gurrin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Kruschwitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Caputo</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Advances in Information Retrieval - 45th European Conference on Information Retrieval</source>
          ,
          <string-name>
            <surname>ECIR</surname>
          </string-name>
          <year>2023</year>
          , Dublin, Ireland, April 2-
          <issue>6</issue>
          ,
          <year>2023</year>
          , Proceedings,
          <source>Part III. Lecture Notes in Computer Science</source>
          , vol.
          <volume>13982</volume>
          , pp.
          <fpage>388</fpage>
          -
          <lpage>391</lpage>
          . Springer (
          <year>2023</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6\_42, https://doi.org/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>42</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Faggioli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Formal</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marchesin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clinchant</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benjamin</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>Query Performance Prediction for Neural IR: Are We There Yet?</article-title>
          <source>In: Proc. ECIR</source>
          (
          <year>2023</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Faggioli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zendel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Culpepper</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>An Enhanced Evaluation Framework for Query Performance Prediction</article-title>
          .
          <source>In: Proc. ECIR</source>
          . pp.
          <fpage>115</fpage>
          -
          <lpage>129</lpage>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hauf</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Predicting the efectiveness of queries and retrieval systems</article-title>
          .
          <source>In: Ph.D. Dissertation</source>
          . University of Twente. pp.
          <fpage>1</fpage>
          -
          <lpage>179</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hauf</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Azzopardi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hiemstra</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>The Combination and Evaluation of Query Performance Prediction Methods</article-title>
          .
          <source>In: Proc. ECIR</source>
          . pp.
          <fpage>301</fpage>
          -
          <lpage>312</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Craswell</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>An Introduction to Neural Information Retrieval</article-title>
          .
          <source>Foundations and Trends in Information Retrieval</source>
          <volume>13</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>126</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tanguy</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Linguistic Features to Predict Query Dificulty</article-title>
          .
          <source>In: Proc. SIGIR</source>
          . pp.
          <fpage>7</fpage>
          -
          <lpage>10</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Raiber</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurland</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Query-Performance Prediction: Setting the Expectations Straight</article-title>
          .
          <source>In: Proc. SIGIR</source>
          . pp.
          <fpage>13</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Roitman</surname>
            ,
            <given-names>H.:</given-names>
          </string-name>
          <article-title>Enhanced performance prediction of fusion-based retrieval</article-title>
          . pp.
          <fpage>195</fpage>
          - -
          <lpage>198</lpage>
          . ICTIR '
          <volume>18</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Scholer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Case for Improved Evaluation of Query Dificulty Prediction</article-title>
          .
          <source>In: Proc. SIGIR</source>
          . pp.
          <fpage>640</fpage>
          -
          <lpage>641</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Shtok</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurland</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carmel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Using Statistical Decision Theory and Relevance Models for Query-Performance Prediction</article-title>
          .
          <source>In: Proc. SIGIR</source>
          . pp.
          <fpage>259</fpage>
          -
          <lpage>266</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Thomas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bailey</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mofat</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Tasks, queries, and rankers in preretrieval performance prediction</article-title>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          .
          <source>ADCS</source>
          <year>2017</year>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>