Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Class unlearning aims to remove a model's ability to recognize designated forget classes while preserving performance on retain classes. However, low forget accuracy after unlearning does not necessarily mean the class structure has been erased. Approximate unlearning methods can alter classifier decision boundaries while leaving recoverable structure in the representation. Prior work has shown that forget classes can be recovered, but existing approaches require real forget or retain samples, auxiliary data, or reference checkpoints. We study class relearning in a strictly source-free setting, asking whether a forget class can be recovered through a classifier-head update using only the unlearned model. Our approach rests on a theoretical analysis establishing a sufficient alignment condition under which a single gradient step on a synthetic probe set increases the expected logit margin of the forget class. Building on this, we propose a white-box Source-Free Relearning Audit (SFRA), which generates candidate embeddings in representation space and uses model-guided confidence filtering to construct high-confidence retain probes and low-confidence boundary-adjacent probes that are relabelled as the forget class. Gaussian sampling and Softmax confidence are used by default, while ablations with alternative proposal distributions and uncertainty criteria show that recoverability is not specific to these choices. To quantify recoverability, we introduce the Relearning Score (RS), which jointly measures forget-class recovery and retain-accuracy preservation, and report class-matched $\Delta$RS relative to a retrained reference. Experiments on CIFAR-10, CIFAR-100, and TinyImageNet with ResNet-18, ViT-B/16, and Swin-T show that several unlearning methods exhibit substantial source-free recoverability, and that for a subset of methods this recoverability exceeds the matched retrained reference.
Combinatorics
Optimal girth-dependent bounds for the Bethe approximation of the permanent
For an $n\times n$ nonnegative matrix $A$, the Bethe permanent, which is computable in deterministic polynomial time, satisfies the tight universal comparison \[\operatorname{Bethe}(A) \leq \operatorname{per}(A) \leq 2^{n/2}\operatorname{Bethe}(A).\] The lower bound, due to Gurvits, is attained on forests. The upper bound, due to Anari and Rezaei, is attained by the adjacency matrix of a disjoint union of $4$-cycles. Confirming a conjecture of Anari, we provide an optimal girth-dependent refinement of the above comparison. More precisely, we show that if the bipartite support graph of $A$ has girth at least an even integer $g \geq 4$, then \[\operatorname{Bethe}(A) \leq \operatorname{per}(A) \leq 2^{2n/g}\operatorname{Bethe}(A).\] The upper bound is attained by the adjacency matrix of a disjoint union of $g$-cycles.
Read the full abstract
Image and Video Processing
Perceptually Regularized Diffusion Model for Image Super-Resolution
Image super-resolution, which aims to reconstruct high-resolution images from their low-resolution observations, is fundamental to medical imaging, remote sensing, surveillance, microscopy, and scientific visualization. Traditional model-based methods formulate super-resolution as an inverse problem with hand-crafted regularization priors. While interpretable and theoretically grounded, they rely on fixed assumptions and require computationally intensive iterative solvers. Deep learning methods offer data-driven flexibility by learning nonlinear mappings from low- to high-resolution images, among which diffusion models have achieved particularly impressive perceptual quality. However, the standard diffusion training objective is a pixel-domain noise-prediction loss that does not explicitly enforce perceptual fidelity, which can lead to oversmoothing and loss of fine image structure. To address these limitations, we propose a perceptually regularized diffusion framework that incorporates prior knowledge through perceptual-loss-based regularization, improving training convergence and encouraging the recovery of meaningful image features. Experiments on benchmark datasets demonstrate improved perceptual quality and competitive distortion metrics, highlighting the effectiveness of regularization for diffusion-based super resolution.
Read the full abstract
Computation and Language
How Output Format Confounds Data Quality and Capability in Instruction Tuning
Instruction-tuning data are judged by quality metrics, and tuned models are judged by benchmarks, but both judgments pass through an output interface: the surface format in which an answer is written. Using gradient signatures across 12 tasks, four semantically equivalent interfaces, three model families, and controlled corruptions, we show that this interface confounds both measurements. Spectral statistics such as effective rank are provably invariant to interface rotation and empirically blind to semantic corruption, while the direction of the update carries the quality signal. The interface-varying residual is not noise: it identifies each unit's own target task perfectly across all three families. Capability itself is stored relative to the training interface: a skill that raises accuracy by more than 40 points under the training format can be nearly invisible under every other, and correcting a single generation budget flips the measured effect of fine-tuning on GSM8K from a gain into a large loss. Pre-registered interventions delimit where this geometry stops short of control. Data quality and model capability are interface-conditioned quantities, and current practice often reports the interface instead of the content.
Read the full abstract
Computational Finance
Insights on Time-consistent Deep Hedging under Elicitable Dynamic Risk Measures
We study deep hedging where the objective is expressed in terms of a dynamic risk measure, under which sequential decisions are time-consistent. We tackle the problem of basket option hedging. We show that the approach is feasible and can be used conveniently in the presence of more complex state spaces with higher dimension than what was previously test in the literature. We rely on the conditional elicitability of spectral risk measures to represent the optimization objective. We provide insights on how the choice of scoring function impacts the training of the hedging agent. We also propose an adapted reinforcement learning (RL) algorithm to solve the problem, which contains additions that are crucial to a successful training of the deep RL agent, and without which the agent fails to converge to proper solutions. The time-consistent hedging strategies are also benchmarked against deep hedging approaches relying on static risk measures leading to precommitment.
Read the full abstract
General Economics
What Would it Cost to End Extreme Poverty?
We study poverty minimization via direct transfers, framing this as a statistical learning problem while retaining the information constraints faced by real-world programs. Using nationally representative household consumption surveys from 34 countries that together account for 76% of the world's poor, we estimate that reducing the poverty rate to 1% (from a baseline of 13%) would cost $211 B nominal per year. This is 4.0 times the corresponding reduction in the aggregate poverty gap, but only 19% of the cost of universal basic income. Extrapolated globally, the results imply a cost of 0.28% of global GDP to (approximately) end extreme poverty.
Read the full abstract
Computer Vision
POI-Loc: A Fine-Grained POI Localization Benchmark and an Asymmetric Global-to-Local Matching Method
Point-of-interest (POI) localization matches user-provided storefront close-ups to the same shops in wide, geo-tagged vehicle-mounted street views. POIs may change while the surrounding scene stays similar, so scene-level recognition alone cannot establish POI identity. Differences in target scale and capture domains further challenge matching. We introduce POI-Loc, to our knowledge the first benchmark dedicated to this asymmetric, fine-grained POI localization task. Many visual place recognition methods represent each image with a single global vector, which tends to dilute fine-grained features of small storefronts amid background clutter. We propose GLAM (Global-to-Local Asymmetric Matching) to combine global and local evidence. In stage one, a single attention-pooled query probe is matched against compact reference region tokens via learnable soft top-k interaction, with the resulting local similarity fused with global similarity for retrieval. Stage two reuses query region tokens before attention pooling and stored reference tokens for mutual-nearest-neighbor re-ranking. GLAM surpasses both global and two-stage baselines on Recall@1/5/10 and mAP, with about $5\times$ smaller re-ranking features and $280\times$ lower per-pair matching cost than FoL. The benchmark and code will be released at https://github.com/roadhan/glam.
Read the full abstract
Systems and Control
Seed-Anchored Budget-Bounded Graph Rendering for Question Answering on Industry-Standard Power-Grid Information and Exchange Models
Large language model question answering over power-grid models must respect a fixed context budget. We introduce seed-anchored graph rendering, a deterministic method that prioritizes query-local graph evidence without adding method-specific tuned or learned parameters beyond the shared hop bound and context budget. The method provides a checkable condition under which predefined seed-local answer-bearing render units are preserved in a greedy bounded-context prefix. We evaluate the approach on Common Information Model (CIM) network models exchanged through the Common Grid Model Exchange Standard (CGMES). On two budget-binding CGMES encodings, naive descriptions-first rendering retains local evidence for every single-hop item but only 0.12 and 0.00 of multi-hop items, whereas seed-anchored rendering retains all such evidence. On a preregistered fresh 100-item bank from the SmallGrid topology family, accuracy rises from 0.450 to 0.970 under a fixed 8,000-character context budget. Under a common retrieval and rendering pipeline, the standards-native seed-anchored graph matches or exceeds extracted graph representations produced by LightRAG, Microsoft GraphRAG, and HippoRAG, while avoiding LLM graph-construction tokens. The results are specific to the evaluated CIM/CGMES models, reader, and context budget; they concern budget-bounded retrieval rather than general question answering.
Read the full abstract
Systems and Control
Efficient Sensor Fusion Through Covariance-Constrained Observation Decimation (CCOD)
Observation decimation is frequently employed in state estimation to reduce sensing, communication, and computational requirements, but decreasing the measurement assimilation frequency increases estimation uncertainty. Selecting an appropriate observation decimation factor therefore requires accurately predicting the resulting estimator performance. While the discrete algebraic Riccati equation (DARE) provides the steady-state estimation-error covariance for standard linear time-invariant Kalman filters, it is not directly applicable to estimators employing decimated measurement updates. Existing approaches address this limitation through lifted system representations or periodic Riccati equation formulations, both of which incur additional computational complexity. This paper presents a covariance-constrained observation decimation (CCOD) framework that reformulates the DARE inputs using equivalent decimated system and process-noise matrices that capture covariance growth between measurement updates. The proposed reformulation enables direct prediction of the steady-state estimation-error covariance through a single DARE evaluation without increasing the system dimension or solving coupled periodic Riccati equations. The resulting covariance prediction is used to determine the maximum observation decimation factor that satisfies a prescribed estimation uncertainty bound. Validation using a high dimensional linear time-invariant system and a space object tracking application demonstrates that the proposed approach accurately predicts steady-state estimator performance while reducing the measurement assimilation frequency required to satisfy specified covariance constraints.
Read the full abstract
Quantum Gases
Bell inequality violation with momentum-entangled massive particles
Bell's theorem revealed the fundamental incompatibility between the predictions of quantum mechanics and local realism. Bell inequality violations have since demonstrated quantum nonlocality using photons and internal states of massive particles, but never using their motional states. Here we report the first Bell inequality violation in the motional states of massive particles. Using momentum-entangled pairs of metastable helium atoms manipulated by matter-wave interferometry, we measure a Clauser-Horne-Shimony-Holt (CHSH) Bell parameter of $S = 2.52 \pm 0.17$, violating the CHSH-Bell inequality ($S \le 2$). Our work completes a long-standing objective in quantum atom optics by extending Bell tests from internal quantum variables to the external degrees of freedom of massive particles, opening a new regime for exploring quantum nonlocality in matter waves and for investigating the interplay between quantum mechanics and gravity.
Read the full abstract
Materials Science
Symmetry-enforced third-order nonlinear thermal Hall effects in altermagnets
Thermal Hall effect (THE) is a powerful probe of material properties, even in insulators. Here we investigate the thermal response of altermagnets by developing a theory on Berry curvature driven nonlinear THE from both electrons and magnons. We identify symmetry conditions under which the third-order THE dominates while linear and second-order contributions vanish. Notably, d-wave and i-wave altermagnets with out-of-plane Neel order satisfy these conditions, whereas in-plane order yields a dominant linear THE. Using KV2Se2O (a d-wave altermagnetic metal) and MnF2 (an altermagnetic insulator) as concrete examples, we show nonzero third-order nonlinear THE from electrons and magnons, respectively, both exhibiting a pi-periodic dependence on the direction of temperature gradient. These symmetry-guaranteed Berry curvature phenomena provide a diagnostic for altermagnetism in candidate materials and enable determination of the Neel vector orientation.
Read the full abstract
Cryptography and Security
C$^2$T-OpenMax: A Novel Open-Set WiFi RF Fingerprinting Method via Center Constrained Learning and Confidence-Guided Tail Modeling
Radio frequency fingerprinting (RFF) enables device authentication from transmitter-specific hardware imperfections, but practical deployment requires cross-environment open-set recognition. Data augmentation improves environmental generalization, yet may yield dispersed, low-confidence known-class representations that distort the class statistics used by OpenMax. To address this problem, we propose C$^2$T-OpenMax, an enhanced OpenMax framework combining center-constrained learning with confidence-guided tail modeling. The former improves intra-class compactness, making class-wise representations more suitable for distance-based modeling. The latter retains only correctly classified, high-confidence logits for mean activation vector estimation and Weibull fitting, reducing bias from ambiguous boundary samples. Together, the two modules refine representation geometry and OpenMax construction while preserving augmentation benefits. Experiments on a public WiFi CSI dataset show that C$^2$T-OpenMax achieves the highest open-set accuracy in seven of eight location groups and outperforms all baselines in area under the receiver operating characteristic curve (AUROC) and open-set classification rate (OSCR) across every tested openness level. Under the largest-openness setting, it improves accuracy by 12.31%, AUROC by 0.0887, and OSCR by 0.0856 over the augmented OpenMax baseline.
Read the full abstract
Machine Learning
Train What You Deploy: Closing the MLP Reachability Gap in Low-Rank Clone Distillation
A compressed student has two shapes that need not agree: the weight it deploys at inference and the weight family its training can reach. We show that a state-of-the-art weight-inheritance distiller, Low-Rank Clone (LRC), deploys a full-width student MLP but ties training to a teacher-induced slice, leaving 62.5-81.4% of each deployed matrix's independent linear degrees of freedom unreachable-paid for at inference, never trainable. Our principle is one line: train what you deploy. From the identical LRC warm start, we make the training object the entire deployed matrix, with no change in deployed shape, deployed parameter count, or inference FLOPs, via two mergeable realizations (Dense-LRC and CORE-LRC) that both collapse to one deployed weight. This recovers stranded capacity: taking the stronger realization per teacher, +2.36/+2.71/+10.45 Avg9 over matched-budget plain-LRC baselines across three teachers (Llama3.2-3B, Llama3.1-8B, Qwen2.5-3B), with the largest gain on the widest teacher (Qwen), where it reaches the original recipe's approx. 20B-token accuracy at 10B tokens (2x token efficiency); there the strictly same-lineage arm still recovers +6.39, the fully controlled figure. Controls strongly support attributing the gain to the enlarged reachable set, rather than to added parameters or the recipe. From approx. 10B distillation tokens plus a short SFT, a half-parameter 1.5B student matches its approx. 9T-token teacher's 9-task macro-average, within evaluation noise and with a residual MMLU deficit, and a 2.7B student beats Meta's own official compression of Llama3.1-8B at ~900x fewer compression tokens (a token count under unmatched recipes, not a compute claim). All results are from single-seed runs on the LRC backbone.
Read the full abstract
Programming Languages
Unifying Function- and Argument-First Bidirectional Type Systems
Bidirectional typing mixes type synthesis and type checking into a single process. Existing bidirectional type systems can be classified into two styles based on whether, given a function application, a bidirectional typing algorithm synthesizes the function's type first and typechecks the argument against the synthesized argument type, or it synthesizes the arguments' types first and typechecks the function against the synthesized arguments' types. We call the former _function-first_ and the latter _argument-first_. Not only do the two styles significantly differ in how the type systems and typing algorithms are formalized, but also they lead to incompatible typeabilities, forcing a language designer to select one style and to give up the other's typeabilities. In this paper, we unify the two styles and develop \lang with a new bidirectional type system for higher-rank polymorphism. Key ideas of the unification are twofold. Each function application is annotated with a bit of information to represent whether function- or argument-first typing is used, to allow a language designer (or even a programmer) to switch between the two styles at their discretion. We reformulate the function- and argument-first type systems by using ideas from colored types and boxy types, which can specify which part of a type should be synthesized or used for checking in a flexible manner. We also develop a typing algorithm based on the worklist approach by Zhao et al. The (declarative) type system of $\lambda^{BH}$ is shown to be sound and to subsume two representative function- and argument-first systems. Our typing algorithm is shown to be sound with respect to the type system of $\lambda^{BH}$ and complete with respect to representative function- and argument-first systems. We mechanically prove the metatheorems using the Abella theorem prover.
Read the full abstract
Computer Vision
InstEditSeg: Instruction-Driven Image Editing for Polyp and Skin Lesion Segmentation
Accurate segmentation of polyps and skin lesions is pivotal for clinical diagnosis, yet existing methods struggle with low contrast, ambiguous boundaries, and cross-domain distribution discrepancies. Discriminative networks and most diffusion-based segmentation approaches predict standalone binary masks, leaving the visual priors of large-scale pretrained generative models largely unexploited. We propose InstEditSeg, a unified generative framework that reformulates medical segmentation as an instruction-driven image editing problem. Instead of emitting a mask, the model renders a color-coded overlay on the original image, conditioned on a textual instruction, so that the edited output aligns with the natural image distribution learned by latent diffusion models and mitigates the domain gap between natural and medical imagery. To recover fine anatomical structures, we introduce DINOv3 as an auxiliary visual encoder and a DINO Feature Guidance Block that builds a multi-scale feature pyramid. The pyramid is fused into the diffusion U-Net by channel concatenation and zero-initialized convolution so that hierarchical discriminative priors can be injected without perturbing the pretrained weights. A dual-branch classifier-free guidance strategy requiring only two forward passes per denoising step reduces inference cost. On polyp and skin lesion benchmarks the framework achieves accuracy competitive with strong discriminative baselines, and it further demonstrates concrete advantages of the generative formulation: notably better cross-domain generalization on unseen data, more complete multi-lesion segmentation, instruction-conditioned task control, and sampling flexibility. We also analyze the strengths and limitations of the paradigm, including its color sensitivity and unsupported attribute-conditioned selection. Code is available at: https://github.com/wincharm001/InstEditSeg.
Read the full abstract
Robotics
Design and Validation of a Lightweight, Low-Profile Powered Knee Prosthesis with Quasi-Direct Drive Actuation
Fully-powered knee prostheses, unlike traditional passive knees, can perform controlled positive work, reducing the need for compensatory behaviors by users during energy-intensive activities. While quasi-direct drive (QDD) actuators provide superior torque control, backdrivability, and acoustic noise properties compared to traditional highly-geared actuators, prior QDD prototypes have been too heavy and bulky for commercial translation. In this work, we present the design and validation of a new lightweight (2.6 kg) and low-profile (24.5 cm tip-to-tip build height) QDD knee prosthesis. By optimizing an 18 to 1 two-stage transmission alongside thermal and structural finite-element analyses, we significantly reduce device mass while enabling a peak torque of 145 Nm. Through benchtop tests, we validate the device's high output torque, low backdrive torque (1 Nm), and its precision position and torque control capabilities. We also demonstrate biomimetic kinematics and peak knee extension torques (within one standard deviation of able-bodied references) during both level-ground walking and sit-stand transitions performed by three participants with transfemoral amputation and varying K-levels. By meeting or improving upon the mass, build height, peak torque, and acoustic noise of a leading commercial powered knee, this work establishes the clinical viability of emerging QDD prostheses that promise improved dynamic performance for their users.
Read the full abstract
Computer Vision
InsightSeg: Reusing Correction Insights for Guideline-Consistent Segmentation
Guideline-consistent semantic segmentation requires more than category recognition, as real-world labeling policies demand fine-grained, task-specific decisions. Recent multi-agent refinement systems improve compliance with such textual guidelines by detecting and correcting errors. However, they are stateless: feedback from the critiquing agent is discarded, causing the same guideline-specific mistakes to be repeatedly rediscovered and corrected across the dataset at the cost of additional refinement. We introduce InsightSeg, an episodic memory mechanism that converts successful correction episodes into reusable, visually grounded insights. A meta-analyzer distills each qualifying episode into directive natural-language insights and anchors them to the local image regions that caused the error using patch-level visual concept vectors. On subsequent images, these concepts are matched against dense patch embeddings to retrieve relevant insights, which condition the segmenting agent before making its first prediction. This shifts the system from correcting recurring errors to preventing them, improving segmentation quality before any refinement occurs. Across Waymo and Cityscapes, InsightSeg improves both first-pass and final guideline-consistent segmentation performance while requiring fewer refinement steps, demonstrating that multi-agent refinement can become more accurate and efficient by drawing on past correction experience.
Read the full abstract
Materials Science
Resolving the structural stability of the hydrogen storage borohydride NaCa(BH4)3 via data-driven screening and first-principles lattice dynamics
Equimolar NaCa(BH$_4$)$_3$ offers a theoretical hydrogen capacity of 11.24 wt.% and a decomposition enthalpy expected to fall between those of NaBH$_4$ and Ca(BH$_4$)$_2$, but it has never been prepared and no crystal structure has been reported. Predictions for it have so far been built within the perovskite family that its heavier homologues adopt. Here that assumption is removed. Six candidate frameworks were assembled from three independent sources — experimentally determined ABX$_3$ borohydrides, a distorted perovskite from data-driven structure prediction, and an unbiased search over a structural database in which all 2238 generated candidates were relaxed with none excluded — and at fixed charge-neutral composition the cation arrangement of every framework was enumerated exhaustively, 420 decorations reducing to 118 symmetry-inequivalent configurations, screened with a machine-learning potential and settled from first principles. The most stable structure is not a perovskite. It is a monoclinic framework of space group Cm, reached only by the unrestricted search, at $-$4.185640 eV/atom, 7.67 meV/atom below the best framework available beforehand; two chemically unrelated donor prototypes converge on it to 0.076 meV/atom, and its ordered cation arrangement is the ground state of its own series. Its phonon spectrum carries no imaginary mode at any wavevector the supercell resolves exactly and its relaxed-ion elastic tensor is positive definite, whereas the orthorhombic perovskite candidate is unstable to $-$2.401 THz. That contrast supplies a physical reason for the reported failure to obtain this composition in perovskite form, and the simulated diffraction pattern reported here identifies the predicted framework by seven reflections that neither parent phase nor the competing framework produces.
Read the full abstract
Computer Vision
Who Drives the Probability Game of VLMs? A Temporal Causal Drive Evaluation Framework
Vision-language models (VLMs) are increasingly evaluated on complex image and video understanding tasks, yet conventional metrics primarily assess final-answer quality and reveal little about how different information sources shape the generation process. We propose a causal and temporal evaluation framework that traces the evolving roles of visual input, question text, and generated prefixes during autoregressive decoding. Grounded in a Structural Causal Model, we use interventions and backdoor adjustment to derive three step-indexed causal-drive metrics—Visual Causal Drive (VCD), Question Causal Drive (QCD), and Prefix Causal Drive (PCD)—for characterizing source-specific generation patterns without requiring reference answers. Experiments on Qwen3-VL-8B-Instruct across MAVIS, LLaVA-Video-178K, and MiraData, together with cross-model validation on InternVL2-8B, reveal a consistent transition from stronger early question and visual guidance toward increasing reliance on generated prefixes. Randomized-intervention validation shows that QCD and PCD reduce recovery error over observational PMI baselines by 34.8% and 47.1%, respectively. On VLMBias, the prefix–visual imbalance score achieves 0.767 AUROC and 0.873 AUPRC for distinguishing prior-driven from visually grounded generations. These results show that causal-drive trajectories provide complementary source-level diagnostics for multimodal generation.
Read the full abstract
Machine Learning (Statistics)
Posterior Tempering Explains Variance Inflation in Linear and Generalized Linear Thompson Sampling
We study a variant of the Thompson Sampling (TS) algorithm, called $\alpha$-TS, for solving stochastic generalized linear bandit problems. Existing analyses of TS require inflating the posterior variance to derive near-optimal regret guarantees. We formalize the idea of variance inflation by introducing $\alpha$-TS that uses a fractional or $\alpha$-posterior instead of the standard posterior. Our main contribution is to identify general regularity conditions on the prior and reward distributions that enable a regret analysis of $\alpha$-TS without assuming any tractable approximation of the posterior distribution, unlike previous works. For a specific choice of $\alpha \propto d^{-1}$, our general regret bound yields the best known regret bound of $O(d^{3/2}\sqrt{T}\log T)$ for both the exponential and sub-Gaussian families of reward distributions. We further provide an $\alpha$-dependent lower bound showing that the regret constant depends on the product $\alpha d$, and that when $\alpha \propto d^{-1}$ the regret scales as $\Omega(d^{3/2}\sqrt{T})$, explaining the origin of the $d^{3/2}$ factor in the upper bound. Our proof technique adapts and combines recent advancements in the analysis of linear bandit problems with first- and second-order posterior concentration theory from the Bayesian statistics literature.
Read the full abstract
Combinatorics
New Upper bounds on the Mondrian Art Problem
We present a new upper bound on the defect of the Mondrian Art Problem. The Mondrian Art Problem asks for a partition of an $n \times n$ square with rectangles of distinct dimensions such that the difference (defect) between the largest and smallest rectangle areas is minimized. We prove that for any $n \times n$ square, there exists a partition with defect $O(n^{5/6})$, improving upon the previously conjectured $O (n/\log n)$ upper bound. We also implement an algorithm that provides empirical evidence supporting our theoretical bound.
Read the full abstract
Computer Vision
Linear Fusion MultiDiffusion for Fast Training-Free Spherical Panorama Generation
We propose LF-MultiDiffusion, a training-free panorama generation method that extends MultiDiffusion to support linear projections between target and reference image spaces. Our key idea is to reformulate latent aggregation as a regularized least-squares problem and solve it efficiently with a Krylov-based iterative solver inside the denoising loop. This formulation enables denser and more natural mappings than prior training-free methods, yielding more stable generation with far fewer perspective views. As a result, LF-MultiDiffusion reduces the number of image generator evaluations during denoising and significantly improves inference efficiency. Experiments show that LF-MultiDiffusion achieves better visual quality, text alignment, and panoramic consistency than the strongest training-free baseline, while providing a 15.36$\times$ speedup. Our project page is available at: https://ahykw.github.io/lfmd.
Read the full abstract
Logic
Baumslag-Solitar Subgroups Obstruct Model Companions for Fields with Group Actions
We prove that if a group $G$ contains a Baumslag-Solitar group $\mathrm{BS}(m,n)$, with $mn\neq0$, then the theory of fields with a $G$-action has no model companion. In particular, every group containing $\mathbb{Z}^2\cong\mathrm{BS}(1,1)$ has no model companion for its field actions, resolving a conjecture of Beyarslan and Kowalski. Consequently, there are no model companions for field actions of $\mathbb{Q}^2$, Thompson's groups $F,T,V$, or Higman's group. Our argument adapts Hrushovski's method for two commuting automorphisms. The key modification is the cyclotomic condition $\theta_q$, which removes the need to prescribe a non-trivial action on a root of unity and thereby makes Hrushovski's method applicable after passing from a subgroup to an ambient group.
Read the full abstract
Instrumentation and Methods for Astrophysics
A measurement-based approach to EPFD calculation, to quantify the impact of satellite mega-constellations on low-frequency radio astronomy
Context: Satellite mega-constellations generate Unintended Electro-Magnetic Radiation (UEMR) impacting low frequency radio astronomy. The Radio Regulations of the International Telecommunications Union Radiocommunication Sector (ITU-R) contain the basis for addressing UEMR, but enforcement mechanisms are absent. Aims: To adapt compatibility study methods based on satellite constellation simulations, in particular the Equivalent Power Flux-Density (EPFD) framework, to radio telescope measurements. Methods: We adapt the ITU-R EPFD calculation framework to measurement data obtained from all-sky interferometric imaging. We address the conceptual differences between forward-model EPFD calculations and measurement-based approaches. In particular, we consider low frequency systems, which are typically wide field-of-view and interferometric instruments. Results: For the first time, we demonstrate that all-sky interferometric observations enable a direct adaptation of the EPFD formalism to measurement data. We thus confirm previous estimations (Di Vruno et al. 2023) that the resulting measurement-based EPFD distributions exceed the radio astronomy interference threshold levels defined in Recommendation ITU-R RA.769-2 in 50-70% of samples. These exceedance fractions are well above the 2% single-system data-loss criterion in Recommendation ITU-R RA.1513-2. Expressed using the conventional 2% compatibility margin, the corresponding margins are negative, ranging from -18.6 to -16.3 dB, equivalent to a required uniform attenuation of 16.3-18.6 dB. Conclusions: Measurement-based implementations provide a practical pathway toward verification and long-term monitoring at low radio frequencies, which could form an important component of enforceability. We suggest instrumentation approaches to support measurement.
Read the full abstract
Nuclear Theory
Spin transport in intermediate-energy heavy-ion collisions
In this mini-review, we provide a brief status report on investigating spin transport phenomena in intermediate-energy heavy-ion collisions by simulating solutions of the spin- and isospin-dependent Boltzmann-Uehling-Uhlenbeck (SIBUU) transport equation using the test-particle method. We outline the physics foundation and technical approach, summarize our main results and identify key challenges in further studying spin transport within the SIBUU framework. As examples, we show how the global and local spin polarizations of nucleons, the spin splitting of nucleon collective flows as well as flows of light clusters at different spin states can be used to explore interesting new physics associated with the nuclear spin-orbit potential in dense neutron-rich medium. The spin-orbit potential and the rigorous angular momentum conservation are also shown to affect spin-averaged observables. Hopefully the new findings and challenges identified here will stimulate further studies both theoretically and experimentally on spin transport in intermediate-energy heavy-ion collisions.
Read the full abstract
Quantum Physics
Entanglement, anti-flatness, and nonlocal nonstabilizerness: a unified perspective from entanglement spectrum
Entanglement and nonstabilizerness capture distinct aspects of quantum complexity, yet their relation through the entanglement spectrum remains poorly understood. Here we develop a spectral framework for bipartite nonlocal nonstabilizerness. We introduce a generalized anti-flatness and derive upper and lower bounds on the nonlocal stabilizer Rényi entropy (SRE) in terms of Rényi entanglement entropy and spectral non-uniformity. We further reduce the local-unitary optimization to a single-unitary problem and prove that the ordered Schmidt reference state is a local minimum of the SRE for integer $\alpha\geq2$. Applying these results to exponentially and algebraically decaying spectra reveals parametrically distinct relations between entanglement and nonlocal nonstabilizerness. For broad spectra, we introduce a dyadic-shell sandwich construction that determines the asymptotic SRE scaling. At one-dimensional conformal critical points, it yields a universal hierarchy of double-logarithmic scaling laws for integer $\alpha\geq2$. Our spectral bounds and dyadic-shell sandwich construction provide general tools for analyzing nonlocal SRE, offering a flexible framework that can be applied to a wide range of entanglement spectra in quantum many-body systems.
Read the full abstract
Artificial Intelligence
ClaimReceipt: Verifying Evidence Sufficiency and Coverage in Agent Evaluations
Agent evaluations face two distinct evidentiary questions: whether a reported claim is recomputable from retained evidence (sufficiency), and whether the retained records cover the committed experiment set (coverage). Generic logs and hash-linked transcripts answer neither reliably. We introduce ClaimReceipt, a claim-relative receipt specification and selective verifier that binds typed transaction evidence to a signed experiment manifest and returns PASS, INVALID, or INCONCLUSIVE per claim. We freeze the specification before implementation (SHA-256 18d109...b81). On 1,392 historical buyer–seller records, a CR-2 verifier reproduces all five manually labeled audit verdicts, exactly replays 600 deterministic and 792 post-generation records, makes every one of 13 declared field groups non-redundant under tested ablations, and returns the expected result on 11/11 semantic faults with 0/8 false positives. We then run a separate prospective CR-3 epoch: 30 assignments are committed before inference, terminal receipts are signed and chained, and private evidence is encrypted for an auditor. Complete evidence yields coverage and accounting PASS; withholding one terminal receipt returns INCONCLUSIVE_COVERAGE, while withholding all private openings preserves coverage and protocol verification but makes economic claims inconclusive, exactly matching a preregistered prediction. Receipt instrumentation adds 0.021% of model-inference time and 9.9 KB per transaction. A specification-legibility probe indicates that our own frozen specification is not yet unambiguous to an independent reader. Claim verification therefore requires both claim-sufficient evidence and a committed universe against which omissions become visible.
Read the full abstract
Machine Learning
CAHR-Net: Condition-Adaptive Hysteresis Reconstruction for Compact and Interpretable Magnetic Core Loss Modeling
Magnetic core loss originates in the hysteresis loop: the energy dissipated per excitation cycle equals the loop area, and frequency, temperature, and waveform shape set the loss by reshaping the loop geometry. Most existing models let these conditions act only on a terminal scalar - empirical equations fold them into fitted exponents, and data-driven predictors append them to encoded features - so no intermediate hysteresis representation remains for the conditions to reshape. This paper proposes CAHR-Net, a condition-adaptive hysteresis reconstruction network that injects the operating conditions where they physically act. It preserves the interpretable chain from flux density waveform to magnetic field reconstruction, loop-area integration, and power loss estimation, and uses feature-wise linear modulation to inject frequency, temperature, and waveform statistics into the intermediate reconstruction representation. A matched large-batch training protocol based on AdamW, cosine scheduling, and a staged reconstruction-to-power-loss objective is also reported, because the modulation pathway takes effect only within it. On the MagNet final A-E material protocol, CAHR-Net attains an average p95 relative error of 6.89% with only 1874 parameters, the lowest among all compared methods, together with a lower worst-material p95 than the strongest black-box solution at about 48x fewer parameters; it reduces the average p95 of the physical reconstruction backbone from 7.47% to 6.89% and the p95 of material D, the most difficult material, from 16.40% to 14.87%. Ablation and condition-slice analyses attribute the improvement to the coupling of physical loop reconstruction, structured condition modulation, and the matched optimization trajectory.
Read the full abstract
Number Theory
Jacquet-Zagier treatment of the beyond endoscopy trace formula for $\mathrm{GL}_2$
We begin the study of the beyond endoscopic trace formula for $\mathrm{GL}_2$ over $\mathbb{Q}$ attached to any symmetric power representation $\sigma_k$ of the dual group $\mathrm{G}L_2(\mathbb{C})$. For an adelic function that incorporates the $L$-functions $L(s_B,\pi,\sigma_k)$ through the basic functions at all the finite places, we integrate the cuspidal kernel against a corresponding Eisenstein series $E(g,s)$ and realize the trace formula as a residue at $s=1$, replacing Arthur's truncation operation by a continuously deformed trace formula. We argue Poisson summation on the trace variable of the Hitchin-Steinberg base and show that the dominant term of the elliptic part admits meromorphic continuation to $\mathfrak{R}(s_B) \geq 0$ with a pole of order $k$ at $s_B =1$.
Read the full abstract
Combinatorics
Rainbow Berge Hamiltonicity in edge-colored random $k$-uniform hypergraphs
Let $H \sim H^{k}_c(n,p)$ be an edge-colored random $k$-uniform hypergraph on the vertex set $[n]$, where each edge $e \in \binom{[n]}{k}$ is included independently with probability $p$ and is uniformly and independently assigned a color from the color set $[c]$. For $k = 2$, Ferber and Krivelevich (2016) established that if $c = (1+o(1))n$ and $p = (\log n + \log \log n + \omega(n))/n$, then with high probability the edge-colored random graph $H \sim H^2_c(n,p)$ contains a rainbow Hamilton Berge cycle. Subsequently, Bal, Berkowitz, Devlin, and Schacht (2021) determined the threshold for the appearance of a (non-rainbow) Hamilton Berge cycle in random $k$-uniform hypergraphs. In this paper, we generalize the results to all integers $k \ge 3$. We prove that if $c = (1+o(1))n$ and $p = (k-1)! \frac{\log n + \log\log n + \omega(n)}{n^{k-1}}$, then with high probability $H \sim H^{k}_c(n,p)$ contains a rainbow Hamilton Berge cycle. Furthermore, both conditions on $c$ and $p$ are asymptotically tight. \noindentKey words: Rainbow subgraph, Hamiltonicity, Berge cycle, Random hypergraph.