KDnuggets Home » News » 2010 » Apr » Events » UAI Approx. Inference Competition  ( < Prev | 10:n09 | Next > )

UAI 2010 Approximate Inference Evaluation Competition


 
  
the upcoming evaluation of probabilistic inference algorithms, will be part of the UAI conference in July


Preliminary call for participation in the 2010 UAI approximate inference evaluation

We are pleased to announce an upcoming evaluation of probabilistic inference algorithms, as part of the UAI conference this July. All researchers working on inference in graphical models are encouraged to participate.

The evaluation will focus on the following computational tasks:

  • calculating MAP/MPE assignments,
  • calculating partition functions (i.e., probability of evidence), and
  • calculating marginals.
Submitted algorithms can compete in some or all of these tasks.

More details can be found at the conference website

We look forward to your participation,

The organizers

New features in this year's competition

  • There will be separate tracks for approximate algorithms that provide upper or lower bound guarantees and those that do not. Exact algorithms are of course invited to participate in any of these tracks.
  • A special track will assess the merit of the submitted inference algorithms when used as a black box for parameter learning.
  • Participants will receive automated performance reports and will be able to submit improvements during the entire competition period.
Dates
  • May 3 Dataset and submission format announced
  • May 10 Submissions accepted on website
  • June 25 Final deadline for submissions
  • July 1 Final results and winners announced
  • July 8-11 Results reported at the UAI conference
Organizers
  • Gal Elidan, Hebrew University
  • Amir Globerson, Hebrew University

KDnuggets Home » News » 2010 » Apr » Events » UAI Approx. Inference Competition  ( < Prev | 10:n09 | Next > )