Week beginning 9th November 2026

Every computer science paper posted to arXiv this week, with plain-language summaries and practical uses for each one. Includes commercial applications where relevant.

Pairing AIS and RF data improves maritime vessel detection accuracy

Pairing AIS with RF: Analysis of a Markovian Approach for Maritime Data Fusion

Abstract: Monitoring maritime activities is important for safety and security, particularly for detecting illegal activities, but remains challenging due to the size and complexity of the maritime domain. The Automatic Identification System (AIS) is commonly used for this purpose, despite its known vulnerabilities. In contrast, space-based radio frequency (RF) observations provide an independent source of vessel activity but lack ship identification and therefore cannot identify vessels on their own. Following the CRISP-DM process, this study applies a Pair Hidden Markov Model (PHMM) to align individual RF detections with AIS trajectories, using temporal and spatial information while modeling noise and timing discrepancies. We evaluate it on NOAA AIS data with synthetic RF detections against nearest-neighbor baselines and analyze its errors with bias tests on trajectory length, sampling density, stationarity and AIS--RF distance. The length-corrected Forward score reaches a top-1 precision of $0.7776$ on the validation split of multi-candidate detections, where errors are possible, and an AUC of $0.637$ for detecting dark vessels among the detections that pass the prefilter. With a single RF detection, the score mostly reflects the AIS trajectory itself, and its errors favor longer and more stationary trajectories. A log-odds score, which compares the full model with a null model without match transitions, raises precision to $0.8580$ and AUC to $0.852$. Its length-corrected variant no longer shows a significant bias towards stationary trajectories and short inter-message distances, but still favors candidates farther from the RF detection. A time-weighted nearest-neighbor baseline without fitting remains ahead (precision $0.9013$, AUC $0.904$), so this single-detection, hand-designed PHMM formulation approaches but does not beat it.

Fri 13 NovMachine LearningCryptography and Security
The gist
Tracking ships at sea is important for safety and spotting illegal activities, but it's hard because of the vast ocean area. The authors studied how to combine two kinds of data: AIS signals that ships send out but can be faked or missed, and radio frequency (RF) detections from space that don’t identify ships directly. They used a special statistical model to link these two data types and found their method gets close to simpler methods for matching ships but doesn't always beat them. Their approach helps understand errors and biases when combining these data sources.
Open → 2611.18563v1

Brain to text decoding runs fast and accurately on mobile devices

FETTUCCINE: Fast and efficient brain-to-text decoding on mobile devices

Abstract: Recent advances in speech neuroprostheses have enabled new communication avenues for people who have lost the ability to speak due to neurological illness or injury. These systems can decode neural activity during attempted speech into text by relying on language priors to achieve high decoding accuracy. This performance currently comes at the cost of using a compute-intensive language modeling stack, presenting a major bottleneck for real-world use. Further, current language models incur highly variable and disruptive inference latencies, limiting communication throughput and preventing users from reliably participating in natural conversation. We introduce FETTUCCINE, an end-to-end brain-to-text framework that leverages the speed and portability of automatic speech recognition (ASR) models to address the aforementioned practical challenges, while achieving usable (<10%) word error rates (WER), efficient adaptation to neural non-stationarities, and reliable performance on mobile devices. When evaluated using publicly available data from an intracortical speech neuroprosthesis user, FETTUCCINE outperforms previous end-to-end methods, achieving as low as 4.39% WER. Most notably, our models successfully run on a commercially-available mobile device with throughput reaching up to 370x real-time, providing the first demonstration of brain-to-text decoding on a mobile device. We also show that our models can be successfully finetuned to extend usable performance to future days. Beyond performance, our approach enables localization of the neural features most relevant for decoding via gradient-based saliency maps, which we show align with well-established physiological priors across different ASR model families. Taken together, our results show that FETTUCCINE overcomes core infrastructural and computational barriers, yielding a new class of portable brain-to-text communication.

Fri 13 NovMachine Learning
The gist
People who can no longer speak due to illness might use brain signals to communicate, but current systems are slow and need powerful computers. The authors developed FETTUCCINE, a new method that quickly turns brain signals into written words using speech recognition technology, and can run on a phone. Their tests show it is accurate and can keep working well over several days. This method also helps locate which brain signals are most important for decoding speech.
Open → 2611.18561v1

Open-weight model trained in simulation controls real robots effectively

Training Reasoning Models in Simulation to Natively Use Real Robots

Abstract: Robot-use agents (RUAs) have emerged as a promising approach to general-purpose robot control. However, strong performance has so far been achieved only by frontier proprietary models such as GPT-6 Astra and Claude Fable 5.2, whereas open-weight models remain substantially less capable. We show that an open-weight 27B reasoning model can be trained to use real robots natively through reinforcement learning, entirely in simulation and without demonstrations. Like a computer-use agent (CUA), the model observes the environment, reasons in a chain of thought, and generates the next end-effector pose, without any harness. We build a Post-training Engine for Agentic Robotics (PEAR) and use it to train the model on simulated robot tasks at scale with robot-use reinforcement learning (RURL), mirroring how frontier models acquire computer use. We find that the skills acquired in simulation generalize well beyond the training tasks: they transfer to an unseen robot, to the real world, and to novel instructions. After training on LIBERO and RoboDojo in simulation, the model succeeds in 60% of our trials on a real dual-arm robot, whereas the base model succeeds in none. On LIBERO, training raises the success rate from 1.6% to 74.4%, approaching GPT-6 Astra and GPT-6.1 Sol at maximum reasoning effort. Compared with $π_{0.5}$, a vision-language-action model fine-tuned on demonstrations, our model is substantially more robust to changes in the task itself. On LIBERO-Pro, $π_{0.5}$ succeeds in only 0.75% of episodes when assigned a new task in a familiar scene whereas our model succeeds in 57.4%. Finally, the model retains its general capabilities, with no measurable degradation on nine reasoning, coding and vision benchmarks. These results highlight robot-use reinforcement learning as a promising component of foundation-model post-training.

Fri 13 NovRoboticsMachine Learning
The gist
Controlling real robots well usually requires powerful, often proprietary AI models. The authors show that a large open AI model can learn to control robots by training purely in simulation without using examples. This trained model can then operate a real dual-arm robot and perform well on new tasks it wasn't explicitly trained on. It also keeps its general abilities intact, showing no loss in other reasoning or coding tasks after training.
Open → 2611.18562v1

Human movement prediction improves by learning forward and backward representations

BAL: Bidirectional Autoregression in Latent Space for Learning Human Movement Representations

Abstract: Learning semantically meaningful human movement representations from 3D pose sequences is essential for human behavior modeling. Existing self-supervised methods derive supervision from artificial assumptions, e.g., invariance to augmentation within a certain range or recoverability of masked regions at a certain temporal scale, introducing heuristic hyperparameters that make the learned semantics sensitive to their settings. We propose BAL, a self-supervised framework that instead exploits supervision intrinsic to human movement: the natural ordering structure of everyday behavior. BAL autoregressively predicts in a semantically abstract latent space, analogous to how humans anticipate others' actions rather than their precise joint configurations. Bidirectional autoregressive prediction, both forward and backward in time, fully leverages these ordering constraints while enabling representation extraction using both past and future context at inference. To suppress representation collapse, BAL decomposes each prediction target into a global component capturing sequence-level semantics and a local component capturing context-independent movement. We prove that the local targets retain nontrivial angular diversity unless the representations are completely collapsed, preserving a meaningful training signal. Experiments on large-scale datasets demonstrate that BAL's representations are highly effective for motion captioning, forecasting, and interpolation, outperforming baselines on most evaluation metrics.

Fri 13 NovComputer Vision and Pattern RecognitionMachine Learning
The gist
Understanding and modeling human movement is important for many applications, but existing methods often rely on tricky assumptions that can make learning inconsistent. The authors propose BAL, a new approach that learns human motion by predicting what happens next and what happened before in an abstract form instead of raw joint positions. This method uses the natural order of movements and prevents the model from collapsing into meaningless patterns by splitting predictions into overall motion and small local changes. Their experiments show that this approach produces better representations for tasks like describing movements, predicting future poses, and filling in missing motions.
Open → 2611.18559v1

Benchmark tests language models editing neural network weights

