60
SpatialBlock: Enhancing Spatial Intelligence in LVLMs via Synthetic Block-Stacking Problem
Researchers release SpatialBlock-15k, a synthetic block-stacking dataset that improves 3D spatial reasoning in large vision-language models without dense geometric annotations.
The paper addresses limited spatial intelligence in LVLMs by training on structured block-manipulation tasks instead of costly real-scene annotated datasets. SpatialBlock-15k contains 15,000 synthetic problems covering 3D-to-2D projection, viewpoint transformation, and structural combination, with color modulation as visual cues. LVLMs trained on it via direct answering or reasoning-based prediction outperform baselines and generalize to real-world spatial tasks. Code and data are released on GitHub.
28
Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization
Researchers release OR-Clarify, a benchmark testing whether LLM agents ask clarifying questions before formulating optimization models from incomplete requests.
OR-Clarify evaluates pre-formulation clarification in operations research: each task gives a partial problem description, withholds structured hidden slots, and scores agents via bounded interaction with a simulated user, measuring slot recovery, stopping behavior, silent assumptions, and interaction cost. The authors also propose InterOPT, a two-stage framework that identifies formulation-critical gaps to decide when to ask or stop. In choice-based experiments InterOPT substantially outperforms all baselines in exact slot recovery and remains competitive in the open-ended setting.
35
55
60
Week in review: High severity WordPress vulnerabilities, fake OAuth IDs bypass sign-in logs
60
Why don't machine learning research agents overfit?
Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.
Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.
Hacker News · security32
AI Agents Are Here. So Are the Threats.
Unit 42 demonstrates nine framework-agnostic attack scenarios against AI agents built with CrewAI and AutoGen, causing data leakage, credential theft and remote code execution.
Palo Alto Networks Unit 42 investigated how attackers can target agentic applications, implementing two functionally identical apps with the open-source CrewAI and AutoGen frameworks and executing the same attacks on both. Nine attack scenarios produce outcomes including information leakage, credential theft, tool exploitation and remote code execution. Findings show most vulnerabilities are framework-agnostic, arising from insecure design patterns, misconfigurations and unsafe tool integrations rather than flaws in the frameworks themselves. The team published defense strategies per scenario and open-sourced the source code and datasets on GitHub.
58
55
42
Recognition-Refusal Misalignment in LLMs: Why Models Answer Structurally Unanswerable Questions
A linear hidden-state direction encodes question impossibility in 1.7B-70B LLMs, but misalignment with the safety-refusal pathway explains why models answer unanswerable questions.
The study examines why instruction-tuned LLMs from 1.7B to 70B parameters answer structurally unanswerable math and code questions instead of abstaining. A single linear direction in the hidden state separates answerable from impossible prompts, showing models represent impossibility before generation, but this direction is nearly orthogonal to the canonical safety-refusal direction. Generation-time steering along the recognition direction changes invalidity-aware behavior dose-responsively, and the geometry is present even at the pretraining endpoint, indicating a routing failure rather than an encoding failure.
30
30
30
57
55
60
55
55
30
30
Towards a Deterministic Math Solver for Clinical Language Models
Paper shows handing arithmetic to a deterministic Python solver beats direct model calculation at 32B but not reliably at 7B on MedCalc-Bench.
Researchers test a Program-Solve interface where clinical LLMs write case-specific Python executed by a restricted local solver instead of doing arithmetic directly. On MedCalc-Bench Verified (1,100 cases, 55 calculators), Qwen2.5-32B-AWQ scored 90.53% with solver handoff versus 83.47% with direct arithmetic (+7.05 points), while Qwen2.5-7B gained an unreliable +3.29 points with a confidence interval spanning zero. The authors audited the benchmark against clinical guidelines and flagged 16 of 55 calculators for version, use, or coefficient concerns.
25
50
Molecular Déjà Vu: Digit-Level Retrieval of Published Values in Frontier Language Models
Audit of 22 frontier models finds widespread verbatim retrieval of published molecular property values, with higher reasoning increasing recall of memorized numbers.
An arXiv audit tests 22 frontier LLMs across 12 molecular regression benchmarks for verbatim retrieval of published values. More than 50% of the LLMs show verbatim retrieval on five datasets, and identical experiments are flagged 89% more often at a high reasoning level than at the lowest one. Suppressing retrieval moves model prediction errors closer together in relative terms, suggesting predictive capability is not determined solely by memorized values.
42
Signed Rescue Routing: Harm-Aware Cascades for Efficient LLM Inference
Signed Rescue Routing improves LLM cascade efficiency by predicting when a larger model actually corrects a smaller one rather than uncertainty.
Signed Rescue Routing (SRR) is a budgeted cascade method that separately predicts rescues and regressions when escalating from a small to a large model, ranking requests by their signed difference. The authors prove this signed conditional gain is Bayes-optimal under a fixed escalation budget and add only a lightweight two-head router needing small-model output statistics at deployment. Evaluation with Qwen3-4B and Qwen3-8B on MMLU, HellaSwag, and ARC-Challenge shows better accuracy-compute tradeoffs than entropy routing and learned error predictors.
22
30
xDailyBench: Benchmarking LLMs on Professional Consultation for Real-Life Problems
xDailyBench tests 11 frontier LLMs on 248 real-life consultation tasks; the best models score 75.6% and lag on implicit requirements.
The benchmark spans 51 scenarios across personal life, white-collar work, learning and research, and cross-domain activities, grounded in requests users actually completed or intended to complete with AI. Tasks are scored with fine-grained binary rubrics covering explicit and implicit requirements under standardized agentic settings. Across 11 frontier models, the best achieved a 75.6% task-level score, with all models performing at least 9 percentage points worse on implicit than explicit requirements.
26
55
45
42
Diffs vs. Whole Files: An Empirical Comparison of Iterative Edit-Based and Direct Generation for Flutter/Dart Code Models
Empirical study finds direct whole-file generation beats iterative diff-based editing for Flutter/Dart code models on about 1,790 held-out tasks.
Researchers trained Rainbow-Pony-100M from scratch and fine-tuned Qwen2.5-Coder-0.5B in both direct-generation and diff-based regimes, then evaluated four resulting models on roughly 1,790 Flutter/Dart tasks. Direct generation outperformed diff-based generation on compilation pass rate, bits-per-byte, character-level similarity, and blinded LLM-judge ratings. Diff-based editing is competitive only on short, localized edits in refactoring and error-handling tasks, a property the authors call task locality.
30
30
Attention Quantization for Tabular Foundation Models
FP8 quantization of attention queries, keys, and values speeds tabular foundation model inference up to 1.7x with no accuracy loss.
The paper develops an FP8 quantization strategy targeting attention calculations (queries, keys, values) in tabular foundation models, arguing attention matters more than weight or KV cache quantization given their differing size and serving patterns versus LLMs. Aligning quantization error between test rows and training rows proves crucial, since misalignment causes drastic accuracy drops. A Triton kernel using explicit FP8 matrix multiplication achieves up to 1.7x speedup over regular 16-bit kernels, with no relevant accuracy loss on TabPFN-v3 and TabICLv2 across TabArena and BeyondArena benchmarks.
28
55
What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexity
Pruning study across four LLM architectures finds dense models degrade sharply on smart-home tool calling while MoE models tolerate far more.
Researchers systematically study pruning-induced degradation in smart-home tool calling across four LLMs spanning dense Transformer, dense hybrid, and mixture-of-experts architectures, combining depth, width, hybrid, and expert pruning methods, and evaluate over 19,500 instances from three datasets after post-pruning supervised fine-tuning. Dense models show narrow safe pruning regions followed by sharp degradation, while MoE models tolerate substantially more pruning. Pruning degrades grounded specificity (operation, device, argument, value) before schema-level intent, and aggressive dense pruning can induce systematic over-refusal.
20
A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM
A*-Thought-V2 compresses chain-of-thought into latent tokens using geometric hidden-state dynamics, cutting computation while improving accuracy on Qwen models.
A*-Thought-V2 models chain-of-thought as a hidden-state trajectory and interleaves explicit text with continuous latent tokens, compressing steps whose transitions deviate from the question-to-solution direction. Trained via stepwise embedding forcing and label forcing with soft multi-modal supervision, it was evaluated on Qwen3.5-9B and Qwen3.6-27B across six benchmarks. Reported results include up to 2.6% average accuracy gain, up to 50% shorter responses, 2.29x higher Accuracy per Computation Unit, 94.6% faster preprocessing, and up to 80.3% faster training.
48
30
42
After warning AI is too dangerous, Bill Gates bets a billion on its upside
Gates Foundation pledges at least $1 billion over two years to widen AI access in health, education and agriculture, warning of a rich-poor divide.
The Gates Foundation's 2026 Goalkeepers report outlines spending of at least $1 billion over two years on AI access in health, education and farming. Gates notes over 90% of early LLM training data was English, with speech recognition error rates below 6% in English but above 60% in Yoruba. Cited projects include Penda Health clinics in Kenya (16-point diagnostic accuracy gain), Gemini Guided Learning in Sierra Leone (1.7 years of learning gains in eight weeks), and India's MahaVISTAAR reaching 740,000+ farmers at under 18 cents per person.
25
An Evidence-First Multi-LLM Framework for Auditable Critical-Infrastructure Dependency Modeling
Evidence-first multi-LLM framework builds auditable critical-infrastructure dependency graphs while preserving provenance and unresolved cases.
The framework constructs Infrastructure Knowledge Bases and Infrastructure Dependency Graphs from heterogeneous infrastructure documentation using multiple open-weight LLMs that independently extract candidate entities and dependencies from normalized evidence. It separates evidence verification, ontology grounding, entity resolution, dependency alignment, validation, fusion, and human review, projecting the validated IKB deterministically into the IDG without new LLM-generated knowledge. Evaluation across nine infrastructure projects shows entity recovery achieves substantially higher recall than full dependency recovery, and cross-model overlap is much lower for dependencies than entities, indicating models often produce non-overlapping candidate assertions rather than stable consensus.
28
Speculative Decoding in vLLM on AMD GPUs
vLLM benchmarks speculative decoding on AMD Instinct MI300X and MI355X GPUs across five drafting methods including EAGLE-3 and native MTP.
The vLLM project documents draft-and-verify speculative decoding support for AMD GPUs via ROCm, comparing native MTP, Gemma 4 MTP, EAGLE-3, DFlash, and DSpark drafting approaches. Output-token throughput effects varied with drafting method, proposal length, model family, draft checkpoint, workload, and acceptance behavior. The post also covers how to enable each method plus practical tuning and observability considerations.
40