Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ethan Bito

dblp:414/7661 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0001-8509-9016ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › reranking
listwise reranking
1.012026
One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation · SIGIR 2026
Information retrieval › ranking
learning to rank
0.312026
One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation · SIGIR 2026
Information retrieval › ranking › learning to rank
listwise learning to rank
0.312026
One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation · SIGIR 2026

Methods — techniques the papers use, named apart from their topics

structured attention mask · 1.0rotary positional embeddings · 1.0large language model · 1.0
YearPublicationVenuePosition
2026 One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation
abstract
Large language models (LLMs) are increasingly used for recommendation reranking, but their listwise predictions can depend on the order in which candidates are presented. This creates a mismatch between the set-based nature of recommendation and the sequence-based computation of decoder-only LLMs, where permuting an otherwise identical candidate set can change item scores and final rankings. Such order sensitivity makes LLM-based rerankers difficult to rely on, since rankings may reflect prompt serialization rather than user preference. We propose InvariRank, a permutation-invariant listwise reranking framework that addresses this dependence at the architectural level. InvariRank blocks cross-candidate attention with a structured attention mask and negates position-induced scoring changes through shared positional framing under Rotary Positional Embeddings (RoPE). Combined with a listwise learning-to-rank objective, the model scores all candidates in a single forward pass, avoiding permutation-based invariance training objectives that require multiple permutations of a candidate set. Experiments on recommendation benchmarks show that InvariRank maintains competitive ranking effectiveness while producing stable rankings across candidate permutations. The results suggest that architectural invariance is a practical route to reliable and efficient LLM-based recommendation reranking. The source code is at https://github.com/ejbito/InvariRank.
Ethan Bito, Yongli Ren, Estrid He
SIGIR1