WeightBench: Evaluating Language Models as Weight-Space Programmers

Abstract: Recent work shows that large language models (LLMs) can operate directly on the parameters of other neural networks. They can read what a network was trained to do, fix a network that fails, and write working networks from scratch, all without gradient descent. This capability has been termed Weight-Space Programming (WSP). Exploring this new paradigm systematically requires a robust benchmark. We introduce WEIGHTBENCH, a benchmark that evaluates LLMs of increasing capability on 42 WSP tasks across five tracks: reading, fixing and writing weights, recognizing edits that are impossible, and data-free compression. The networks whose weights the LLMs read and edit range from 2K-parameter control policies to 7B-parameter language models. Experimental benchmark results show that frontier agents can already read small networks and write working control policies without ever running them, but cannot yet patch language models, compress them without data, or tell an impossible edit from a hard one. On all 42 tasks, Claude Opus 5.5 reaches a macro score of 0.535 (Sonnet 5.5 0.466, Haiku 5.5 0.402, DeepSeek v4-flash 0.215); on the 38 tasks it was run on, GPT-6.1-sol reaches 0.568 against Opus's 0.546. Code, the task registry, our OS-level sandbox harness, and the live leaderboard are publicly available at https://github.com/Aayush-Marasini/WeightBench.

Fri 13 NovMachine LearningArtificial Intelligence
The gist
It can be hard to understand or fix how one neural network works by looking inside it, especially for other AI systems. The authors created a test called WeightBench that sees how well large language models can read, fix, or write the parameters of other neural networks without retraining. They tested many tasks and found current models can handle small networks well but still struggle with bigger ones or harder tasks. This benchmark helps measure progress in having AI directly program other AI systems.
Open → 2611.18553v1

Restoring variety in fast image and video generation models

Restoring Diversity in Distilled Image and Video Generators by Probing Activations

Abstract: Distilling diffusion models into few-step student models substantially reduces sampling latency, but induces severe diversity collapse: samples generated from different random seeds show minimal variation. In this work, we investigate the root cause of this failure by probing the internal representations of student models relative to their teachers. We find that distilled students maintain total activation variance comparable to their teachers, but concentrate it into substantially fewer directions. This directional collapse is localized to an identifiable intermediate block at the initial denoising step. Consequently, diversity collapse stems from a misallocation of activation variance rather than an inherent loss of generative capacity. Guided by this finding, we propose ReDiverse to reinstate the missing variance directions. At training time, ReDiverse-FT fine-tunes a lightweight adapter that regresses student activations onto the teacher's, reviving the teacher's feature variance characteristic. At inference time, ReDiverse-TF introduces a training-free mechanism that steers activations along precomputed teacher principal directions. Across image and video distillation benchmarks, ReDiverse consistently restores sample diversity while preserving generation quality, further supported by the user study.

Fri 13 NovComputer Vision and Pattern Recognition
The gist
Generating images and videos quickly often involves making simpler versions of big models, but this can cause the models to produce very similar results every time. The authors found that while these simpler models keep overall activity similar to the original, this activity is focused too narrowly, losing diversity. They created two methods to fix this by restoring the lost variation in the model’s internal signals, leading to more varied outputs without losing quality. Their work applies to both pictures and videos and was confirmed by user feedback.
Open → 2611.18550v1

Just Video Transformer simplifies pixel video generation with transformers

JVT: Just Video Transformer makes pixel-space video diffusion simple

Abstract: Direct diffusion modeling of high-dimensional raw video data is challenging, and existing pixel-space methods often rely on specialized architectures. We introduce JVT (Just Video Transformer), a simple large-patch DiT-style Transformer for pixel-space video diffusion, without a pretrained autoencoder, auxiliary detailers, cascaded stages, or U-Net-style skip connections. We systematically examine video patch embeddings, register tokens, and adaptive layer normalization to identify design choices that balance generation quality and computational efficiency. The resulting JVT design achieves generation quality competitive with latent diffusion baselines in both class-conditioned and unconditional settings. The pixel-space formulation of JVT also naturally supports joint generation of pixel-aligned modalities. We demonstrate this capability through camera-conditioned RGB-disparity generation, which improves camera following relative to RGB-only baselines and yields explicit scene geometry without an additional reconstruction model at inference. These results highlight the potential of simple DiT-style Transformers for pixel-space video diffusion, and we hope our findings offer useful insights and practical guidance for future research.

Fri 13 NovComputer Vision and Pattern Recognition
The gist
Creating videos directly from raw pixels is difficult and often requires complex special tools. The authors introduce Just Video Transformer (JVT), a simpler way to generate videos using a type of AI model called a Transformer, without extra tricks or helpers. They studied which design choices work best to keep the quality high while saving computing power. Their method matches the quality of existing advanced approaches and can also create related video information like depth maps that help understand scenes better.
Open → 2611.18549v1

Continuum robots achieve precise motion with advanced friction modeling

Modeling the Frictional Contact of Continuum Robots with Environments through Linear Complementarity Problem

Abstract: Accurate friction modeling in continuum robots is essential for precise motion control and path planning. However, current approaches make predictions only for the mechanism's internal friction that is limited by the boundary forces of the Coulomb friction cone, which fail to characterize the static friction and motion hysteresis. In this paper, we propose a novel friction model based on complementarity constraints under the Coulomb friction assumption. This model predicts various friction effects caused by environmental interactions, including both static and sliding frictions and hysteresis behavior, as well as the corresponding robot deformation induced by these interactions, which are crucial for the practical motion planning and control of continuum robots. Additionally, real-time implementation of this model can be achieved, meeting the demand for computational efficiency in robotic applications. Experimental validations demonstrated that this model is able to reduce the maximum tip position error from 45.4 mm in the frictionless model to 5.85 mm in our friction-included model with a 287.9 mm-long tendon-driven continuum robot.

Fri 13 NovRobotics
The gist
Controlling the movement of flexible robots that bend and twist, called continuum robots, is tricky because friction from their surroundings can make them move unpredictably. The authors created a new way to model how friction works when these robots touch things around them, capturing even sticky forces and the lag in movement changes. Their model helps predict how the robot will actually behave, making its movements more accurate. They tested this on a real robot and found it made the robot’s tip much closer to where it was supposed to be.
Open → 2611.18546v1

Adaptive perturbations improve solving linear systems with less computation

From smoothed analysis to backward error: The power of adaptive perturbations

Abstract: Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a solution to a small random perturbation of the problem instance. This is closely related to the classical concept of backward error in numerical analysis, which allows an algorithm to return a solution to an arbitrary perturbation of the problem. Despite the qualitative similarity of these concepts, we show that they can exhibit large quantitative differences. Notably, we prove that, while a linear system with any $n \times n$ matrix $A$ can be solved to backward error $ε$ using $O(\log(n) / ε)$ matrix-vector products with $A$, any algorithm that solves a random $ε$-sized perturbation of $A$ requires $Ω(n)$ matrix-vector products. This means that a useful perturbation for solving a linear system in backward error must be adaptive to the input. Interestingly, however, randomness is still essential: we show that any deterministic method that attains small backward error for all linear systems provably requires $Ω(n)$ matrix-vector products, resulting in the first separation between randomized and deterministic algorithms in a natural computational model for solving linear systems. Finally, we show that matrix structure can significantly affect backward error complexity. For example, we show a deterministic $O(1/ε)$ matrix-vector product algorithm for symmetric linear systems.

Fri 13 NovData Structures and Algorithms
The gist
Solving systems of linear equations is crucial in computing but can sometimes take a lot of time. The authors show that when solving these systems, carefully changing (or perturbing) the input data based on the original problem helps solve it more efficiently than just adding random noise. They prove that random changes alone need many steps, but adaptive tweaks require fewer. They also find that the structure of the data can change how hard it is to solve these equations.
Open → 2611.18545v1

Tight bounds improve clustering guarantees for k median and k means

Tight Bounds for k-Median++ and Improved Bounds for k-Means++

