A Framework for Optimizing Paper Matching

by   Laurent Charlin, et al.

At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge for any conference organizer. In this paper we propose a framework to optimize paper-to-reviewer assignments. Our framework uses suitability scores to measure pairwise affinity between papers and reviewers. We show how learning can be used to infer suitability scores from a small set of provided scores, thereby reducing the burden on reviewers and organizers. We frame the assignment problem as an integer program and propose several variations for the paper-to-reviewer matching domain. We also explore how learning and matching interact. Experiments on two conference data sets examine the performance of several learning methods as well as the effectiveness of the matching formulations.


Deep Probabilistic Graph Matching

Most previous learning-based graph matching algorithms solve the quadrat...

Matching Papers and Reviewers at Large Conferences

This paper studies a novel reviewer-paper matching approach that was rec...

A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching

The estimation of correspondences between two images resp. point sets is...

Paper Matching with Local Fairness Constraints

Automatically matching reviewers to papers is a crucial step of the peer...

Diverse Reviewer Suggestion for Extending Conference Program Committees

Automated reviewer recommendation for scientific conferences currently r...

Computing Optimal Assignments in Linear Time for Graph Matching

Finding an optimal assignment between two sets of objects is a fundament...

A Graph Analytics Framework for Ranking Authors, Papers and Venues

A lot of scientific works are published in different areas of science, t...

Code Repositories


Ideas on active learning

view repo