Daily AI News — 2026-08-18
Generated at 2026-08-18T06:07:24.773765-07:00 by a GitHub Actions GitOps pipeline.
Top stories
- We still don’t know how people are really using AI — MIT Technology Review AI, 2026-08-18 10:06 UTC. Score 11.0 — AI companies like Anthropic and OpenAI regularly publish reports on how people are using products like Claude and ChatGPT, but they only release the data they want us to see, AI researchers say. “There is no independent source to corroborate it,” says Anka Reuel, a Computer Science PhD candidate at the Stanford Trustworthy AI Research…
- OGX: An Open-Source, Vendor-Neutral Generative AI Application Server — arXiv cs.AI, 2026-08-18 04:00 UTC. Score 10.9 — arXiv:2608.14580v1 Announce Type: new Abstract: OGX (Open GenAI Stack) is an open-source AI application server and Python library that implements the APIs of major frontier labs (OpenAI, Anthropic, Google) with pluggable backend providers. Developers building agentic AI applications--such as retrieval-augmented generation pipelines, multi-turn agents, and tool-calling workflows--can develop against a single API surface and deploy with any combination of inference engine, vector database, and safety backend, without changing application code. OGX's primary focus is the Responses API for server-side agentic orchestration, conforming to the Ope…
- Do LLM Agents Negotiate Rationally? A Mechanism-Design Framework for Verifiable Multi-Agent Interaction over A2A/MCP — arXiv cs.AI, 2026-08-18 04:00 UTC. Score 10.1 — arXiv:2608.14613v1 Announce Type: new Abstract: Modern LLM-agent frameworks increasingly interoperate through standards such as Anthropic's Model Context Protocol (MCP) for agent-to-tool access and Google's Agent2Agent (A2A) protocol for agent delegation and negotiation. However, these protocols specify transport and discovery rather than strategic correctness and do not guarantee efficient, individually rational, or strategy-proof outcomes. We introduce a framework that (i) encodes classical negotiation mechanisms, including alternating-offers bargaining and Vickrey-Clarke-Groves-style auctions, as constraints over A2A message schemas; (ii)…
- Training Leaves Traces: Centered Residual Signatures for Language Model Lineage Verification — arXiv cs.CL, 2026-08-18 04:00 UTC. Score 10.1 — arXiv:2608.14929v1 Announce Type: new Abstract: Open-weight language models are fine-tuned, quantized, pruned, and merged, yet their provenance is often undocumented. We study data-free white-box lineage verification: can weights alone reveal whether two compatible model checkpoints share ancestry? Residual training produces a shared identity-aligned component in branch products, so this structure alone cannot establish ancestry. We remove it and compare checkpoint-specific structure across residual blocks, yielding a symmetric lineage score calibrated against independent checkpoints. On residual-MLP and GPT-2 benchmarks, the score separates…
- When Less Is Enough: Context Selection and Prompting Strategies for Bengali News Headline Generation — arXiv cs.CL, 2026-08-18 04:00 UTC. Score 10.1 — arXiv:2608.15879v1 Announce Type: new Abstract: Large language models (LLMs) have shown strong performance in text generation tasks, yet their effectiveness on headline generation remains sensitive to how input context is selected and presented. In this work, we investigate Bengali news headline generation as a document-level generation task that requires effective selection and presentation of salient contextual information from long-form articles. Using Gemini-2.0-Flash, Llama-3.3-70B, and GPT-4o, we systematically study the effects of context selection, prompting strategies, and in-context learning (i.e., few-shot) on the quality of headl…
- The Unwritten Benchmark: A New Challenge for Multimodal Machine Learning in Abstract Perceptual Reasoning — arXiv cs.AI, 2026-08-18 04:00 UTC. Score 10.0 — arXiv:2608.14558v1 Announce Type: new Abstract: Current multimodal models have demonstrated remarkable proficiency in recognizing static visual and auditory content. However, their capacity for abstract perceptual reasoning, inferring unseen information from dynamic, generative processes, remains a critical and underexplored frontier. In this paper, we introduce The Unwritten Benchmark, a new challenge designed to probe this abstract perceptual and cognitive ability. We define the core task as acousto-kinematic word inference: models must decipher words, across 3 different writing styles, being written solely from the audio of pen scratches…
- CEDAR-GRPO: Process-Aware Reinforcement Learning for General Abductive Reasoning in LLMs — arXiv cs.AI, 2026-08-18 04:00 UTC. Score 9.2 — arXiv:2608.14791v1 Announce Type: new Abstract: Abductive reasoning, often characterized as inference to the best explanation, is central to explanation under uncertainty, from everyday sense-making and investigation to scientific discovery. Yet LLM research has mostly studied abduction through narrow, task-specific benchmarks, making it unclear whether observed gains transfer beyond the benchmark family used for training or evaluation. We ask whether RL post-training can improve abduction as a transferable reasoning capability. We introduce CEDAR-GRPO, a process-aware framework that combines final-answer correctness with abductive rewards f…
- Beyond Tokens: A Survey on Decoding Methods for Large Language and Vision-Language Models — arXiv cs.CL, 2026-08-18 04:00 UTC. Score 8.4 — arXiv:2608.14797v1 Announce Type: new Abstract: Large language models (LLMs) and large vision-language models (LVLMs) have demonstrated impressive generative capabilities, yet ensuring their outputs align with user intent is still challenging. While most existing approaches address this issue at the training stage, inference-time approaches like decoding methods offer a more efficient and scalable solution. Decoding methods control model generation by guiding token-level selection, performing sequence-level generation, or generating tokens in parallel to accelerate the process. In this survey, we identify three emerging paradigms from recent…
- What to Forget in Unlearning? Forget Set Curation for Language Models — arXiv cs.CL, 2026-08-18 04:00 UTC. Score 8.4 — arXiv:2608.14855v1 Announce Type: new Abstract: Machine unlearning aims to remove targeted data or behaviors from a trained model without retraining from scratch. Yet most evaluations assume that the examples to forget are already known. In realistic language-model deployments, a requester may ask a model to stop reproducing a song or book without knowing which spans, documents, quotations, or near-duplicates in a trillion-token corpus support that behavior. We study this missing upstream problem, forget set curation: mapping a suppression request to the data passed to an unlearning algorithm. We introduce CleanSlate, a benchmark for verbati…
- AI’s recursive self-improvement might not come so quickly after all — MIT Technology Review AI, 2026-08-18 09:00 UTC. Score 7.6 — The AI industry’s boldest promise right now is that AI will soon improve itself, with almost no need for human oversight. LLMs can already write code, generate synthetic data for training, and optimize the computer chips they run on. Forecasts of explosive AI progress predict that what researchers call recursive self-improvement is on the horizon. …
Signals to watch
- Most represented sources: arXiv cs.AI (4), arXiv cs.CL (4), arXiv stat.ML (4), MIT Technology Review AI (2).
- Recurring themes: model (12), training (7), inference (5), benchmark (5), openai (4), anthropic (4), gpt (4), research (3).
- Review the raw JSON output in
data/items/ if you want to audit scoring or feed coverage.
All links
- Selected items: 18
- AI summarization: deterministic fallback
- Source data:
data/items/ in this repository