Abstract: The popular $k$-means++ algorithm, or $D^\ell$-sampling, is a fundamental primitive in both the theory and practice of clustering. In the bi-criteria setting, the algorithm samples $k+Δ$ centers ($Δ\ge0$), and its cost is compared with the optimum using $k$ centers. Despite extensive study over the past two decades, its exact approximation ratio and tight bi-criteria guarantees remain unknown. We give a unified analysis for every distance exponent $\ell>0$, every $k\ge1$, and every $Δ\ge0$. For metric $k$-median, our bounds are tight for all $k$ and $Δ$. Without extra centers, the exact approximation ratio is $2(1+H_{k-1})$ (also in Euclidean space), improving the previous upper bound by a factor of $2$ ($H_j$ denotes the $j$th harmonic number). This tight analysis reveals that even one extra center improves the approximation ratio by an additive $Θ(\log\log k)$, whereas previous bounds show no improvement. For every $\ell>0$, our analysis gives upper bounds with the same dependence on $k$ and $Δ$ as our tight bound for metric $k$-median, with leading constants depending only on $\ell$ and whether the metric is Euclidean. Beyond the improved dependence on $Δ$, our leading constants are smaller than those in previous analyses. In particular, for the widely used Euclidean $k$-means objective, our upper bound without extra centers is $(1+\varphi)(1+H_{k-1})$, where $\varphi\approx1.618$ is the golden ratio, improving upon the previous constant of $5$. With oversampling, a constant fraction of extra centers is known to provide a constant-factor approximation. For example, with $10\%$ extra centers, our guarantee is $5.7$, compared with the best previous guarantee of $25.9$.

Fri 13 NovData Structures and Algorithms
The gist
Finding good cluster centers for data helps organize and understand information, but figuring out how close you are to the best solution can be tricky. This paper studies a popular method called k-means++ that picks cluster centers intelligently and gives new, exact limits on how well it performs. The authors show better results than before, especially when allowing a few more centers than the basic method. These improvements work for many types of distance measures, helping ensure clustering is both reliable and efficient.
Open → 2611.18544v1

Imitation bootstrapping speeds up multi-agent reinforcement learning

Imitation Bootstrapped Multi-Agent Reinforcement Learning

Abstract: Demonstrations are an effective way to accelerate single-agent reinforcement learning (RL), but extending this idea to multi-agent reinforcement learning (MARL) is non-trivial as it is difficult and often impossible for a single person to teleoperate multiple agents simultaneously. Round-Robin Behavior Cloning (R2BC) addresses this by letting a single demonstrator control one agent at a time while the others execute their current policies. However, the resulting imitation policies are limited by the quality of the demonstrations. We propose Imitation Bootstrapped Multi-Agent Reinforcement Learning (IBMARL), a framework that extends Imitation Bootstrapped Reinforcement Learning (IBRL) to cooperative teams and uses R2BC to train the imitation policies. At each time step, every agent receives one action proposal from its imitation policy and one from its RL policy, and an ensemble of centralized critics selects among the per-agent combinations of the two. A gated imitation penalty, a soft Q-filtered behavior cloning loss, regularizes each RL policy toward its imitation policy only where the critics value the imitation action more, so that after training each agent executes its RL policy alone, without the centralized critics. On four cooperative multi-agent RL benchmarks, IBMARL surpasses its imitation policies $2.6$-$4.2\times$ faster than demonstration-based baselines on two tasks, is the only method to surpass it on the other two, and exceeds the demonstrator itself on two of the four. With real human demonstrations IBMARL still surpasses imitation learning alone, and does so more than twice as fast as the best baseline.

Fri 13 NovArtificial IntelligenceMultiagent Systems
The gist
Training multiple AI agents to work together can be very slow because one person cannot easily control all of them at once to give examples. The authors propose a method that lets a person teach one agent at a time while the others act on their own, and then uses a smart way to combine these lessons with the agents’ own learning. This approach helps the agents learn faster and perform better than just copying the demonstrations or other existing methods. It also works well even when the demonstrations come from real humans.
Open → 2611.18543v1

Elliptic schedules improve sampling efficiency for complex distributions

Elliptic Sampling: Optimal Interpolant Schedules for Gaussians and Beyond

Abstract: Generative modeling based on stochastic interpolants requires specifying two key choices: an interpolant schedule bridging the initial and target distributions, and an efficient discretization of the resulting probability-flow ODE. In this work, we introduce a new framework for joint schedule/discretization design based on the analyticity properties of the (complexified) ODE trajectories, which in turn ensure good numerical behavior. Our formulation can be solved exactly via conformal mapping, yielding a natural family of variance-preserving elliptic schedules, parametrized by Jacobi elliptic functions. Pairing an elliptic schedule with a tailored discretization, we obtain Zoloflow, a new sampling algorithm closely connected to Zolotarev's optimal rational function approximants. Crucially, both the elliptic schedule and Zoloflow explicitly incorporate the condition number $κ$ of the target distribution and reduce to the classical trig schedule in the limit $κ\rightarrow 1$. For Gaussian targets, Zoloflow achieves minimax optimality among all oblivious score-span algorithms, attaining total-variation error $\varepsilon$ using $Θ(\logκ\,\log(\sqrt d/\varepsilon))$ (exact) score queries. For the log-concave case, the elliptic schedule allows sampling with at most $\varepsilon$ 2-Wasserstein-error by requiring merely $\widetilde{O}(\sqrt{d} \, \mathrm{polylog}(κ, 1/\varepsilon))$ score evaluations. Complementing these theoretical results, we empirically evaluate the elliptic schedule on general (non-log-concave) target distributions, including detailed comparisons with alternative schedule proposals on both synthetic benchmarks and existing image generation datasets.

Fri 13 NovArtificial IntelligenceMachine Learning
The gist
Sampling from complicated probability distributions is important for many AI tasks but can be slow and tricky. The authors propose a new method called elliptic sampling that uses advanced math to better schedule how sampling moves from a starting point to a target distribution. This method is especially good for Gaussian targets and log-concave distributions, making the process more efficient and accurate. They show both theoretical advantages and practical benefits on various datasets, improving over older approaches.
Open → 2611.18542v1

Free lattices do not contain infinite ascending chains of three-generator copies

No free lattice contains an infinite ascending chain of copies of FL(3)

Abstract: No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3), the free lattice on three generators; this answers a question that R. A. Dean asked and the second author's 1997 notes on the problem left open. Every such chain would yield, inside FL(3), a coherent chain of proper self-embeddings $Θ_0, Θ_1, Θ_2, \dots$ with $Θ_k \circ Θ_j = Θ_j$ for $j < k$, so that each later embedding fixes the image of each earlier one pointwise. Every proper self-embedding of FL(3) whose fixed sublattice contains a free generating triple fixes one of the three generators, say $z$, because a power of it or of its dual lies above the identity, and a self-embedding that moves every generator and lies above the identity fixes at most eleven elements. Up to duality, a proper self-embedding fixing the image of such a $Θ_1$ pointwise fixes only elements above $z \wedge (x \vee y)$, where no free generating triple containing $z$ can lie. We also verify the one-step example of the 1997 notes, prove that no step toward such a chain is self-similar, and show that the configuration the argument rules out at length three does occur at length two. Without freeness the answer reverses: FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, so the lattice analogue of Takahasi's chain condition for free groups fails. The theorem itself is checked by the Agda proof assistant under its safe flags, for free lattices over generators with decidable equality, and its formal proof uses no classical principle: finite searches and an induction on a finite set replace the infinite pigeonhole principle by which a chain yields a coherent chain.

Fri 13 NovLogic in Computer Science
The gist
This paper solves a math puzzle about special structures called free lattices, focusing on the version with three starting points. The authors prove that you cannot find an endlessly growing sequence of smaller copies of this structure inside the original. They use formal proof tools to confirm their result without relying on assumptions like the infinite pigeonhole principle. The work clarifies how these complex ordered shapes behave and shows that without the ‘free’ condition, infinite sequences do appear. This advances understanding in abstract algebra and the properties of mathematical orderings.
Open → 2611.18541v1

Finite intelligence can handle infinite tasks when shared patterns exist

Why Finite Intelligence Works in an Infinite World: A Mathematical Theory

