<?xml version="1.0" standalone="yes"?>
<Paper uid="N04-4024">
  <Title>Direct Maximization of Average Precision by Hill-Climbing, with a Comparison to a Maximum Entropy Approach</Title>
  <Section position="7" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> We developed an algorithm for exhaustively searching a continuous and unbounded direction in term weight space in O(M2 log M) time. Initial results suggest that the maximum entropy approach performs as well as this algorithm, which hill-climbs directly on average precision, allaying our concerns that the metric divergence exhibited by the maximum entropy approach is a problem for studying optimal queries.</Paragraph>
  </Section>
class="xml-element"></Paper>