#ranking-algorithms News & Analysis

5 articles tagged with #ranking-algorithms. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

5 articles

AINeutralarXiv – CS AI · Jun 86/10

🧠

PaperFlow: Profiling, Recommending, and Adapting Across Daily Paper Streams

PaperFlow introduces a longitudinal framework for scientific paper recommendation that moves beyond static ranking to simulate real-world reading behavior across daily paper streams. The system profiles users, recommends papers under display constraints, and adapts to interest drift through multiple feedback signals, validated against a new benchmark of 1,200 user-day episodes and human expert evaluation.

AINeutralarXiv – CS AI · Jun 26/10

🧠

From Noise to Order: Learning to Rank via Denoising Diffusion

Researchers propose DiffusionRank, a generative deep learning approach to learning-to-rank in information retrieval that uses denoising diffusion models instead of traditional discriminative methods. By modeling the full joint distribution of features and relevance labels, the method demonstrates improvements over classical ranking approaches on standard benchmarks.

AINeutralarXiv – CS AI · May 275/10

🧠

RAGEAR: Retrieval-Augmented Graph-Enhanced Academic Recommender

RAGEAR is a neurosymbolic recommender system that combines dense retrieval of lecture transcripts with knowledge graphs to improve academic course recommendations. The system demonstrates that fine-grained instructional content outperforms metadata-only approaches, with a novel graph-aware aggregation function that effectively propagates evidence from transcript chunks to course-level rankings.

AINeutralarXiv – CS AI · Apr 146/10

🧠

GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs

Researchers introduce GroupRank, a novel LLM-based passage reranking paradigm that balances efficiency and accuracy by combining pointwise and listwise ranking approaches. The method achieves state-of-the-art performance with 65.2 NDCG@10 on BRIGHT benchmark while delivering 6.4x faster inference than existing approaches.

AINeutralarXiv – CS AI · Mar 166/10

🧠

When LLM Judge Scores Look Good but Best-of-N Decisions Fail

Research reveals that large language models used as judges for scoring responses show misleading performance when evaluated by global correlation metrics versus actual best-of-n selection tasks. A study using 5,000 prompts found that judges with moderate global correlation (r=0.47) only captured 21% of potential improvement, primarily due to poor within-prompt ranking despite decent overall agreement.