Researchers developed a framework that enhances local AI models to achieve performance comparable to Fable on benchmarks, potentially at a lower cost, which the author is attempting to integrate into their opencode setup.
A University of Michigan study finds that people increase their confidence when AI agrees with their views, but do not significantly change their opinions when AI disagrees.
Research indicates that rapid caldera collapse during the 2022 Hunga eruption enhanced the tsunami, suggesting small undersea volcanoes can generate outsized tsunamis.
A user shares a hand-drawn illustration prompt to summarize a Google Research paper on recursive self-improvement for AI agents, highlighting its clarity and practical approach without retraining models.
RAND proposes a 'Freedom of Action' strategy for the U.S. to navigate the uncertain path to artificial superintelligence, keeping major options open until evidence dictates a choice.
This paper proposes a lightweight plastic-memory framework for graph few-shot class-incremental learning, which uses an evolving micro-clustering structure and meta-learning to balance knowledge retention and adaptability to new classes with limited data.
The paper proposes ADNet, an adaptive decomposition network for multi-step traffic forecasting that learns to disentangle heterogeneous traffic dynamics into dominant and residual components via spectral decomposition, achieving superior performance on the TraffiDent dataset.
This paper characterizes the minimal recurrent behavioral memory required for imitating an expert under partial observability, using information-theoretic measures and experimental validation.
The paper introduces Modular Norm RandOpt, an architecture-aware perturbation method for efficient ensembling of language models, showing improved performance with fewer candidates across multiple tasks and model scales.
This paper introduces randomized-pass replay (RPR) to bound rehearsal gaps in online continual learning, showing improved accuracy over independent class-balanced retrieval in experience replay methods like ER-ACE.
The paper proposes a general self-supervised learning framework for combinatorial optimization using Frank-Wolfe methods to handle constraints, with strong empirical results on problems like TSP, Maximum Coverage, and QAP.
The paper introduces TopoSIGN, a topology-guided graph pre-training and prompt learning framework for signed graphs, which combines structural encoding and persistent homology to improve transfer learning in tasks like link prediction and node classification.
This paper studies how traits can persist across multiple generations of language models in training lineages, finding that traits may remain internally present even when behaviorally absent, with implications for model safety and training.
The paper proposes FRAC-MARL, a decentralized actor-critic multi-agent reinforcement learning method that achieves full Byzantine resilience by leveraging redundancy in communication, ensuring convergence to optimal parameters even under adversarial attacks.
The paper proposes EviGDA, a framework that enhances graph domain adaptation by combining graph-aware and graph-free experts to improve prediction under structural shifts.
The paper derives exact changes in marginal log-likelihood for Dirichlet-smoothed Markov models when adding workflow traces, and evaluates trace selection methods under budget constraints using the BPI Challenge 2012 dataset.
This paper introduces Riemannian Wasserstein Entropic Flow Matching (RWEFM), a generative framework for modeling probability distributions on Riemannian manifolds, with applications in scientific domains like single-cell biology and protein conformations.
This paper introduces ActiveContinuous-Score Occupancy Modeling to optimize the allocation of review efforts for machine learning labels in AI-assisted biodiversity surveys, enhancing the accuracy of occupancy models.
The paper introduces NSFT, a fine-grained parameter-efficient fine-tuning framework for MoE LLMs that refines adaptation from experts to sub-experts, demonstrating improved performance with fewer trainable parameters.
This paper proposes GittinsEval, a cost-aware Bayesian bandit framework for efficient LLM evaluation that significantly reduces costs while maintaining high performance by adaptively selecting configurations.