Abstract: An information system often has to learn before it knows what it will be asked. A finite representation can succeed without recording an infinite environment in full when those asks share collective structure, rather than demand unrelated facts scattered arbitrarily across it. We formalize this phenomenon through future-task information, the minimum retained information needed to preserve decision value relative to the available evidence. A joint decision-regret state records posterior comparisons among actions for every permitted task. Under compactness assumptions, every retained representation admits a calibrated replacement based on this state, preserving all task regrets without increasing information; the resulting information-regret curve equals an operational coding rate. Two exact boundaries govern finite preservation: weak-star closure for a fixed action count, and the singular mass of the source-evidence law when all finite action menus are admitted. Collective structure determines information requirements beyond individual-question difficulty. Families with identical source laws, pairwise task metrics, and individual-task rates can have different high-resolution exponents. Covariance-identical coordinate and parity families have different exact rate-distortion curves, with optimal parity retention characterized by a sharp Fourier-entropy inequality. For balanced nested task families, refinement sizes and weighted reach determine the rate within an additive constant, attained by prefix coding under explicit decay conditions. Nonlinear learning and computational separations distinguish preservation from efficient discovery and use. The proposed mathematical theory identifies which shared decision requirements allow finite information to remain useful for infinitely many possible purposes.

Fri 13 NovInformation TheoryMachine Learning
The gist
Many systems need to learn before knowing exactly what questions they will face, but they can't store everything because the world is too large. The authors explain why it's still possible for systems with limited memory to perform well when the questions share common structures. They develop a mathematical framework to describe how much information a system must keep to make good decisions for many possible tasks. This work identifies when a small representation can cover infinitely many future needs by capturing shared patterns across tasks.
Open → 2611.18538v1

Agentic reinforcement learning harnesses evolve automatically during training

ModHarness-RL: Recasting Harnesses as Learnable and Evolving Programs for Agentic RL

Abstract: Agentic reinforcement learning (RL) increasingly relies on a harness, the scaffold around the model that decides what it sees of its own interaction and what guidance it receives. Most existing approaches train under a hand-written harness that stays fixed throughout. However, an effective harness depends on the domain, the data and the model, and keeps changing as the model trains. We introduce ModHarness-RL, which recasts the harness as programs that are learned from data and evolve as the model trains with RL. ModHarness-RL records the interaction as structured State, a set of typed blocks, and two core components of the harness are programs over these blocks, a Compression program that assembles the accumulated history into the model's context and a Steering program that supplies guidance when behavior deviates. During RL training, candidate programs are proposed from recent trajectories, verified by execution, and replayed over past trajectories, so the harness tracks how the model's behavior shifts. We study CodeSearch in depth and further analyze ALFWorld and BIRD SQL, with models from 1.5B to 8B. The proposed Compression and Steering mechanisms improve held-out performance over the fixed-harness baseline in most settings. These results suggest that a harness for agentic RL can be learned from the task's data and evolved with the model.

Fri 13 NovArtificial IntelligenceComputation and LanguageMachine Learning
The gist
In reinforcement learning, agents need a harness that guides what they see and how they act. Most harnesses are manually made and stay the same during training, but this doesn't work well because the harness should change as the agent learns and the situation changes. The authors propose ModHarness-RL, a system that creates and updates these harnesses automatically as programs that adapt over time. This approach lets the agent better understand its history and corrects its behavior, improving performance across several tasks.
Open → 2611.18533v1

Evolution shapes AI choices between tasks and social rules

Alignment by Socialization: Learning Tradeoffs Under Selection

Abstract: Artificial intelligence (AI) agents are expected to complete tasks while following rules of conduct, but these objectives can conflict. We study how evolutionary selection shapes an agent's choices between them, and whether experience can make those choices reflect human judgments and withstand subsequent pressures. In our model, copies of an agent face a common uncertain reward state, and only those taking the rewarded action reproduce. We show that long-run growth is maximized when each action is taken as often as the environment rewards it. We compare three policies. A task-only policy thrives in a sandbox rewarding completion alone but fails when conduct matters. A fixed linear policy increasingly favors task completion as its stakes rise, even where humans never reward it. A learned policy instead converges to the tradeoffs rewarded by its environment; when humans supply the rewards, we call this socialization. Accumulated experience makes socialization harder to reverse under subsequent task-only training, although violations can arise before the prevailing disposition changes, and finite memory weakens this protection. When a single violation can end a deployment, a hard prohibition can prevent it, but a mistaken prohibition can also be costly. Experiments with small neural networks illustrate how training targets and memory shape these outcomes. Our results suggest that alignment depends not only on the objectives assigned to agents, but also on the environments that shape and sustain their behavior.

Fri 13 NovArtificial Intelligence
The gist
AI agents need to balance getting tasks done with following rules, but these goals can sometimes clash. The authors study how evolutionary pressures influence an AI’s decisions when facing rewards for both completing tasks and acting properly. They show that AIs that learn from experience to match the reward patterns given by humans can better maintain good behavior even when conditions change. However, if memory is limited or rules are very strict, mistakes can still happen. This work helps explain how both objectives and the environment shape AI behavior.
Open → 2611.18531v1

Contextual bias in agricultural image networks revealed by neuron concepts

Understanding Contextual Bias in Agricultural CNNs Through Hidden-Neuron Concept Induction

Abstract: Convolutional Neural Networks (CNNs) can classify images using background-dominated patches that contain little or none of the target object, showing that they exploit contextual information. Previous studies detected this behavior through classification accuracy but say little about what CNN hidden layers represent. We investigate whether Concept Induction can reveal interpretable visual properties associated with hidden-neuron activations on contextual image patches. Using five agricultural datasets with high, moderate, and low contextual bias, we analyze four CNN architectures at three network depths and five patch locations. Quantitative image descriptors of each patch are encoded in a knowledge graph and used as background knowledge for Concept Induction, which derives logical expressions characterizing neuron activation. These expressions are tested on held-out images using the Mann-Whitney U test and Cliff's delta. Of 48,013 tested neuron-feature pairs, 13,164 (27.4%) were validated. Validation was most frequent at intermediate depths (mean 40.2% at mid layers versus 12.0% at deep layers), and no patch location dominated across datasets. Among the tested descriptors, edge, Gabor, and Tamura texture features had the highest validation rates. Stronger contextual bias did not correspond to higher neuron-feature validation rates: moderately biased Sugarcane had the highest rate (40.5%) and highly biased Cassava the lowest (19.2%). These results suggest that behavioral context dependence and the semantic interpretability of hidden neurons capture different aspects of CNN behavior, and that Concept Induction can complement patch-based bias detection.

Fri 13 NovComputer Vision and Pattern RecognitionMachine Learning
The gist
Sometimes, AI image classifiers look at backgrounds instead of the main object to decide what is in a picture. This paper studies what specific features inside an AI’s 'brain' (hidden neurons) respond to when they see these background clues. The authors used a method called Concept Induction to find understandable visual patterns in the AI’s hidden layers from different agricultural image datasets. They found that some neuron responses can be explained by patterns like edges and textures and that this explanation varies by network depth and dataset. This work shows that knowing how these AI neurons work helps complement existing ways to detect AI bias toward backgrounds.
Open → 2611.18530v1

Streaming diarization removes speaker limit for long meetings

eDIAR: Training-Free Open-Speaker Streaming Diarization for Long Meetings and Large Archives via e-means

Abstract: Meetings last up to an hour, and nobody knows in advance how many people will speak. Neural diarizers with a fixed number of output slots, such as Streaming Sortformer and Nemotron-3, are accurate and run online, but they cannot name more speakers than they have slots. We remove this limit without retraining. The slot head keeps deciding who is active and when speech overlaps, and speaker embeddings are clustered inside a single slot, with the official e-means algorithm, only after every slot has been used. In the streaming system, re-clustering is confined to a bounded window, labels are revised for a few seconds, and identities are anchored to the slots of the head. The resulting system has no limit on the number of speakers and stays accurate when speakers outnumber the slots, where fixed-slot models break down. On meetings that grow to an hour it stays far more accurate than Streaming Sortformer, which accumulates errors, and its cost per update does not grow with the meeting. The same recipe turns the four-slot Streaming Sortformer into an open-speaker system. Across recordings, e-means makes it affordable to link the speakers of a large archive frame by frame, a task that arises when conversational corpora are prepared, and it reaches the clustering quality of Lloyd's $k$-means several times faster. The method needs little tuning, and e-means runs with its default recipe from a few hundred to more than a million embeddings.

