CS Paper Radar

Weekly top 20

2026-W47 Nov 16 – Nov 22, 2026

Ranked from 1,465 papers submitted on 2 days — week in progress, ranks can still change. Each research area gets slots in proportion to its share of this week's papers (at least one), filled by score; near-duplicates are removed. Why

Score = weighted mean ofCitations 20%Upvotes 10%Code stars 10%Venue 15%Code/data 10%Novelty 15%Momentum 15%Substance 5%how it works
1

High-Fidelity Binarized Neural Vocoder

cs.SD ·2026-11-17 ·Andong Li, Tong Lei, Xiaodong Li, Chengshi Zheng
publishedcode/data
Abstract · Accepted by IEEE Transactions on Audio, Speech and Language Processing 2026, 15 pages, 10 figures, 16 tables

Neural vocoders have achieved remarkable progress in high-fidelity waveform generation in recent years, but most existing methods still rely on full-precision operators, leading to non-negligible storage and computational costs during inference. Binary neural networks (BNNs) provide an alternative direction by quantizing weights and activations to 1 bit. However, directly applying binarization to neural vocoders is rather challenging as it inherently incurs severe information loss. To this end, we propose BiVoC, a BNN-oriented time-frequency neural vocoder for high-fidelity waveform generation. Building on our previous full-precision RNDVoC framework, BiVoC adapts the inverse-problem formulation, range-null decomposition, and fineto-coarse non-uniform subband modeling to the 1-bit setting. Specifically, we develop a simple binarized convolutional unit to provide stable time-frequency feature modeling under binary representations. Furthermore, we analyze the quality-complexity sensitivity of different modules and propose a mixed-precision design to retain quality-sensitive components in full precision while binarizing computation-dominant parts. Extensive experiments are conducted on LibriTTS and multiple out-of-distribution benchmarks. Both objective and subjective results demonstrate that BiVoC substantially outperforms BNN variants obtained by directly binarizing existing vocoders, while achieving competitive performance against several mainstream full-precision vocoder baselines under much lower theoretical computational cost. These results demonstrate the promising potential of BNNs in the audio generation field. Codes and pre-trained weights are available at https://github.com/Andong-Li-speech/BiVoC.

0.77
2

Latent Feedback Is a Compute and Data Amplifier

cs.LG ·2026-11-16 ·Benhao Huang, Chaitanya Dwivedi, Xuezhe Ma, Alexander Moreno, Hector Liu
code/datahot direction
Abstract · 23 pages. Code: https://github.com/ifm-ai/LoRM

When high-quality data runs out, a common practice is to train on it for several epochs, but each repeat is worth less than the last. Latent feedback, which feeds each token's top-layer state into the next token's input, is another way to spend that compute, yet it has not been tested against a vanilla Transformer that spends the same compute on more epochs. We run this test across a ladder of model sizes, unique data and epochs, tuning both models at every size and amount of unique data. Latent feedback makes every FLOP and every token count for more except when unique data is scarce relative to model size, a regime that today's models are far from. We find that latent feedback serves as an amplifier: with unique data fixed, it reaches a Transformer's loss with less compute; with epochs fixed, it reaches that loss with less unique data. Furthermore, both savings grow with unique data per parameter and with repetition, and downstream tasks agree. To go beyond our grid, we fit one scaling law to both models, in which latent feedback enters as a Transformer with more parameters; it predicts that both savings keep growing with unique data and repetition. Fitted on models from 60M to 271M parameters, the law predicts the losses at a held-out 778M size to within 0.3% and the gap between the two models to within 0.05%. At most, latent feedback saves 48% of the compute and 47% of the unique data. When data, not compute, is the limit, latent feedback is the better use of a FLOP for a model of a given size.

0.75
3

BehaVerify: A Formal Verification Tool for Behavior Trees

cs.SE cs.LOcs.RO ·2026-11-17 ·Serena S. Serbinowska, Ben Wooding, Diego Manzanas Lopez, Luke Nam, Anne M. Tumlin +3 more
publishedcode/datahot direction
Abstract · In Proceedings FMAS 2026, arXiv:2611.21375

