Skip to content
AI NEWS JOURNAL
AI, IN PERSPECTIVE

Search AI news

Search headlines, summaries and articles to connect the dots.

Newest first

Build a Robot Pick-and-Place Simulation with SimReady Assets

This walkthrough demonstrates how to create a beverage can pick-and-place task using the UR17G robot arm, Robotiq 2F-140 gripper, and a beverage can in Isaac Sim. The process involves downloading SimReady assets from SimReady Central on Hugging Face, assembling the robot and gripper, validating joint and physics settings, and using an AI agent to generate and run control code for the task. The simulation tests grasp accuracy, object stability during movement, and placement precision, with validation reports confirming compliance with SimReady profiles. The workflow supports reuse of validated assets and encourages developers to contribute their own SimReady-compatible robotics content.

XYBench: Helping with the problem behind the question

XYBench, a benchmark of 8,115 real-world questions spanning programming and everyday tasks, tests AI assistants' ability to recognize and respond to users' misconceptions—such as asking how to thicken frosting when the real issue is warm cupcakes. Developed with researchers from Carnegie Mellon, NVIDIA, and Johns Hopkins, XYBench measures whether models identify underlying goals (X), address them effectively, and steer users away from flawed approaches (Y). Evaluations of models like Claude Sonnet 4.6, GPT-5, Gemini 3.1 Pro, Qwen3.5-9B, and DeepSeek-V4 Pro showed they frequently focused on the stated request rather than the actual goal, with limited success in misconception identification. Human reference answers outperformed all models, highlighting a gap in pragmatic reasoning. The benchmark uses automated and human evaluation to assess pragmatic solution, emphasis, and misconception identification, offering a tool for researchers to improve AI assistants’ ability to provide helpful advice even when users ask the wrong question.

4 insights from Block Builderlab Launch Event 2026: AI agents join the team as working colleagues

At Block Builderlab Launch Event 2026, AI agents moved out of single-player chat windows and into shared workspaces. There they work beside people as named, auditable members of the team. Block Inc. built these tools to run itself as an intelligence company, and it is now offering them to other businesses, building on Buzz, its […] The post 4 insights from Block Builderlab Launch Event 2026: AI agents join the team as working colleagues appeared first on SiliconANGLE.

An LLM Is All You Need: Data-Efficient Adaptation to Full-Duplex, Word-Level Spoken Dialogue

arXiv:2611.14774v1 Announce Type: new Abstract: Full-duplex spoken dialogue, in which a system listens while it speaks and can backchannel, yield the floor, and be interrupted, is usually obtained by training on hundreds of thousands to millions of hours of speech. This is costly, rewrites the language model that supplies the system's knowledge, and still leaves turn-taking either implicit or decided coarsely rather than word by word. We show that a frozen, general-purpose multimodal LLM can instead be adapted into a word-level full-duplex system with little data. Our system is a thinker-talker cascade on an 80 ms frame clock. The thinker keeps the LLM frozen and trains only lightweight adapters and a few new token embeddings (97M parameters); at every frame it emits one token of agent text, with pauses, yields, and onsets represented as tokens of the same vocabulary and kept legal by a finite-state machine. A four-stage curriculum, each stage anchored to the model's own behavior under the previous format, performs the conversion in about 30 GPU-hours. The talker reads only the thinker's discrete tokens, so the two halves are trained independently. On Full-Duplex-Bench and InteractionBench, the system is competitive with open-source full-duplex systems built through large-scale speech training: among them, it is the least likely to take the floor when the user merely pauses, backchannels most often, and leads in spoken-task accuracy, groundedness, and coherence over long conversations.

Claude’s Duet agent is a little neurotic and surprisingly helpful

Normally, the products I test don't offer to help me write up my experience with them. Duet is different. Claude Duet is Anthropic's AI agent for consumers, the latest attempt by an AI company to try to convince us that agents can be useful for people who don't write code. It's been an interesting couple […]

Introducing Gemini 4 Hydrogen

Google launches Gemini 4 Hydrogen, a high-speed, efficient AI model designed for everyday coding, agentic workflows, and consumer use. It offers four thinking levels for adjustable speed and intelligence, outperforms previous models in benchmarks, and integrates across Google products including Search, the Gemini app, Google Sheets, and Google Antigravity. Hydrogen enhances multi-model collaboration through Orchestrator, improves safety and reliability, and is now available globally to all users via API, enterprise tools, and consumer platforms.

LLMON: An LLM-Native Markup Language, now in Granite 4.1 3B and 8B

