Juan Wisznia
Author directory2026
Active Learners as Efficient PRP Rerankers
Jeremías Figueiredo Paschmann | Juan Kaplan | Francisco Nattero | Santiago Mauricio Barron Bucolo | Juan Wisznia | Luciano Del Corro
Findings of the Association for Computational Linguistics: EMNLP 2026
Jeremías Figueiredo Paschmann | Juan Kaplan | Francisco Nattero | Santiago Mauricio Barron Bucolo | Juan Wisznia | Luciano Del Corro
Findings of the Association for Computational Linguistics: EMNLP 2026
Pairwise Ranking Prompting (PRP) elicits pairwise preference judgments from an LLM, which are then aggregated into a ranking, usually via classical sorting algorithms. However, judgments are noisy, order-sensitive, and sometimes intransitive, so sorting assumptions don’t match the setting. Because sorting aims to recover a full permutation, truncating it to meet a call budget does not produce a dependable top-*K*. We thus reframe PRP reranking as active learning from noisy pairwise comparisons and show active rankers are drop-in replacements that improve NDCG@10 per call in the call-constrained regime. Our noise-robust framework also introduces a randomized-direction oracle that uses a single LLM call per pair. This approach converts systematic position bias into zero-mean noise, enabling unbiased aggregate ranking without the cost of bidirectional calls.
2025
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
Juan Wisznia | Cecilia Bolaños | Juan Tollo | Giovanni Franco Gabriel Marraffini | Agustín Andrés Gianolini | Noe Fabian Hsueh | Luciano Del Corro
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
Juan Wisznia | Cecilia Bolaños | Juan Tollo | Giovanni Franco Gabriel Marraffini | Agustín Andrés Gianolini | Noe Fabian Hsueh | Luciano Del Corro
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
We introduce a novel framework for analyzing sorting algorithms in pairwise ranking prompting (PRP), re-centering the cost model around LLM inferences rather than traditional pairwise comparisons. While classical metrics based on comparison counts have traditionally been used to gauge efficiency, our analysis reveals that expensive LLM inferences overturn these predictions; accordingly, our framework encourages strategies such as batching and caching to mitigate inference costs. We show that algorithms optimal in the classical setting can lose efficiency when LLM inferences dominate the cost under certain optimizations.
2024
The Greatest Good Benchmark: Measuring LLMs’ Alignment with Utilitarian Moral Dilemmas
Giovanni Franco Gabriel Marraffini | Andrés Cotton | Noe Fabian Hsueh | Axel Fridman | Juan Wisznia | Luciano Del Corro
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Giovanni Franco Gabriel Marraffini | Andrés Cotton | Noe Fabian Hsueh | Axel Fridman | Juan Wisznia | Luciano Del Corro
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
The question of how to make decisions that maximise the well-being of all persons is very relevant to design language models that are beneficial to humanity and free from harm. We introduce the Greatest Good Benchmark to evaluate the moral judgments of LLMs using utilitarian dilemmas. Our analysis across 15 diverse LLMs reveals consistently encoded moral preferences that diverge from established moral theories and lay population moral standards. Most LLMs have a marked preference for impartial beneficence and rejection of instrumental harm. These findings showcase the ‘artificial moral compass’ of LLMs, offering insights into their moral alignment.