This paper presents BehaVerify, a verification toolbox for behavior trees (BTs) and Neuro-Symbolic BTs. BTs are a graphical language for planning and sequencing behaviors - similar to extended state machines - and are increasingly used in safety-critical domains. BehaVerify enables users to specify a BT using a Domain Specific Language (DSL) with formal syntax and semantics. This language further includes Linear Temporal Logic and Computation Tree Logic specifications. BehaVerify uses an efficient encoding into nuXmv, called fastforwarding, to quickly verify if a specification holds over the BT. Additionally, BehaVerify can generate implementations of the BT in Python and Haskell. Through Python, BehaVerify has been integrated with PyTrees and Robot Operating System (ROS) and has been deployed to several autonomous robotic systems, including for verifying runtime monitors. While prior works have developed the underlying theory, this manuscript focuses on the toolbox usage, functionality and implementation. BehaVerify is open source: https://github.com/verivital/behaverify

0.73
4

Lived Experiences of Power and Agency: Achieving Voice Sovereignty in Assistive Speech Technology for Nonbinary Users

cs.CY cs.HC ·2026-11-16 ·Maxwell Hope, Juliana Francis, Joakim Gustafson, Éva Székely
top venue
Abstract · Proceedings of Interspeech 2026

Speech-generating devices (SGDs) are essential tools for many speech-disabled individuals, yet current systems often reinforce normative assumptions about identity and communication. Prior research on gender expansive SGD users has largely focused on gendered voice options, with less attention to broader identity alignment and the technological conditions that shape users' agency. This study examines how gender expansive SGD users experience power over their voices using thematic analysis of qualitative survey data. Three themes emerged: (1) integration of SGDs into daily life, (2) identity expression, and (3) power and agency. Participants expressed the need for more responsive and reliable technology, inclusive and customizable voices, and greater autonomy in defining how their voices sound and are perceived. Ultimately, their perspectives call for a reimagining of SGD systems as tools for reclaiming the power of one's voice and the ability to define and enact one's will through it.

0.69
5

Life-cycle structural reliability of RC bridge piers under corrosion in a changing climate

cs.PF ·2026-11-16 ·Giuseppe Vittorio Nava, Luca Capacci, Fabio Biondini, Lorenzo Casti
publishedunusualhighly cited
Abstract

Aging and deterioration processes of structures and infrastructure systems can be severely affected by the long-term evolution of environmental conditions expected in a changing climate. This paper aims at investigating the interaction between climate change and environmental aggressiveness on the probabilistic life-cycle performance of concrete structures under corrosion. A simulation-based framework is proposed for life-cycle structural reliability analysis under climate change scenarios. The framework is applied to a bridge pier with hollow core cross-section exposed to chloride-induced corrosion. The results allow to quantify the impact of climate change on long-term probabilistic structural response and highlight the need for proper modeling of the environmental parameters and climate evolution over the entire lifespan of aging structures for optimal life-cycle maintenance and management of structural and infrastructural facilities.

0.68
6

Weight-Space Programming Doesn't Need Transformers

cs.LG cs.AIcs.CL ·2026-11-17 ·Hyunjong Ok, Jaeho Lee
code/datacommunity pick
Abstract · Preprint (Work in progress)

Standard neural architectures such as the Transformer were chosen because they train well with gradient descent and run fast on GPUs. In weight-space programming, a large language model (LLM) writes target weights by hand without gradient-based training, so those reasons no longer apply. Should we keep the Transformer? Given minimal guidance, ten labeled examples, and a sandbox, mainly on multiple-choice questions, we task three frontier LLMs with either generating the weights of a fixed architecture or designing the architecture themselves. When free to design, all three compile plain-text facts into a sparse table queried by a fixed procedure, reaching up to 54.4% test accuracy. An LLM-designed model achieves higher test accuracy than the most accurate released Transformer that the same LLM wrote while using about 1,800x fewer parameters. Without gradients, they choose a table, in which the LLM can state what each weight means and can find and rewrite a wrong one. Each wrong answer points to one row, and removing a row changes about one other answer. From this, we propose an associative-memory-based model up to 17x faster on GPUs than a same-sized Transformer. We also test pretrained weights, other benchmarks, and tasks where models generate answers. Pretrained LLMs remain more accurate; the claim concerns which structure to build when writing weights.

0.68
7

From Attack Tree to Model Checker: Binding CAPEC Patterns to Verify Robotic System Security

