Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 29 August
In a real Hilbert space, we study a bilevel optimization problem that consists in minimizing an outer convex function over the zero set of a maximally monotone operator. In the smooth setting, where the outer objective is convex and Fréchet differentiable and the inner operator is single-valued, continuous and monotone, we associate with the problem a first-order dynamical system that can be viewed as a monotone flow applied to a dynamically regularized operator. Under a suitable Attouch-Czarnecki-type condition for the inner level, we establish last-iterate convergence rates for both the outer and inner residuals, together with weak convergence of the trajectories to optimal solutions of the bilevel problem. In the smooth+nonsmooth setting, we enrich the outer objective with a proper, convex, and lower semicontinuous function, while the inner operator is augmented by the subdifferential of a function with the same properties. We propose a regularized proximal-extragradient algorithm in which both the forward and backward steps are performed with respect to dynamically regularized operators and functions, respectively. Under an analogous Attouch-Czarnecki-type condition formulated for the smooth+nonsmooth case, we establish last-iterate convergence rates for both the outer and inner residuals, together with weak convergence of the iterates to optimal solutions of the bilevel problem.
Computational Complexity
Hardness of Approximation of Rank Aggregation on Ulam Metric
We study the approximability of rank aggregation under the Ulam metric. In the Ulam median problem, the goal is to find a permutation minimizing the sum of its Ulam distances to the input permutations, while in the Ulam center problem the objective is to minimize the maximum such distance. Both problems are known to be NP-hard, but no explicit approximation hardness was previously known. We prove that, for every $\varepsilon>0$, it is NP-hard to approximate either Ulam median or Ulam center within a factor of $51/50-\varepsilon$, even when the input consists of only four permutations. We further show that unless P = NP, neither problem admits a polynomial-time additive approximation scheme. The hardness result for Ulam median is established via a reduction from MAX-E3-LIN-2. The corresponding hardness for Ulam center is then obtained through a reduction from Ulam median.
Read the full abstract
Information Retrieval
History-Conditioned Joint-Prefix Alignment for Generative Recommendation
Generative recommendation retrieves items by autoregressively generating semantic identifiers, but beam search may discard a target before its complete identifier is generated. Our preliminary analysis across three benchmarks shows that most missed targets are pruned within the first two decoding steps, highlighting the importance of early prefix retention. However, retaining a target's first-token branch alone is insufficient if its continuation is pruned at the next step: aligning only the first-token distribution improves first-token survival but yields little gain in complete-path retention. This observation motivates joint supervision of early branches and their continuations. We propose Prefix Alignment with Temporal History (PATH), which aggregates transition statistics from the training corpus over recent interactions with exponential decay to construct history-conditioned two-token prefix targets. PATH aligns the model's joint predictions with these targets through forward KL divergence, using a chain-rule decomposition that enables unbiased Monte Carlo estimation. At inference time, PATH reuses the transition statistics for pointwise mutual information (PMI) calibration, reranking completed candidates relative to global prefix frequency. Experiments on Beauty, Instruments, and Yelp demonstrate the effectiveness of PATH, showing consistent improvements in recommendation performance and higher full-SID survival rates.
Read the full abstract
High Energy Physics (Phenomenology)
Probing strange-sector flavor-changing neutral currents at DUNE-like facilities
We investigate the sensitivity of DUNE-like facilities to flavor-changing neutral-current interactions between down and strange quarks through inclusive deep-inelastic neutrino scattering. In the framework of a general low-energy effective Lagrangian for Dirac and Majorana neutrinos, we evaluate projected sensitivities for CP- and $\tau$-optimized beam configurations. The strongest bounds on the dimensionless Wilson coefficients, defined relative to the Fermi constant $G_F$, reach $\mathcal{O}(10^{-3})\text{--}\mathcal{O}(10^{-2})$ at the near detector, whereas far-detector limits are roughly one order of magnitude weaker. When systematic uncertainties are included, the near-detector sensitivity is dominated by the background-rate uncertainty, while the far-detector sensitivity is limited primarily by the signal-rate uncertainty. At the far detector, the dependence of the projected bounds on the neutrino mass ordering and the Dirac CP-violating phase $\delta_{\mathrm{CP}}$ is largely confined to coefficients involving the electron flavor.
Read the full abstract
Computer Vision
Dynamic-Robust Photometric-Semantic Reconstruction for Open-Vocabulary 3D Scene Understanding
The integration of novel view synthesis (NVS) and open-vocabulary segmentation (OVS) has recently yielded powerful feed-forward 3D foundation models. However, their inherent reliance on static-scene assumptions leads to severe misalignment of spatial features in unconstrained dynamic environments. To bridge this critical gap, we propose SPAR, a novel joint semantic-geometric encoding architecture that explicitly isolates transient dynamic noise prior to latent space aggregation. Furthermore, we introduce a dynamic-region-aware end-to-end training paradigm that structurally couples motion estimation with multi-view visual and semantic learning. This unified approach enables the network to inherently resolve motion conflicts and distill multi-view consistent, temporally stable scene representations from dynamic inputs. Extensive experiments on the challenging D-RE10K benchmark demonstrate that SPAR achieves state-of-the-art performance. Our end-to-end approach achieves exceptional novel view synthesis quality, yielding a PSNR of 22.15 dB and 23.33 dB given only 3 and 4 input views respectively. Despite being trained in a self-supervised manner, our model achieves an mIoU of 88.5% for motion mask prediction. Furthermore, our analysis reveals a strong inter-task synergy between photometric scene reconstruction and semantic understanding, where semantic synthesis learning consistently enhances photometric fidelity in novel view rendering. Code will be available at https://github.com/dmucby/SPAR.
Read the full abstract
Numerical Analysis
A Tensor Neural Network Method for High-Order Homogenization of Locally Periodic Elliptic Problems
We develop a high-order tensor neural network (TNN) method for locally periodic elliptic multiscale problems of the form $-\nabla\cdot(A(x,x/\varepsilon)\nabla u_\varepsilon)=f$. Because the coefficient depends on both the slow variable $x$ and the fast periodic variable $y=x/\varepsilon$, the high-order cell problems and macroscopic corrector equations are more involved than in the classical case $A=A(y)$, and the correctors depend parametrically on $x$. We derive a computable high-order two-scale expansion and prove an $H^1$ convergence estimate for the partial expansion in boundary-layer-free settings, including periodic domains and ideal boundary-matching configurations. The proof uses the recursive compatibility structure of the corrector hierarchy and a zero-mean oscillation estimate in $H^{-1}$. We then construct a TNN framework for the high-dimensional corrector problems. Its tensor-product structure permits deterministic one-dimensional quadrature for the cell problems, homogenized coefficients, macroscopic source terms, and loss functions, avoiding Monte Carlo integration error. The numerical realization assumes that the coefficient entries and assembled data admit finite or controlled tensor-product representations; this computational assumption is separate from the general matrix-valued coefficient class used in the analysis. Experiments with scalar locally periodic coefficients show accurate high-order correctors. The $H^1$ semi-norm errors are consistent with the proved estimate, while point-normalized $L^2$ errors display the nominal high-order behavior predicted by the formal expansion.
Read the full abstract
Artificial Intelligence
An Explainable Coherence Score for Detecting Temporal Inconsistencies in Political News
Temporal inconsistencies, such as mandates attributed outside their real interval, events presented as past before they occurred, or inverted causal sequences, are a form of political disinformation that evades style-based fake news detectors: a well-written article with a single wrong date carries no lexical signal of falsehood. This paper introduces the Temporal Coherence Score (TCS), a continuous, intrinsically interpretable metric that quantifies the temporal coherence of a news article, computed by a four-stage pipeline: extraction of temporal facts, construction of a temporal knowledge graph, hierarchical verification against internal consistency rules and external reference sources, and score aggregation with automatically generated explanations. Verification combines eight internal checkers derived from Allen's interval algebra with a five-level external hierarchy ranging from a locally stored reference knowledge base of 1{,}256 curated political facts to live Wikidata SPARQL queries. On a benchmark of 100 political news articles with injected temporal errors, the system reaches a precision of 0.909 at the selected operating threshold, with a single residual false positive, a profile deliberately tuned for human-in-the-loop fact-checking assistance, where false alarms are costlier than missed detections. Unlike lexical baselines that output only a binary label, every flagged article is accompanied by the inconsistency type, the entities involved, and the reference source that contradicts the claim.
Read the full abstract
Physics and Society
Sustained Heterogeneity: an emergent collective mechanism in LLM-driven traffic
Large language models (LLMs) are increasingly adopted as closed-loop controllers in physical multi-agent systems, yet their emergent collective dynamics remain incompletely characterised. We deploy 22 LLM agents as direct, real-time target-speed controllers (per 0.5 s cycle, with IDM as collision-avoidance clamp) on a 230 m ring road under the Sugiyama 2008 paradigm, reproducing human-like stop-and-go waves. Six matched controls spanning stochasticity (white noise, OU noise, temperature), population variance, and dynamical instability (delay, OV model) are systematically excluded. The surviving phenomenon, termed Sustained Heterogeneity (SH), is the persistent, approximately temperature-insensitive (approx. 8 percent across a 6x T sweep), per-cycle divergence in LLM-chosen target-speed adjustments, propagating through a three-stage cascade of drift, gap erosion, and nonlinear braking. Across four traffic densities, the critical LLM penetration fraction p_c decreases monotonically from no transition at density 43.5 veh/km to p_c approx 0.23 at density 95.7 veh/km, consistent with an initiation-threshold model governed by trigger distance, stochasticity, and fleet size. Chain-of-thought analysis of 39,600 decisions across three seeds shows agents engage in multi-factor safety reasoning, yet systematic divergence persists, implying stability must be enforced at the dynamics layer. This is the first study to identify a previously uncharacterised collective mechanism in LLM-controlled traffic and map a density-dependent phase boundary p_c(rho).
Read the full abstract
Quantum Physics
Probabilistic generation of two-mode binomial cat states using cross-Kerr interactions
Superpositions of macroscopically distinct coherent states, or cat states, are a key resource for quantum technologies. In particular, two-mode binomial cat states can give rise to exact quantum error correction in continuous-variable quantum computing. However, their preparation typically requires non-Gaussian initial states, such as Fock or NOON states, which are challenging to realize experimentally. Here, we propose a protocol to generate two-mode binomial cat states where the only requirements are Gaussian initial states in combination with heralded heterodyne measurements. Our approach utilizes cross-Kerr interactions between bosonic modes commonly realizable in superconducting circuit architectures. We show that by adjusting the input state parameters, our protocol remains robust to dissipation under realistic experimental conditions. Our work provides a practical route to realizing multinomial cat states in current experimental platforms without requiring non-Gaussian initial resources, overcoming a key limitation of existing preparation schemes.
Read the full abstract
Computer Vision
A Tensor Variational Formulation of Gradient Energy Total Variation
We present a novel variational approach to a tensor-based total variation formulation which is called gradient energy total variation, GETV. We introduce the gradient energy tensor [6] into the GETV and show that the corresponding Euler-Lagrange (E-L) equation is a tensor-based partial differential equation of total variation type. Furthermore, we give a proof which shows that GETV is a convex functional. This approach, in contrast to the commonly used structure tensor, enables a formal derivation of the corresponding E-L equation. Experimental results suggest that GETV compares favourably to other state of the art variational denoising methods such as extended anisotropic diffusion (EAD)[1] and total variation (TV) [18] for gray-scale and colour images.
Read the full abstract
Dynamical Systems
Full Topological entropy of Xiong chaotic sets beyond the specification property
In this paper, we show that for a shift dynamical system $(X_{\mathcal{L}}, \sigma)$ with a weakened form of the specification property, there exists a Xiong chaotic set $C$ of $X_{\mathcal{L}}$ with full topological entropy everywhere (i.e. the intersection of $C$ and arbitrary non-empty open subset of $X_{\mathcal{L}}$ has full topological entropy). Moreover, $C$ satisfies that for any non-empty subset $A$ and any continuous map $F: A\rightarrow X_{\mathcal{L}},$ there exists an increasing sequence $\{p_{k}\}_{k=1}^{+\infty}$ of positive integers such that $\lim\limits_{k\rightarrow +\infty}\sigma^{p_{k}}(x)=F(x)$ holds for any $x\in A.$
Read the full abstract
Computation and Language
Toward a Cross-Lingual Romanization Ecosystem for Sinitic Languages: A Paired Mandarin-Cantonese Case Study
This paper proposes the Sinitic Romanization Ecosystem, a cross-lingual Sinitic romanization design framework with supporting digital infrastructure and a community-driven open-source workflow. The design framework addresses the lack of systematic cross-lingual romanization alignment among Sinitic languages through four design principles: phonetic correspondence for representing similar sounds with similar romanized symbols, historical-phonological correspondence for aligning cognate romanization strings, one-phoneme-one-symbol, and basic Latin-letter use, with a balancing consideration recognizing trade-offs among these principles. For the main paired case study, we develop CantRomZJ1 and MandRomZJ1, Cantonese and Mandarin romanization schemes following the design framework, respectively. We also develop schemes for several other Sinitic languages, including Meixian Hakka, Shanghai Wu, and Nanjing Jianghuai Mandarin, following the same design framework. To bring the romanization schemes into practical use, we develop open-source infrastructure for structured romanization storage, conversion, parsing, dictionary construction, and input-method generation. Finally, we evaluate the design framework through speech-to-romanization experiments based on Meta's Massively Multilingual Speech (MMS) fine-tuning. Compared with the Pinyin+Jyutping baseline, our MandRomZJ1+CantRomZJ1 condition reduces Cantonese WER and CER by 7.80% and 10.61%, respectively. These results suggest that cross-lingual romanization alignment can improve transfer in low-resource Sinitic speech technology.
Read the full abstract
High Energy Physics (Theory)
Flat connections on moduli spaces I: Local (1,0)-extension of the DHS connection
The flat DHS connection $\mathcal J_{\mathrm{DHS}}$ constructed in arXiv:2602.01461 is smooth on the configuration space of $n$ points on a fixed compact Riemann surface $\Sigma$ of arbitrary genus $h$, takes values in an infinite-dimensional Lie algebra $\hat{\mathfrak t}_{h,n}$ and is invariant under the modular group $\mathrm{Sp}(2h,\mathbb Z)$. This paper is the first in a series for a program whose goal is to extend the connection $\mathcal J_{\mathrm{DHS}}$ to a global flat connection on the Teichmüller space $\mathcal T_{h,n}$ valued in the Lie algebra of derivations of $\hat{\mathfrak t}_{h,n}$. Upon the choice of local coordinates adapted to the map $\mathcal T_{h,n}\to \mathcal T_h$, such a connection splits into three pieces: $\mathcal J_{\mathrm{DHS}}$, a piece $\mathcal L$ corresponding to holomorphic directions of $\mathcal T_h$ and a third piece corresponding to anti-holomorphic directions in $\mathcal T_h$. In this paper, we isolate the system of equations satisfied by $\mathcal L$ and obtain its solution locally and explicitly. The construction of a global extension of $\mathcal J_{\mathrm{DHS}}$ to $\mathcal T_{h,n}$ and the extension of the meromorphic connection of arXiv:1112.0864 to $\mathcal T_{h,n}$, are relegated to future publications in this series.
Read the full abstract
Artificial Intelligence
JudgePanel: A Compact Judge with Panel Deliberation via Adaptive Multi-Reward Reinforcement Learning
The LLM-as-a-Judge paradigm has emerged as a scalable alternative to human evaluation. However, single-model judges are limited by their inherent model biases, while multi-agent evaluation protocols that mitigate this through diverse deliberation are prohibitively expensive at inference time. To this end, we propose \modelname, which equips a compact \underline{Judge} model with multi-agent \underline{Panel} deliberation capability. Specifically, we first train on panel deliberation traces from an ensemble of strong evaluators, capturing structured patterns of discussion, disagreement, and resolution. To further improve judgment quality beyond SFT, we introduce AdaReward, an adaptive multi-reward RL algorithm that dynamically rebalances reward component weights as different objectives saturate at different rates during RL training. For practical deployment, we further design a lightweight domain specialization module for rapid adaptation to new evaluation domains with few hundred labeled samples. As a result, (i) Novel: the first framework to equip a single compact judge with multi-agent panel deliberation capability at single-model inference cost; (ii) Effective & Reliable: JudgePanel with a 14B backbone outperforms judge-specialized models up to 70B across four evaluation benchmarks, demonstrates strong position consistency, and rapidly specializes to new domains with few hundred samples.
Read the full abstract
Computer Vision
Feature-Spectral Fragility in Segmentation: Dataset Dependence, Architecture-Specific Localization, and Spectral Correlates
Robustness of segmentation models is commonly assessed through input-domain perturbations, while dependence on frequency content within learned feature representations remains less understood. We probe this dependence using targeted post-training low-pass interventions on internal representations of three segmentation architectures, ResNet50-UNet (CNN), VM-UNet (SSM), and Swin-UNETR (Transformer), across CVC-ClinicDB and ISIC2018, with headline evaluations performed on untouched held-out test sets. At cutoff $\rho=0.25$, feature-domain low-pass filtering causes severe degradation on CVC: Dice drops by 100%, 73.2%, and 30.9% for CNN, SSM, and Transformer, respectively, compared with 9.4%, 10.3%, and 0.6% on ISIC. The cross-dataset difference is statistically significant for every architecture. Single-stage interventions further show that the most sensitive stage depends on architecture and dataset: the CNN peaks at the 2nd to 3rd encoder block, whereas the SSM peaks at the 1st to 2nd encoder stage. Native feature-domain spectral measurements show an inverse association between high-frequency energy and fragility on CVC; the relationship is only partial on ISIC and is therefore treated as a candidate correlate rather than a proven mechanism. Finally, Fourier augmentation improves robustness to input-space low-pass filtering but leaves feature-domain degradation essentially unchanged. These results show that feature-spectral robustness is strongly dataset-dependent, architecture-specific, and distinct from input-domain spectral robustness.
Read the full abstract
Adaptation and Self-Organizing Systems
Perturbation responses on topological synchrony in simplicial Kuramoto model
Synchronization is conventionally understood as the emergence of a phase-locked collective state among interacting dynamical units. However, extending this notion to systems whose dynamical variables are defined on higher-dimensional simplices introduces fundamentally new constraints arising from the topology of the underlying simplicial complex. In the simplicial Kuramoto model, nontrivial topological cycles give rise to a higher dimensional harmonic subspace that is unaffected by the coupling and can therefore drift indefinitely, preventing a globally synchronized state. To resolve this we employ Hodge decomposition on simplicial Kuramoto dynamics and investigated the components. Despite this topological obstruction, we show that the simplicial Kuramoto model admits fixed-point states in the exact and coexact sectors of the Hodge decomposition above critical coupling strengths, which we derive analytically for both sectors. This decomposition provides a generalized notion of synchronization in which the non-harmonic components converge to fixed states. We further investigate the robustness of these fixed-point states to external perturbations. Excluding the drifting and non-interacting harmonic component, the perturbation response is governed by the spectrum of weighted Laplacian and recovers a Kirchhoff index dependence analogous to standard Kuramoto case. In contrast, the harmonic sector is non-dissipative, and consequently the fragility of the system increases with the dimension of this topological subspace. We characterize this effect numerically using triangulated tori with varying first Betti number and find a superlinear scaling relation between system fragility and the dimension of the harmonic sector.
Read the full abstract
Mesoscale and Nanoscale Physics
Quantifying Ultrafast Orbital Pumping and Nanometre-Scale Orbital Diffusion in Magnetic Heterostructures
Quantifying ultrafast orbital pumping and transport remains challenging because spin and orbital currents contribute coherently to terahertz emission. Here, we combine spintronic terahertz emission spectroscopy with wedge-sample thickness control to disentangle these contributions in Fe, Co and Ni heterostructures with Ta, W and Nb. Their opposite spin Hall and orbital Hall polarities enable quantitative determination of relative pumping strengths and propagation lengths. We find that orbital pumping increases from Fe to Ni, with inferred orbital-to-spin current ratios reaching several tens of percent in Ni, exceeding current microscopic predictions. Remarkably, Nb exhibits an orbital diffusion length of ~1.5 nm, substantially longer than in Ta and W and beyond the sub-nanometre scale predicted by recent orbital-relaxation calculations. These findings provide quantitative experimental benchmarks for ultrafast orbital pumping and transport.
Read the full abstract
Computer Vision
Mapping-Based Image Diffusion
In this work, we introduce a novel tensor-based functional for targeted image enhancement and denoising. Via explicit regularization, our formulation incorporates application dependent and contextual information using first principles. Few works in literature treat variational models that describe both application dependent information and contextual knowledge of the denoising problem. We prove the existence of a minimizer and present results on tensor symmetry constraints, convexity, and geometric interpretation of the proposed functional. We show that our framework excels in applications where nonlinear functions are present such as in gamma correction and targeted value range filtering. We also study general denoising performance where we show comparable results to dedicated PDE-based state of the art methods.
Read the full abstract
Combinatorics
On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs
A $(1^j,2^k)$-packing edge-coloring of a graph $G$ is a partition of the edge set $E(G)$ into $j$ matchings and $k$ induced matchings. Hocquard, Lajou, and Lu\v zar found a subcubic planar graph of girth $3$ that has no $(1,2^5)$-packing edge-coloring and also conjectured that every subcubic planar graph has a $(1,2^6)$-packing edge-coloring. We also notice that for every fixed positive integer $k$ there exists a subcubic planar graph with girth $k$ that is not $(1,2^3)$-packing edge-colorable. It is natural to consider what is the minimum positive integer $k_1$ such that every subcubic planar graph with girth at least $k_1$ is $(1,2^5)$-packing edge-colorable. Furthermore, we also consider what is the minimum positive integer $k_2$ such that every subcubic planar graph with girth at least $k_2$ is $(1,2^4)$-packing edge-colorable. In this paper, we show both $k_1$ and $k_2$ are finite, and in fact $5 \le k_1 \le 12$ and $6 \le k_2 \le 16$.
Read the full abstract
Computer Vision
Subtraction-Based Tumor Segmentation and Lesion-Centered pCR Prediction for the MAMA-MIA Challenge
We describe the submission of team FME to the MAMA-MIA Challenge, which evaluated primary tumor segmentation and prediction of pathological complete response (pCR) from pretreatment dynamic contrast-enhanced breast MRI on an external multi-country cohort. For segmentation, we trained a five-fold residual-encoder nnU-Net ensemble using only the first post-contrast minus pre-contrast image, combined with mirroring test-time augmentation and largest-connected-component filtering. For pCR prediction, we ensembled 25 pretrained 3D video classifiers trained on lesion-centred crops from the pre-contrast and first two post-contrast volumes. FME ranked second in both tasks. The segmentation method achieved a combined performance-fairness score of 0.882, with Dice 0.713 and normalized Hausdorff distance 0.099. The pCR method achieved a combined score of 0.664, balanced accuracy of 0.541, and equalized-odds disparity of 0.212. The results indicate that subtraction-based input and ensembling support robust tumor segmentation under cross-site domain shift, whereas pCR prediction from baseline DCE-MRI alone remains limited. For the submission repository, see https://github.com/FraunhoferMEVIS/MAMA-MIA-Challenge-FME
Read the full abstract
Instrumentation and Methods for Astrophysics
How nanoscale physics shapes ice formation in the Universe: Rethinking gas freeze-out on dust grains
In cold molecular clouds, gas freeze-out onto dust grains initiates interstellar ice formation, yet sticking probabilities of heavy species are often assumed to be near unity at low temperature. Recent laboratory measurements on realistic grain analogues show that this assumption can fail. Using CO as a prototype, we investigate how nanoscale surface morphology controls adsorption and ice growth at 10 K on highly oriented pyrolytic graphite and carbon soot. X-ray photoelectron spectroscopy, low-temperature scanning tunneling microscopy, kinetic Monte Carlo simulations, and a thermodynamic description are combined to relate molecular retention to local surface structure. CO does not adsorb with unit sticking on graphite: adsorption proceeds through monolayer growth, a reduced-retention crossover near monolayer completion, and delayed multilayer growth. STM shows that CO remains highly mobile on graphite terraces and is stabilized mainly at island edges and terrace steps. On soot, the same sequence occurs at much higher exposures and with substantially lower sticking coefficients, while simulations show preferential retention in concave regions and poor wetting of convex asperities. These results indicate that low-temperature sticking is governed by post-impact exploration and competition between stabilization and escape. Nanoscale morphology amplifies this mechanism, reducing effective sticking probabilities and delaying gas freeze-out on realistic dust grains.
Read the full abstract
Computer Vision
Training-Free Hidden-State Refinement for Flow-Matching Image Generators
We aim to improve frozen flow-matching image generators by adding inference computation inside the denoiser, without changing model weights or the outer sampler. Existing generators usually spend extra test-time computation by increasing the number of sampling steps, which repeatedly evaluates the entire denoiser and couples quality gains to sampler cost. A key challenge is how to use extra computation inside a frozen transformer denoiser: the method must decide which tokens, layers, and sampling times receive repeated updates while preserving the original generation pipeline. We introduce a training-free looping framework that repeatedly applies selected transformer layers inside each denoising call. Dense and Sparse Token Loop vary the token scope; Sampling-Progress Gating and the loop layer range specify when and where looping is active; loop count and strength control the repeated updates; and Loop Guidance combines ordinary and looped vector-field predictions. Across two Scale-RAE model scales, loop variants improve primary and auxiliary quality metrics with competitive quality–efficiency trade-offs. Loop Guidance further improves both primary metrics across all three tested models; on Scale-RAE DiT2.4B, it raises GenEval from 0.4471 to 0.5691 and DPG-Bench from 0.7656 to 0.8053. Code will be released.
Read the full abstract
High Energy Physics (Experiment)
Sensitivity of a Missing-Mass Search for a Light Dark Photon with a Positron Beam on a Hydrogen Target
We present a Geant4-based simulation study of the sensitivity to a light dark photon, $A'$, using a positron beam incident on a thin liquid-hydrogen target and a high-resolution forward electromagnetic calorimeter for final-state photon reconstruction. This study is motivated by ongoing research and development toward a low-energy positron facility at Jefferson Lab. The proposed search employs the missing-mass technique in the annihilation-in-flight process $e^+e^- \to \gamma A'$, providing sensitivity to the $A'$ independently of its decay mode. We evaluate the expected backgrounds from standard QED annihilation and bremsstrahlung processes and present the projected sensitivity to the kinetic-mixing parameter $\epsilon^2$ as a function of the $A'$ mass. The experiment with 500~MeV beam will provide the data for $A'$ mass range 7-19 MeV. The projected sensitivity on $\epsilon^2$ is $4\times10^{-8}$ at $m_{A'}=19$~MeV.
Read the full abstract
Image and Video Processing
Manifold-Constrained PET Reconstruction with Learned Flow-Matching Priors
Image reconstruction for positron emission tomography (PET) is an ill-posed Poisson inverse problem. In this work, we introduce an unsupervised, optimization-based reconstruction framework that employs a flow-matching generative model as a learned manifold prior. We train the generative model on high-quality PET images to learn a differentiable ordinary differential equation (ODE)-based transport from a Gaussian latent distribution to the PET image distribution. We incorporate this generator as an explicit manifold constraint into a regularized Poisson likelihood formulation. To solve the resulting problem, we develop an alternating direction method of multipliers (ADMM) algorithm that integrates an expectation-maximization (EM)-type surrogate update for Poisson data fidelity with gradient-based latent-space optimization. Numerical simulations and in vivo PET experiments demonstrate improved reconstruction accuracy compared with conventional reconstruction methods and recent deep learning-based approaches, particularly in low-count settings, with competitive computational efficiency.
Read the full abstract
Logic
Dilator-based analysis of KP
Proof theorists developed various frameworks to analyze impredicative systems like $\Pi^1_1\text{-}\mathsf{CA}_0$ or $\mathsf{KP}$; One is an operator-controlled derivation system, and the other is Girard's dilator-based $\beta$-logic. In this paper, we provide a functorial formulation of operator-controlled analysis of $\mathsf{KP}$, thereby unifying the two approaches into a single framework. As an application, a new proof of Girard's boundedness theorem is also provided, which states that every $\Sigma_1$-over-$L_{\omega_1^{\mathsf{CK}}}$-definable function $\omega_1^\mathsf{CK}\to \omega_1^\mathsf{CK}$ is bounded by a recursive dilator.
Read the full abstract
Superconductivity
Topological pair density waves in kagome superconductors
The pair density wave (PDW) is an unconventional superconducting state exhibiting periodic pairing modulations due to pairing with finite momentum Q. In two dimensions, multiple Q components of the PDW can have a non-trivial relative phase, breaking time-reversal symmetry and resulting in a topological electronic structure. Here we review progress on exploring such topological PDWs (TPDWs) and discuss their potential realization in kagome superconductors. We first introduce the concept of a TPDW starting from the Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) state and examine the challenges toward its realization. We then discuss the possibility of a TPDW in the kagome lattice, which intertwines with chiral superconductivity and loop currents, thus connecting to models describing the quantum anomalous Hall effect. Furthermore, we review the experimental signatures of a TPDW in AV3Sb5 (A = Cs, Rb, K) superconductors and highlight related quantum effects, including switchable chiral pairing modulations, Bogoliubov Fermi states, the superconducting diode effect, and the anomalous thermal Hall effect. Finally, we project the future research opportunities of this correlated topological quantum phase and discuss its broad implications for finite-momentum pairing, topological matter, and chiral superconductivity.
Read the full abstract
Analysis of PDEs
Apriori Estimates and Nonexistence Results for Some Quasilinear Problems in a Half-Space
We obtain apriori estimates for positive solutions of some quasilinear elliptic problems in a half-space. Using these estimates and other techniques, we derive new nonexistence results for the respective Dirichlet problems.
Statistical Methodology
Stochastic Bayes factors: why, when, and how
The Bayes factor (BF) is a central tool in Bayesian hypothesis testing and model selection, yet its practical use is often challenged. Classical BFs depend heavily on prior specification, cannot be applied with improper priors, and are typically interpreted through arbitrary evidence scales. Moreover, they fail to capture uncertainty inherent in the data, leading to an analogy with frequentist p-values, and primarily reflect prior-predictive rather than posterior-predictive performance. We introduce the stochastic Bayes factor (SBF), a new framework that extends the BF by explicitly incorporating uncertainty via replicated data. Formally, the SBF is defined as a push-forward measure transferring the BF from the observed data space to that of replications. This approach generalizes previous calibration proposals, while emphasizing posterior-predictive replication as a robust alternative. We establish key theoretical properties, including model consistency, compatibility and dominance, ensuring that SBFs preserve desirable Bayesian guarantees. An algorithmic routine is then proposed to operationalize the SBF, guiding model discrimination in a principled way while naturally providing model calibration. Simulation studies and real applications confirm that the SBF offers improved robustness and predictive reliability compared to the classical BF, by providing a valuable tool for model comparison.
Read the full abstract
Computer Vision
SGRNet: Spatially Guided Radiology Network for Structured Radiological Reporting of Head and Neck Cancer
Automated radiological report generation can alleviate clinical workloads and eliminate observer variability. However, standard free-text generation models pose hallucination risks in dense regions and fail under data scarcity. We address these challenges in Head and Neck Cancer (HNC) from contrast-enhanced CT (CECT) imaging. To enforce factual safety, we reformulate report generation as an anatomically grounded, multi-label, structured reporting task, predicting localized tumor involvement across a hierarchical clinical schema. To bridge the visual gap from missing metabolic imaging (e.g., PET), we introduce SGRNet (Spatially Guided Radiology Network), incorporating two low-cost spatial priors: automated organ segmentations and weakly supervised tumor localization maps modeled via 3D Gaussian heatmaps. These priors are dynamically integrated via spatial feature modulation to guide the network toward subtle tumor-induced structural alterations. Evaluated on a multi-centric dataset of 184 paired HNC CECT volumes and reports, on five clinically salient, densely packed anatomical subsites, SGRNet achieves a mean Average Precision (mAP) of 0.60, an 8.8 percentage-point absolute improvement over strong volume-only 3D baselines.
Read the full abstract
Machine Learning (Statistics)
Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter
We study the empirical Sinkhorn estimator of the entropic optimal transport potentials under the uniform loss. Since the potentials are only unique up to additive constants, we measure the error using the quotient supremum norm, defined as $d_\infty([u],[v]) = \inf_{a\in\mathbb{R}}\|u-v-a\|_\infty$. For a fixed regularization parameter $\varepsilon>0$, we establish a non-asymptotic statistical rate of $n^{-1/2}$. This is achieved by combining the Birkhoff-Hopf contraction theorem with entropy bounds on normalized kernel sections. However, the constant in this bound grows exponentially with $1/\epsilon$. To improve this, we isolate geometric conditions under which the empirical estimator maintains the $n^{-1/2}$ rate but features polynomial dependence on $1/\varepsilon$. The key requirement is a polynomial residual-stability estimate for the population Sinkhorn map. We provide sufficient criteria for this, including a polynomial contraction property and a local inverse estimate. Furthermore, we introduce two rigorously verifiable model classes an $\varepsilon$-weak residual-interaction class obtained after separable centering and another based on connected tight-edge graphs for fixed discrete costs where the polynomial rate is guaranteed without relying on abstract resolvent assumptions. Finally, we establish matching minimax lower bounds demonstrating that the $\varepsilon n^{-1/2}$ rate cannot be uniformly improved in the bounded-interaction regime.