Large Language Model
VLAS: Vision-Language-Action Model With Speech Instructions For Customized Robot Manipulation
Zhao, Wei, Ding, Pengxiang, Zhang, Min, Gong, Zhefei, Bai, Shuanghao, Zhao, Han, Wang, Donglin
Vision-language-action models (VLAs) have become increasingly popular in robot manipulation for their end-to-end design and remarkable performance. However, existing VLAs rely heavily on vision-language models (VLMs) that only support text-based instructions, neglecting the more natural speech modality for human-robot interaction. Traditional speech integration methods usually involves a separate speech recognition system, which complicates the model and introduces error propagation. Moreover, the transcription procedure would lose non-semantic information in the raw speech, such as voiceprint, which may be crucial for robots to successfully complete customized tasks. To overcome above challenges, we propose VLAS, a novel end-to-end VLA that integrates speech recognition directly into the robot policy model. VLAS allows the robot to understand spoken commands through inner speech-text alignment and produces corresponding actions to fulfill the task. We also present two new datasets, SQA and CSI, to support a three-stage tuning process for speech instructions, which empowers VLAS with the ability of multimodal interaction across text, image, speech, and robot actions. Taking a step further, a voice retrieval-augmented generation (RAG) paradigm is designed to enable our model to effectively handle tasks that require individual-specific knowledge. Our extensive experiments show that VLAS can effectively accomplish robot manipulation tasks with diverse speech commands, offering a seamless and customized interaction experience. With the advent of large vision-language models (VLMs) and the availability of extensive robotic datasets, vision-language-action models (VLAs) (Brohan et al., 2022; 2023; Kim et al., 2024) have become a promising approach for learning policies in robotic manipulation. These models demonstrate enhanced generalization to novel objects and semantically diverse instructions, as well as a range of emergent capabilities.
MapNav: A Novel Memory Representation via Annotated Semantic Maps for VLM-based Vision-and-Language Navigation
Zhang, Lingfeng, Hao, Xiaoshuai, Xu, Qinwen, Zhang, Qiang, Zhang, Xinyao, Wang, Pengwei, Zhang, Jing, Wang, Zhongyuan, Zhang, Shanghang, Xu, Renjing
Vision-and-language navigation (VLN) is a key task in Embodied AI, requiring agents to navigate diverse and unseen environments while following natural language instructions. Traditional approaches rely heavily on historical observations as spatio-temporal contexts for decision making, leading to significant storage and computational overhead. In this paper, we introduce MapNav, a novel end-to-end VLN model that leverages Annotated Semantic Map (ASM) to replace historical frames. Specifically, our approach constructs a top-down semantic map at the start of each episode and update it at each timestep, allowing for precise object mapping and structured navigation information. Then, we enhance this map with explicit textual labels for key regions, transforming abstract semantics into clear navigation cues and generate our ASM. MapNav agent using the constructed ASM as input, and use the powerful end-to-end capabilities of VLM to empower VLN. Extensive experiments demonstrate that MapNav achieves state-of-the-art (SOTA) performance in both simulated and real-world environments, validating the effectiveness of our method. Moreover, we will release our ASM generation source code and dataset to ensure reproducibility, contributing valuable resources to the field. We believe that our proposed MapNav can be used as a new memory representation method in VLN, paving the way for future research in this field.
Training Turn-by-Turn Verifiers for Dialogue Tutoring Agents: The Curious Case of LLMs as Your Coding Tutors
Wang, Jian, Dai, Yinpei, Zhang, Yichi, Ma, Ziqiao, Li, Wenjie, Chai, Joyce
Intelligent tutoring agents powered by large language models (LLMs) have been increasingly explored to deliver personalized guidance in areas such as language learning and science education. However, their capabilities in guiding users to solve complex real-world tasks remain underexplored. To address this limitation, in this work, we focus on coding tutoring, a challenging problem that requires tutors to proactively guide students toward completing predefined coding tasks. We propose a novel agent workflow, Trace-and-Verify (TRAVER), which combines knowledge tracing to estimate a student's knowledge state and turn-by-turn verification to ensure effective guidance toward task completion. We introduce DICT, an automatic evaluation protocol that assesses tutor agents holistically using controlled student simulation and code generation tests. Extensive experiments reveal the challenges of coding tutoring and demonstrate that TRAVER achieves a significantly higher success rate. Although we use code tutoring as an example in this paper, our results and findings can be extended beyond coding, providing valuable insights into advancing tutoring agents for a variety of tasks.
Grounding LLM Reasoning with Knowledge Graphs
Amayuelas, Alfonso, Sain, Joy, Kaur, Simerjot, Smiley, Charese
Knowledge Graphs (KGs) are valuable tools for representing relationships between entities in a structured format. Traditionally, these knowledge bases are queried to extract specific information. However, question-answering (QA) over such KGs poses a challenge due to the intrinsic complexity of natural language compared to the structured format and the size of these graphs. Despite these challenges, the structured nature of KGs can provide a solid foundation for grounding the outputs of Large Language Models (LLMs), offering organizations increased reliability and control. Recent advancements in LLMs have introduced reasoning methods at inference time to improve their performance and maximize their capabilities. In this work, we propose integrating these reasoning strategies with KGs to anchor every step or "thought" of the reasoning chains in KG data. Specifically, we evaluate both agentic and automated search methods across several reasoning strategies, including Chain-of-Thought (CoT), Tree-of-Thought (ToT), and Graph-of-Thought (GoT), using GRBench, a benchmark dataset for graph reasoning with domain-specific graphs. Our experiments demonstrate that this approach consistently outperforms baseline models, highlighting the benefits of grounding LLM reasoning processes in structured KG data.
Mantis: Lightweight Calibrated Foundation Model for User-Friendly Time Series Classification
Feofanov, Vasilii, Wen, Songkang, Alonso, Marius, Ilbert, Romain, Guo, Hongbo, Tiomoko, Malik, Pan, Lujia, Zhang, Jianfeng, Redko, Ievgen
In recent years, there has been increasing interest in developing foundation models for time series data that can generalize across diverse downstream tasks. While numerous forecasting-oriented foundation models have been introduced, there is a notable scarcity of models tailored for time series classification. To address this gap, we present Mantis, a new open-source foundation model for time series classification based on the Vision Transformer (ViT) architecture that has been pre-trained using a contrastive learning approach. Our experimental results show that Mantis outperforms existing foundation models both when the backbone is frozen and when fine-tuned, while achieving the lowest calibration error. In addition, we propose several adapters to handle the multivariate setting, reducing memory requirements and modeling channel interdependence.
On the Robustness of Transformers against Context Hijacking for Linear Classification
Li, Tianle, Zhang, Chenyang, Chen, Xingwu, Cao, Yuan, Zou, Difan
Transformer-based Large Language Models (LLMs) have demonstrated powerful in-context learning capabilities. However, their predictions can be disrupted by factually correct context, a phenomenon known as context hijacking, revealing a significant robustness issue. To understand this phenomenon theoretically, we explore an in-context linear classification problem based on recent advances in linear transformers. In our setup, context tokens are designed as factually correct query-answer pairs, where the queries are similar to the final query but have opposite labels. Then, we develop a general theoretical analysis on the robustness of the linear transformers, which is formulated as a function of the model depth, training context lengths, and number of hijacking context tokens. A key finding is that a well-trained deeper transformer can achieve higher robustness, which aligns with empirical observations. We show that this improvement arises because deeper layers enable more fine-grained optimization steps, effectively mitigating interference from context hijacking. This is also well supported by our numerical experiments. Our findings provide theoretical insights into the benefits of deeper architectures and contribute to enhancing the understanding of transformer architectures.
ChatGPT reaches 400M weekly active users
ChatGPT has surpassed 400 million weekly active users. "We feel very fortunate to serve 5 percent of the world every week," OpenAI COO Brad Lightcap said on X about the new audience stat. This figure is twice the weekly active user count reported by the company in August 2024, which was double the figure it posted in November 2023. The latest milestone for the AI assistant comes after a huge uproar over new rival platform DeepSeek earlier in the year, which raised questions about whether the current crop of leading AI tools was about to be dethroned. OpenAI is on the verge of a move to simplify its ChatGPT offerings so that users won't have to select which reasoning model will respond to an input, and it will make its GPT-4.5 and GPT-5 models available soon in the chat and API clients.
Why OpenAI is trying to untangle its 'bespoke' corporate structure
On the Friday after Christmas, OpenAI published a blog post titled "Why OpenAI's structure must evolve to advance our mission." In it, the company detailed a plan to reorganize its for-profit arm into a public benefit corporation (PBC). In the weeks since that announcement, I've spoken to some of the country's leading corporate law experts to gain a better understanding of OpenAI's plan, and, more importantly, what it might mean for its mission to build safe artificial general intelligence (AGI). "Public benefit corporations are a relatively recent addition to the universe of business entity types," says Jens Dammann, professor of corporate law at the University of Texas School of Law. Depending on who you ask, you may get a different history of PBCs, but in the dominant narrative, they came out of a certification program created by a nonprofit called B Lab. Companies that complete a self-assessment and pay an annual fee to B Lab can carry the B Lab logo on their products and websites and call themselves B-Corps.
Program Merge: What's Deep Learning Got to Do with It?
If you regularly work with open-source code or produce software for a large organization, you are already familiar with many of the challenges posed by collaborative programming at scale. Some of the most vexing of these tend to surface as a consequence of the many independent alterations inevitably made to code, which, unsurprisingly, can lead to updates that do not synchronize. Difficult merges are nothing new, of course, but the scale of the problem has gotten much worse. This is what led a group of researchers at Microsoft Research (MSR) to take on the task of complicated merges as a grand program-repair challenge--one they believed might be addressed at least in part by machine learning (ML). To understand the thinking that led to this effort and then follow where that led, ACM Queue asked Erik Meijer and Terry Coatta to speak with three of the leading figures in the MSR research effort, called DeepMerge.a Meijer was long a member of MSR, but at the time of this discussion was director of engineering at Meta. Coatta is the chief technology officer of Marine Learning Systems. Shuvendu Lahiri and Christian Bird, two of the researchers who helped drive this effort, represent MSR, as does Alexey Svyatkovskiy, who was with Microsoft DevDiv (Development Division) at the time. Terry Coatta: What inspired you to focus on merge conflicts in the first place? And what made you think you'd be able to gain some advantage by applying AI techniques? Christian Bird: Back in the winter of 2020, some of us started talking about ways in which we might be able to use machine learning to improve the state of software engineering.
xAI's Grok 3 is available for free to everyone 'for a short time'
You can now access xAI's most advanced large language model, Grok 3, even if you don't pay for a subscription on X. Grok 3 is available for free "for a short time," according to xAI founder Elon Musk, though the company didn't say until what "short time" means exactly. When you go to Grok on X or the web, and when you launch the standalone app, you'll now see new "Think" and "DeepSearch" options that are only available with xAI's latest LLM family. Just make sure you're using Grok 3 instead of Grok 2 in the chatbot interface's drop-drown menu. If you're paying for X Premium, which now costs 40 a month, or the chatbot's standalone 30-per-month SuperGrok plan, you'll get "increased access" to Grok 3's features, as well as early access to advanced features like Voice Mode. For a short time, Grok 3 is available for free to all! https://t.co/r5iLXi2pBm