IBM has introduced LLMON (LLM Object Notation), a new markup language designed to explicitly communicate structure and semantics to large language models. Built to address issues like prompt injection attacks and brittle behavior in smaller models, LLMON uses reserved special-token delimiters to mark semantically coherent components such as instructions, data, and requirements, enabling precise binding between them. Two experimental preview models—granite-4.1-3b-LLMON-preview and granite-4.1-8b-LLMON-preview—are now available, alongside a GitHub repository with conversion tools, workflows, and examples. LLMON enhances robustness by separating instruction from data, reducing indirect prompt injection success rates nearly to zero while maintaining performance comparable to standard Granite 4.1 Instruct models. It also supports custom schemas via LoRA fine-tuning, as demonstrated in ScienceWorld and tool-calling agent use cases. The approach is distinct from JSON, which lacks model-friendly structure, and complements existing chat templates by adding semantic clarity across roles.

LLMs and the Homogenization of Teaching

arXiv:2611.14828v1 Announce Type: new Abstract: Large language models (LLMs) are known to lack diversity in open-ended text generation, a limitation that is especially consequential in education, where homogeneity can narrow the kinds of thinking and disciplinary work students are invited to do. We study diversity in two educational generation tasks: math items and essay feedback. We compare frontier and open-weight models with human-authored reference distributions using lexical, semantic, and domain-grounded measures. For math, we examine the mathematical activities students are asked to perform; for feedback, we examine the revision work requested and the rhetorical strategies used to communicate it. We evaluate direct prompting, two diversity prompting methods, and post-training. Across both tasks, directly prompted model outputs are markedly less diverse than human-authored content--78% higher on lexical (Self-BLEU) and 51% higher on semantic (embedding) similarity--and represent a narrower range of instructional forms. Diversity prompting and post-training increase variation largely through surface features without broadening the instructional repertoire. Models inherit and amplify the most normative routines of human instruction. Overcoming mode collapse in education will require richer instructional data and investment in teachers' creative capacity and professional judgment.

Provably Optimal HBT Legalization in Seconds: Certified Optima Reveal Where the Headroom Really Lies

arXiv:2611.14928v1 Announce Type: new Abstract: Hybrid bonding terminal (HBT) legalization assigns every terminal of a face-to-face 3D IC to its own pitch-grid site with minimum total Manhattan displacement. Open3DBench reports that a reinforcement-learning (RL) legalizer reduces displacement by 19-22% relative to a sliding-window (SW) heuristic, but none of its legalizers is publicly released. We ask how much displacement any legalizer can still recover. We build an open benchmark of 21 design/pitch instances from Open3DBench placement data, with reconstructed greedy, SW (ViaLegal-style) and BTAssign-style baselines, and GEO-Exact, an exact solver that runs successive shortest augmenting paths over lazily generated spatial candidate edges. An independent dual certificate proves its assignment optimal on all 21 instances (relative primal-dual gap at most $8.2 \times 10^{-16}$). Against these optima, our SW reconstruction with ViaLegal's default configuration is on average 0.011% above optimal (worst 0.119%), while on the 16 contended instances BTAssign-style, a density-guided heuristic (DGHL) and greedy are 3.0%, 6.9% and 64.5% above. Headroom does appear outside this regime: with 2x2 windows SW reaches 34.1%, and above about 58% utilization, on three of six swept designs, it reaches 21.1% on bp, 27.5% on swerv and 8.9% on jpeg (217 further certified instances, and ten bp points checked against an independent exact solver). If the published 19-22% gain were measured on instances like ours, SW would have to be at least 24-28% above optimal on average, far more than any SW variant we tested at nominal pitch; the RL paper's own comparison with the Hungarian optimum puts its SW 3.05% above optimal on average. GEO-Exact is also about an order of magnitude faster than DGHL and SW in our harness (geometric means 8.1x and 40x; a compiled core against Python baselines on a shared server). Code, optimal values and certificates are released.

ToolTurns: Benchmarking LLM Agents in Multi-Turn Dialogue

arXiv:2611.14925v1 Announce Type: new Abstract: Tool-using language models are increasingly deployed in conversational settings, yet most large-scale tool-use benchmarks focus on isolated requests. We introduce ToolTurns, a benchmark of 2,620 problems spanning 1,827 tools and 11,004 API endpoints across 47 categories. Each dialogue begins with an intentionally underspecified request and continues through two context-dependent follow-ups, testing clarification, tool use, and retention of conversational context. We also introduce an open-source user simulator that reveals withheld context through dialogue and generates follow-up requests, with a checker--fixer pipeline for improving its turns. Across nine language models, the best agent resolves 69.6% of individual requests but completes only 39.8% of full dialogues. Under this evaluation protocol, every evaluated model receives lower success scores on follow-up requests than on the initial request, and dialogue-quality rubric scores and task success can rank models very differently. Paired turn-level evaluation shows that the checker--fixer reduces detected dialogue defects, and blind human evaluation favors the revised turns. ToolTurns provides a testbed for evaluating whether agents sustain task success across multi-turn dialogue with tools.

