Yedid Hoshen
Author directory2026
Discovering Hidden Gems in Model Repositories
Jonathan Kahana | Eliahu Horwitz | Yedid Hoshen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Jonathan Kahana | Eliahu Horwitz | Yedid Hoshen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Public repositories host millions of fine-tuned models, yet community usage remains disproportionately concentrated on a small number of foundation checkpoints. We investigate whether this concentration reflects efficient market selection or if superior models are systematically overlooked. Through an extensive evaluation of over 2,000 models, we show the prevalence of "hidden gems", unpopular fine-tunes that significantly outperform their popular counterparts. Notably, within the Llama-3.1-8B family, we find rarely downloaded checkpoints that improve GSM8K accuracy from 83.2% to 96.0% without increasing inference costs. However, discovering these models through exhaustive evaluation of every uploaded model is computationally infeasible. We therefore formulate model discovery as a Multi-Armed Bandit problem and accelerate the Sequential Halving search algorithm by using shared query sets and aggressive elimination schedules. Our method retrieves top models with as few as 50 queries per candidate, accelerating discovery by 50×.
2024
From Zero to Hero: Cold-Start Anomaly Detection
Tal Reiss | George Kour | Naama Zwerdling | Ateret Anaby Tavor | Yedid Hoshen
Findings of the Association for Computational Linguistics: ACL 2024
Tal Reiss | George Kour | Naama Zwerdling | Ateret Anaby Tavor | Yedid Hoshen
Findings of the Association for Computational Linguistics: ACL 2024
2018
Non-Adversarial Unsupervised Word Translation
Yedid Hoshen | Lior Wolf
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Yedid Hoshen | Lior Wolf
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Unsupervised word translation from non-parallel inter-lingual corpora has attracted much research interest. Very recently, neural network methods trained with adversarial loss functions achieved high accuracy on this task. Despite the impressive success of the recent techniques, they suffer from the typical drawbacks of generative adversarial models: sensitivity to hyper-parameters, long training time and lack of interpretability. In this paper, we make the observation that two sufficiently similar distributions can be aligned correctly with iterative matching methods. We present a novel method that first aligns the second moment of the word distributions of the two languages and then iteratively refines the alignment. Extensive experiments on word translation of European and Non-European languages show that our method achieves better performance than recent state-of-the-art deep adversarial approaches and is competitive with the supervised baseline. It is also efficient, easy to parallelize on CPU and interpretable.