<!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>
      <title-group>
        <article-title>VIRLab: A Platform for Privacy-Preserving Evaluation for Information Retrieval Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hui Fang</string-name>
          <email>hfang@udel.edu</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ChengXiang Zhai</string-name>
          <email>czhai@illinois.edu</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Existing IR evaluation:</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Privacy-Preserving Evaluation (PPE):</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Algorithm-centric</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Data-centric</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Computer Science, University of Illinois at Urbana-Champaign</institution>
          ,
          <addr-line>Urbana, IL</addr-line>
          <country country="US">USA</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Department of Electrical and Computer, Engineering, University of Delaware</institution>
          ,
          <addr-line>Newark, DE</addr-line>
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Information retrieval (IR) has been a highly empirical discipline since the very beginning of the eld. The development and study of any novel techniques such as retrieval models always require extensive experiments over multiple representative data collections. Traditionally, IR evaluation relies on the use of publicly available data, so researchers often download the collections and conduct the evaluation on their servers. However, this would not be a favorable (or even possible) solution to evaluation over the proprietary data due to various privacy concerns. In this paper, we discuss one potential solution to the privacy-preserving evaluation (PPE) for IR models. We rst brie y introduce the VIRLab system, and then discuss how to extend the system to enable a controlled data-centric experimental environment for evaluation over proprietary data.</p>
      </abstract>
      <kwd-group>
        <kwd>virtual IR lab</kwd>
        <kwd>privacy-preserving evaluation</kwd>
        <kwd>PPE</kwd>
        <kwd>data-centric evaluation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>Information retrieval (IR) is an empirical discipline. The
research progress achieved in this eld is closely related to
careful and thorough evaluation over representative data
collections. For example, when developing a new algorithm
such as a retrieval function, it would be necessary to
compare its performance with those of the state of the art
retrieval functions on multiple representative data collections.
Since traditional data collections are often publicly available,
researchers could download the collections and conduct the
evaluation on their own servers, as shown in the left plot
of Figure 1. We refer to such an evaluation paradigm as
algorithm-centric evaluation since the evaluation happens at
Copyright c 2014 for the individual papers by the papers’ authors.
Copying permitted only for private and academic purposes. This volume is
published and copyrighted by its editors.
.
the site of algorithms and data are moved there.</p>
      <p>Although the current evaluation practice works well with
the publicly available data collections, it cannot support the
evaluation over proprietary data, which can not be easily
shared due to privacy concerns. As a result, only a very
small number of researchers who have the access to these
proprietary data collections are able to conduct experiments,
which makes it impossible for other researchers to reproduce
the results.</p>
      <p>Unfortunately, due to the empirical nature of the
discipline, it is always essential to evaluate IR algorithms with
real applications involving real users, thus almost always
raising the issue of privacy protection. Thus, we must study
how to improve the reproducibility of IR research and enable
controlled experiments on proprietary data while preserving
the privacy of the collections.</p>
      <p>In this paper, we propose a novel privacy-preserving
evaluation (PPE) paradigm, which is data-centric.
Instead of conducting the evaluation at the sites of algorithms,
the new evaluation paradigm moves the algorithms to the
data and conducts evaluation at the sites of the data, as
illustrated in the right plot of Figure 1.</p>
      <p>To support the proposed PPE paradigm, it would be
necessary to develop an infrastructure that enables users to
upload the code of their methods, evaluates the uploaded codes
and returns the evaluation results to the users. We rst
discuss the challenges of building such an infrastructure, and
then explain how to leverage the recently developed Virtual
IR Lab (VIRLab) system to overcome the challenges.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>CHALLENGES</title>
      <p>We now discuss three major challenges of building the
proposed data-centric PPE infrastructure.</p>
      <p>Algorithm Uploading: What is the best way of
implementing and uploading an algorithm so that it could
be executed on the sites hosting the data with the
minimum e ort?
Modularized Evaluation: How to enable the
evaluation of individual system components? At which
granularity level should an algorithm be implemented
and uploaded?
Privacy-Preserving Result Delivery: What kind
of results should be returned to the users so that
privacy can be preserved while allowing users to obtain
enough information to further improve the performance?
The rst challenge is mainly concerned with how to make
sure the code implemented at the \algorithm sites" can be
correctly and e ortless executed at the \data sites". This
is particularly important since di erent users may
implement their algorithms using a wide variety of conventions,
programming languages and system environments. On the
one extreme, the evaluation infrastructure could push the
load of ensuring correct and easy execution of the code to
the users. It means that the users need to make sure that
their codes follow certain requirements that are necessary
for the correct execution. However, this would also mean
that the users have to change their own implementations for
the evaluation, which would require non-trivial e orts when
their underlying IR systems are quite di erent from the one
supported at the central server. On the other extreme, the
evaluation infrastructure would be responsible for ensuring
the correct execution of the uploaded code on the server side.
Such a process could undoubtedly introduce lots of human
e orts and may discourage the involvement of any personnel
who plans to share the private data collections. Clearly, the
desirable platform should aim to strike a balance between
these two scenarios.</p>
      <p>The second question is about the modularity of the
