Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 18 August
Chernoff information is a fundamental divergence measure characterizing the optimal error exponent in Bayesian binary hypothesis testing, with applications in information fusion, time-series analysis, and statistical learning theory. However, closed-form expressions exist only for simple parametric families, and nonparametric estimation remains difficult because the quantity is defined as an optimization of the unnormalized Rényi divergence over its order. We reformulate this optimization via a derivative condition, whose zero locates the optimal mixture parameter, and estimate the derivative directly using a $k$-nearest-neighbor method. We prove the $L_2$-consistency of the derivative estimator under mild regularity conditions on the densities and their domain. Coupled with a bisection procedure that locates the optimal parameter up to arbitrary precision, this yields an estimator for Chernoff information.
Digital Libraries · Cross-listed from physics.soc-ph
Computational Prosopography across a Millennium: Mathematically Oriented Lineages Traced from the Fields Medalists
We reconstruct the mentor–student network through which documented scholarly training passed across roughly nine centuries, and subject both the network and the means of reconstructing it to source criticism. From Wikidata, which aggregates the Mathematics Genealogy Project and the MacTutor Archive, we extract approximately 470,000 mentor–student assertions, yielding a directed acyclic graph of 372,853 persons. Using all 64 historical Fields Medalists as a fixed, ex ante tracer set, backward traversal enumerates some 25.5 million distinct paths reaching 57 generations. Three structural observations follow. Genealogical traffic through Leibniz forms an hourglass: thin upstream, 5.3 paths per node on average, and thick downstream, 53.4, a ratio near 10:1, with no counterpart at Newton, who lies on only four of the 64 lineages. Across a window centered on Leibniz, seven independently extracted predicate dimensions reorganize together, and recorded learned-society membership rises from 6.5 to 82.1 percent of the cohort. Upstream, 54 of the 64 lineages converge on the same five twelfth- and thirteenth-century Islamic and Byzantine scholars before terminating at an eleventh-century boundary we name the Monastery Wall. We argue that such observations cannot be assessed without tool criticism. The traversal engine is algebraically reversible, so every ranking decision it makes can be reconstructed afterward. We characterize its measurement bias in closed form, show that the macro-structures survive switching that bias off, and report the family of lineages the traversal returns at different resolutions rather than a single ranked list.
Read the full abstract
Machine Learning
Hybrid ML for Lightweight Pre-Route Delay Estimation in Open-Source IC Design
Static Timing Analysis (STA) is a critical step in the design flow of digital integrated circuits, however, obtaining accurate delay estimations can represent a challenge when limited information regarding physical design is available. In response, this work presents a hybrid and light-weight machine learning (ML) based approach that combines a decision tree with linear regression to improve pre-routing delay estimations generated by the open-source RTL-to-GDSII tool OpenLane. The proposed model achieves an 80% reduction in error compared to OpenLane's estimates, demonstrates a 71% improvement even without utilizing OpenLane-specific parameters. Overall, this method offers an alternative to traditional delay propagation techniques and more complex machine learning models that is not only accurate, but is also over 300 times smaller, 2 times faster and offers a higher explainability.
Read the full abstract
Computation and Language
CABLE: Extending the Reach of Memory Retrieval via Complementary Antecedent-Based Linking and Expansion
As LLM agents operate across structured workflows and sessions, preserving long-term history does not ensure that later contexts can recover relevant evidence through a bounded memory interface. We study this evidence-reachability problem in long-term conversational memory, where retrieval still relies heavily on semantic similarity. This works well for topical recall, but it often misses earlier experiences, plans, or motivations that are semantically distant from the later events they help explain. Existing memory graphs provide cross-memory structure, yet links driven mainly by semantic overlap can duplicate what the host retriever already recovers. We argue that link construction should instead prioritize a sparse set of retriever-complementary associations. We present CABLE (Complementary Antecedent-Based Linking and Expansion), a plug-in augmentation that constructs links designed to extend the host retriever's direct semantic reach. For each new memory, CABLE generates antecedent-oriented queries, retrieves prior memories, subtracts candidates in the direct semantic neighborhood, and verifies the remainder before adding the accepted complementary associations into a sparse directed graph. At retrieval time, CABLE expands the host system's retrieved seeds along these links to surface implicit supporting evidence. We evaluate CABLE with A-MEM on LoCoMo and MA-LongMemEval, and further integrate it into SimpleMem and Mem0g on LoCoMo, using Qwen3.5-27B, DeepSeek-chat, and GPT-4o-mini. CABLE yields higher mean LLM-judge scores in every evaluated system-level setting, with the largest gains in categories where useful evidence is distributed across memories or sessions, including open-domain, multi-session, and preference-oriented questions. These results support prioritizing sparse, reasoning-relevant associations that complement rather than duplicate the host retriever.
Read the full abstract
Systems and Control · Cross-listed from math.OC
Stochastic Robust Linear W-infinity Control via Dynamic Output Feedback
This paper introduces a robust W-infinity optimal control framework for linear Itô diffusions using a weighted Sobolev-space performance measure. Because the sample paths of Itô diffusions are nondifferentiable, the formulation leverages the weak derivative of the expected state. An LMI-based semidefinite program is developed for dynamic output-feedback synthesis, and a rigorous stability analysis guarantees mean-square ultimate boundedness with minimized ultimate bound. A numerical example demonstrates that the proposed approach provides effective disturbance attenuation with fast transient performance.
Read the full abstract
Numerical Analysis
Asymptotic dispersion correction for the isotropic elastic Helmholtz equation discretized with a MAC scheme
The numerical simulation of time-harmonic wave propagation in elastic media plays an important role in applications such as geophysics and non-destructive testing. Accurate discretization of the elastic Helmholtz equation at high frequencies is challenging due to numerical dispersion and pollution effects. In this work, we develop an asymptotic dispersion correction for a Marker-And-Cell (MAC) discretization of the isotropic elastic Helmholtz equation. We characterize the discrete dispersion relation of the scheme and determine the leading-order term in the dispersion error in both two and three spatial dimensions. Based on this analysis, we derive a correction that is asymptotically optimal in the limit of vanishing mesh size. The proposed approach improves the agreement between the discrete and continuous wave propagation properties while preserving the structure of the underlying discretization. We also establish a connection between the factorization of the dispersion relation and the structure of the grad-div operator symbol, providing additional insight into the algebraic structure of the elastic problem. Numerical experiments finally demonstrate a substantial reduction of relative errors and confirm the effectiveness of the proposed correction. We further provide numerical evidence that the corrected discretization improves the convergence behavior of multigrid solvers.
Read the full abstract
Data Structures and Algorithms
Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries
We study the data structure version of the element distinctness problem: preprocess an array of $n$ elements from an alphabet of size $\sigma$ to answer All-Distinct queries, asking whether a given range contains only distinct elements. We first focus on uniformly random arrays: in the encoding model, where access to the input at query time is not allowed, we prove a lower bound on the expected space; for instance, the lower bound is $n$, $1.3627n$, $1.5153n$, $1.5824n$ bits for $\sigma = 2,3,4,5$, and approximately $n\sqrt{\pi/(2\sigma)}\,\log\sigma$ bits for $\sigma =\omega(1)$. We complement this by designing different average-case optimal encodings, supporting All-Distinct queries in worst-case time $O(1)$, $o(\log^{2}{\log{n}})$, or $O(\log\log{n})$ depending on $\sigma$, and $O(1)$ expected time for any $\sigma = \omega(1)$. We then switch to worst-case (non-random) arrays: in the indexing model, where access to the input is allowed, we prove a cell-probe space-time tradeoff lower bound showing that any index using $n/b$ bits must have $\Omega(b/\log{b})$ query time. We conclude by presenting a simple index almost matching this lower bound.
Read the full abstract
Artificial Intelligence
AutoResearch: Insight In, Hallucination Out
Autonomous research systems are increasingly capable of executing long research workflows, yet automation alone does not ensure that the resulting process remains scientifically grounded. We introduce AutoResearch, a two-stage system that connects Idea Generation with Idea Execution to address both how research ideas are formed and how they are reliably established through experimentation. In Idea Generation, AutoResearch continuously integrates emerging research signals with accumulated domain knowledge, identifies transferable mechanistic insights, and uses multi-model generation and cross-review to produce grounded, testable research plans. In Idea Execution, coordinated agents decompose these plans into experiments, iteratively implement and diagnose them, and employ independent evidence-based review before accepting research conclusions. Across representative settings in cross-modal retrieval, systems optimization, and benchmark-driven machine learning, AutoResearch turns generated ideas into measurable progress, detects and corrects unreliable experimental results, and makes evidence-conditioned decisions to continue, revise, or terminate research directions. For example, on RSICD benchmark, an AutoResearch-generated idea improves mean Recall from 32.84 to 34.69, while recording only 5 audit-confirmed issue events compared with 11-27 for other autonomous research systems. These results demonstrate a research process in which meaningful insight is grounded before experimentation and conclusions are grounded before acceptance: Insight In, Hallucination Out.
Read the full abstract
Systems and Control
Adaptive Model Predictive Control for Ground Vehicles: Review and Demonstrative Implementation
This paper reviews Adaptive Model Predictive Control (AMPC) methods for Autonomous Vehicles (AVs), focusing on control strategies that dynamically adapt to uncertainties and changing conditions in real-time. The critical role of Adaptive Model Predictive Control (AMPC) in addressing the challenges of autonomous vehicle control are discussed. For the scope of this paper, AMPC is defined as a class of Model Predictive Control (MPC) techniques that modify the system model, cost function, constraints, or prediction horizon, based on real-time data. Traditional MPC, while effective for constrained optimization, struggles with model inaccuracies, computational demands, and dynamic environments, necessitating AMPC methods. The review covers existing literature on Gain scheduled MPC, Online Model Estimation MPC, Weight Adaptive MPC, Horizon Adaptive MPC, Learning Based MPC, and Hybrid MPC that combines MPC with other control methods. In addition to the survey, a demonstrative simulation of an adaptive MPC controller is presented that illustrates practical aspects of weight and speed adaptation in trajectory tracking.
Read the full abstract
Systems and Control
The Zonotopic Mixture Filter
State estimation is commonly posed in either a probabilistic or an unknown-but-bounded framework. The former requires a fully specified noise distribution, typically with unbounded support, while the latter yields guaranteed enclosures that carry no probabilistic weighting. Bridging these noise descriptions, this paper proposes a zonotopic mixture noise model, in which the noise is generated by drawing a zonotope from a finite collection according to fixed probabilities and then realizing an arbitrary element of it. For this noise model, we derive the zonotopic mixture filter, which propagates a bank of zonotopic Kalman filters over mode histories, discards the histories falsified by the data, and weights the surviving ones by their relative probability. The resulting state enclosures yield guaranteed coverage probabilities and remain valid for every noise realization compatible with the bounds, and a greedy mixture reduction scheme preserves these statistical guarantees while keeping the representation tractable. Numerical examples illustrate the proposed approach and its potential benefits over related state estimation methods.
Read the full abstract
Machine Learning
Dynamic Compression in Recurrent Networks
Recurrent models process long contexts efficiently by compressing their history into a fixed-size state, but modern architectures typically do so in a single causal pass over the sequence. Each input must therefore be compressed before the model knows how it will later be used, forcing a limited state to compromise across possible future demands. We introduce dynamic compression, which allows a recurrent model to selectively revisit past tokens and revise its fixed-size state through additional recurrent updates. The model need not preserve every part of the history at uniformly high fidelity in its recurrent state, because lower-fidelity information can be revisited from the retained raw sequence when it becomes relevant. We study this in a controlled setting where the model first learns multiple functions in-context and, later in the same sequence, encounters a series of few-shot tasks that each require it to identify and reuse one of those functions. A single-pass model must preserve every function at sufficient fidelity for any future task, whereas selective re-scanning allows the model to revisit and refine only the function currently needed. We find that dynamic compression substantially reduces the recurrent state required for accurate reuse and scales more favorably as the number of stored functions grows. These results demonstrate a computation–memory tradeoff in which recurrent models can spend more computation revisiting their history to make more effective use of a fixed-size state.
Read the full abstract
Computation and Language
BEAR-Bench: A Bilingual Enterprise and Academic Reasoning Benchmark for Multimodal Models
While Multimodal Large Language Models (MLLMs) have made significant strides in visual comprehension, their ability to reason about text-dense, professional documents remains incompletely evaluated. Existing benchmarks emphasize information extraction, require external domain knowledge, or cover professional documents only as one of many settings. They are also largely English- or Chinese-centric, leaving other languages and Russian, in particular, substantially underrepresented. To address these limitations, we introduce BEAR-Bench (Bilingual Enterprise and Academic Reasoning), a self-contained, complex English-and-Russian benchmark comprising 1000 human-annotated questions based on text-rich business and scientific documents. We evaluate 16 proprietary and open-weight MLLMs, including Gemini 3.1 Pro and Qwen3.5-397B, on BEAR-Bench and observe clear headroom even for the strongest systems. Finally, we use the resulting model outputs to compare existing hallucination detection methods, evaluating not only how often models fail on BEAR-Bench but also how reliably those failures can be identified.
Read the full abstract
Machine Learning · Cross-listed from physics.flu-dyn
A Residual Learning Approach for Unsteady Aerodynamic Load Prediction
This paper investigates the feasibility of using residual learning to improve unsteady aerodynamic load prediction for aeroelastic applications. The machine learning technique selected for the study is the long short-term memory (LSTM) neural network, which is used for its suitability for sequential data with aerodynamic memory effects. The approach is investigated for the NLR 7301 airfoil benchmark using high-fidelity CFD lift data for prescribed pitch and plunge motions in the transonic flow regime in the presence of shock motion. An analytical unsteady aerodynamic model based on the Wagner function is used as a physics-based baseline, and the neural network is trained to learn the difference between the CFD lift coefficient and the Wagner prediction. The residual model is compared with a direct neural-network model trained to predict the CFD lift coefficient. The comparison includes feature and normalization studies, external benchmark cases, and leave-one-out and leave-family-out generalization tests across a range of sinusoidal and non-sinusoidal motions. The residual model performs best when its inputs align with the Wagner formulation variables, generally giving lower error and more consistent performance across training runs, though the direct model remains more accurate for some high-frequency cases. The residual model also generalizes better in the leave-one-out and leave-family-out tests, with a smaller increase in error than the direct model when entire motion families are withheld from training. Overall, the results indicate that residual learning shows promise as a modular approach for augmenting classical low-order aerodynamic theories, especially when the physics baseline removes a structured part of the aerodynamic response and leaves a lower-variance correction for the neural network to learn.
Read the full abstract
Discrete Mathematics
Abstract Simulation of Reaction Networks
Reaction networks model reactions between a finite set of species. These networks can be associated with different semantics, depending on the type of analysis and the phenomena under study. The standard continuous semantics is given by a system of differential equations based on the kinetic expressions of the reactions. To simulate a network under this semantics, the full knowledge of the kinetic laws of each reaction and the initial concentrations of each species is necessary. Since in empirical settings the quantitative information about the reactions can be partially or totally unknown, the challenge is to introduce new semantics that can still be applied. In this direction, a recent approach in the state of the art concerning Reaction Networks proposes a qualitative abstraction that is too coarse to properly capture the time-course continuous behaviour. Starting from the ideas of this approach, in this paper we first introduce the causal continuous semantics for Reaction Networks to capture their continuous-time dynamics, preserving the causality hidden inside each transition. Later, we introduce the differential sign semantics to abstract in a qualitative way the behaviour of a system under the causal continuous semantics. We show that our new method, based on abstract interpretation, yields appropriate Boolean transition graphs that refine those provided by the previous approach.
Read the full abstract
Information Retrieval
VisDocAgentBench: Benchmarking Agents for Visually Rich Document Retrieval
Visually rich documents encode relevance through language, layout, structured visual elements, and corpus context, yet retrieval is typically evaluated by one-shot query–page matching. Agentic-search benchmarks usually score downstream question answering or report generation, leaving document ranking under iterative evidence acquisition underexplored. We introduce VisDocAgentBench, a closed-corpus benchmark comparing static and agentic retrieval under a shared ranked-output contract. It contains 2,375 pages from 100 documents and 120 unique-target queries balanced across direct, one-bridge, and two-bridge evidence structures. Relation-preserving construction yields semantic, relational, and visual queries, followed by full-document review and hard-negative validation. A strong late-interaction visual retriever reaches 97.50% Recall@1 on direct items but 2.50% on two-bridge items, exposing the limits of query–target matching when relevance depends on corpus context. Agents recover much of this loss, but planner choice and retrieval representation remain decisive. Every planner performs better with visual retrieval, whose best R@1 reaches 67.50% versus 37.50% for OCR-text. Ablations identify iterative search and page inspection as consequential capabilities, and providing the complete support context improves ranking on both routes. Trace analysis localizes the remaining losses to target discovery, candidate examination, and evidence-role integration. These findings motivate retrieval agents that combine modality-preserving discovery with evidence-directed verification.
Read the full abstract
Computer Vision
CFB-GBM v2.0: An Augmented Longitudinal Dataset for Multi-Modal Glioblastoma Segmentation, Radiomics, and RANO Progression Tracking
Glioblastoma (GBM) is the most aggressive primary brain tumor in adults, with a median overall survival of 15 months. Longitudinal, multi-modal imaging datasets with comprehensive clinical and treatment data are essential to support the development of reproducible computational methods for treatment response prediction, disease progression modelling, and personalized medicine. We present CFB-GBM v2.0, an extension of our previously released CFB-GBM dataset comprising 264 GBM patients treated according to the standard Stupp protocol. The primary contribution of this release is the completion of Gross Tumour Volume (GTV) delineations across all available timepoints ($t_0$, $t_1$ and $t_2$), increasing the overall GTV completion rate from 35% to 97%. This was achieved using a nnU-Net model pre-trained on BraTS 2021 and fine-tuned on CFB-GBM ground-truth contours, with the generated segmentations validated by five radiation oncologists. From these longitudinal GTV annotations, volumetric RANO 2.0 response category labels were derived for all available temporality pairs ($t_0 \rightarrow t_1$, $t_0 \rightarrow t_2$ and $t_1 \rightarrow t_2$). To further ease dataset usability and reproducibility, brain masks computed with HD-BET and pre-computed radiomic features extracted with PyRadiomics are provided for each patient timepoint and MRI modality. Additionally, the WHO classification guideline (2016 vs. 2021) applicable to each patient's diagnosis is now explicitly documented. CFB-GBM v2.0 is publicly available on The Cancer Imaging Archive (TCIA) at https://www.cancerimagingarchive.net/collection/cfb-gbm .
Read the full abstract
Computer Vision
Improving Complex Moiré Removal with Generative Supervision
The availability of high-quality paired data is essential for training learning-based image demoiréing models. However, it remains challenging for existing datasets to encompass the complex moiré patterns captured in uncontrolled real-world scenarios. Such degradations typically manifest as large-scale, multicolored moiré patterns. Moreover, these patterns frequently occur in images for which clean counterparts are difficult to obtain, such as photographs acquired from public displays or existing online resources. In this work, we propose a novel data engine designed to improve the removal of complex moiré patterns by generating training supervision. Specifically, we initially collect real-world images containing complex moiré patterns and localize the corresponding screen regions. Multiple image-conditioned generative foundation models are subsequently deployed to produce candidate references. To establish reliable supervision, these candidates are subjected to patch-level quality control to filter and select the optimal results. Based on this systematic paradigm, we construct the WildMoiré dataset, which contains 6.8K moiré-GT training pairs. For evaluation, we additionally build an independent test set comprising $\sim$250 pairs with captured clean ground truth. Extensive experiments on ESDNet, SDXL, and Qwen-Image-Edit demonstrate that the proposed generative supervision consistently improves the performance of complex moiré removal.
Read the full abstract
Robotics
ControlledShifts: Towards Standardizing Robustness Evaluation in Trajectory Prediction Under Distribution Shifts
Trajectory prediction is central to safety in autonomous driving, yet learning-based predictors tend to degrade sharply when encountering scenarios poorly represented by their training data. Many methods attempt to mitigate distribution shift degradation through data-centric or test-time adaptation approaches; however, they are typically validated along fragmented axes of generalization, leaving the field without a standardized way to compare robustness across shifts a model may encounter. To address this, we introduce ControlledShifts, a framework and benchmark suite that systematically re-splits existing trajectory datasets into in-distribution (seen) and out-of-distribution (unseen) partitions, via a shared characterization-and-splitting formulation, in which a characterization function fixes the axis of variation a benchmark probes and a splitting function fixes how the tail of that axis is withheld. The suite comprises three benchmarks targeting key topological and behavioral distribution shifts. Furthermore, to aggregate multi-dimensional performance metrics across these benchmarks, we propose a unified robustness score that evaluates models along two complementary dimensions: prediction quality (relative performance gain) and prediction stability (performance preservation under shift). We showcase ControlledShifts by benchmarking prominent transformer-based architectures, exposing critical differences in how models of varying capacities handle latent relevance and environmental structure.
Read the full abstract
Logic in Computer Science
A Kernel-Checked Exclusion Certificate for Erdős Problem 647
Erdős problem 647 asks whether any $n > 24$ satisfies $\max_{m<n}(m + \tau(m)) \le n + 2$, where $\tau$ is the divisor-count function. Computational searches have excluded solutions up to $10^{12}$ by direct sieve and up to roughly $9.17 \times 10^{18}$ within a modular reduction whose Lean component relies on native_decide; those computations sit outside any proof kernel. We give the first exclusion checked end to end by one: no solution exists with $24 < n \le 10^9$, proved in Lean 4 with axiom closure exactly {propext, Classical.choice, Quot.sound} – no sorry, no native_decide, no problem-specific axiom. The proof replays a chain of 6,685,922 factorization witnesses whose excluded intervals concatenate across $(24, 10^9]$; it needs no primality facts beyond primes below 1024, and it is the finite, fully proved form of a domination-interval argument whose asymptotic step was the identified gap in a withdrawn January 2026 claim on this problem. The generation pipeline is cross-checked by two further independent implementations, the compiled development replays through the standalone lean4checker, and two from-source verification legs – Lean toolchains compiled from source by gcc and by clang, mathlib rebuilt with no cache – reproduce the committed certificates byte for byte, with olean digests identical across three builds on two architectures. Our range is three to ten orders of magnitude below the computational frontiers we cite; the contribution is the trust base, not the range.
Read the full abstract
Robotics
Jetson-ORB-SLAM3: Accuracy-Preserving GPU Implementation for Edge Computing Devices
Visual-inertial SLAM on low-power edge platforms is constrained by the cost of dense feature extraction and loop closure. Prior GPU ports of ORB-SLAM trade accuracy for speed by approximating the ORB detector, altering the feature set and therefore the estimated trajectory. We present an accuracy-preserving GPU implementation of ORB-SLAM3 for the NVIDIA Jetson Orin Nano, whose GPU ORB front end reproduces the reference CPU detector algorithmically to 94.7% exact keypoint agreement and 99.9% descriptor bit agreement. This work also makes CNN-based loop closure edge-viable through native TensorRT. The visual front end (feature extraction) is offloaded to the GPU while the mapping and optimization back end is kept on the CPU, matching each computation to the hardware it suits. The accuracy is verified by comparing four configurations: the GPU pipeline and the unmodified CPU reference, each run on both the Jetson Orin Nano and a desktop. On EuRoC dataset, all four agree to within 0.10cm in mean absolute trajectory error (SE(3)), so neither the GPU port nor the change of hardware shifts the estimated trajectory. The GPU-versus-CPU comparison is reproducible on TUM-VI and KITTI datasets, so the acceleration is accuracy-preserving rather than approximate. The proposed implementation is competitive with published ORB-SLAM3 on EuRoC, attains sub-centimeter accuracy on five of the six TUM-VI room sequences, and reaches sub-1% relative translation error on nine of eleven KITTI sequences. For loop closure, the generic ONNX-Runtime CUDA/TensorRT execution providers are unusable with our CosPlace ResNet-50 on the embedded platform, whereas a native libnvinfer FP16 engine reduces per-query inference to 2.2ms, a 180x speedup. Learned place recognition therefore runs concurrently with tracking on a 7W device. In monocular-inertial mode the system sustains 32FPS mean over the eleven EuRoC sequences.
Read the full abstract
Numerical Analysis
A Discrete-to-Continuum Variational Theory for Area-Preserving Surface Parameterization
We establish a discrete-to-continuum variational theory for area-preserving parameterization of surfaces based on the stretch energy. For orientation-preserving diffeomorphisms between compact, connected, oriented Riemannian surfaces of equal total area, we prove that area-preserving maps are precisely the critical points of the stretch energy under boundary-fixing variations. We then establish discrete-to-continuum convergence of the optimal energy values: within a uniformly geometrically controlled admissible class, the discrete infimum converges to the smooth minimum with second-order accuracy, while discrete almost minimizers have first-order decay of their $L^2$ area distortion. Thus, the discrete problem not only approximates the smooth stretch energy but also recovers area preservation in the refinement limit. We further derive the $L^2$-gradient flow of the stretch energy and its simplicial counterpart, whose projected quasi-implicit iteration is shown to be globally convergent. The resulting method applies to open and closed surfaces of several topological types, and numerical experiments on benchmark surfaces illustrate its improvement over existing methods.
Read the full abstract
Computer Vision
DistillPath: An Efficient 22M Distilled Pathology Encoder Approaching Large Foundation Model Performance
Many high-performing pathology tile encoders are now foundation models with hundreds of millions to over a billion parameters. Encoding and storing the thousands of tiles in each whole-slide image with such models is costly on commodity hardware, so compact encoders that retain useful downstream performance are a valuable alternative. We present DistillPath-KS16, which starts from the existing 22M kaiko ViT-S/16 encoder and improves it by distilling from released pathology encoders used as frozen teachers. The recipe reads only the teachers' final class and patch tokens and trains on 6,000 public slides, needing neither their DINO nor iBOT pretraining heads nor a billion-tile corpus, so it applies to any released encoder that exposes backbone tokens. We distill four teachers spanning 86M to 1.1B parameters into the same student. Every variant improves the kaiko baseline on all three benchmarks we use, EVA, HEST, and PLISM, and the strongest teacher is task-dependent. On the seven-task EVA mean, DistillPath-KS16-Virchow2 reaches $0.795$, within $0.015$ points of Virchow2, the top-scoring model in our evaluation, at about $29\times$ fewer parameters; it also scores above H0-mini and GPFM on this aggregate metric, though that advantage is task-concentrated rather than uniform. Because it remains a 22M ViT-S/16 with 384-dimensional features, DistillPath-KS16 runs more than $25\times$ faster than Virchow2. Code is available at https://github.com/RamonKaspar/DistillPath, and released model weights are available at https://huggingface.co/collections/RamonK/distillpath.
Read the full abstract
Computation and Language
BayesPrompt: human readable prompts that make sense
Reconstructing prompts that can elicit a desired answer or behaviour in an LLM is an open and important research topic. Optimisation methods which aim at minimising the perplexity of a given answer, however, consistently yield so-called pseudoprompts, unintelligible strings of tokens which can lack human interpretability. We argue that this is a consequence of the ill-posedness of the prompt optimisation task. By reframing the task as a Bayesian posterior inference over prompts, we propose an efficient algorithm to sample prompts which are both efficient (in terms of perplexity) and human readable. We compare our approach with state of the art alternatives showing on a real data set a marked improvement over a range of metrics.
Read the full abstract
Hardware Architecture
ESR-HGNN: Eliminating Semantic Redundancy for Efficient Mini-batch HGNN Inference
Heterogeneous graph neural networks (HGNNs) are highly effective in processing heterogeneous graph data and have been widely adopted in critical domains. As real-world graph data continues to scale, performing direct inference on entire graphs becomes increasingly infeasible, making mini-batch methods the standard approach. However, in end-to-end HGNN inference, metapath-based mini-batch sampling constitutes a significant performance bottleneck due to the extensive random memory accesses induced by the irregular traversal of graph structures. Existing sampling paradigms suffer from excessive redundant traversals caused by inherent semantic redundancy, severely degrading sampling efficiency and, consequently, leading to suboptimal mini-batch inference performance. In this work, we propose a redundancy-aware HGNN sampling paradigm that leverages a metapath trie to reuse traversal paths, effectively eliminating redundant memory accesses. We then map it onto a multi-channel hardware sampling unit denominated ESR-HGNN. Furthermore, we introduce a reusability-driven metapath grouping technique that optimally clusters metapaths to maximize reusable traversal paths within hardware channels, enhancing efficiency in scenarios with semantic parallelism. Extensive experimental results demonstrate that ESR-HGNN achieves an average sampling performance improvement of one order of magnitude over CPU and GPU, accompanied by significant energy savings. Additionally, it delivers substantial speedup in end-to-end mini-batch inference when integrated with GPU and state-of-the-art HGNN inference accelerator.
Read the full abstract
Game Theory
An improved bound for the randomized metric distortion problem
We propose a randomized social choice rule called Mixed Integrated Veto (MIV) with metric distortion of $5/2$, improving the previous best upper bound of $2.75271$. MIV is the equal mixture of Maximal Lotteries and Integrated Veto, a new rule built on the Simultaneous Veto process of Kizilkaya and Kempe. Rather than returning the candidate surviving longest, Integrated Veto assigns each candidate probability proportional to its average score over the whole process.
Read the full abstract
Logic in Computer Science · Cross-listed from math.LO
Idealizing Useful Fictions in Omega Grounded Arithmetic
Grounded arithmetic is a family of formal systems for reasoning about computation in which a statement may be asserted only when a terminating computation backs it; the logics are paracomplete - for a sentence whose backing computation never settles, neither the sentence nor its negation is derivable, so paradoxes like the Liar are harmless rather than explosive. The reflective member of the family, RGA, can quantify over its own computations, but cannot certify that its own unbounded searches have definite yes-or-no answers. This paper studies what happens when that openness is closed by exactly one rule - ATI, the $\omega$-grounded universal: if every numeric instance of a universal sentence is certified decided, the universal is certified decided. The resulting system, OGA, shares RGA's syntax and rules symbol-for-symbol otherwise, and every consequence is developed as a machine-checked theorem. Decidedness certificates become abundant - every totality question about a computable function is certified to have an answer, whether or not anyone can produce it - and this is exactly the provable separation between the two systems. OGA is complete for its own semantics; certified-but-unresolved sentences receive values built from the system's own open questions. Provability remains recursively enumerable, with a primitive-recursive certificate checker, while $\omega$-truth deliberately is not. Within that asymmetry, incompleteness takes a new form. The Gödel sentence is classified, unconditionally, as a genuine fiction: neither provable nor refutable, yet valued, and carrying a computable pedigree recording exactly what adopting it as an axiom commits one to. The adoption is itself a theorem suite: extending OGA by any finite stock of true fictions is consistent, and independently certified adoptions can never collide.
Read the full abstract
Numerical Analysis
Efficient computation of eddy-currents for nonlinear magnetic field problems
Estimation of eddy-current losses in conducting non-laminated components of electrical devices requires expensive three-dimensional simulations. Various approximations are therefore used in practice to reduce the computational cost in the early design phase. We review some approaches and discuss their modelling assumptions and resulting approximations. In particular, we identify eddy-current reaction fields as a significant contribution that should be accounted for globally. These reaction fields can be approximately reconstructed from two-dimensional magnetostatic simulations by solving a single linearized time-periodic problem. We further discuss different strategies for solving this post-processing problem. Numerical results demonstrate improved loss prediction compared to standard post-processing at moderate additional cost.
Read the full abstract
Artificial Intelligence
ARASH: Adaptive Retrieval And Shot Selection for Tabular Prediction
Tabular prediction is a critical task across numerous applications. The recent success of large language models has sparked various approaches for adapting them to the tabular domain. A prevalent strategy involves training or fine-tuning specialized Tabular Foundation Models (TFMs) such as TabPFN. However, TFMs require substantial computational resources, and frequent model retraining is often impractical. In-context learning (ICL), specifically, few-shot prompting, offers a resource-efficient alternative to enhance performance. Yet, identifying the most relevant rows to serve as shots remains a challenge for tabular data. This paper introduces ARASH (Adaptive, query-specific Retrieval And Shot selection), a method that improves TFM efficiency by selecting optimal shots based on local neighborhood analysis within the training set. Our results demonstrate that ARASH reduces the prompt length and memory usage of TabPFN by 1261.5$\times$ and 2.56$\times$, respectively, while providing comparable accuracy.
Read the full abstract
Databases
Rerootable Hypertree Decompositions
Hypertree decompositions are a cornerstone in the theory of answering conjunctive queries efficiently. However, they are not yet widely adopted in practice. Problems related to, e.g., the uniqueness of decompositions and succinct representations of all decompositions have so far mostly been neglected by the theory literature. In this paper, we present the first in-depth discussion of rerootability in hypertree decompositions—a property which we argue is essential for such problems. Rerootability leads us to projection-freeness, and we have to discuss normal form to recover tractability. Normal form, however, again obstructs rerootability, and for this reason, we define a relaxed notion of normal form which leads to a truly rerootable and tractable class. Experimental evidence suggests that the price we pay in terms of width increase for transitioning to this class of decompositions is moderate in practice.
Read the full abstract
Sound
UniVerse: Benchmarking and Enhancing LALMs on Culturally Inclusive Low-Resource Music Understanding
Recent advances in large audio-language models (LALMs) have significantly improved performance in tasks such as music captioning, genre classification, and sound event detection. However, limited attention has been paid to improving their adaptability across diverse musical traditions, particularly folk music rooted in distinct cultural contexts. Folk-music traditions are typically resource-scarce, unevenly represented across regions, and poorly documented. Even when such samples appear in large-scale pre-training, LALMs often fail to capture their structural and stylistic characteristics, partly due to the absence of dedicated evaluation protocols and training solutions. To address these limitations, we introduce UniVerse, a reproducible solution for low-resource music understanding. Specifically, we propose UniVerseBench, a benchmark of 5,042 Q&A pairs across more than 38 cultural and linguistic entities, constructed via an expert-guided yet highly automated pipeline. In parallel, we construct a fully automated, model-generated multi-turn dialogue training dataset UniVerseSet. By training LALMs on UniVerseSet, we systematically adapt and investigate representative multimodal imbalance learning strategies across both dense and Mixture-of-Experts (MoE) architectures. Experimental results indicate that fully automated data curation combined with imbalance-aware training yields non-trivial improvements, but models still struggle to capture fine-grained acoustic features, indicating a gap between surface-level alignment and deep musical comprehension.