Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 6 September
Motivated by the growing importance of fairness in machine learning, fair $k$-center clustering has attracted considerable research attention as a fundamental problem. In this problem, a dataset is partitioned into $m$ disjoint groups, and the objective is to select $k$ data points as centers, subject to upper bounds on the number of centers chosen from each group, aiming to minimize the maximum distance between any data point and its assigned center. Focusing on Euclidean spaces, which are ubiquitous in machine learning applications, we first develop a parameterized approximation algorithm for Euclidean fair $k$-center with an approximation ratio of $2.732$. By incorporating this algorithm as a post-processing stage into a one-pass streaming framework for large-scale data, we obtain an approximation ratio of $4.464$. These ratios can be further respectively improved to $2.414$ and $3.828$ with a runtime exponential on $k$. To ensure polynomial-time complexity, we further design a one-pass streaming algorithm with an approximation ratio of $4.732$, which can be further improved to $4.42$, outperforming the state-of-the-art ratio. Finally, extensive experiments show that our methods significantly outperform state-of-the-art approaches in terms of clustering accuracy.
Software Engineering
From Reading Code to Reading Spec: A Verified Layer for LLM-Driven Codebase Maintenance
The rapid growth of LLM-generated code increases software complexity and the maintenance burden on engineers. While LLMs offer a potential automated alternative, this structural complexity hinders their ability to manage codebases directly. We introduce the Provable Representation Of Original Functionality (PROOF), which manages codebases indirectly via structured specifications. To enable full-lifecycle codebase management strictly through these specifications, PROOF abstracts codebase topology into a hierarchical natural-language representation. To establish absolute trust, the system proves semantic equivalence by reconstructing source code exclusively from this specification. This verified foundation drives maintenance requests, executing code modifications while synchronously updating itself to prevent semantic drift. Experiments on real-world repositories confirm the effectiveness of these specifications.
Read the full abstract
Machine Learning (Statistics)
Recovering Weak Signals with Normalizing Flows
In many scientific disciplines, weak signals of interest are obscured by dominant nuisance signals that are several orders of magnitude stronger. Recovering these weak signals requires subtracting the dominant ones; however, this calibration process inherently distorts or partially suppresses the underlying signal of interest. To address this problem, we propose the use of normalizing flow models to reconstruct calibration-affected weak signals. By leveraging the statistical invariance of the target signals and assuming minimal initial suppression, our framework effectively recovers the lost signal components. We provide a comprehensive theoretical overview of this normalizing flow-based recovery method and demonstrate its efficacy using simulated data.
Read the full abstract
Computation and Language
Cross-Lingual Representation Alignment by Token-Level Optimal Transport in a Language-Agnostic Space
Cross-lingual alignment (CLA) aims to align the representations of large language models (LLMs) across languages, enabling cross-lingual transfer to improve multilingual capabilities. Previous CLA methods often ignore language-specific information encoded in representations and only consider sentence-level alignment, which may lead to suboptimal performance and input-output language mismatch. We propose CAROT (Cross-Lingual Alignment of Representations in a Language-Agnostic Space via Optimal Transport), which consists of two steps: identifying language-specific representations in LLMs' internal states and aligning language-agnostic representations across languages at the token level by optimal transport, while explicitly preserving language-specific representations. Inference-time steering experiments show that the representations computed by CAROT are effective alignment targets, improving multilingual performance by up to 11.2 points in accuracy while maintaining input-output language consistency. We further use the representations obtained by CAROT as training targets, internalizing the aligned representations. The trained models outperform existing CLA methods in 11 of 18 evaluation settings (3 models $\times$ 3 tasks $\times$ ID/OOD languages). Our work provides insights into what constitutes effective alignment targets for CLA in LLMs. Code is available at https://github.com/ynklab/CAROT
Read the full abstract
Computer Vision
An Integrated Video-AI Platform for Action-Level Microanastomosis Training and Performance Feedback
Developing microanastomosis skill requires repeated practice with timely, action-specific feedback, yet expert review of lengthy microscope videos does not scale to frequent or distributed training. We present an integrated video-AI platform that turns a complete simulated procedure into inspectable, interactive feedback through three connected modules. First, a proposed transformer segments the video into six surgical actions. Second, object detection and tracking localize instrument tips within each action; the resulting kinematic features and action statistics drive supervised classification of five NOMAT-aligned performance dimensions. Third, a grounded large language model (LLM) uses these structured outputs to answer user questions about the current scene, actions, motion, and predicted performance through a unified interface. In a two-site study, 17 participants completed 72 procedures comprising 576 suture placements. The action-segmentation module achieved 87.66% accuracy and 82.86% F1, increasing to 93.62% and 88.32% after workflow-aware refinement. The five performance classifiers achieved 76.0% mean accuracy, with Cohen's $\kappa$ from 0.63 to 0.93. Although the language interface and educational benefit require prospective evaluation, these results establish the technical basis for an expert-supervised platform that can shorten review, expose the evidence behind performance estimates, and support scalable formative microsurgical training.
Read the full abstract
Statistical Methodology
Robust and Sparse Group Dynamic Causal Modeling via Student-t Parametric Empirical Bayes and Nonlocal Priors
Dynamic causal modeling (DCM) estimates directed effective connectivity, while parametric empirical Bayes (PEB) supports group inference using subject-specific posterior summaries. Standard PEB relies on Gaussian models and continuous shrinkage, making it sensitive to atypical estimates and unable to distinguish negligible from nonzero effects. We develop a robust and sparse group-DCM extension combining a Student-$t$ likelihood with a spike-and-slab prior using a nonlocal product-moment (pMOM) slab. A normal–gamma representation of the Student-$t$ distribution yields weights that downweight atypical {whitened residual coordinates}. The pMOM slab vanishes at zero, sharpening coefficient selection and yielding inclusion probabilities. {We propagate first-level posterior uncertainty through block-covariance pre-whitening and use a multistart generalized expectation–maximization (EM) algorithm with conditional maximization for mode fitting, followed by parallel-tempering posterior integration for inclusion probabilities. A simulation study showed that Student-$t$ weighting supplied the main protection against contamination, while spike-and-slab regularization reduced fixed-threshold false selections. In an openly shared mixed-gambles fMRI application, we found mild heterogeneity, concentrated inclusion support on departures of all four diagonal self-inhibition scaling parameters from the SPM default, and close directional agreement with standard PEB implemented in Statistical Parametric Mapping.} Our framework therefore adds interpretable {whitened-coordinate} robustness diagnostics and sparse coefficient selection to hierarchical DCM while retaining first-level uncertainty.
Read the full abstract
Combinatorics
Multicolor Ramsey and list Ramsey numbers for star-like trees
For a graph \(H\), the \(k\)-color Ramsey number \(r(H;k)\) is the least integer \(N\) such that every \(k\)-edge-coloring of \(K_N\) contains a monochromatic copy of \(H\). A \(k\)-list assignment has \(|L(e)|=k\) for every edge. The list Ramsey number \(r_\ell(H;k)\) is the least integer \(N\) for which there exists a \(k\)-list assignment on \(E(K_N)\) such that every coloring from the lists contains a monochromatic copy of \(H\). Let \(K_{1,n}\) be a star, \(S(n,m)\) the double star obtained by joining the centers of \(K_{1,n}\) and \(K_{1,m}\), and \(S_n^m\) the graph obtained from \(K_{1,n}\) by subdividing \(m\) edges once. Alon et al.\ conjectured that \(r_\ell(K_{1,n};k)=r(K_{1,n};k)\) for all \(k,n\ge1\). In this paper, we confirm their conjecture for all \(k\ge1\) and \(n\ge3\) by a unified direct proof. For even \(k\ge4\) and under explicit parameter conditions, we prove that \(r(S(n,m);k)=kn+m+2\) for even \(n\) and \(r(S_n^m;k)=k(n-1)+m+2\) for odd \(n\). For two colors, we establish a general list Ramsey lower bound and determine the common values of Ramsey and list Ramsey numbers for double and subdivided stars in explicit parameter ranges. These results close several gaps in the known bounds.
Read the full abstract
High Energy Physics (Phenomenology)
Nodal filtering in open-charm decays of the $\psi(4040)$–$\psi(4160)$ system
Hadronic decay channels can provide direct information on the momentum-space structure of confined quark systems. We investigate this possibility in the $\psi(4040)$–$\psi(4160)$ system using an instantaneous Bethe–Salpeter (BS) framework combined with a relativistic $^3P_0$ decay model. The BS solutions yield nearby bare $3\,^3S_1$ and $2\,^3D_1$ states at 4051 and 4110 MeV, respectively, whose opposite displacements from the physical vector states motivate an effective two-state level-repulsion description. By comparing the matched open-charm channels $D\bar D$, $D\bar D^*+{\rm c.c.}$, $D_s\bar D_s$, and $D_s\bar D_s^*+{\rm c.c.}$ with the same leading $P$-wave threshold behavior, we show that channel-dependent overlap kernels act as momentum-space nodal filters. At $M=4146$ MeV, the $PV/PP$ width ratio is 0.253 in the nonstrange sector but 1.63 in the strange sector, reversing the ordering expected from phase space alone. The momentum-resolved amplitudes reveal that different channels weight opposite sides of the same $2D$ nodal region differently, leading to distinct cancellation patterns and a common recoil condition, $P_f\simeq0.775$ GeV, for charge-resolved $D\bar D^*$ amplitude zeros. These results establish open-charm decays as a probe of momentum-space wave-function structures in heavy quarkonium.
Read the full abstract
Signal Processing
Sparse Channel Acquisition in Aging Fluid Antenna Systems: A Reliability-Calibrated Posterior Reconstruction Approach
Fluid antenna systems (FASs) exploit port-domain diversity within a compact aperture, but their gain can be lost if the receiver has to scan too many ports before data transmission. This paper studies sparse channel acquisition for aging FAS receivers, where the available information has mixed reliability: current observations are fresh but sparse, whereas historical channel state information (CSI) is dense but stale due to Doppler-induced temporal decorrelation. We formulate the problem from a communication perspective by linking aperture-field reconstruction to port-selection rate, outage, probing budget, and online inference latency. We then cast the acquisition task as reliability-calibrated posterior reconstruction, in which the sparse current observations serve as hard measurement evidence and historical CSI is reused only as soft temporal side information. The resulting reliability-controlled conditional diffusion posterior (DCP) framework conditions the denoising process on the sparse current observations, the observation mask, and the historical CSI, and refines the reverse trajectory through observation consistency, mismatch-aware temporal gating, spatial trust weighting, progressive temporal activation, and warm initialization. Analysis shows how aging and reconstruction error induce rate distortion and rate regret. Simulations across probing budgets, signal-to-noise ratios (SNRs), temporal correlations, observation patterns, ablation settings, and latency tests show consistent reconstruction gains with millisecond-level online inference latency, indicating that stale CSI can be beneficial when its strength, timing, and spatial support are explicitly controlled.
Read the full abstract
Signal Processing
Reconfiguring Sparse Apertures: Partial-Mobility Planar FAS for 2-D DOA Estimation
Classical sparse arrays enlarge the sensing aperture under limited element and radio-frequency (RF) chain budgets, but their fixed geometries impose a persistent tradeoff between wide-sector identifiability and local angular resolution. This paper converts this static design into a two-state reconfigurable sparse aperture by allowing only part of a planar fluid antenna system (FAS) to move after an initial observation. A compact, Nyquist-spaced seed first provides an ambiguity-controlled acquisition geometry. The remaining fluid ports then move or switch to information-efficient refinement positions, and the measurements collected before and after reconfiguration are jointly processed. We formulate the receiver under fixed total numbers of ports and RF chains, a movement budget, and a common total-snapshot budget. A policy-level Fisher information matrix (FIM) identity accounts for the observation-dependent refinement geometry. For a single source, a relaxed planar D-optimal analysis gives the corner-favoring aperture law, while a finite-port certificate bounds the information retained under spacing, reachability, and partial-actuation constraints. For multiple sources, an aperture-and-conditioning surrogate generates feasible sparse layouts that are ranked and locally refined using the exact frame FIM with coarray, spacing, and movement regularization. Seed multiple signal classification (MUSIC) identifies a reliable angular basin, followed by joint concentrated-likelihood refinement over both states. Equal-budget simulations show that reconfiguring a sparse aperture converts available area and movement into lower angular error and retains much of the all-movable gain with fewer actuated ports. They also identify the operating boundary: if a full sparse aperture can remain permanently deployed, avoiding movement and snapshot splitting can be preferable.
Read the full abstract
High Energy Astrophysical Phenomena
Detectability of bulk viscosity effects on post-merger gravitational wave signals from binary neutron star mergers
We investigate bulk viscosity (BV) effects on post-merger gravitational wave (PMGW) signals from binary neutron star (BNS) mergers and their detectability using realistic equation of state (EoS) posteriors constrained by recent progress in gravitational-wave (GW) and X-ray observations, as well as neutron skin thickness measurements. A linear fitting formula based on recent BNS simulations with BV is used to estimate the peak frequency shift of the PMGWs caused by BV effects. Subsequently, we evaluate this peak frequency shift for our set of EoS posterior samples. We use the Fisher information matrix and the dataset of simulated observable events from the ET and CE detector network in an optimistic scenario to estimate the measurement accuracy of the peak frequency. We find that BV effects on PMGWs may be detectable only for EoS models with large values of the symmetry energy slope ($L_{\rm sym}$), as favored by neutron-skin thickness measurements. Thus, the detection of BV effects on PMGWs itself can provide abundant information about the symmetry energy and its slope. However, BV effects on PMGWs are generally weak and may be observed only in some extreme and optimistic cases. Therefore, observations of PMGWs and their analyses may not be able to provide very accurate measurements of the symmetry energy through BV effects.
Read the full abstract
Computer Vision
Multi-Grid Post-Training for Long-Form Multi-Shot Video Generation
Generating long-form multi-shot videos requires coherent within-shot motion and visually consistent narratives across shots. Existing video generators favor continuous motion and struggle to present complete shot sets when an entire narrative is packed along one temporal axis. We propose MovieGrid, a Multi-Grid Post-Training paradigm that decomposes a long video into shorter, temporally ordered chunks and arranges them on a spatial grid for joint modeling. This design reduces the number of shots handled by each temporal axis while enabling global information exchange across chunks. We construct the Multi-Grid Long Video (MGLV) dataset from 1,000 long-form videos using source video collection, hierarchical segmentation, grid video construction, and character-aware story annotation, producing 54K grid videos paired with story prompts. Our Noise-Free Random-Grid Training retains a random subset of chunks as clean visual context for denoising the remaining chunks. Grid Embedding encodes grid structure, character-aware Story Prompts link recurring entities, and Grid Boundary Loss stabilizes layouts. Under the same token budget, MovieGrid generates 6.05 times more shots than Temporal Packing in a 1,616-frame video. On a benchmark spanning five real-world categories, it achieves state-of-the-art intra-shot consistency (0.9131 versus 0.8086 for HoloCine) and inter-shot consistency (0.5914 versus 0.5384 for StoryMem). MovieGrid can further scale video length with minimal compromise through single or multiple generations.
Read the full abstract
Information Theory
Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation
Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any $h\geq2$ node erasures in a cooperative way, while retaining the minimum storage as an $[n,k]$ MDS code. Each code coordinate (node) is assumed to store an array of $\ell$ symbols, where $\ell$ is termed as sub-packetization. To address the disk IO (input/output) capability, a cooperative MSR code is said to have optimal-access property, if during node repair, the amount of data accessed at each helper node meets a lower bound on this quantity. In this paper, we focus on reducing the sub-packetization level of optimal-access cooperative MSR codes. We propose new constructions of optimal-access cooperative MSR codes through two methods. At first, we propose a direct explicit construction by designing its parity-check matrix. Such parity-check matrix is built by repeatedly employing two crucial parity-check matrices as building blocks. Secondly, we propose a generic transformation framework. Starting from an arbitrary $[n+d-k,d]$ MDS scalar code, one can derive a final cooperative MSR code by systematically applying two basic transformations. Both approaches yield $(n,k,\ell=\delta^m)$ optimal-access cooperative MSR codes with $\delta=d-k+h$ and $m=\binom{n}{h}-\lfloor\frac{n}{\delta}\rfloor(\binom{\delta}{h}-1)$. Compared with the state of the art (with $\ell=\delta^{\binom{n}{h}}$), the derived codes can reduce the sub-packetization $\ell$ by a fraction of $1/\delta^{\lfloor\frac{n}{\delta}\rfloor(\binom{\delta}{h}-1)}$, where $\delta=d-k+h$. Moreover, we also show that some previous code structures of optimal-access cooperative MSR codes and optimal-access MSR codes with $h=1$ are included as special cases of our transformation construction. At last, we note that all of the constructions are built over a finite field of linear size $\geq n+d-k$.
Read the full abstract
Computational Complexity
Exponential Sampling Lower Bounds for Polynomial Sources
A degree-$d$ polynomial source is the output of a polynomial map of degree at most $d$ over $\mathbb{F}_2$ on arbitrarily many uniform random bits. Khodabandeh and Shinkar (FOCS '26) proved that $\mathrm{Ber}(1/3)^{\otimes N}$ has statistical distance $1-o(1)$ from every constant-degree polynomial source and conjectured exponentially small overlap. Independently of Khodabandeh and Shinkar, Byramji, Kane, Morris, and Ostuni (RANDOM '26) asked for an explicit target distribution at distance $1-\exp(-N^{\Omega_d(1)})$. We resolve both questions. For every fixed $d\geq1$, every degree-$d$ polynomial source has overlap at most $\exp(-c_dN)$ with $\mathrm{Ber}(1/3)^{\otimes N}$, where $c_d>0$ is independent of the seed length. For quadratics, $c_2=2^{-26}$ suffices. We amplify Khodabandeh and Shinkar's uniform separation of acceptance probabilities from non-dyadic parameters (numbers not of the form $a/2^b$ for integers $a$ and $b\geq0$). The result extends to other non-dyadic Bernoulli parameters and to coordinates that are Boolean functions of boundedly many bounded-degree polynomials. We also give a uniform deterministic hierarchy between adjacent degrees. Appending the outputs of disjoint AND gates on $d+1$ inputs to uniform seed bits yields flat degree-$(d+1)$ target distributions of entropy $k$ with overlap $\exp(-\Omega_d(\min\{k,N-k\}))$ against every degree-$d$ source, for $\min\{k,N-k\}\geq2(d+1)$. This entropy dependence is optimal up to constants in the exponent among flat target distributions for fixed $d$. The construction has locality $d+1$ and uses $O(N)$ field operations to sample. At $k=\lfloor N/2\rfloor$, it handles $d\leq(1-\varepsilon)\log_2N/3$ with overlap $\exp(-N^{\varepsilon-o(1)})$ for fixed $0<\varepsilon<1$. The proof combines monotonicity of Gowers uniformity norms, pairwise independence of points in a random affine cube, and relative entropy.
Read the full abstract
Computer Vision
DualPathOcc: Dual-Resolution BEV Encoder for 3D Occupancy Prediction
Predicting 3D occupancy from multi-view images requires preserving geometric detail during 2D-to-3D lifting while reasoning over sparse, volumetric scene representations. We present DualPathOcc, a camera-based framework that combines a Spatial Enhancer for high-resolution feature aggregation before BEV compression, a SENet-augmented dual-path BEV encoder for local-global context modeling, and height-aware weighted cross-entropy for near-ground occupancy. The final model is optimized with occupancy supervision and no explicit depth loss. On single-frame Occ3D-nuScenes, DualPathOcc achieves 37.37 mIoU. We further analyze how surface-centered depth targets interact with volumetric occupancy learning.
Read the full abstract
High Energy Astrophysical Phenomena
Constraining the Equation of State of Neutron Stars with third-generation Gravitational Wave detectors
We investigated the impact of the number of binary neutron star merger events and neutron star (NS) mass distributions on constraining the equation of state (EoS), tidal deformability and radius of NSs, as well as the nuclear parameters, using binary neutron star inspiral gravitational wave signals with third-generation detectors. We generate simulated gravitational wave signals and compute the Fisher information matrix for each event after the number of events and mass distribution models are given. The covariance of EoS parameters is obtained by holding the non-EoS waveform parameters fixed at their injected values and accumulating the Fisher matrix over all events. Finally, the posterior samples of EoS, tidal deformability, radius and nuclear parameters are generated based on this covariance matrix. We find that larger number of events lead to tighter constraints due to more observed events and data accumulation, as expected given the increased number of detections. Meanwhile, we note that the mass distribution plays a more important role in constraining the EoS. We compare a realistic bimodal Gaussian distribution, a uniform distribution and another uniform including sub-solar mass NSs. The results show that the uniform distribution yields tighter constraints than bimodal models because it includes more low-mass and massive NSs. This also implies that events near $1.4\,\Msun$ provide partly redundant information about the EoS. Additionally, including sub-solar mass NSs can further improve the constraints by significantly reducing the EoS uncertainties at sub-saturation densities and inner-crust, highlighting the importance of sub-saturation density EoS.
Read the full abstract
Robotics
LANTERN: A Closed-Loop Benchmark for VLM-Based Cooperative Driving with Temporally Grounded Warnings
We present LANTERN, a closed-loop benchmark for temporally grounded cooperative warnings. LANTERN separates warning onset, hazard onset, warning termination, and post-hazard recovery, and evaluates each physical event under matched warning and no-warning executions so that the warning's contribution is measured in isolation rather than confounded with onboard vision. The benchmark spans six safety-critical scenario families and provides 3,272 sequences with 236,309 frames for training, together with 120 matched route pairs for closed-loop evaluation. Each hazard route is evaluated under the warning and no-warning conditions, while its no-hazard control penalizes unconditional braking. We further introduce the Cooperative Unified Score (CUS), a safety-gated metric that jointly rewards route progress, anticipation, clearance, and recovery. Fine-tuning a representative VLM driving model raises CUS from 34.6 without warnings to 75.5 with them, demonstrating both the value of cooperative warnings and the discriminative power of the paired protocol. All resources will be made publicly available.
Read the full abstract
Machine Learning
Robust Conformal Consensus: Multi-Agent LLM-as-a-Judge Interval Evaluation with Conformal Prediction
LLM-as-a-Judge has emerged as a promising paradigm for evaluating natural language generation. However, the uncertainty associated with such evaluations remains largely unexplored, which limits their reliability in real-world applications. Although conformal prediction offers a principled framework for uncertainty quantification, existing approaches typically apply it to a single LLM judge, overlooking the variability introduced by using different LLM evaluators. In this work, we propose a robust uncertainty estimation framework for multi-agent LLM-as-a-Judge evaluation. Our approach constructs conformal prediction intervals for LLM-based scores from multiple LLMs. By considering intervals from different LLM judges, we obtain more stable and reliable uncertainty estimates. Extensive experiments demonstrate that our method produces valid prediction intervals with coverage guarantees, and that interval-based aggregation across multiple judges leads to more stable evaluation outcomes.
Read the full abstract
Artificial Intelligence
AutoKD: Autonomous Knowledge Discovery
Scientific discovery in data-rich domains is currently constrained by human bandwidth: the growth in the volume and complexity of real-world data far outpaces the rate at which researchers can read, reason, and synthesize. Recent LLM-based multi-agent systems have begun to automate portions of the research cycle, but they target hypothesis generation in settings where validation cannot itself be automated, and each run is one-shot, with no mechanism for findings to accumulate or steer subsequent inquiry. This paper introduces AutoKD, a multi-agent framework for autonomous knowledge discovery that is both computational and cumulative, allowing validated findings to persist and inform subsequent inquiry. Six coordinated LLM agents collaborate in an open-ended discovery loop, where accepted findings are stored in a persistent insight graph that serves as both long-term memory and an exploration-steering mechanism. We evaluate AutoKD on three diverse datasets from two perspectives: Open-ended Quality against published findings, and Conditioned Quality via literature-derived queries. Across both evaluation perspectives, AutoKD covers known findings and surfaces substantive discoveries that complement human-driven research. Our code is available at https://github.com/GeQinwen/AutoKD.
Read the full abstract
Emerging Technologies
multi-Stochastic Core Architecture for Scaling Probabilistic Ising Machines
Ising Machines offer vast potential to solve NP-hard optimization problems efficiently that are intractable to solve using conventional computing architecture. A lot of these optimization problems fall into statistical learnability and involve finding an optimal solution among many possible, near-analogous configurations, by searching in a non-convex energy landscape. In this context, the probabilistic Boltzmann machine architecture especially PASS (Parallel Asynchronous Stochastic Sampler), explores and models the complex probability landscape pertaining to all possible configurations and excels in finding the ground-state energy solution of these intractable problems. Additionally, the noise-based neuron architecture addresses the limitation of conventional annealing methods, which may get stuck around local minima. Here, we demonstrate a stochastic sampling approach based on Block Gibbs Sampling to integrate multiple asynchronous PASS chips (four in this work), enabling improved scalability. Further, we demonstrate the scaling by mapping 784 nodes Max-Cut problem integrating 256 nodes PASS accelerator manufactured in 14 nm CMOS FinFET technology. PASS-enabled system with Block Gibbs Sampling protocol shows approximately 1000 times speedup for Max-Cut optimization compared to state-of-the-art methods implemented on CPUs and GPUs. The general applicability of this approach is further illustrated by solving a quantum spin chain Transverse Ising system and accurately representing complex probability landscapes. Moreover, our results demonstrate the change in the scaling law to constant in the scaled-PASS accelerator as compared to exponential on GPUs enabling at least 4 orders of magnitude improvement in time-to-solution. Hence, the presented methodology enables the pathway for scaling of asynchronous brain-like dynamics systems that do not follow any clock for its operation.
Read the full abstract
Numerical Analysis
Vertex interpolation by bivariate $C^1$ cubic splines: counterexamples, geometric stability, and indecomposable defects
We study vertex evaluation on the full space of continuously differentiable piecewise cubic polynomials on a fixed planar triangulation. A complete dual description turns failure of interpolation into balanced edge weights with nonzero vertex loading. It leads to exact counterexamples with 17, 25, 31 and 41 vertices, each with one relation and the classical lower-bound dimension. The 31- and 41-vertex examples have interior graphs that are trees. We give a geometric construction criterion for a sector-completion family and a certified implicit construction outside that family. With all boundary vertices fixed, the nearby bad configurations form a four-dimensional smooth locus in the 17-vertex case, two intersecting components of dimensions six and five in the 25-vertex case, and isolated transverse points in the two tree examples. A common Schur-complement estimate explains their different interpolation costs. We first realize arbitrary defect by decomposable chains of the 41-vertex example. We then construct obstructions from individually interpolatory blocks, prove that the capacity of one complete edge is exactly five, and build a fixed-square family with arbitrarily large strongly indecomposable defect. The latter excludes two triangle-disjoint connected normal bad submeshes even when those submeshes may have holes.
Read the full abstract
High Energy Physics (Theory)
Finite stress-tensor moment tomography of boundary-graviton coherences
Einstein gravity in 2+1 dimensions is a topological theory that does not admit the existence of local bulk gravitons. However, $\mathrm{AdS}_3$ gravity with Brown-Henneaux boundary conditions does admit the existence of boundary gravitons, which are described by Virasoro descendants. An observer living on the asymptotic boundary can use finite order moments of the boundary stress tensor as a probe of these states. We fix one highest-weight module and assume that the Shapovalov forms are nondegenerate. We also assume that the unknown state the observer is probing has a known finite descendant support and that interlevel coherence is part of the unknown data. We find that, given a descendant at level $N\geq2$, stress moment tomography at order $N$ (meaning $N$ stress moment insertions) is informationally incomplete, while tomography with stress moments of order $N+1$ is informationally complete. This is to say that, on the unitary regular locus, orthogonal pure states can have the same complete order-$N$ record. Likewise, for exact finite-window result for levels through $L\geq2$, tomography of order $L$ is incomplete while tomography of order $L+1$ recovers every density-matrix block. Corresponding exact thresholds hold in the full left-right theory. In heavy sectors for which a semiclassical bulk interpretation exists, these thresholds say when finite-support boundary-graviton states first become distinguishable.
Read the full abstract
Materials Science
First-Principles Study of Magnetism, Electronic Structure, and Bonding in Nb-Mn-Ge Kagome Compounds
In this work, we systematically investigate the magnetic ground states, electronic structures, and bonding characteristics of the computationally predicted stable NbMn6Ge6, NbMn6Ge5, and NbMn6Ge4 using first-principles calculations. Our results show that structurally stable NbMn6Ge6 has a collinear antiferromagnetic configuration, while the metastable rhombohedral NbMn6Ge5 and NbMn6Ge4 favor ferromagnetic ground states. Magnetic moments on Mn atoms are nearly localized, suggesting the applicability of a generalized spin Hamiltonian. Magnetic anisotropy in AFM NbMn6Ge6 and FM NbMn6Ge5 has uniaxial behavior, while FM NbMn6Ge4 has in-plane anisotropy. Charge density difference and electron localization function analyses further show charge redistribution and bonding features within the Mn-Ge Kagome network and between adjacent structural layers. Electronic structures near the Fermi level show no features suitable for topological magnetism studies. Experimental synthesis, structural characterization, and magnetic measurements are required to verify our predictions.
Read the full abstract
Information Theory
A Graph Foundation Model for Large-Scale MIMO Detection
Large-scale multiple-input multiple-output (MIMO) detection is fundamental to modern wireless networks but constrained by performance-complexity trade-offs. Existing detectors, whether classical or learning-based, often fall short in either scalability or generalizability across heterogeneous scenarios. To overcome these limitations, we introduce a wireless-native graph foundation model (GFM) tailored for large-scale MIMO detection. The proposed GFM employs a physics-informed hybrid architecture, integrating the local correlation extraction of message passing neural networks with the global attention of graph Transformers, encoding the physical interference patterns from the expectation propagation algorithm. Via extensive pre-training, this synergy enables the learning of a general-purpose detection mapping scalable across antenna dimensions and channel conditions. For rapid downstream deployment, parameter-efficient fine-tuning is leveraged to adapt the GFM to specific non-ideal system regimes with minimal overhead. To enhance inference efficiency, a mixture-of-experts mechanism is embedded at downstream deployment to dynamically activate only the necessary sub-modules. Evaluations show that the proposed GFM consistently outperforms classical detectors and advanced data-driven baselines in accuracy, configuration generality, and cross-scenario transferability across various challenging zero-shot and few-shot conditions.
Read the full abstract
Computer Vision
NOVA: Normal-Side Modeling for Training-Free Zero-Shot Video Anomaly Detection
Training-free zero-shot video anomaly detection (ZS-VAD) leverages vision-language models (VLMs) to localize anomaly instances from a predefined anomaly vocabulary, without providing any video. Existing CLIP-based methods often emphasize anomaly-side semantics, while the competing normality side remains less carefully formulated. We identify two key limitations in existing solutions: (i) blurred decision boundary: normal prompts may contain ambiguous verbs, such as running, that are semantically close to anomalies, reducing normal and abnormal separation in the VLM embedding space; and (ii) modality gap: poor alignment between features of textual normal anchors and visual frames. We propose NOVA, a training-free ZS-VAD framework that strengthens the normal side at both linguistic and visual levels. NOVA introduces Normality-Aware Prompt Construction (NA), which excludes anomaly-adjacent verbs and biases normal descriptions toward static, low-motion scenes. To overcome the text-vision modality gap, NOVA constructs a Visual Normality Anchor (VNA), which creates a weighted visual normal anchor from the initial frames of each test video, providing a video-specific normal reference without task-specific training or annotations. NOVA achieves 89.86 percent AUC on UCF-Crime and 95.07 percent AUC and 84.82 percent AP on XD-Violence, reaching state-of-the-art performance among comparable training-free zero-shot methods.
Read the full abstract
Computer Vision
AGSA-Net: Abundance-Guided Self-Attention Network for Spectral Unmixing-Aware Hyperspectral Remote Sensing Image Classification
Hyperspectral image (HSI) classification plays a vital role in remote sensing applications, including agriculture, environmental monitoring, and urban analysis. However, its performance remains challenged by high spectral redundancy, noise sensitivity, and the difficulty of jointly modeling local material composition and long-range spectral dependencies. To address this, we propose AGSA-Net, an abundance-guided self-attention network that explicitly integrates spectral unmixing priors into the classification process. AGSA Net first estimates physically meaningful subpixel abundance maps subject to non-negativity and sum-to-one constraints, regularized by hybrid linear-nonlinear reconstruction decoder. The learned abundances are then used to construct an abundance affinity prior that guides a spectral transformer to emphasize class-discriminative interactions, and the resulting transformer features are fused with compact abundance descriptors for final prediction; in contrast to existing approaches that use abundance as auxiliary or concatenated features. Experiments on Indian Pines, Augsburg, and Berlin demonstrate the benefit of incorporating abundance- guided contextual modeling, particularly in heterogeneous urban scenes. The source code and trained models are available at: https://github.com/nnuvi/AGSA-Net
Read the full abstract
Probability
The Berry-Esseen Constant Conjecture is Eventually True
We prove that the Esseen's constant $0.4097...$ is valid in the iid Berry–Esseen inequality as long as the sample sizes $n\ge N$. The threshold $N$ is universal over all real summand distributions with positive variance and a finite third absolute moment. In particular, one may take $N=2\left\lceil\exp(10^{17})\right\rceil. $
Read the full abstract
Quantum Physics
Variational Quantum Homotopy Perturbation Method to Solve Nonlinear Partial Differential Equations
Solving nonlinear partial differential equations is important in various scientific and engineering applications. Recently, quantum computing was introduced as an alternative computational paradigm for solving nonlinear partial differential equations. In this paper, a new method called the variational quantum homotopy perturbation method is proposed to improve the scalability of solving nonlinear partial differential equations through two aspects. First, the dimension of the Hilbert space remains the same after the nonlinear partial differential equation is linearized through the homotopy perturbation. Second, the solutions are obtained with a variational quantum simulation framework, where the number of qubits is decreased with functional encoding and the depth of parametrized circuits is reduced. The additional contribution of this paper is the introduction of new criteria for selecting the homotopy series truncation order and circuit depth for cost-effective variational quantum homotopy perturbation method. The proposed approach is demonstrated with several examples, including the vorticity transport equation and the reduced magnetohydrodynamics equations.
Read the full abstract
Computer Vision
MSCA-UNet: Multi-Scale Context and Attention U-Net for Image Segmentation
U-Net remains a practical baseline for image segmentation because of its simple encoder-decoder structure and skip connections. However, the bottleneck representation is still dominated by a limited set of receptive fields, while decoder features are propagated without explicitly emphasizing the most informative channels and spatial locations. This paper presents MSCA-UNet, a U-Net-based segmentation architecture that combines multi-scale contextual aggregation at the bottleneck with channel-spatial attention refinement in the decoder. The multi-scale module uses parallel atrous convolutions to capture contextual features at different receptive fields, while Convolutional Block Attention Modules (CBAMs) progressively recalibrate decoder features. Under identical experimental settings, the baseline U-Net achieves 96.9% mIoU on a held-out test set. Adding multi-scale context improves mIoU to 97.5%, while attention alone reaches 98.4%. Combining both mechanisms yields 99.1% mIoU, a 2.2 percentage-point improvement over the baseline. Parameter analysis further shows that the attention-only variant adds approximately 0.044M parameters, whereas the multi-scale module contributes most of the additional model capacity. The results support the view that multi-scale context enrichment and attention-based feature refinement provide complementary benefits within a U-Net framework.
Read the full abstract
Multiagent Systems
Adaptive stabilization of a leaderless bearing-constrained formation with disturbances
In this paper, we consider the problem of regulating and maintaining a target formation characterized by a set of bidirectional bearing constraints under disturbances. The agents in the formation are modeled by single integrators with deterministic bounded continuous disturbances of which both actual function and upper bound are unavailable for the control design. Due to the time-varying disturbances, the target formation is time-varying. We propose displacement/bearing-only based adaptive sliding mode control laws to uniformly asymptotically stabilize the time-varying target formation and reject the matched disturbances, and provide sufficient conditions to prevent possible collisions. A time-dependent adaptive design method is provided to convert the displacement-based control law to a bearing-only one. In addition, to alleviate chattering phenomena from sliding mode control, smooth adaptive control laws are introduced to guarantee uniform global boundedness of the desired formation. Finally, simulation results are given to support the analysis.