When Is Proof-Step Verification Worth Its Cost? Operating Requirements of Certify-or-Decline Verification for Open-Weight Mathematical Reasoning

arXiv:2611.14794v1 Announce Type: new Abstract: Proof-step verification rewrites a solver's answer into typed steps and uses LLM judges to certify or decline. We evaluate this pipeline on open-weight models across GPQA, AIME-2025, and a MATH-500 subset. Certification raises answer-key-match precision by 31 percentage points on the strong GPQA configuration and 46 on AIME, while answering only 35% and 21% of attempts. On near-ceiling MATH-500, gains are at most 5 points at a loss of 13-27 points of coverage. An output-token-matched self-consistency selector obtains 82.9% precision at 35% coverage, compared with the verifier's pooled 87.6% (paired difference: +4.8 points, 95% interval [-8.2, 18.5]). A diagnostic sample reveals a distinct failure mode: 52 of 88 completed problems end in invalid proof construction without ever reaching a judge. Finally, external-LLM acceptance of rendered certified chains is 61.0-67.6%, compared with 87.6% answer-key match. These audits lack human or formal-kernel ground truth. Open-weight auditor pairs show near-zero chance-corrected agreement, which measures consistency rather than accuracy against proof truth. These results motivate separate reporting of execution failures, selected-answer precision, and independently assessed proof validity. We provide per-configuration results and evaluation details in the supplement.

Clipto enables ChatGPT and Claude to search and analyze years of people’s meetings and video calls

Artificial intelligence assistants such as ChatGPT and Claude have become essential tools for millions of workers worldwide, helping them compose emails in seconds, generate complex code and draft reports by looking at whatever data that person has access to. But there’s one thing that’s missing from those chatbots’ knowledge. Ask them what was discussed in […] The post Clipto enables ChatGPT and Claude to search and analyze years of people’s meetings and video calls appeared first on SiliconANGLE.

The Definitive Fine-Tuning Guide for 3D Generation Models

This blog post provides scripts and Docker containers for fine-tuning TRELLIS.2, a 3D generation model, using LoRA adapters on footwear data from the Google Scanned Objects (GSO) dataset. The approach focuses on improving geometric accuracy by training only the sparse-structure and shape flow diffusion transformers while freezing the texture stage. The process includes preprocessing with Blender to generate 16 views per object, converting meshes into latents, and training with Hugging Face Jobs or local Docker. Results show significant improvements in F-score, chamfer distance, and normal consistency on held-out test objects, demonstrating effective adaptation for specific 3D object categories.

BioMem: Agentic Memory for Biomedical LLM Agents

arXiv:2611.13426v1 Announce Type: new Abstract: Large language models (LLMs) have demonstrated considerable potential in biomedical applications, while agentic memory systems have emerged as a promising approach to preserving and utilizing information across tasks and interactions. However, a fundamental question remains: how effectively and reliably do these systems retain, retrieve, update, and utilize biomedical information? In this study, we systematically investigate agentic memory in the biomedical domain, focusing on task effectiveness, retrieval quality, information fidelity, and long-term robustness. We evaluate five memory approaches across four LLMs in three representative settings: biomedical knowledge reasoning, clinical prediction, and long-term conversational memory. Our analyses reveal how memory construction, evidence relevance, and conversational history shape downstream biomedical performance, highlighting the distinct challenges of retrieving relevant information, preserving its fidelity, and effectively utilizing it for reasoning. Building on these findings, we introduce Hybrid Memory Retrieval and Utilization (HMRU), a training-free framework that jointly enhances evidence accessibility and task-aware utilization to improve biomedical reasoning and long-term conversational memory. HMRU achieves an average relative improvement of 8.6% across biomedical question-answering and conversational memory benchmarks, with additional gains in selected clinical prediction tasks. It further reduces conversational answer errors by 24.9% and closes 48.0% of the performance gap to full-context inference. Our findings provide a systematic characterization of biomedical agentic memory and practical insights into developing more effective and reliable memory-augmented LLM systems.

Mercor raises $750M at $20B valuation to take AI agent evaluation to enterprises

Artificial intelligence training data company Mercor.io Corp. today revealed that it has raised $750 million in new funding at a $20 billion valuation. Mercor provides the human expertise used to train and evaluate AI models, drawing on a network of more than 5 million domain experts. Most of that work so far has been for […] The post Mercor raises $750M at $20B valuation to take AI agent evaluation to enterprises appeared first on SiliconANGLE.

Multimodal Graph Learning: A Survey of Models, Benchmarks, and Frontiers

