Searcharxiv⌕ Search

arXiv subjects

Shuwei Wang

Publications and source records attributed to Shuwei Wang.

11 recordsLinked to original sources

Multi-Horizon Future Discovery for Physics-Informed Exploration

Exploration in physical control environments requires agents to identify actions whose consequences reveal previously unexplored aspects of the underlying dynamics. However, many intrinsic motivation methods rely on immediate prediction errors, state novelty, or local physical changes, which may overlook informative outcomes that emerge across extended temporal horizons. We investigate whether learning structured representations of reachable futures can provide a more effective basis for exploration. To this end, we introduce Hamiltonian Temporal Contrastive Curiosity (HTC$^2$), a framework that combines multi-horizon temporal representation learning with Hamiltonian phase-space structure. A horizon-conditioned contrastive critic learns temporal relationships from future-state pairs sampled within the same episode. The distance between positive-pair representations is then used as an intrinsic reward, encouraging the agent to explore futures that remain insufficiently organized in the learned representation. To incorporate information about physical dynamics, we additionally modulate this reward using bounded multi-step Hamiltonian variation, rather than directly rewarding changes in the Hamiltonian itself. We integrate HTC$^2$ with both Soft Actor-Critic (SAC) and Proximal Policy Optimization (PPO), and evaluate it across six DeepMind Control Suite tasks. Comparisons with ICM, RIDE, E3B, Plan2Explore, and a single-step Hamiltonian curiosity baseline are complemented by state-coverage evaluations, component ablations, and phase-space diagnostics to characterize the contributions of temporal learning and physical structure to exploratory behavior.

cs.LG↗

A technical note on universal formula pcas

We record some interesting technical caveats found when using universal formulae to formulate pcas -- namely, that there are different ways to extract a (partial) function from a definable collection of pairs, and these choices have an impact on formula complexity.

math.LO↗

Synthesizing Physics Formulae with Transformers

Finding a compact formula that fits a set of input-output pairs and predicts outputs on unseen inputs is a fundamental problem in science. Symbolic regression automates the search for such formulae: search-based methods explore the space of possible formulae directly, while transformers pre-trained on synthetic data produce formulae of comparable quality substantially faster. Existing transformers, however, are prone to overfitting --- they find formulae that fit the training data well but do not extrapolate to input ranges unseen during training. We address this by shaping the set of formulae used to train a transformer, and show that the resulting formulae extrapolate substantially better. Fine-tuning the transformer on data with noise-corrupted target values further makes the synthesized formulae robust to noise in the observations. On SRBench and LLM-SRBench our transformer synthesizes a formula in about ten seconds and extrapolates better than all evaluated methods at a comparable budget. Search-based methods surpass our accuracy only when given one to three orders of magnitude more time.

cs.LG↗

An equiconsistency proof for $\mathrm{CZF} + V = L$

In many axiomatic set theories, Gödel's constructible universe $L$ is known as an inner model, that is, a definable class satisfying the same axioms (and containing the same ordinals). This gives a trivial proof that adding the axiom $V = L$ does not increase the consistency strength of the theory. In this paper, we shall look at a system of intuitionistic set theory known as $\mathrm{CZF}$, where $L$ fails to exhibit such nice properties. We will demonstrate that, here, the theory $\mathrm{CZF} + V = L$ is still equiconsistent with $\mathrm{CZF}$, but the proof will involve a much more complicated realisability model and a recursion-theoretic argument.

math.LO↗

GeoCo-SAVi: Geometry-Consistent Slot Attention for Explicitly Editable Object Representations

Object-centric video models represent scenes with slots, yet exposed geometry can vary in meaning with appearance. In Invariant Slot Attention (ISA), explicit position and scale can disagree with the decoded center and extent; edits can yield unexpected motion or resizing, and replacing appearance can shift geometry. GeoCo-SAVi promotes geometric authority and semantic alignment. Its spatially equivariant, object-wise decoder makes position and scale effective commands: changing them moves or resizes the rendered support. Factual position alignment ties position to the decoded center, and normalized attention overlap discourages duplicate allocation. Appearance transplantation aligns geometry semantics across objects, so recipient geometry governs layout while donor appearance supplies shape. On Obj3D, GeoCo-SAVi matches ISA reconstruction, reduces latent-position-to-decoded-centroid error by nearly 90%, and reduces appearance-induced size variation while producing the expected translation and scale responses. On 250 MOVi-C videos, it improves reconstruction and instance grouping over both same-protocol references, and video editing over STAITUS. GeoCo-SAVi transforms explicit geometry into compositional control, making both position and scale more readable and editable. Project page: https://GeoCo-SAVi.github.io/.

cs.CV↗

HamiFormer: Dual-Expert Diffusion Fields with Affine Symplectic Maps