Fri 13 NovSound
The gist
It can be hard to keep track of many people speaking in long meetings, especially if you don't know how many people there will be. This paper presents a method that helps computers identify who is speaking without needing to be told how many speakers to expect. The system uses a new way to group speaker information continuously during the meeting, which works well even if there are more speakers than usual. This method is fast, needs little adjustment, and works well for linking speakers in very large collections of conversations.
Open → 2611.18529v1

WaferTetris boosts chip use and speeds AI tasks on wafer-scale hardware

WaferTetris: Efficient Freeform Mapping on Wafer-Scale Accelerators

Abstract: Wafer-scale accelerators offer massive compute capacity through hundreds of thousands of processing elements (PEs) interconnected across a single wafer, but realizing this potential requires efficient application mapping. Their scale makes programming these systems and mapping applications onto them challenging. Existing approaches rely on template-based mappings to maintain productivity, but these templates restrict the mapping design space. In particular, they impose fixed geometric layouts over the PE grid, often leaving compute and memory resources underutilized. In this work, we present WaferTetris, a system that removes these geometric restrictions through freeform mapping. Its Tetris-like strategy flexibly packs computation across the wafer, improving PE utilization and usable memory capacity while preserving PE-task code. We develop a recurrence-based throughput model that captures branch-and-join dependencies to guide spatial parallelism, and an architecture model with per-color gates that enable existing FPGA place-and-route algorithms to enforce WSE routing constraints. We evaluate WaferTetris on Cerebras WSE-3 using LLM decoding and scientific stencil benchmarks. For LLM decoding, it achieves up to $4.42\times$ the system throughput of a template-based automatic mapping baseline on the same fabric size. Compared with the manually optimized WaferLLM, WaferTetris supports $1.8\times$ the context length for LLaMA3.1-8B (80k versus 44k), while delivering equal or higher per-user throughput at matched context lengths, up to $1.10\times$.

Fri 13 NovHardware ArchitectureComputation and Language
The gist
Wafer-scale computer chips have thousands of tiny processors that work together, but putting tasks onto these chips efficiently is tough. Most ways to organize these tasks force fixed shapes and layouts, which wastes power and memory. The authors created WaferTetris, a method that fits tasks like Tetris pieces onto the chip more flexibly. This better use of space helps run big AI models and scientific calculations faster and with more memory. Their tests show WaferTetris can increase speed and support longer AI model contexts than other methods.
Open → 2611.18527v1

Mixed signal design uses capacitor memory for event camera segmentation

EventSpikeSeg: Memory-Aware Mixed-Signal Architecture for Event-Camera Spiking Segmentation

Abstract: Event-camera segmentation requires persistent neural state despite sparse input events, making memory organization a central constraint on embedded implementation. We present EventSpikeSeg, a mixed-signal architecture combining resident capacitor memory with shared analog processing in GF180MCU 180-nm CMOS. Its 25-population spiking encoder-decoder has 143,824 synaptic weights but requires 30,976,000 membrane states at 440 x 640 resolution. The mapping specifies chronological 5-ms model updates, digital event/address services and 64-state capacitor banks. Characterization covers 22 module families and 74 operating points, distinguishing transistor simulations from digital-library estimates. Nominal results include 41.711 microwatts biased neuron-core power, 3.338-pJ positive terminal energy for a 1.4-microsecond cell read, and 0.531-mV selected-state drift over a 5-ms extracted-tile hold. Commit and coupling errors are reported separately. The software checkpoint records 27.976% mean intersection-over-union on a held-out six-class DSEC split; this is not hardware accuracy. Component layouts and simulation evidence quantify local implementation costs and expose storage replication and service scheduling as scaling constraints. A detailed SPICE-calibrated behavioral forward simulation of one full-resolution DSEC frame achieves 24.26% mean intersection-over-union, versus 26.22% for the matched PyTorch reference, using a compact 5-fF bank variant and external count/voltage calibration. Physical full-network operation, system energy and mismatch robustness remain unverified.

Fri 13 NovHardware ArchitectureComputer Vision and Pattern RecognitionNeural and Evolutionary Computing
The gist
Event cameras capture changes in a scene as events, which are sparse and require memory to interpret over time. The authors introduce EventSpikeSeg, a new hardware design that uses a mix of analog and digital circuits with capacitor memory to process these event streams more efficiently. Their design is tested through simulations that estimate power use and accuracy, showing promise but not yet demonstrating a fully working physical system. This work focuses on how to organize memory and computation for event camera segmentation in embedded hardware.
Open → 2611.18524v1

New accelerator design boosts large language model learning during inference

Mutable Inference: Architecting LLM Accelerators for Inference-Time Learning

Abstract: Long-context LLMs must retain growing histories, but full attention makes each new token increasingly expensive. Inference-time learning (ITL) offers another approach. The model keeps training on the context during inference, retaining what it learns in its weights. Recent work shows that ITL can match full-context attention quality while attending only to a recent fixed-size window. This bounds attention costs but adds Learning (backward computation and weight updates) alongside Prediction (the forward pass) costs. Inference accelerators assume fixed weights, while training accelerators target complete training steps. This work identifies two opportunities. Attention's non-matrix operations leave enough idle matrix capacity for Learning, while selected layers can tolerate delayed weight updates with little quality loss. We exploit both with Learning While Serving (LWS), an inference accelerator architecture that shares compute hardware between latency-critical Prediction and deadline-flexible Learning. Hardware-managed per-layer weight versioning allows Learning to publish updates while in-flight computations read older versions. Resumable reduction blocks let Learning kernels span fragmented idle windows and yield to Prediction, while dedicated softmax-gradient units relieve vector contention. On modeled datacenter and edge NPUs, LWS hides Learning within Prediction, sustaining Prediction-only throughput while preserving 99.3% of fully fresh Learning's quality benefit for TTT-E2E 3B at 128K tokens. Across nine models, LWS achieves 1.6x the throughput of serial execution and 1.3x that of the best prior co-execution architecture. RTL synthesis shows that LWS adds 1.5% to NPU core area without another MAC array. By efficiently turning idle inference capacity into learning capacity, LWS establishes inference-time learning as a first-class workload for future LLM accelerators.

Fri 13 NovHardware Architecture
The gist
Large language models can remember lots of recent words but doing so slows down their response over time. The authors found a way to make these models learn from new information during use without slowing down their predictions. They designed special hardware that shares work between making predictions quickly and updating the model efficiently. This means the model stays up-to-date with less delay and uses computer resources more effectively. Their design increases throughput and keeps model quality high, making this learning method more practical.
Open → 2611.18523v1

Patient-specific simulations improve tricuspid valve modeling accuracy

Patient-specific Modeling of the Tricuspid Valve from 3D Transesophageal Echocardiography

Abstract: Purpose: Image-based patient-specific simulations of the tricuspid valve (TV) could support repair planning. However, clinical images incompletely resolve the chordal anatomy and cannot directly determine tissue properties, which hinders the development of such models. We developed and evaluated a framework that simulates the TV from clinical images and addresses these limitations using measurements on explanted human valves. Methods: We reconstructed ten functionally competent human TVs from 3D transesophageal echocardiography. Following manual segmentation, we automatically built finite element models with synthetic chordae and with leaflet thickness, chordal insertion density, and tissue properties informed by ex vivo human measurements. Next, we used shape matching and force-based chordal-length adjustment to simulate valve closure. We also assessed inter-observer segmentation variability and sensitivity to chordal insertion density, leaflet stiffness, leaflet thickness, and chordal size and material properties. Results: Per-valve median geometric errors were 0.61-1.13 mm relative to the morphed references and 0.55-0.95 mm relative to the image-derived surfaces. Coaptation covered 20-42% of the leaflet area, and median leaflet stresses ranged from 7.6 to 16.9 kPa. Inter-observer variability in segmentation most strongly affected coaptation area. Of the population-based inputs, insertion density and leaflet stiffness most affected geometric error. Thickness primarily affected stress, whereas chordal size and material properties had limited effects. Conclusion: Clinical echocardiography, supplemented with ex vivo human tissue data, enabled patient-specific simulation of ten human TVs. This framework provides a foundation for investigating valve mechanics and developing repair-planning tools, while sensitivity analyses identify priorities for model refinement and uncertainty assessment.