arXiv:2611.12990v1 Announce Type: new Abstract: Multimodal attributed graphs (MAGs), in which nodes carry text, images, and other modalities while edges encode relations among entities, underlie e-commerce, social media, content platforms, and creative applications. Learning on MAGs has developed along two complementary lines: graph-centric methods redesign how modalities are fused, propagated, and connected within message passing, while foundation-model-centric methods pretrain transferable multimodal graph encoders or bring graph context into multimodal large language models for prediction and generation. In parallel, several benchmarks have appeared with different datasets and evaluation protocols. This survey takes an algorithm-centric and evaluation-grounded view of the field and makes three contributions. Modeling: we introduce a unified message-passing formulation and organize methods into five integration levels (feature, propagation, topology, learning, and foundation model), covering discriminative and graph-conditioned generative models; within this formulation we derive representative methods as special cases, compare their assumptions, expressiveness, and cost, and identify cross-modal sensitivity as a property that separates otherwise similar architectures. Datasets and evaluation: we review recent benchmarks, summarize their datasets and metrics, define model-independent descriptors (label homophily, average degree, clustering, and edge provenance), and map each evaluation protocol to the baselines it uses. Frontiers: we connect multimodal graph learning to AI agents, covering the multimodal graphs that agents perceive and remember and graph engineering, the practice of organizing agent workflows as explicit graphs; we then discuss open problems, concrete efforts for the community, and research directions, including when graph structure helps in the presence of strong multimodal foundation models.

One Table, Many Queries: Benchmarking Generalist Tabular Models Across Generation, Imputation, and Prediction

arXiv:2611.13001v1 Announce Type: new Abstract: Generation, imputation, and prediction query different aspects of the same tabular distribution, but are usually evaluated separately. This leaves unclear which capabilities they share, how their training objectives interact, and whether one model can perform all three well. We introduce the One Table Benchmark (\ours{}), spanning 56 datasets, 46 registered methods, and 20 capability axes under aligned data splits and explicit task contracts. We compare task ranks on aligned support, train five backbones under all seven non-empty objective combinations on five datasets with three seeds, and contrast fixed-model profiles with specialist portfolios. Rank comparisons connect imputation and prediction through numerical recovery and dependence preservation, and link generation to both through predictive utility; distributional fidelity follows different, sometimes opposing, rankings. Objective interventions show the largest pooled gains from including the recipient's own objective. Generation has the broadest coverage of positive pooled auxiliary effects, while prediction shows potential to improve imputation and synthetic-data utility, with responses that vary across backbones. Cross-addition effects reveal that objective benefits need not add and depend on the objectives already present. Fixed-model comparisons expose corresponding utility--fidelity trade-offs: some generalists surpass specialist portfolios on utility, while fidelity continues to favor specialization. Frozen foundation models show strong prediction and numerical point imputation, together with promising synthetic-data utility, highlighting their potential across all three tasks. These findings motivate unified tabular models that share useful conditional information while improving categorical reconstruction and faithful joint sampling.

SELD: Detecting Silent Evidence Loss in Context Compression beyond the Answer

arXiv:2611.12903v1 Announce Type: new Abstract: Context compression is now routine for language models with long inputs, but a compressed context is useful only if it keeps the evidence for the answer. Existing checks compare the reader model's answer or its most likely words, and thus miss a frequent failure, silent evidence loss: key evidence is removed while the answer stays the same, leaving the answer unsupported and risky for other models that reuse the context. To address this challenge, we propose SELD (Silent Evidence Loss Detector), which needs no training and no labels. Its principle is that when evidence is lost, a reader model's preferences among the answers it leaves unsaid shift even if its answer does not, so comparing these preferences before and after compression reveals losses that answer checks cannot see. We also build SEL-Pairs, a benchmark of length-matched evidence and control deletions from three question-answering datasets. Quantitative and qualitative experiments with five reader models on it show that SELD consistently outperforms strong and recent baselines across compressors, compression rates and models, identifying the evidence-removing edit in 83% of matched pairs with unchanged answers, against 70% for the strongest baseline. These results show that evidence loss in compressed contexts can be detected even when the answer is unchanged.

SetPrint: Black-Box LLM Fingerprinting via Setwise Correspondence of Response Changes

arXiv:2611.12950v1 Announce Type: new Abstract: Black-box LLM fingerprinting aims to determine whether a target model was derived from a source model when only the output responses to input queries are observable. One way to reveal this relationship is to perturb each query and observe the resulting responses of both models, yielding two corresponding sets of response variations. These sets provide two complementary sources of information: the relations among response changes within each set, and the correspondence of response changes between the two sets. Existing approaches, however, have not fully exploited both. We introduce \textbf{SetPrint}, a training-free method that jointly captures both within-set relations and between-set correspondence. SetPrint expresses each response change relative to the mean change of its own set, and then compares changes from the two models that were induced by the same perturbation. On LeaFBench, SetPrint consistently outperforms existing training-free black-box fingerprinting methods. Further analyses attribute these gains to both within-set relations and between-set correspondence.