A central question in the LLM debate is whether transformers can infer rules absent from training, or whether apparent generalisation reduces to similarity-based interpolation over observed examples. We test a strong interpolation-only hypothesis in two controlled settings: one where interpolation is ruled out by construction and proof, and one where success requires emitting intermediate symbolic derivations rather than only final answers. In Experiment 1, we use a cellular automaton with a pure XOR transition rule and remove specific […]

Ver mais

Automated Speciation (Bifurcation) When the Regulator returns UNSAT (identifying that performance and diversity constraints are mutually exclusive), the system triggers a Bifurcation Event. This partitions the population into specialized sub-cradles, proved by Lean 4 to be Pareto-optimal transitions. JAX-Native Parallelism Implementation utilizes JAX collective operations for O(1) scaling across multi-GPU/TPU nodes. The Symbolic Tier (Z3/Lean) runs asynchronously on CPU nodes, maintaining high-throughput JaxMARL environment rollouts. submitted by /u/Regular_Run3923 [link] [comments]

Ver mais

arXiv:2601.20038v1 Announce Type: new Abstract: Kawarabayashi and Sidiropoulos [KS22] obtained an $O(log^2 n)$-approximation algorithm for Multicut in planar digraphs via a natural LP relaxation, which also establishes a corresponding upper bound on the multicommodity flow-cut gap. Their result is in contrast to a lower bound of $tilde{Omega}(n^{1/7})$ on the flow-cut gap for general digraphs due to Chuzhoy and Khanna [CK09]. We extend the algorithm and analysis in [KS22] to the node-weighted Multicut problem. Unlike in general digraphs, node-weighted […]

Ver mais

arXiv:2602.18569v1 Announce Type: new Abstract: Many people could benefit from exoskeleton assistance during gait, for either medical or nonmedical purposes. But exoskeletons bring added mass and structure, which in turn require compensating for. In this work, we present a lightweight, low-complexity, soft bilateral ankle exoskeleton for plantarflexion assistance, with a shoe attachment design that can be mounted on top of any pair of shoes. Experimental tests show no significant difference in lower limb kinematics and kinetics when wearing […]

Ver mais

A major challenge of Reinforcement Learning is that agents often learn undesired behaviors that seem to defy the reward structure they were given. Explainable Reinforcement Learning (XRL) methods can answer queries such as "explain this specific action", "explain this specific trajectory", and "explain the entire policy". However, XRL lacks a formal definition for behavior as a pattern of actions across many episodes. We provide such a definition, and use it to enable a new query: "Explain this behavior". […]

Ver mais

Something I like about our weird new LLM-assisted world is the number of people I know who are coding again, having mostly stopped as they moved into management roles or lost their personal side project time to becoming parents. AI assistance means you can get something useful done in half an hour, or even while you are doing other stuff. You don’t need to carve out 2-4 hours to ramp up anymore. If you have significant previous coding […]

Ver mais

arXiv:2604.06263v1 Announce Type: new Abstract: Generative advertising in large language model (LLM) responses requires optimizing sponsorship configurations under two strict constraints: the strategic behavior of advertisers and the high cost of stochastic generations. To address this, we propose the Incentive-Aware Multi-Fidelity Mechanism (IAMFM), a unified framework coupling Vickrey-Clarke-Groves (VCG) incentives with Multi-Fidelity Optimization to maximize expected social welfare. We compare two algorithmic instantiations (elimination-based and model-based), revealing their budget-dependent performance trade-offs. Crucially, to make VCG computationally feasible, we […]

Ver mais

arXiv:2511.18107v2 Announce Type: replace-cross Abstract: Accurately solving partial differential equations (PDEs) is critical to understanding complex scientific and engineering phenomena, yet traditional numerical solvers are computationally expensive. Surrogate models offer a more efficient alternative, but their development is hindered by the cost of generating sufficient training data from numerical solvers. In this paper, we present a novel framework for active learning in PDE surrogate modeling that reduces this cost. Unlike the existing AL methods for PDEs that always […]

Ver mais