Predicting smooth dynamics and collisions requires modeling continuous evolution and abrupt state changes. We introduce HamiFormer, a dual-expert diffusion field combining whole-window denoising with residual-corrected Hamiltonian propagation. Their mixed-state feedback attenuates the direct contribution of inherited autoregressive error: each mixed state guides subsequent propagation within the jointly refined window. Parallel Local Affine Scan (PLAS) amortizes iterative refinement across rectified-flow steps and evaluates derivatives in parallel across physical time. PLAS's affine symplectic maps achieve lower solver error and runtime than sequential explicit Euler in our evaluation. A Regime Model Tree specializes residuals and routing to balance typical-state accuracy against large tail errors. Our analysis gives conditions for physically consistent refinement and warm-start tracking, and finite-window error bounds under diffusion feedback. In 192-step evaluations, HamiFormer reduces normalized phase-space MSE by 26.3% against PhysiFormer on HamiBalls-1 and 21.4% against DiT on HamiBalls-2, with comparable model capacities. Disjoint-interval comparisons show the lowest late-horizon position and momentum errors among baselines on both datasets. Project page: https://hamiformer.github.io/.

cs.LG↗

Antichain of ordinals in intuitionistic set theory

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In this paper, we shall show that starting from two incomparable ordinals, one can construct canonical bijections from any arbitrary set to an antichain of ordinals, and consequently any subset of the given set can be defined using ordinals as parameters. This implies the surprising result that in the theory "$\mathrm{IKP} + {}$there exist two incomparable ordinals", the statements $\mathrm{Ord} \subseteq L$ and $V = L$ are equivalent.

math.LO↗

Some notes on plump ordinals

In this exposition, we attempt to formalise a treatment of Paul Taylor's notion of plump ordinals in weak intuitionistic axiomatic set theories such as IKP. We will explore basic properties of plump ordinals, especially in relation to Gödel's constructible universe $L$ and incomparable codings. As a quick application, we explain at the end how plump ordinals can be used to build a Heyting-valued model $V^\mathbb{H}$ from a classical $V \vDash \mathrm{ZFC}$ such that for some arbitrary, fixed $x \in V$ we have $V^\mathbb{H} \vDash \mathcal{P}{\left(\check{x}\right)} \in L$.

math.LO↗

FlashRecovery: Fast and Low-Cost Recovery from Failures for Large-Scale Training of LLMs

Large language models (LLMs) have made a profound impact across various fields due to their advanced capabilities. However, training these models at unprecedented scales requires extensive AI accelerator clusters and sophisticated parallelism strategies, which pose significant challenges in maintaining system reliability over prolonged training periods. A major concern is the substantial loss of training time caused by inevitable hardware and software failures. To address these challenges, we present FlashRecovery, a fast and low-cost failure recovery system comprising three core modules: (1) Active and real-time failure detection. This module performs continuous training state monitoring, enabling immediate identification of hardware and software failures within seconds, thus ensuring rapid incident response; (2) Scale-independent task restart. By employing different recovery strategies for normal and faulty nodes, combined with an optimized communication group reconstruction protocol, our approach ensures that the recovery time remains nearly constant, regardless of cluster scale; (3) Checkpoint-free recovery within one step. Our novel recovery mechanism enables single-step restoration, completely eliminating dependence on traditional checkpointing methods and their associated overhead. Collectively, these innovations enable FlashRecovery to achieve optimal Recovery Time Objective (RTO) and Recovery Point Objective (RPO), substantially improving the reliability and efficiency of long-duration LLM training. Experimental results demonstrate that FlashRecovery system can achieve training restoration on training cluster with 4, 800 devices in 150 seconds. We also verify that the time required for failure recovery is nearly consistent for different scales of training tasks.

cs.DC↗

Ring artifacts correction method in x-ray computed tomography based on stripe classification and removal in sinogram images

X-ray computed tomography (CT) is widely utilized in the medical, industrial, and other fields to nondestructively generate three-dimensional structural images of objects. However, CT images are often affected by various artifacts, with ring artifacts being a common occurrence that significantly compromises image quality and subsequent structural interpretation. In this study, a ring artifact correction method based on stripe classification and removal in sinogram images was proposed. The proposed method classifies ring artifacts into single stripes and multiple stripes, which were identified and eliminated using median filtering and multiphase decomposition, respectively. A novel algorithm combining median filtering, polyphase decomposition and median filtering was further developed to eliminate all forms of stripes simultaneously and effectively. The efficacy of the proposed method was validated through both simulated and experimental CT data. The study provides a novel perspective and integrated approach to addressing ring artifacts in X-ray CT. It will be of significant illuminating to a diverse readership, including radiologists, clinical researchers, and industrial scientists.

physics.med-ph↗

An ordinal analysis of CM and its extensions

In arXiv:0905.1675, Nik Weaver proposed a novel intuitionistic formal theory of third-order arithmetic as a formalisation of his philosophical position known as mathematical conceptualism. In this paper, we will construct a realisability model from the partial combinatory algebra of $Σ^1_1$-definable partial functions and use it to provide an ordinal analysis of this formal theory. Additionally, we will examine possible extensions to this system by adding well-ordering axioms, which are briefly mentioned but never thoroughly studied in Weaver's work. We aim to use the realisability arguments to discuss how much such extensions constitute an increase from the original theory's proof-theoretic strength.

math.LO↗