cs.CR cs.LO ·2026-11-17 ·Juel Hussain, Louise A. Dennis, Clare Dixon, Marie Farrell
published
Abstract · In Proceedings FMAS 2026, arXiv:2611.21375

Security-minded verification of autonomous and robotic systems presupposes an attacker, yet the path from a threat catalogue to a checkable attacker model is still traversed by hand. This research preview presents the theory and construction of a pipeline that mechanises it. Each leaf of an attack tree is mapped to a CAPEC attack pattern and written in first-order logic as a rule: the attacker's prerequisites imply the attack's effect. Casting the pattern as such a rule is what makes it operational - its variables can be bound to a specific system's parts, and its prerequisites can then be tested against that system under a chosen configuration of security controls. Binding is our means of verifying whether a system is vulnerable to a given attack: from a bound pattern we derive an attacker model, turn its effect into a temporal-logic property, and check that property against the system with and without a countermeasure, reporting the control that defeats the attack. We describe the signature, schemas, profiles for approach, and explore how CAPEC can support reasoning about robotics security.

0.67
8

SE(3)-LIVOM: Adaptive Multi-LiDAR-Inertial-Visual Odometry and Mapping

cs.RO ·2026-11-17 ·Gunhee Shin, Seungjae Lee, Daebeom Kim, Seoyeon Jang, Hyun Myung
publishedcode/data
Abstract · 3 pages, 2 figures, 2 tables. Overall winner of the COMFORT Challenge, IROS 2026 Workshop on Data in Field Robotics. Code: https://github.co…

This paper presents SE(3)-LIVOM, the overall winner of the COMFORT Challenge at IROS 2026. The challenge asks for the trajectory of a legged robot in the GrandTour dataset, whose scenes include collapsed buildings, construction sites and snowfields. SE(3)-LIVOM runs in real time on two LiDARs, one camera and an IMU. Its frontend extends SE(3)-LIO to multiple LiDARs and a camera. Adaptive downsampling keeps the time per scan near 35 ms within and across scenes. An online backend corrects drift with a plane bundle adjustment over submaps and an incremental pose graph. With a single configuration for all scenes, the system reaches an average ATE of 1.40 cm on the six test scenes. The code is available at https://github.com/url-kaist/se3-livom-comfort.

0.67
9

iEEG Can Help EEG: Improving Clinical Scalp EEG Analysis through Intracranial Priors

cs.LG eess.SPq-bio.NC ·2026-11-16 ·Xianglong Bao, Yi Ding, Zengxiang Li, Nan Liu, Kewen Wang +2 more
top venuecode/data
Abstract · Accepted at KDD 2027

Scalp electroencephalography (EEG) is a cornerstone of clinical brain monitoring, making the quality of its signal fundamental to downstream tasks and models. However, that signal is heavily contaminated by non-neural interference and blurred by volume conduction. Existing methods operate almost exclusively within the scalp modality, so they inherit the contamination they would need to overcome. In practice, intracranial EEG (iEEG) observes the neural activity with far higher fidelity, yet it is invasive and therefore scarce, and the two modalities are rarely recorded as pairs at scale, share no common channel space, and offer no clean ground truth to directly supervise a mapping. Motivated by the neuronal synchronization mechanism shared by the two modalities, we propose a reprogramming approach that fits a signal-to-signal model on iEEG alone and freezes it as a cross-modal prior. We introduce ReBrain, a framework to transfer an iEEG-learned prior to scalp EEG, which re-expresses any scalp signal through that prior and can be inserted upstream of any downstream model with no pairing or fine-tuning. ReBrain consistently improves host models across recordings from multiple hospitals and across architecture families, and our analysis traces this gain to genuine neural structure carried by iEEG rather than to the architecture itself. This work provides evidence that a scarce clean modality can serve as a transferable prior for an abundant noisy one, offering a general recipe for cross-modal transfer among biosignals. Our code is available at https://github.com/Xianglong-Bao/ReBrain.

0.66
10

ForceBody: Force-Paired Parametric Body Motion with Torque Uncertainty

cs.CV cs.AI ·2026-11-17 ·Joonwoo Kwon, Yufei Zhang, Xiaoming Liu, Zijun Cui
top venuebenchmarkcode/data
Abstract · Accepted at NeurIPS 2026 Evaluations & Datasets Track