uploaded algorithms and the evaluation platform. An IR
system includes multiple components such as document
preprocessing, indexing, retrieval, results presentation, etc. It
would be necessary to allow users to test the implementation
of each component separately. This requirement also means
that the number of experiments that needs to be conducted
could be too large to be handled by the data sites manually.</p>
      <p>The third question concerns with the decision about what
kind of information about the evaluation results can be shared
with the users. Let us take the evaluation of a retrieval
function as an example. Since the goal is to evaluate the
e ectiveness of a retrieval function over private data
collections, the most basic information that the system could
return would be the results measured with various
evaluation metrics such as MAP. However, such basic information
might not allow the users to gain enough information about
how to revise their methods to improve the performance.
Thus, it would be necessary to study how to provide more
informative evaluation results without revealing sensitive
information from the private data collections.</p>
    </sec>
    <sec id="sec-3">
      <title>3. POTENTIAL SOLUTION: VIRLAB</title>
      <p>
        The Virtual IR Lab (VIRLab) 1 is a web-based system
for learning and studying IR models [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The system allows
users to implement retrieval functions, evaluate the
functions over the provided data collections and then analyze
the evaluation results when necessary. We now describe how
to leverage the VIRLab system to solve the three challenges
discussed in the previous section.
      </p>
      <p>
        Dynamic code generation for algorithm uploading:
The VIRLab system currently allows users to implement a
retrieval function through a Web form by combining
statistics provided through a list. After that, the
implementations are converted and embedded to C/C++ codes, and
the codes are then compiled and executed. The process of
code conversion is achieved by a customized dynamic code
generator [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We propose to adapt the similar strategies
to more general scenarios such as allowing users to upload
their own codes that follow the conversions required by the
dynamic code generators.
      </p>
      <p>Modularized evaluation infrastructure: To enable
the evaluation of individual IR system components, we
propose to modularize the evaluation infrastructure. Such a
design could allow users to evaluate the e ectiveness of each
component. Although the current VIRLab system allows
only the customized implementation of retrieval functions,
we plan to open up other components and allow users to
upload or implement their own methods. In fact, such a
design could enable a more controlled experiment set up for
privacy-preserving evaluation.</p>
      <p>
        Multi-level privacy-preserving result delivery: The
VIRLab system provides a leaderboard for each data
collection, which displays the evaluation results for well performed
retrieval functions. Moreover, it also allows users to see the
performance for each query and compare the performance of
their methods with a baseline method. All the above
information would not contain much sensitive information since
only the evaluation results are reported and no information
about the private data has been revealed. It is clear that
such a strategy can protect privacy well, but might not
provide lots of useful information for the users to analyze and
gure out how to revise the retrieval functions to improve
the performance. Since not every private collection has the
same level of privacy concerns, it would be necessary to
identify multiple privacy-preserving levels and decide how to
return results accordingly. For example, we could anonymize
query terms with their IDs and display the statistics for each
term. If the data collection has less restriction, we could
display selected terms or phrases without revealing the actual
content in the data. Finally, constructing diagnostic
evaluation collections [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] would be another way of diagnosing the
problems of a retrieval function without giving out private
information.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. CONCLUSIONS</title>
      <p>In this paper, we propose a novel data-centric PPE
evaluation infrastructure. The basic idea is to move the
evaluation process from \algorithm sites" to \data sites". Its unique
advantage is to enable the evaluation over proprietary data
while preserving the privacy. We identify three challenges
and propose to leverage the VIRLab system to solve them.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Engler</surname>
          </string-name>
          and
          <string-name>
            <given-names>T. A.</given-names>
            <surname>Proebsting</surname>
          </string-name>
          .
          <article-title>Dcg: an e cient, retargetable dynamic code generation system</article-title>
          .
          <source>In ASPLOS'94.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Diagnostic evaluation of information retrieval models</article-title>
          .
          <source>ACM Transactions on Information Systems</source>
          ,
          <volume>29</volume>
          (
          <issue>2</issue>
          ):7{
          <fpage>41</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Virlab: A web-based virtual lab for learning and studying information retrieval models</article-title>
          .
          <source>In Proceedings of the SIGIR'14</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>