A new graph-constrained generative paradigm is introduced, Anticipatory Generative Modeling, which resolves next transition selection by incorporating the Anticipation of how the future route may unfold toward the destination, and a novel generative model named Foresight that formulates a probabilistic model for an"ant...
Large audio-language models (LALMs) frequently exhibit object hallucination, affirming absent sounds. The dominant mitigation, Audio-Aware Decoding (AAD), contrasts logits under real audio against an all-zero"blank"waveform, flagged by prior review as out-of-distribution. We introduce a black-box causal test that isola...
Empowerment measures the capacity of an agent to actively control its environment. In this work, we explain the connection between skill learning and empowerment. While skill learning is not empowerment, we introduce a simple scalable recipe for empowerment maximization: empowerment corresponds to the number of executa...
Catherine Ji, Vivek Myers, Joshua Lin et al.· 0 citations
VEPA is introduced, a framework for the verified evolution of formal agent guardrails that represents the guardrail as a formal policy of executable symbolic rules over typed agent events and consistently outperforms baselines while expanding the scope of deterministic formal-policy enforcement.
Duy Nguyen, Lesly Miculicich, Bhavana Dalvi et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Data-centric scaling of RLVR has focused on collecting or generating verifiable training problems. However, corpus size alone does not determine whether the dataset provides a useful learning signal for a target policy. To guide the synthesis of effective RLVR data, we experimentally characterize dataset effectiveness...
Ximing Lu, Aviral Kumar, Jan Kautz et al.· 0 citations
Agentic large language models now tackle complex tasks, yet strategic reasoning over long horizons is under-studied: most agentic benchmarks are short and episodic, and performance on long tasks is hard to dissect into stored knowledge, reasoning and luck. We introduce SpireBench, in which models play the complete comm...
Monte Carlo Tree Search (MCTS) is often proposed for scheduling directed-acyclic-graph (DAG) workflows, yet most studies never run the comparison that could refute it - giving a much simpler method the same search effort. We run that comparison under a controlled protocol. All arms receive an identical budget - the sam...
Explainable Artificial Intelligence (XAI) tools have often been presented as methods to increase trust in machine learning models by making aspects of their algorithms more human-understandable. However, evidence accumulated over the last decade points to an overall failure of this objective, instead promoting overreli...
Marco Zullich, Emily Schiller, Ivan Gentile et al.· 0 citations
Training Mixture-of-Experts (MoE) models for reinforcement learning (RL) couples two load-balancing problems: sequence composition determines dense attention work in each data-parallel microbatch, while token routing determines sparse expert work on expert-parallel ranks. Optimizing either alone can shift the bottlenec...
Yibo Shen, Xudong Han, Xiao-Wei Zhu et al.· 0 citations
The increasing complexity of state-of-the-art machine learning models has made their behavior progressively harder to interpret, spurring rapid advancements in the field of eXplainable Artificial Intelligence (XAI). Among many methods proposed, perturbation-based approaches play a major role. By systematically altering...
Josef Lindl, Mariana Chaves, Damien Garreau· Lecture notes in computer sc...· 0 citations
A fractional stochastic neural network with residual dynamics driven by fractional Brownian motion is developed by introducing a discrete stochastic maximum principle and constructing the corresponding adjoint recursion.
We introduce a PAC framework in which the learner can access sampling oracles both before and at decision time. Sample complexity is measured by a pair $(n,m)$, where $n$ is the learning budget spent before a query is known and $m$ is the additional sampling budget per query. We demonstrate its relevance in discounted...
Corentin Pla, Hugo Richard, Marc Abeille et al.· 0 citations
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 27, 2026
Prabha Jha used her experience with MIT Open Learning’s program for senior executives to develop AI solutions for her employer, Verizon, and to write a book.
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.