Forces and torques drive human motion, central to biomechanics, robotics, and physics-aware animation, yet they are often absent from learning-based motion pipelines for body reconstruction and generation. Some motion datasets provide force annotations, but the paired motion sequences are incompatible with the parametric body models used in modern learning pipelines. In addition, existing datasets typically obtain joint torques through inverse dynamics, which is inherently sensitive to the quality of the input kinematics; however, they do not quantify the reliability of these torque estimates. We close this gap with ForceBody, the first dataset to bring ground truth force supervision into a parametric body representation, shipped with per-sample torque uncertainty. ForceBody pairs the SKEL body model with ground reaction forces and inverse-dynamics joint torques across 10,386 motion trials (9.7M frames, 26.9 hours) from 140 subjects. Each torque label is paired with a per-frame, per-joint uncertainty annotation obtained by Monte Carlo sampling through the inverse dynamics pipeline. We benchmark six architectures (MLP, Conv1D, LSTM, GRU, Mamba2, Transformer) on ground reaction force and joint torque prediction from SKEL motion. As one example use of the released uncertainty, finetuning a Transformer with per-sample uncertainty weighting reduces the MAE of joint torque estimation by 5%. Code and data are at https://github.com/DominoAI-Lab/ForceBody-NeurIPS-ED-2026.

0.66
11

ViRA: Toward Ultra-High-Resolution Visual Agents via Cross-Input Relative Policy Optimization

cs.CV cs.AI ·2026-11-16 ·Huawei Lin, Jinting Liu, Tongyan Wang, Xuyang Chen, Ruihua Shi +7 more
theorycode/data
Abstract · 74 pages, 11 figures, 26 tables. Code: https://github.com/huawei-lin/ViRA

Visual agents answer questions about ultra-high-resolution photos by zooming into the relevant regions. However, existing agents often answer from common sense instead of reading the evidence. Reinforcement learning (RL) on the final answer cannot correct this, because a guess earns the same reward as reading. We propose Cross-Input Relative Policy Optimization (CrossRPO), which trains agents on contrast sets. A contrast set asks one question about several versions of an image that differ only in a small region with the evidence and have different answers, so only reading the evidence solves the whole set. CrossRPO rewards solving the whole set, and we prove that it does not reinforce a set answered from common sense. We build contrast sets for training (ViRA-Train) and evaluation (ViRA-Bench) by editing one small object in images of 21 to 120 megapixels, and we photograph further sets with real changes (ViRA-Bench-Real) to exclude editing traces. We train two Visual Reasoning Agents, ViRA-9B and ViRA-27B, with CrossRPO on only about 3,500 items of ViRA-Train each. CrossRPO achieves 63.3% set accuracy on ViRA-Bench at the maximum resolution, against 59.3% for GRPO. ViRA-9B is the most accurate open model of its size on all benchmarks, and ViRA-27B outperforms Claude Haiku 5.5 and GPT-6-Luna, both at their highest thinking level, on most benchmarks.

0.66
12

The Kernel Reality Check: Benchmarking and Distilling Efficient Attention at Scale

cs.LG ·2026-11-17 ·Fırat Öncel, Cem Subakan, Mirco Ravanelli, Çağatay Yıldız
top venuecode/data
Abstract · Accepted at NeurIPS 2026. 20 pages

Kernelized attention methods, which aim to replace the $O(N^2)$ complexity of softmax attention with $O(N)$ alternatives, have been the focus of intense research in the last five years. Despite growing interest, systematic evaluations and fair comparisons across approaches and scales are still missing. We analyze kernelized attention in two halves and highlight prominent limitations on each. On efficiency, FlashAttention achieves lower memory consumption and faster wall-clock time than SOTA kernelized methods during training and in vision transformers across most sequence lengths (with inference-time memory in causal language models the only clear exception), contradicting the core assumption for pure kernelized attention used as a drop-in replacement for softmax. We also discover that reported efficiency gains often fail to reproduce against modern baselines. On quality, current kernelized methods leave gaps of 2-10 points relative to softmax under a unified distillation protocol, and model scala alone does not close these gaps. We show this gap is not intrinsic to kernelization: LARA++, a principled extension of LARA that approximates softmax via importance sampling with adaptive proposal distributions, recovers up to 99% of softmax accuracy. We establish that the gap is closable; however, the computational overhead remains substantial, leaving the efficiency wall intact. Code is available at https://github.com/firatoncel/KernelRealityCheckNeurIPS2026

