Topic

#Benchmarks

In AI, benchmarks are standardized test suites that objectively measure and compare model performance across defined tasks. For example, MMLU evaluates language models on question answering across more than 50 academic subjects.

40Articles
3Sources
74Avg. signal
arXiv cs.CL·

Redact or Keep? A Fully Local AI Cascade for Educational Dialogue De-Identification

Local de-identification framework for educational dialogues. Two-stage cascade: union proposer (lightweight encoders + deterministic rules) generates PII candidates, then binary Redact/Keep reviewer uses dialogue context and speaker role. Achieves 0.958 macro F1 on math tutoring transcripts, outperforms commercial API (0.706) and local LLM baseline (0.767), runs on single laptop.

RAGAI safetyPapers
SIG
78
HYP
00
arXiv cs.CL·

MCompassRAG: Topic Metadata as a Semantic Compass for Paragraph-Level Retrieval

MCompassRAG improves RAG systems by using topic-level metadata as a semantic compass for paragraph-level retrieval. The method enriches chunk representations with topic signals in the same embedding space and trains a lightweight retriever via LLM-teacher distillation. Across six benchmarks, it gains 8.24% in information efficiency with 5× lower latency than efficient RAG baselines.

RAGEmbeddingsBenchmarks
SIG
78
HYP
00
arXiv cs.LG·

Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier

PROPEL is a framework training task generators via RL to create optimally difficult problems for agent learning. A lightweight probe predicts solver pass rate without repeated rollouts, reducing evaluation to a single forward pass. On code and SWE tasks, learnable-frontier generation increases from 10.1% to 20% (Qwen2.5-3B) and 9.8% to 19.6% (Qwen3.5-27B).

Reinforcement learningAI AgentsCode generation
SIG
78
HYP
00
arXiv cs.LG·

Gaussian Mixture Attention: Linear-Time Sequence Mixing via Probabilistic Latent Routing

Gaussian Mixture Attention (GMA) replaces standard attention with probabilistic routing through K learned Gaussian mixture components. Queries and keys map to responsibility vectors in a shared latent space. GMA avoids explicit N×N matrix materialization, reducing memory complexity to O(NK) instead of O(N²). Competitive on long-context classification, but behind SDPA and Mamba on WikiText-103.

ReasoningBenchmarksPapers
SIG
72
HYP
00
arXiv cs.LG·

PSyGenTAB: A Privacy-Preserving Framework for Synthetic Clinical Tabular Data Generation via Constrained Optimization

PSyGenTAB is a privacy-preserving framework for synthetic clinical tabular data generation formulated as constrained optimization solved via Augmented Lagrangian Method. It embeds configurable privacy constraints into training to preserve inter-feature clinical relationships and minority-class patterns while maintaining data utility for medical AI applications.

Benchmarks
SIG
72
HYP
00
arXiv cs.AI·

RTSGameBench: An RTS Benchmark for Strategic Reasoning by Vision-Language Models

RTSGameBench is a benchmark to evaluate strategic reasoning in Vision-Language Models (VLMs) using real-time strategy games. Built on Beyond All Reason, it offers multi-scenario evaluations, diagnostic mini-games targeting specific competencies, and a self-evolving generation framework. Current state-of-the-art VLMs fail at multi-agent coordination and complex task scaling.

VisionReasoningMulti-agent
SIG
72
HYP
00
Benchmarks — AI news · Signal IA