This analysis identifies a common obstruction: cheap nuisance interpolation causes the refit to underweight the truly predictive coordinate, and an exact target-mass identity and a two-sign argument turn this effect into clipped prediction loss.
A novel mechanism to automatically identify which of these point-labels are suitable, and which are actively harmful, when used for propagation is introduced, paving the way for scalable ecological analysis.
César Borja, Breck A. McCollum, Jarrett E. K. Byrnes et al.· 0 citations
Reflex-Guard is introduced, a lightweight guardrail that runs locally that uses jailbreak-aware preprocessing, compact sentence-transformer embeddings, and seven fast binary classifiers that enable high-accuracy prompt safety filtering with much lower latency than existing solutions.
Istiaque Ahmed, Afia Anjum Borsha, Ranat Das Prangon et al.· 0 citations
Spaced Repetition Training (SRT) is introduced, a continual learning framework inspired by cognitive science, which schedules sample-rehearsal using the SuperMemo-2 (SM-2) algorithm, and preserves broad benchmark performance that naive continual pre-training and uniform replay substantially degrade.
Results indicate the visual component is dominant but not solely responsible for skill prediction; further work is needed to conclusively disentangle transferable skill features from those bound to a specific visual domain.
Hanna Hoffmann, F. Bechtolsheim, Stefanie Speidel et al.· 0 citations
The Structural Gap Hypothesis Agent (SGHA), a fully automated, corpus-first research-problem discovery system that runs entirely on a local LLM, is introduced and compared with the AI Scientist-v2 idea formulation module in five machine-learning domains.
An analysis that derives task-specific algorithmic design spaces from human-designed methods, maps both human- and agent-designed methods into these spaces, and quantifies their algorithmic differences at the module level suggests that although current agents can occasionally match or surpass human SOTA performance, their algorithmic designs remain within human-derived algorithmic design spaces.
Yikang Yang, Zhengxin Yang, Luzhou Peng et al.· 0 citations
This paper proposes an online generalized-sparsity-constrained regression framework, focusing on online cardinality-constrained linear regression and low-rank matrix sensing, and introduces an efficient online hard-thresholding algorithm that performs closed-form updates and requires storing only summary statistics, making it computationally, memory, and storage efficient.
A transition kernel defined over the RBM sequence used in DT is proposed, enabling nonlocal moves within a single transition while leaving the RBM sequence invariant and mitigates the training failures observed with BGS- and DT-based learning.
Across four RoboTwin tasks spanning different horizons and coordination patterns, Prism-GRPO improves success and quality at matched rollout budgets and reaches target success rates with up to 56% fewer rollouts.
Zeyun Deng, Yuzhe Lu, Ya-Wei Wang et al.· 0 citations
Motivated by a conjecture of Vaikuntanathan and Zamir, we study the pseudo-mixing of Kac's walk on $\mathrm{SO}(n)$: whether short trajectories are indistinguishable from Haar measure by low-complexity tests. We prove that the first $k$ columns mix in Wasserstein distance in $O(n(k+\log n)\log n)$ steps for fixed accuracy, resolving a conjecture of Oliveira. Combining this with a representation-theoretic variance bound, we show that if $T=\omega(nk(k+\log n)\log n)$, then every degree-$k$ polynomial normalized to have unit Haar variance has expectation under the $T$-step law within $o(1)$ of its Haar expectation. As an application, we show that this pseudo-mixing estimate can be used to prove the effectiveness of a fast Johnson--Lindenstrauss transform with the usual target dimension.
N. Pillai, Aaron Smith, Vinod Vaikuntanathan· 0 citations
SPACE is proposed, a conformal wrapper for sample-generating multivariate forecasters that consistently brings realized joint and rolling coverage closer to the nominal target, achieving superior coverage-efficiency tradeoffs relative to competing wrappers.
Baishi Li, Kelvin J. L. Koa, Ke-Wei Huang· 0 citations
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.
MIT News · Artificial Intelligence· news.mit.eduAug 24, 2026