Fri 13 NovComputational Engineering, Finance, and Science
The gist
The tricuspid valve in the heart can be hard to model precisely using clinical images alone because important parts aren't clearly visible and tissue properties can't be measured directly. The authors created a method that uses 3D heart scans combined with detailed measurements from real human valves taken out of the body to build better computer models of this valve. They tested their method on ten valves, showing their models matched real valve shapes closely and identified which factors impact accuracy most. This work helps build tools that could assist doctors in planning valve repairs tailored to each patient.
Open → 2611.18522v1

Detect out-of-distribution objects by size and border conditions

Box-conditional Hypothesis Testing for Out-of-Distribution Object Detection

Abstract: Detecting out-of-distribution (OOD) objects is essential for ensuring the reliability and safety of object detectors in real-world deployment. We treat the decision on a detected box as a hypothesis test with the null hypothesis that the box covers an object of an in-distribution (ID) class. The null distribution changes with the size of the box and its contact with the image border, and the detector observes both. The test can therefore rank a box only against ID boxes of the same size and border contact, which gives a distribution-free bound on the false-alarm rate for each of them and uncovers the separation that one null distribution hides. The power of the test also rests on the layer it reads. Layers built only for the ID classes have no reason to keep what sets an unknown object apart, so the test reads the features before them. We propose \textbf{PLUM}, a training-free score that pools the last backbone stage inside the box and ranks its distance to the ID classes among ID boxes of the same size and border contact. On the standard benchmark, PLUM reaches the highest AUROC among the compared methods without external models, with 91.5 and 94.5 on PASCAL-VOC and 95.1 and 97.5 on BDD100K. Code: https://github.com/DDOZMI/PLUM

Fri 13 NovComputer Vision and Pattern Recognition
The gist
Detecting objects that do not belong to known categories is important for safety in computer vision. The authors treat each detected object as a hypothesis test to decide if it belongs to a known class, adjusting their test based on object size and position in the image. They propose PLUM, a simple way to score how unfamiliar an object is by comparing it to known objects of similar size and position, using intermediate features of the detection model. Their method works well on standard benchmarks without needing extra models.
Open → 2611.18519v1

OpenLayout platform uses AI agents to improve chip design accuracy

OpenLayout: An Open and Agentic-Driven Platform for Holistic VLSI Physical Design and Benchmarking

Abstract: Physical design automation of very large-scale integrated circuits (VLSI) has made significant strides, progressing from single-stage placement and routing toward increasingly integrated full-flow implementation. Yet, existing approaches struggle with the vast design space optimization (DSO) arising from diverse technology nodes, circuit designs, and varied constraints. The substantial runtime of physical-design tools further exacerbates this challenge, leaving industrial workflows heavily dependent on experienced engineers to navigate the design space and achieve power, performance, and area (PPA) targets, incurring significant engineering effort. We argue that large language models (LLMs) with strong reasoning capabilities, enriched with distilled human design expertise, offer a promising path toward efficient and automated DSO. Unlike traditional algorithms, LLMs can interpret complex design contexts and naturally incorporate human expertise expressed in natural language for reasoning, acting, observing, and adapting throughout the design process, a capability that conventional optimization methods cannot exploit. To this end, we present OpenLayout, an agentic platform that leverages multi-agent collaboration with embedded design knowledge to enable self-iterative DSO. We further introduce OpenLayout-Bench, a benchmark targeting advanced technology nodes with commercial EDA tools to systematically evaluate physical design automation capabilities of LLMs. Experimental results demonstrate that OpenLayout achieves state-of-the-art performance, with approximately 20% accuracy improvement over baseline methods. Our work is open-sourced at https://github.com/fenggev56/OpenLayout

Fri 13 NovHardware Architecture
The gist
Designing computer chips is very complicated and takes a lot of time and expert knowledge. The authors show that using large language models—advanced AI that understands and reasons like humans—can help automate this process. Their platform, OpenLayout, uses multiple AI agents working together to improve chip design, making it about 20% more accurate than older methods. They also created a benchmark to test this approach on new technology. This work is openly shared for others to use and build upon.
Open → 2611.18517v1

StreamEmbed speeds up screenshot search by reusing visual data

StreamEmbed: Real-Time Indexing from Pixels for Screenshot Retrieval

Abstract: Screen history can serve as searchable visual memory for people and agents, but unlike an offline corpus, it must be encoded and indexed as each screenshot arrives. OCR-based indexing is fast but loses visual information; visual encoding takes over two seconds. Yet screens change incrementally: most pixels repeat within and across screenshots. This raises a question: do visual encoders need to recompute their representations from scratch for every new screenshot? We present StreamEmbed, a system for incremental visual embedding that exploits this redundancy. Guided solely by pixel differences, it combines spatial token pruning, which skips blocks that repeat a neighbor, with temporal KV reuse, which reuses cached keys and values for blocks unchanged across screenshots. A small learned adapter compensates for pruning and reuse to preserve fidelity to full-screenshot embeddings. On ScreenMemEval, our benchmark of 10,426 questions over 184 hours of screen histories from two humans and a computer-use agent, StreamEmbed sets a new accuracy-latency Pareto frontier on an M2 Pro GPU: it encodes up to 3.7x faster than full-screenshot encoding without sacrificing accuracy and improves accuracy over OCR-based indexing by up to 6.3 Recall@10 points at matched latency. A memory-efficient vector index stores a simulated year of screenshots in 0.13 GB of RAM. Together, these results make real-time indexing of screen history in its native visual form practical, laying a foundation for fully local visual assistants.

Fri 13 NovComputer Vision and Pattern RecognitionInformation RetrievalMachine Learning
The gist
Screenshots change mostly by small amounts from one to the next, but most current methods treat each screenshot as completely new, making search slow or less accurate. The authors show a way to speed this up by only updating parts that change and reusing data from previous images, keeping the search quality high. Their approach balances speed and accuracy better than older methods, making it practical to quickly find screenshots based on their visual content.
Open → 2611.18516v1

Mechanistic interpretability partially predicts web agent hallucinations but has limits

Can Mechanistic Interpretability Help Explain LLM Agent Failures? A Case Study on Web Element Hallucination

Abstract: Mechanistic Interpretability (MI) has made significant progress in explaining the internal computations of Large Language Models (LLMs); however, these advances have yet to demonstrate comparable success in explaining the decision-making processes of LLM-based agents. This paper examines the challenges MI tools face when applied to realistic agentic failures. We focus on one such failure: web agents hallucinating actions that are not available on a website. We apply a series of mechanistic analyzes to Qwen2.5-7B-Instruct as it interacts with live websites. We find that a linear probe trained on the last prompt token can predict hallucinations before generation begins (0.80 AUC) and steering along a probe direction corrects 85\% of hallucinations, but disrupts 7\% of valid actions. However, these results only provide a partial explanation of why the agent hallucinates. The probe direction is sensitive to prompt formatting, losing much of its steering effect after a minor change to how actions are represented. Additionally, circuit identification can be difficult as the computation is distributed across multiple components and positions, and the information the agent relies on varies across examples. We discuss how these observations challenge the assumptions underlying standard MI methods for circuit discovery and feature identification, and outline future directions for making these methods better suited to explain failures in LLM-based agents.

Fri 13 NovArtificial IntelligenceComputation and Language
The gist
Sometimes language-based web agents try to do actions that don’t actually exist on a website, which is called hallucination. The authors studied how to explain and fix these hallucinations using tools that look inside the agent’s reasoning process. They found a way to predict when hallucinations will happen and reduce them by changing the agent’s internal signals. However, this method only works partially and is sensitive to small changes, showing that it’s hard to fully understand why the agent makes these mistakes.
Open → 2611.18514v1

MeReader provides offline AI help for private narrative book reading

MeReader: An Offline, Privacy-Preserving, Progress-Aware AI Assistant for Narrative eBook Reading

