Imagen de Portada

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wisznia, Juan, Bolaños, Cecilia, Tollo, Juan, Marraffini, Giovanni, Gianolini, Agustín, Hsueh, Noe, Del Corro, Luciano
Formato:	Preprint
Publicado:	2025
Materias:	Computation and Language
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Greatest Good Benchmark: Measuring LLMs' Alignment with Utilitarian Moral Dilemmas
por: Marraffini, Giovanni Franco Gabriel, et al.
Publicado: (2025)

Active Learners as Efficient PRP Rerankers
por: Paschmann, Jeremías Figueiredo, et al.
Publicado: (2026)

Rate-Optimal Rank Aggregation with Private Pairwise Rankings
por: Xu, Shirong, et al.
Publicado: (2024)

Entropy Sentinel: Continuous LLM Accuracy Monitoring from Decoding Entropy Traces in STEM
por: Buffa, Pedro Memoli, et al.
Publicado: (2026)

A BERTology View of LLM Orchestrations: Token- and Layer-Selective Probes for Efficient Single-Pass Classification
por: Meyoyan, Gonzalo Ariel, et al.
Publicado: (2026)

On the Optimal Pairwise Group Testing Algorithm
por: Skorniakov, Viktor, et al.
Publicado: (2022)

Optimal Differentially Private Ranking from Pairwise Comparisons
por: Cai, T. Tony, et al.
Publicado: (2025)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

Optimal and Practical Batched Linear Bandit Algorithm
por: Yu, Sanghoon, et al.
Publicado: (2025)

Optimal Network Pairwise Comparison
por: Jin, Jiashun, et al.
Publicado: (2024)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
por: Goswami, Mayank, et al.
Publicado: (2022)

Efficient and Optimal No-Regret Caching under Partial Observation
por: Mazziane, Younes Ben, et al.
Publicado: (2025)

Optimal Batched Linear Bandits
por: Ren, Xuanfei, et al.
Publicado: (2024)

Cost-Aware Optimal Pairwise Pure Exploration
por: Wu, Di, et al.
Publicado: (2025)

Optimal Pairwise Comparison Procedures for Subjective Evaluation
por: Webb, Jack, et al.
Publicado: (2025)

EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sorting
por: Park, Yujin, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)

Batch-Max: Higher LLM Throughput using Larger Batch Sizes and KV Cache Compression
por: Metel, Michael R., et al.
Publicado: (2024)

Optimal Initialization of Batch Bayesian Optimization
por: Ren, Jiuge, et al.
Publicado: (2024)

Optimal Batched Best Arm Identification
por: Jin, Tianyuan, et al.
Publicado: (2023)

On Optimal Batch Size in Coded Computing
por: Saha, Swapnil, et al.
Publicado: (2025)

Optimal Selection Using Algorithmic Rankings with Side Information
por: Donahue, Kate, et al.
Publicado: (2025)

Beyond Pairwise: Empowering LLM Alignment With Ranked Choice Modeling
por: Tang, Yuxuan, et al.
Publicado: (2025)

Optimal Spatio-Temporal Decoupling for Bayesian Conformal Prediction
por: Fang, Yu-Hsueh, et al.
Publicado: (2026)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
por: Balasubramanian, Shrinivass Arunachalam
Publicado: (2025)

Optimal Batch Allocation for Wireless Federated Learning
por: Song, Jaeyoung, et al.
Publicado: (2024)

Optimal Push and Pull-Based Edge Caching For Dynamic Content
por: Abolhassani, Bahman, et al.
Publicado: (2024)

Pairwise Optimal Transports for Training All-to-All Flow-Based Condition Transfer Model
por: Ikeda, Kotaro, et al.
Publicado: (2025)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
por: Malinovsky, Yaakov, et al.
Publicado: (2025)

Almost Asymptotically Optimal Active Clustering Through Pairwise Observations
por: Teo, Rachel S. Y., et al.
Publicado: (2026)

The Pairwise Matching Design is Optimal under Extreme Noise and Assignments
por: Azriel, David, et al.
Publicado: (2024)

New Sorting Algorithm Wave Sort (W-Sort)
por: Wei, Jia Xu
Publicado: (2025)

Optimal Brain Decomposition for Accurate LLM Low-Rank Approximation
por: Li, Yuhang, et al.
Publicado: (2026)

Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles
por: Chang, Xiangyu, et al.
Publicado: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Batched Self-Consistency Improves LLM Relevance Assessment and Ranking
por: Korikov, Anton, et al.
Publicado: (2025)

OBCache: Optimal Brain KV Cache Pruning for Efficient Long-Context LLM Inference
por: Gu, Yuzhe, et al.
Publicado: (2025)

The Pairwise Matching Design Is Optimal Under Extreme Noise and Extreme Assignments
por: Adam Kapelner, et al.
Publicado: (2025)