Skip to content
AI NEWS JOURNAL
AI, IN PERSPECTIVE

Daily picks

Understand the AI developments that matter, starting with original sources.

Newest first

MiniMax M3.1Flash release sparks “questionable results” concerns: high scores on old questions, failure on new ones, and an illusion rate as high as 92.8%

On October 19, 2026, MiniMax released its low-cost large model, M3.1Flash, which scored 42 points in comprehensive evaluations and boasts a 70% reduction in cost compared to the previous generation. However, it immediately faced accusations of “cheating on exam questions”: on AA’s publicly available past papers, it nearly achieved a perfect score, yet continued to produce the original answers even after the question stems were rewritten. Reviewers such as Cat Boss and Binkg pointed out that its performance on old and new questions is sharply divided, token consumption is abnormal, and its hallucination rate in knowledge tests reaches as high as 92.8%. On October 23, MiniMax open-sourced the model weights for independent verification, but the mechanisms behind its question-identification capabilities and the reasons for discrepancies in Chinese–English responses remain unresolved.

Why it matters:This report is based on multi‑party empirical testing (including Binkg’s re‑title experiment, the author’s replication, and a dual evaluation comparison between AA and Plotly‑Mila), verifiable data (token counts, prices, accuracy/hallucination rates), and contradictions in model behavior (English errors vs. Chinese correctness, stable performance on old tasks vs. collapse on new ones). It systematically lays out the core symptoms of the current credibility crisis in large‑model evaluations: high scores do not necessarily equate to strong generalization, and low‑price advantages create tension with the reality of model capabilities. The information source is a deep investigation authorized for publication by Titanium Media, complete with original test procedures, screenshot evidence, and timestamps, offering both timeliness and rich detail.

Timeline and related coverage

SpecMem introduces a real-time tool-call memory management mechanism, enhancing the agent’s response speed.

On October 26, 2026, arXiv published a preprint paper titled “SPECMEM: Accelerating Agentic Tool Calling via Live Memory Management” (ID 2610.31840v1), introducing a new system called SpecMem that significantly reduces tool-call latency by enabling cross-session, online, user-level memory management for tool invocations.

新闻源配图 · arXiv cs.CL

Why it matters:This study addresses the high latency issue in deploying current tool‑calling agents, which arises from autoregressive decoding. It proposes key techniques such as verifiable write‑back, LRU eviction, and side‑effect gating, and validates their effectiveness on real query streams involving multiple users and sessions—achieving up to 1.74× measured speedup and a 27% average increase in accepted tokens. This represents an important advance in the field of AI system engineering.

Timeline and related coverage

Research reveals that open-source large models commonly exhibit list-filling phenomena in structured extraction.

An empirical study published on October 24, 2026, on arXiv (paper ID 2610.30997v1) found that when a JSON extraction schema specifies a minimum number of items in the list but the actual document content falls short, eight open-source weighting models generally treat this minimum value as a generation target rather than a constraint, resulting in 55.4% of output lists exceeding the true count (compared to a baseline of 34.5%). The filler items are often drawn from the original text, and about half pass the source‑consistency check; common mitigation strategies prove only marginally effective.

Padding to k: A Minimum Count in the Schema Makes Open-Weight Models Pad Their Extraction Lists

Why it matters:This study employed a preregistered protocol to systematically evaluate eight open-source models and six hosted-service models across 558 real-world documents and nine annotated datasets. With a rigorous methodology and publicly available data—both the code and results have been released on GitHub—it reveals a critical yet often overlooked deficiency in structured information extraction that undermines the reliability of downstream tasks: schema‑induced non‑faithful filling behavior.

Timeline and related coverage