0.65
13

EfficientVPR: Toward Efficient Visual Place Recognition via Scene-Aware Prompt Tuning and Adaptive Feature Enhancement

cs.CV ·2026-11-17 ·Wenjing Tang, Chuanguang Yang, Zhulin An, Libo Huang, Yongjun Xu
top venuecode/data
Abstract · 18 pages, 11 figures, accepted at CVPR 2026

Visual place recognition (VPR) faces critical challenges in handling extreme environmental variations while meeting the computational constraints of practical applications. Current methods predominantly address these challenges by either scaling up model capacity or employing computationally intensive reranking stages, creating a significant efficiency bottleneck. To overcome this limitation, we propose EfficientVPR, a lightweight one-stage framework that achieves speed-accuracy trade-offs through two key innovations: i) a scene-aware visual prompt tuning method which adapts pretrained features with less parameters while dynamically adjusting to sample-specific characteristics, and ii) an instance-dependent key local feature enhancement module that further reinforces discriminative regions. Comprehensive evaluations on Pitts250k, MSLS, Eynsham, AmsterTime and SVOX demonstrate that our method establishes a new SOTA for DINOv2-small models by outperforming all same-scale competitors, and delivers a $73\times$ speedup with 60\% lower-dimensional features while maintaining competitive (within 2.5% average R@1 gap) against the SOTA DINOv2-large-based two-stage method. Our code will be available at https://github.com/WiniTang/EfficientVPR.

0.65
14

Noise Characterization and Robust Signal Detection in Yeast Pheromone Molecular Communication

cs.IT cs.ET ·2026-11-17 ·Nikolaos Ntetsikas, Styliana Kyriakoudi, Antonis Kirmizis, Ioannis Krikidis, Ian F. Akyildiz +1 more
publishedunusual
Abstract

A critical aspect of Molecular Communications (MC) is the implementation of signal detection policies amidst noise. To date, noise characterizations within the MC field have predominantly drawn from methodologies found in wireless communications literature. In this study, we diverge from existing MC research by utilizing a newly developed experimental platform that employs yeast, allowing us to consider more realistic noise characterizations based on the relevant signaling pathways. We propose suitable signal detection mechanisms tailored to this experimental setup, which focuses on yeast cell-to-cell communications. Our analysis identifies gene transcription as the primary source of noise, and we utilize a Markov birth-death process model with Poisson arrivals and departures to characterize it. The noisy expression of the FUS1 gene is best represented using a mixed Gaussian distribution model. This model serves as a foundation for evaluating the performance of Maximum Likelihood Detection mechanisms in terms of Bit Error Rate (BER) for both symbol-by-symbol and sequence transmission schemes. Error analysis indicates that appropriate adjustments to the signal threshold can reduce errors to as low as 10%, which is not negligible. In contrast, the detection of symbol sequences demonstrates enhanced error performance, achieving error rates as low as 0.4%, albeit at the cost of increased computational complexity.

0.64
15

SWIR-cGAN: Synthesizing SWIR Bands Using VNIR Imagery from CBERS and AMAZONIA-1

cs.CV ·2026-11-17 ·Alisson Cleiton de Oliveira, Rennan de Freitas Bezerra Marujo, Thales Sehn Körting
publishedcode/data
Abstract · Available on: https://ieeexplore.ieee.org/document/11793642. Early Access

Spectral band synthesis is an important research topic in remote sensing. The Brazilian satellites CBERS-4, CBERS-4A, and AMAZONIA-1 provide high temporal resolution (1-3 days) visible and near-infrared (VNIR) imagery through the Wide-Field Imager (WFI), but lack short-wave infrared (SWIR) bands. Recent deep learning methods have shown promising results for spectral synthesis, but challenges remain for cross-satellite generalization and spectrally distant bands. This paper presents a conditional Generative Adversarial Network (cGAN) with an attention-enhanced U-net generator and a multi-loss objective to synthesize Sentinel-2/MSI SWIR bands 11 (SWIR-1) and 12 (SWIR-2) from WFI VNIR inputs. Experiments used 4,125 patches for training and cross-validation and 1,026 unseen patches for testing, with hyperparameters optimized using a subset of the training data. On SWIR-1, the model achieved SSIM of 0.900, PSNR of 31.44 dB, and MAE of 0.019 in TOA reflectance. On SWIR-2, it achieved SSIM of 0.917, PSNR of 33.35 dB, and MAE of 0.015. Benchmarking was performed on the test dataset, with each model optimized separately prior to evaluation. SWIR-cGAN outperformed the baselines, particularly for SWIR-2. The ablation study identified the multi-loss as the main performance contributor, while the attention and residual modules provided additional improvements. Our results demonstrate the feasibility of synthesizing SWIR bands from WFI imagery. The SWIR-cGAN is available at https://github.com/marujore/swir-cgan.

