search

seanhagen / bradleyterry

Package to do Bradley-Terry Model pairwise compairsons
BSD 3-Clause "New" or "Revised" License
10 stars 2 forks source link

Faster iteration #1

Open Azmisov opened 2 months ago

Azmisov commented 2 months ago

There's a paper that came out: M. E. J. Newman (2023). They have an alternative iteration that converges up to 100x times faster. Simple change.

Also there's an iteration which applies the prior 1/(score + 1) to numerator and denominator. It removes the need to normalize, and allows method to converge even if scores are not fully connected.

Another suggestion from that paper: they recommend doing asynchronous updates, where you immediately update scores, rather than buffering them and updating all en-masse. Faster convergence apparently.

seanhagen commented 2 months ago

Thanks for the info @Azmisov! Do you have a link to that paper I'd be able to read ( without needing to pay or have some kind of subscription )?

Azmisov commented 1 month ago

https://www.jmlr.org/papers/volume24/22-1086/22-1086.pdf

Or for future readers, you can typically search a paper's title on Google Scholar and find a link. In this case: "Efficient Computation of Rankings from Pairwise Comparisons"