Abstract: This paper introduces MeReader, a privacy-preserving, offline and progress-aware AI assistant designed to function as a contextual companion for narrative reading on consumer hardware. Unlike conventional Large Language Model (LLM)-based systems that process documents/books online in an all-texts-at-once type of way, thereby risking narrative spoilers, MeReader confines both retrieval and generation to the reader's distinct position in the text. The system integrates a hybrid retrieval architecture, combining vector similarity, BM25, and summary embeddings, to ensure high fidelity to the reader's current context. We evaluate the system across classical English books using both quantitative comprehension metrics and qualitative LLM-based independent judging. The results identify a quality-latency frontier, showing that mid-sized local models (2b-4b) can achieve comprehension parity with larger counterparts (5b+) while maintaining acceptable response quality. Importantly, the proposed progress-aware boundary mechanism is shown to prevent future content leakage without compromising retrieval quality and correctness. These findings suggest that a localized, privacy-centric approach can augment, rather than replace, the digital reading experience, offering a good alternative to cloud-dependent services. Therein, there remains a lack of amalgamate systems which combine progress-aware, privacy-preserving, and narrative eBook reading with AI support. It is in this very gap that the development of MeReader came to be; synthesizing said strands into an offline, book-constrained assistant focused on enhancing comprehension without compromising narrative continuity or user privacy.

Fri 13 NovInformation RetrievalArtificial IntelligenceComputation and Language
The gist
Reading a book with AI help usually means sending your text online, risking spoilers and privacy. The authors present MeReader, an AI assistant working completely offline on your own device, which only looks at the part of the book you're currently reading. This approach keeps your story safe from future spoilers and your data private. They tested MeReader on classic English books, finding that modestly sized local AI models can match bigger ones in understanding while keeping quick response times.
Open → 2611.18513v1

Numerical problems disrupt calculations between very similar distributions

On numerical issues of divergences between nearly equal distributions

Abstract: Barron et al. (2026) recently identified numerical issues in the softmax and soft cross-entropy loss. We show that similar issues are present in standard divergence operations between categorical distributions. This includes the forward and reverse Kullback-Leibler (KL) divergence and generalized Jensen-Shannon divergence (JSD), as well as Monte Carlo KL estimates and entropy. When the distributions are nearly equal, rounding and cancellation issues affect the forward and gradient computations. These issues can affect settings using divergences in optimization objectives, such as knowledge distillation, reinforcement learning, and proximal methods. We propose numerically stable reformulations and provide example implementations for each setting, validated by property-based tests.

Fri 13 NovMachine Learning
The gist
When comparing two very similar groups of data using common mathematical tools like KL divergence or Jensen-Shannon divergence, small errors from computer rounding can mess up the results. The authors found these issues affect how both the values and their rate of change (gradients) are calculated. These numerical problems can cause trouble in areas like machine learning where such comparisons guide training, including knowledge distillation and reinforcement learning. The paper offers new, more stable ways to do these calculations and shows code examples that pass thorough tests.
Open → 2611.18511v1

Conic classification heads may not keep features within bounded regions

Asymptotic Margins and Feature Confinement in Conic Classification Heads under Softmax Cross-Entropy

Abstract: Classification heads built on conic functions give each class a bounded region of the feature space, and such regions are used to reject samples of unseen classes. We ask whether these regions also keep the features bounded when the head is trained with softmax cross-entropy. For a head whose class scores combine a linear term with a Euclidean norm, we first show that the region of each class is bounded by a quadric of revolution, whose eccentricity is the reciprocal of one learned ratio. We then attach to each class an asymptotic margin, which compares the growth of its score with the growth of all the other scores and can be computed by a second-order cone program. The loss of a class has infimum zero exactly when its margin is positive, and it then approaches zero only along diverging features. When the margin is negative, the loss is coercive and its minimizers lie in an explicit ball. Since softmax depends only on the differences between scores, a class with a bounded region can still have a positive margin, so bounded regions do not confine the features. The result extends to other norms, including the polyhedral conic functions. On CIFAR-10 and CIFAR-100, all 1210 cells of 67 trained conic heads have positive margins, whereas a prototype head keeps nine of its ten cells bounded, as the theory predicts.

Fri 13 NovMachine Learning
The gist
This paper studies a type of classifier that uses curved boundary regions to separate different classes of data. The authors investigate whether training such classifiers with a common loss function called softmax cross-entropy keeps the features within those bounded regions. They find that even when class regions are bounded, the features themselves can still grow without bound during training if certain mathematical conditions are met. Their theory is confirmed by experiments on image datasets, showing the classifier features are not always confined as the bounded regions might suggest.
Open → 2611.18507v1

Large language models extract standardized data from sarcoma reports

Agentic induction of common data elements and information extraction from sarcoma case report abstracts

Abstract: Common data elements (CDEs) support clinical data comparability but are usually defined manually. We investigated whether large language model agents could derive a CDE schema from sarcoma case report abstracts and apply it at scale. An agent proposed 72,909 candidate CDEs from 24,588 PubMed abstracts; agentic consolidation yielded 1,570 CDEs. We retained 53 supported by at least 50 abstracts and attempted evidence-linked extraction across the corpus. Processing succeeded for all retained CDEs in 79.2% of abstracts, including responses indicating non-mention. Two human reviewers approved 83.0% of retained CDEs for relevance, 67.9% for clarity, and 56.6% for correctness. In 100 sampled abstracts, exact agreement with the value extracted by the LLM was 94.9% among 1,116 pairs with a non-empty answer (abstract-level bootstrap 95% CI, 93.0-96.4%). Errors concentrated in anatomical and temporal fields. These findings support agent-assisted schema drafting followed by expert curation before large-scale extraction.

Fri 13 NovComputation and Language
The gist
It can be hard to compare medical reports because doctors write them in many different ways. This paper shows how smart language AI agents can read thousands of sarcoma case reports and find common pieces of information automatically. The AI suggested many possible data elements, then people helped choose the best ones for typical use. The AI then extracted these data from most reports accurately, especially outside of anatomy and timing details. This method can help create standard data formats faster with AI and expert checks.
Open → 2611.18506v1

Robot paths planned to handle unknown environmental disturbances

Disturbance-Aware Informative Planning in Spatiotemporal Environments

Abstract: Autonomous robots are widely used for persistent monitoring of spatiotemporal environments, where quantities of interest (QoI) change across space and time and require repeated measurements. In practice, robot motion can be affected by external disturbances that vary across the environment. When such external disturbances are not considered in trajectory optimization, it can lead to inaccurate predictions of robot motion and, consequently, the information acquired about the QoI during execution. However, estimating disturbances throughout the environment can be inefficient, as disturbances in regions with little overlap with monitoring trajectories have limited impact on monitoring performance. We therefore propose a two-stage informative planning framework for unknown, spatially varying but time-invariant disturbances, combining informed disturbance sampling with disturbance-aware trajectory optimization. First, we identify where QoI measurements are needed and generate alternative paths to these locations using the environment geometry. We then prioritize disturbance measurements based on their expected reduction of disturbance uncertainty along these paths. Second, rather than optimizing information acquisition based on nominal robot motion, we incorporate the learned disturbance belief into trajectory optimization to account for its effects on robot motion and information acquisition. Across four simulation scenarios, the proposed method reduces disturbance-learning time by 25.0--52.3 percent compared with environment-wide estimation and identifies paths that appear costly under nominal dynamics but become preferable when disturbances are considered.

Fri 13 NovRobotics
The gist
Planning robot paths can be tricky when the environment pushes the robot in unexpected ways. The authors propose a method that smartly finds where to measure these disturbances only along routes where the robot needs to go for important monitoring. Then, the robot plans its path while considering these pushes, leading to better predictions of where it will move and more accurate data collection. Their tests show this method learns about disturbances faster and finds better paths compared to ignoring these factors.
Open → 2611.18505v1

Agentic ai evolves fault-tolerant quantum error-correcting circuits

Agentic AI for Discovering Fault-Tolerant Quantum Circuits

Abstract: Scaling quantum computing toward practical quantum advantage is currently limited by the efficiency of circuits that operate on information encoded by quantum error-correcting codes. The full stack of quantum computing encompasses several tasks: preparation of logical code states, implementation of logical gates, logical routines on encoded qubits, etc. Yet, these circuits are largely designed by hand for individual cases, with some recent works incorporating machine learning for certain aspects. We formulate this problem as agentic evolutionary program synthesis, wherein a large language model, leveraging its pretraining knowledge and tool-use proficiency, and guided by a circuit verifier, evolves a program that defines a Clifford circuit for a wide range of curated tasks such as logical state preparation, logical gate design, and logical routines such as code-switching, code growth, etc. Our approach consistently finds fault-tolerant circuits for all of these tasks, each verified by an exhaustive check over faults.