0.63
16

Accelerate Bench: Evaluating Agents for Application-Level Program Optimization

cs.AI ·2026-11-16 ·Bowen Liu, Yuhan Li, Nuo Chen, Weile Luo, Miao Peng +5 more
benchmarkcode/data
Abstract · 49 pages, 8 figures. Work by Bowen Liu was done during an internship at Tencent Hy Team. Yuhan Li is Project Lead; Nuo Chen is corresponding…

Application optimization requires coding agents to discover useful changes and coordinate them across a complete program while preserving the required computation. We introduce Accelerate Bench, a benchmark of 32 CPU optimization tasks adapted from scientific applications and supercomputing competitions. Each task provides a working program and specifies the workload, correctness requirements, timing boundaries, and permitted edits, leaving agents to choose where and how to optimize. Public testing supports iterative development, and a separate verifier scores the final submission. On benchmark version 1.1, we evaluate 16 coding agents, each pairing a model with a harness. Their Score@1 ranges from 25.5% to 67.4%. Most of their programs are correct, and the size of the speedup separates them: the two leading agents are at least 2x faster on 22 or more of the 32 tasks, while the other fourteen reach 2x on 8 to 17 and leave 125 of their 412 correct outcomes below 1.25x. Controlled replays show why coordination across an application matters: identical source code runs between 0.29x and 2.12x depending only on build and runtime settings, and one code change is worth 1.01x or 6.4x depending on another. Accelerate Bench pairs executable workloads with agents' programs and trajectories to evaluate both their gains and the process behind them.

0.63
17

MillBill: A Machining Agent with Geometric Feedback

cs.AI cs.CV ·2026-11-17 ·Gennadii Savrasov, Artem Slavin, Soslan Kabisov, Andrey Kuznetsov, Anton Konushin +1 more
code/data
Abstract · 18 pages, 8 figures. Code: https://github.com/kulibinai/millbill

Turning a CAD model into a machining program requires both process knowledge and geometric precision. Language models can generate such workflows by writing geometry and toolpath code for each part, but this makes numerical execution part of the model's task. We introduce MillBill, an agent that separates machining decisions from their geometric execution and verification. Given a boundary-representation part, stock, and material, a locally hosted, mid-sized open model proposes operations and cutting parameters for indexed three-axis machining. A geometric harness generates toolpaths, simulates material removal, and returns feedback for plan refinement. Setup planning accounts for what the available cutters can physically reach, rather than visibility alone. We evaluate the resulting programs by the fraction of the target surface area within the specified tolerance after simulated machining. With Qwen3.8-27B, MillBill outperforms frontier-model approaches that construct their own geometry and toolpath workflows on the evaluated machining tasks. Code: https://github.com/kulibinai/millbill

0.63
18

DominoBench: Evaluating Multi-Step Physical Reasoning from Still Images

cs.CV ·2026-11-16 ·Emilio Ferrara
benchmarkcode/data
Abstract · DominoBench dataset, evaluation harnesses, and benchmarks available at https://huggingface.co/datasets/emilioferrara/DominoBench

Can a vision-language model look at a picture of a chain reaction and tell what will happen? Recent multimodal models describe scenes fluently and solve textbook physics problems, which suggests they should also predict how a scene of ramps, ledges, pendulums, seesaws and dominoes plays out once a ball is pushed. We tested this claim on 30 models from 10 families and reached a clear conclusion: unaided, no model predicts the outcome reliably. We built DominoBench, a benchmark of still images of 2D rigid-body scenes whose outcome a physics simulator computes. It holds 854 items in 427 minimal pairs, in which a change of one to three grid steps in one quantity decides whether one person survives, and every item comes with a four-rung hint ladder ending in the exact calculation that decides the outcome. Unaided, frontier models from Anthropic, Google and OpenAI are right about the person whose fate flips in at most 75% of items and answer both twins of a pair correctly in at most 40%. Pointing at the deciding step helps little, and exact geometry given as text barely helps, yet once the deciding calculation and the quantities it needs, including speeds that a still image cannot show, are written out, the same models reach 80-92% on the deciding person, while small open-weight models stay near chance. Physical prediction from a still image therefore fails at the quantitative step: the strongest models use the deciding quantity when they are given it, but do not produce it on their own. For models that plan or act in the physical world, a fluent account of a scene is thus no evidence of a correct prediction: such models must find and compute the deciding quantity unprompted, and DominoBench tests whether they do.

