Industry

58

Only Sat, November 14, 2026 · All dates →

SparseRead cuts agent token use by up to 92.9%

A paper introduces SparseRead, a reading control layer that exposes only needed evidence without modifying the agent model. Across six models including Claude Opus 5 and five scenarios, it cut tokens by up to 92.9% and wall time by up to 89.0%, with quality preserved or improved in 97% of settings.

r/LocalLLaMA ·

New French Prix Pascal prize to reward AI-assisted writing

France has launched the Prix Pascal, a literary prize for works written with AI collaboration; entrants must disclose the model used, such as Claude, Gemini or ChatGPT, and submit a technical file plus a two-page explanation of their 'seed'. The first edition is open to unpublished writers, with submissions due by end-November, following controversy over AI-assisted writing that saw author Thélyson Orélien dropped from major prize shortlists.

Le Monde.fr ·

Anthropic upgrades Claude Code Projects for parallel AI workers

Anthropic added proactive coordinator messages, read-only thread sharing, scheduled reminders and /fork, /btw branching to Claude Code Projects, cutting manual monitoring when cloud sessions run in parallel. The public beta covers Pro and Max on web, desktop and mobile, excluding Team and Enterprise, and threads with local access cannot be shared.

Hacker News ·

Amazon plans global product data graph

Reuters reports Amazon is building a "World Product Graph," a data vault indexing products sold anywhere online, including items Amazon doesn't sell. The goal is to keep shoppers from doing product research on Reddit or Google and to make AI agents rely on Amazon's product index.

The Verge ·

ICML 2027 Adopts Two-Stage Review and Reciprocal Reviewer Rules

ICML 2027's call for papers introduces two-stage review, where area chairs decide full review and first-stage rejections need senior area chair confirmation. It also caps submissions at 20 per person, requires a reciprocal reviewer per paper, and may desk-reject noncompliant papers.

r/MachineLearning ·

e-means: 10x faster k-means at equal loss

A LocalLLaMA post shares a method called e-means, claiming k-means clustering runs 10x faster at equal loss. The submission is link-only and provides no implementation details or benchmark data.

r/LocalLLaMA ·
That is everything