Fri 13 NovArtificial Intelligence
The gist
Quantum computers need special circuits to protect information from errors, but these circuits are usually designed by hand, which is hard and slow. The authors use an AI agent, guided by a checker, to automatically develop circuits that handle errors while doing important tasks like preparing and transforming quantum states. Their method finds reliable, error-resistant circuits for a range of tasks by combining AI’s knowledge with an evolutionary approach. This helps make quantum computing more practical by improving how error correction is done.
Open → 2611.18504v1

Autonomous boats monitor water quality to detect harmful algal blooms

In Situ Monitoring and Predictive Modeling of Harmful Algal Blooms with Autonomous Surface Vehicles

Abstract: Harmful Algal Blooms (HABs) pose significant environmental, economic, and public-health challenges in coastal and inland water bodies, creating a need for scalable methods to collect spatially distributed water-quality data. This paper presents an autonomous surface vessel-based sensing system for in-situ water-quality monitoring related to harmful algal bloom detection. The system integrates a BlueBoat Autonomous Surface Vessel (ASV), a motorized winch for depth-controlled sonde deployment, a multiparameter water-quality sonde, side-scan sonar, and an event-camera payload. Autonomous waypoint missions were used to collect measurements across selected sampling regions and multiple depths, enabling both horizontal and vertical characterization of environmental conditions. Field deployments were conducted in Lake Pontchartrain, Louisiana, with additional measurements collected in False River, Louisiana to increase dataset diversity. The collected measurements included algal pigment indicators, nutrient concentration, turbidity, temperature, and other water-quality parameters relevant to bloom formation. In addition, complementary sonar and event-camera data were collected during vehicle operation to provide contextual environmental information. A machine-learning classification approach was also evaluated using the collected water-quality measurements to support HAB and non-HAB classification. The results demonstrate the feasibility of using a modular ASV platform for repeatable, multi-modal water-quality data collection and support future development of autonomous monitoring systems.

Fri 13 NovRobotics
The gist
Harmful algal blooms can damage water environments and harm people. The authors created a robot boat system that collects water quality data from different depths and areas automatically. They tested this system in two Louisiana lakes, measuring things like nutrients and temperature that relate to algal blooms. The data was also used to train a machine-learning method to tell if a bloom is present. This work shows how autonomous boats can help track and study dangerous water conditions over time.
Open → 2611.18501v1

Improved approximation algorithms lower bounds for asymmetric TSP problems

A Common Improved Bound for Asymmetric TSP and Path TSP

Abstract: We give polynomial-time $(R_*+\varepsilon)$-approximation algorithms for asymmetric TSP and asymmetric path TSP, for every fixed $\varepsilon>0$, where $R_*=6+\sqrt2+\sqrt{15+6\sqrt2}\approx12.2604$. Both guarantees hold relative to the corresponding subtour relaxations, whose integrality ratios are therefore at most $R_*$. This improves the previous guarantees of below $14.7$ for asymmetric TSP and $15$ for asymmetric path TSP [Vygen, 2026]. Our algorithms strengthen subtour covers and recursive augmentation in the laminar framework [Svensson, Tarnawski, Vegh, JACM'20; Traub, Vygen, 2025]. The recursive analysis retains the paths through contracted regions and accounts jointly for their cost and the dual mass they visit. We also improve the reduction from asymmetric path TSP to vertebrate pairs [Traub, Vygen, 2025] by comparing two initial walks with complementary completion bounds. Applied to Vygen's existing vertebrate-pair algorithm, this reduction alone improves the path factor from $15$ to below $14.7$, matching his asymmetric TSP guarantee.

Fri 13 NovData Structures and Algorithms
The gist
Finding the shortest possible route that visits a list of places once and returns to the start is very hard, especially when travel costs differ by direction. The authors improved algorithms that quickly find routes for these tricky cases, asymmetric traveling salesman problems and path TSPs, with better quality guarantees than before. Their new methods build on existing techniques and offer tighter bounds on how close the solutions are to the best possible routes. This means more efficient routing in situations where directions and costs matter differently, such as logistics or vehicle routing.
Open → 2611.18498v1

Teleoperation improves fault recovery in self-driving laboratories

Toward Resilient Self-Driving Laboratories through Telerobotic Interventions

Abstract: Self-driving laboratories (SDLs) accelerate scientific research by integrating robotics, automated experimentation, and machine learning to execute experiments autonomously. Biology and chemistry have adopted these systems. However, increasing SDL complexity heightens susceptibility to unexpected faults in automated workflows, highlighting the need for efficient recovery mechanisms. In this study, we investigate telerobotic interventions to enhance SDL resilience against unexpected failures. We developed a teleoperation interface enabling human operators to resolve disruptions during automated tasks. The interface enables precise control of a six-degree-of-freedom (DOF) robotic arm (UR3e) using a 3D mouse (3Dconnexion SpaceMouse Pro). Two velocity-based controller strategies were evaluated: (i) a coupled mode mapping all six DOFs to the 3D mouse's central knob and (ii) a decoupled mode separating translational and rotational motions. To evaluate the framework, teleoperators intervened across three SDL fault scenarios. In the first study, comparative trials showed that the decoupled controller was associated with shorter completion times and reduced rotational motion. In a second study, teleoperators performed an aiming task with and without reference-path guidance. Users were more target-driven and risk-tolerant without guidance but showed behavioral differences under different guidance strategies. These findings suggest that controller configuration and reference-path design influence operator performance during SDL fault recovery, informing teleoperation interface optimization. This work demonstrates the potential feasibility of teleoperation as a human-in-the-loop recovery mechanism for SDL workflows, combining robotic precision with human adaptability and problem-solving. These findings also provide a foundation for future studies in shared autonomy and semi-autonomous intervention.

Fri 13 NovRobotics
The gist
Self-driving laboratories use robots and AI to run experiments on their own, but sometimes things go wrong and the robots get stuck. The authors studied how people can remotely control robotic arms to fix these problems quickly and safely, using a special interface. They found that separating different movements in the controls helped people work faster and more precisely. This approach could make automated labs more reliable by letting humans step in when machines have trouble.
Open → 2611.18496v1

Small language models improve math reasoning with executable step training

ARCHER: From Rationale Imitation to Executable Reasoning in Small Language Models

Abstract: Small language models are attractive for local, low-cost, and privacy-sensitive deployment, but they remain unreliable on mathematical reasoning tasks that require decomposition, exact computation, tool use, and verification. We introduce \textbf{ARCHER}: \textbf{A}ction-trace \textbf{R}einforcement for \textbf{C}alculator-grounded \textbf{H}ierarchical \textbf{E}xecutable \textbf{R}easoning, a two-stage framework for training small language models (SLMs) to produce executable and auditable reasoning trajectories. In the first stage, ARCHER compiles free-form chain-of-thought rationales into typed action traces containing reasoning steps, calculator calls, deterministic runtime observations, verification actions, and final answers. This shifts the supervision target from imitating explanatory text to learning a tool-grounded reasoning policy. In the second stage, ARCHER refines this policy through asymmetric hierarchical reinforcement learning, using grouped and conditionally gated trajectory rewards for answer correctness, tool grounding, process discipline, and trace alignment. Across five standard sub-10B backbones, ARCHER improves over the strongest tool-augmented baseline by 5.51 percentage points on macro-average across benchmark accuracies, including gains of 8.95 points on MATH-500 and 5.33 and 5.34 points on AIME-2024 and AIME-2025. Evaluations on two additional reasoning-specialized 7B backbones further show that executable grounding remains beneficial after reasoning-focused reinforcement learning or distillation. These results demonstrate that executable supervision and reward-guided behavioral refinement provide a general and effective training paradigm for compact mathematical reasoners.

Fri 13 NovArtificial Intelligence
The gist
Small language models are easier to use locally but struggle with math problems that need precise steps, calculations, and checking. The authors present ARCHER, a method that teaches these models to follow clear, executable reasoning steps using calculator calls and verification. This method trains models in two stages: first by turning free explanations into structured actions, then by refining them through reinforcement learning. Their approach improves math problem-solving accuracy on several benchmarks with models smaller than 10 billion parameters.
Open → 2611.18494v1