Active Ranking and Matchmaking, with Perfect Matchings

H. Ferchichi, Matthieu Lerasle, Vianney Perchet
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Distributionally Robust Optimization with Bias and Variance Reduction

97% match1 repo82026

Effective and Efficient Structural Inference with Reservoir Computing

97% match2026

Unifying Automatic and Interactive Matting with Pretrained ViTs

97% match2026

Accelerating Training with Neuron Interaction and Nowcasting Networks

97% match1 repo312026

Comparing Comparisons: Informative and Easy Human Feedback with Distinguishability Queries

97% match2026

General Point Model Pretraining with Autoencoding and Autoregressive

97% match1 repo52026

Cite this paper

@article{ferchichi2026active,
  title  = {Active Ranking and Matchmaking, with Perfect Matchings},
  author = {H. Ferchichi and Matthieu Lerasle and Vianney Perchet},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:2c2f28204ec8bb51bd82afecba3def3ed6dcf148},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2c2f28204ec8bb51bd82afecba3def3ed6dcf148.svg)](https://codeofpaper.com/paper/2c2f28204ec8bb51bd82afecba3def3ed6dcf148)

Discussion