0.61
19

Magflow: Differentiable Simulation of Industrial-Grade 6D Magnetic Levitation

cs.RO cs.LGeess.SY ·2026-11-17 ·Philipp Hartmann, Jannick Stranghöner, Klaus Neumann
top venuecode/data
Abstract · 8 pages, 5 figures, 1 table. Accepted for publication in IEEE Robotics and Automation Letters (RA-L). Project page: https://sites.google.com…

Magnetic levitation with six-degrees-of-freedom enables frictionless transport and micrometer-scale positioning in principle, but low-level control is inherently challenging due to its complex and unstable dynamics. Industrial systems typically rely on deep hardware-software co-design, where mover and stator geometries are jointly designed to enable a compact, hand-crafted approximation of the electromagnetic force computation, thereby keeping control computationally tractable at kilohertz rates. However, this approach imposes overly conservative constraints on the operating workspace and the range of supported mover topologies. Instead of reducing the underlying physics to a hand-crafted approximation, we compute the physics directly. We introduce Magflow, a fully differentiable, GPU-parallel simulator for 6D magnetic levitation. It is used to train the first neural controller for an industrial-grade 6D magnetic levitation system that is learned purely from simulated physics. We show that the learned neural controller transfers zero-shot from simulation to real hardware while satisfying hard real-time constraints at 4 kHz. The learned controller achieves qualitatively new behaviors and even levitates a mover topology for which no hand-crafted solution exists. These results demonstrate that co-design is not a physical necessity for 6D magnetic levitation control. More broadly, control learning from simulated physics can find solutions beyond the reach of control engineering in demanding industrial domains. Source code and demonstration videos are publicly available at https://sites.google.com/view/magflow.

0.59
20

Data-Driven Predictive Control for Autonomous Vehicle Racing under Varying Friction

eess.SY cs.RO ·2026-11-16 ·Julius Beerwerth, Julius Tischbein, Bassam Alrifaee
code/data
Abstract · 8 pages, 4 figures. Submitted to the 2027 European Control Conference (ECC). Code and data: https://github.com/bassamlab/multisurface-racing…

Data-driven predictive control (DPC) predicts future outputs by combining recorded input-output trajectory data such that the combined trajectory approximately matches a measured initial trajectory and tracks a provided reference. This paper investigates to what extent and under which conditions DPC using data pooled across operating conditions retains the prediction accuracy of DPC using data from the current operating condition. In autonomous vehicle racing, the tire-road friction varies between racetrack sections and tire sets. If the initial trajectory and the recorded data originate from different frictions, prediction accuracy of DPC degrades. Ensuring the frictions match requires knowing the friction during recording and estimating the current friction explicitly. Instead, we pool data recorded at different frictions. We compare the prediction accuracy of DPC using data recorded under the current friction (matched), a different friction (mismatched) and data pooled from both frictions. We evaluate in simulation and small-scale vehicle experiments in the Cyber-Physical Mobility Lab (CPM Lab). Our results show that pooled data keep the multi-step root-mean-square prediction error within 1.5 times that of matched data, whereas mismatched data increase it by a factor of 2.2 to 3.4. To assess how this prediction accuracy carries over to control, we evaluate the tracking error from the raceline in closed loop. In simulation, DPC with pooled data tracks comparably to nonlinear model predictive control (13.7 cm versus 13.3 cm) and close to DPC with matched data in the CPM Lab, differing by 0.1 cm on the low-friction tires (1.6 cm versus 1.5 cm) and by 0.2 cm on the high-friction tires (0.9 cm versus 1.1 cm). DPC thus provides partial adaptation to varying friction, without a dedicated adaptation method.

0.58