Search arXiv⌕ Search

arXiv subjects

Zhen Zhang

Publications and source records attributed to Zhen Zhang.

At least 37 records · Page 2Linked to original sources

CriticHack: Evaluating Visual Rewards Under Robot Policy Optimization

Learned visual reward models are increasingly used to optimize robot policies, yet a reward model can score an execution that acts on the wrong object as highly as one that completes the task. We show that optimizing such a reward can amplify these wrong-object failures while reward and task success both rise, so the signals a practitioner would normally monitor look healthy. We fine-tune every denoiser parameter of a diffusion policy against Robometer on a drawer task. Starting from a supervised policy with no prior reward exposure, five training runs raise task success by 10.2 percentage points and wrong-object failures by 10.9 points on 512 evaluation seeds, whereas five runs trained on the simulator's task-completion signal raise success without amplifying wrong-object failures (difference 9.2 points, 95% CI 5.6 to 13.0). The amplification recurs from a policy previously optimized against learned rewards, under the policy's native diffusion sampler, at matched distance from the initial policy, and across constrained-policy experiments with two critics and two optimizers. A tilt model explains when it occurs: under KL-regularized optimization, an outcome becomes more frequent whenever its expected reward under the initial policy exceeds the population average. Robometer separates successes from failures well overall (AUROC .81) but scores wrong-object failures slightly above successes (AUROC .37), so optimization raises both. The same model predicts the outcome shifts across 26 constrained settings (Spearman .89), including those in which task success falls, and Robometer's own published success-termination recipe inherits the error. A frozen outcome verifier redirects the same optimization toward the requested task.

cs.RO↗

AffectSim: A Controllable Interactive 3D Simulation Benchmark for Embodied Affective Perception

Existing affective benchmarks largely rely on fixed recordings, where observation conditions are predetermined before inference. Consequently, they mainly evaluate passive affect recognition while overlooking a key question for embodied agents: how to actively acquire informative affective evidence. We introduce AffectSim, a controllable interactive 3D simulation benchmark for embodied affective perception. AffectSim represents affective behaviors as replayable 3D episodes and separates the underlying behavior from how it is observed, enabling systematic control over distance, orientation, occlusion, scene geometry, and agent viewpoint. It contains 27,647 episodes across five emotion categories and 57 scenes. Across 24 frozen perception-model configurations, we show that observation quality substantially affects recognition. To examine whether active sensing can recover this gap, we establish a training-free heuristic baseline, which improves recognition in 21 of 24 settings. Building on this, we propose Evidence-Aware Observation Gate (EAOG) to adaptively assess whether additional observation is still beneficial. These results show that affective perception depends not only on the observed behavior, but also on how evidence is acquired. By making observation acquisition experimentally controllable, AffectSim provides a foundation for studying embodied affective perception in interactive 3D environments. All benchmark assets, code, and simulation environments will be released.

cs.HC↗

Making Euclid VIS Imaging AI-Ready: A Scalable Pipeline for Morphology, Anomaly Detection, and Similarity Search

The Euclid mission is delivering an unprecedented volume of high-resolution galaxy imaging, posing new challenges for standardized and reproducible reuse across morphological analyses. We present a scalable pipeline that converts released VIS cutouts into standardized $224\times224$ model inputs and uses a pretrained DINOv2 ViT-S/14 feature extractor to construct a 365,513-row, 384-dimensional cutout-and-embedding product from the Galaxy Zoo Euclid (Q1) catalogue. Initial production of the 365,513 released cutouts required approximately 48 hours, corresponding to an estimated end-to-end rate of $2.12$ cutouts s$^{-1}$. The service supports batch task management, while persistent reuse of generated products avoids repeating mosaic extraction for matching requests; together with released-scale production, these mechanisms define the operational scalability considered here. The representation is evaluated with held-out regression, few-label classification, anomaly-candidate prioritization, and similarity retrieval. Held-out ridge probes yield $R^2=0.377$--$0.596$ across four catalogue quantities. Under a one-percent total labelled budget that includes validation, frozen MLP macro-F1 is 0.802--0.861 for three tasks but 0.484 for the strongly imbalanced spiral task; limited final-block fine-tuning gives 0.810--0.850 for those three tasks and 0.520 for spiral. The historical anomaly workflow identifies 1,681 configuration-dependent candidates, and the displayed examples illustrate image-quality failures without estimating their prevalence. These results show that a standardized image interface and a reusable pretrained embedding can support several downstream analyses at the scale of the released Euclid Q1 sample, while the quantitative performance and interpretation remain task dependent under the declared input and evaluation contracts.

astro-ph.IM↗

Regularizing modality contribution drift in multimodal continual learning

Multimodal continual learning (MMCL) aims to acquire new knowledge from multimodal data while retaining previously learned knowledge. Existing MMCL methods primarily mitigate forgetting by aligning cross-modal representations or preserving feature-level semantic similarity. However, different tasks may rely on different modalities, and learning new tasks can alter how modalities contribute to predictions on previously learned tasks. It remains underexplored how modality contributions evolve across incremental stages and how such changes relate to forgetting in MMCL. We term such changes Modality Contribution Drift (MCD) and introduce an MCD score based on controlled modality-subset interventions. Our theoretical and empirical analyses show how contribution drift can lead to forgetting, while existing MMCL and conventional CL methods do not effectively mitigate MCD. To address this issue, we propose Continual Modality Contribution Drift Regularization (CMCDR) to preserve the modality contribution profiles of previously learned tasks in both replay-based and replay-free settings. In the replay-based setting, CMCDR estimates modality contributions from stored old samples and regularizes their drift relative to a frozen previous model. In the replay-free setting, CMCDR uses current-task samples as probes to match old-class contribution profiles between the current and frozen models without storing old exemplars. Across six benchmarks covering multimodal class-incremental learning and continual multimodal question answering, CMCDR substantially reduces modality contribution drift, improves average accuracy by 0.88-7.66 percentage points, and reduces average forgetting by 0.85-11.55 percentage points over the corresponding baselines.

cs.LG↗

FingerViP: Learning Real-World Dexterous Manipulation with Fingertip Visual Perception

Current dexterous manipulation systems commonly rely on external or wrist-mounted cameras for visual feedback. However, such sensing setups are prone to occlusion and can limit performance on tasks requiring close-range, multi-view perception. In this work, we design a vision-enhanced fingertip module that brings clear visual perception directly to the fingertips and present FingerViP, a learning system that leverages fingertip visual perception for dexterous manipulation. Specifically, the fingertip module integrates miniature-camera sensing within compact-footprint hardware and is installed on each finger of a multi-fingered hand, which substantially improves visual perception by providing comprehensive, multi-view observations of objects and surrounding environment. Building on the integrated fingertip modules, we develop a diffusion-based whole-body visuomotor policy conditioned on a third-view camera and multi-view fingertip vision, enabling the robot to effectively learn complex manipulation skills directly from human demonstrations. To improve view-proprioception alignment and contact awareness in the policy observation representation, each fingertip visual feature is augmented with its corresponding camera-pose encoding and per-finger joint-current encoding. We validate the effectiveness of multi-view fingertip vision and demonstrate the robustness and adaptability of FingerViP across a range of challenging real-world tasks, including retrieving objects behind an occluding curtain, achieving a $56.6\%$ relative improvement in average success rate over the baseline using an external third-view camera and a wrist-mounted camera. Videos, code, and hardware designs are available on our project page: https://fingervip.github.io/.

cs.RO↗

Well-posedness of neural turbulence closures and tangent dissipation

A neural turbulence closure defines a new boundary-value problem, $R(U)=N(U)+F(U)=0$, with a coupled Jacobian $J(U)=N'(U)+F'(U)$, where $N$ is the original mean-flow operator and $F$ the learned closure. We establish two consequences of global tangent dissipation. For a monotone original operator, a positive uniform margin supplied by the original operator and closure together guarantees existence, uniqueness and a global inverse-sensitivity bound relating a posteriori solution error to the a priori residual. For a general original operator, a dissipative closure cannot worsen tangent dissipation, but this alone does not guarantee uniqueness. Tangent dissipation depends on both diffusion and reaction. We study two complementary ways to promote it: (1) an exact-integral construction enforcing non-negative tangent diffusion while leaving reaction unconstrained, and (2) a penalty on tangent-reaction violations at sampled states. Tangent diffusion enters the Jacobian, and non-negative secant eddy viscosity alone does not control its coercivity. We conduct tests with channel flow at $Re_τ=180$--$5200$, which provides a strongly monotone baseline. Both constrained closures reach accurate solutions in all 50 training-seed/Reynolds-number cases. At $Re_τ=1000$, we conduct tests with 10,000 starts for one fixed network per closure and we find one root for each constrained closure and multiple roots for the other closures. Although this does not prove uniqueness, it provides strong empirical evidence for uniqueness of the tested constrained closures. At $Re_τ=5200$, the construction and penalty reduce the reported inverse sensitivity relative to the original operator by approximately $372\times$ and $11\times$, respectively.

physics.flu-dyn↗

Dependency-Aware Trajectory Refinement for Efficient Multi-Turn Agent Fine-Tuning

Multi-turn agent trajectories often contain redundant rounds (failed tool calls, parallel sub-queries, verification-only steps) that inflate both training and inference cost. We propose viewing each trajectory as a \emph{round-level dependency DAG} that exposes which rounds are globally load-bearing for the final answer, and fine-tune agents on trajectories refined through this DAG. Given an LLM-annotated DAG, these edits are deterministic and interpretable, with optional rephrasing. Models trained on these refined trajectories consistently outperform those trained on the original trajectories at lower inference cost. Specifically, across four multi-modal QA benchmarks, our refinements improve downstream accuracy by up to $1.7$\,pp over vanilla SFT (and $5.7$\,pp over an LLM-deletion baseline) while reducing per-sample inference messages by up to approximately $40\%$ and inference tokens by up to approximately $48\%$, translating to substantial savings in compute and serving cost. Code is available.

cs.CL↗

RealSimLoop: Online Real-to-Sim Adaptation via Differentiable Reduced-Order Simulation with Vision Feedback

Real-world observations of deformable objects are often sparse or surface-level, while downstream tasks require hidden physical quantities such as internal deformation, stress fields, and interaction forces. Physics-based simulation can recover these quantities, but online real-to-sim adaptation remains challenging due to costly full-space optimization, limited feedback, and time-varying material properties. To address these challenges, we propose RealSimLoop, a differentiable framework for online real-to-sim adaptation using vision data as physical feedback. Our approach achieves quasi-real-time performance by executing differentiable simulation within a reduced-order neural subspace, drastically accelerating the optimization loop. We couple this efficient dynamics model with differentiable rendering, enabling direct gradient backpropagation that leverages high-fidelity pixel data to refine physical parameters such as material stiffness. Furthermore, by employing a sliding-window objective function, RealSimLoop enables robust online adaptation, allowing the system to track time-varying material properties and effectively bridge the real-to-sim gap arising from model reduction or unmodeled dynamics. Extensive experiments demonstrate that our method outperforms conventional offline methods, and we validate the framework's versatility in downstream applications, including external force prediction and 3D stress field reconstruction with novel view synthesis.

cs.GR↗

RAGTIMER 1.0: Rapid Rare-Event Partial State Space Construction for Stochastic VAS (extended version)

Transient reachability analysis of rare events in Continuous-Time Stochastic Vector Addition Systems (CTSVAS) such as Chemical Reaction Networks (CRNs) has proven a formidable challenge to cutting-edge tools. Underlying a CTSVAS is a continuous-time Markov chain (CTMC), and CTMC transient reachability analysis calls for Probabilistic Model Checking (PMC). This analysis requires the explicit representation of a model's entire state space. Rare events occur with extremely low probability, compounding the challenge of probabilistic analysis. In CRNs, it is imperative to verify the probability of rare events; even a low concentration of a species can have pathological consequences. This paper presents the RAGTIMER 1.0 tool, which efficiently builds a partial state space for a CTSVAS by enumerating traces to a rare event of interest and expanding them to exploit concurrency and cycles, providing a guaranteed lower bound on the probability of a rare event. Guaranteed lower bounds are particularly useful in synthetic biological applications because they indicate how and when a rare event can be experimentally observed. RAGTIMER is an attractive alternative to existing rare event analysis methods for CTSVAS models. It outperforms existing PMC tools and refutes multiple probability estimates from rare-event stochastic simulation on multiple challenging CRN models. RAGTIMER uses optimized data structures, a simple input format, and memory-safe Rust code to improve the scalability and accessibility of PMC for industry professionals.

cs.FL↗

FrontierChallenge: Evaluating Scientific Workflow Completion

Scientific agents increasingly analyze data, execute code, and produce research artifacts, yet most benchmarks emphasize final answers, isolated programs, or a single domain. We introduce FrontierChallenge, a cross-domain benchmark comprising 300 end-to-end scientific workflows. In this paper, we release and evaluate 97 of these tasks, spanning quantum chemistry, molecular dynamics, materials characterization, analytical chemistry, life science, and electrochemistry/environment. Each task provides fixed inputs and specifies a bundle of required scientific deliverables. We evaluate twelve frontier models with three agent scaffolds. Pass Rate measures the fraction of tasks satisfying the full-completion criterion, while Avg. Score captures partial progress. Each of the best-performing configurations completed only 20 of the 97 released tasks, yielding a Pass Rate of 20.6%. Partial progress translated especially poorly into complete delivery in analytical chemistry and electrochemistry/environment: Avg. Scores reached 87.6 and 94.9, but the highest Pass Rates were only 4% and 0%. Among non-passing Claude Code trajectories, 75.5% still ended with language claiming completion. Complementary HDS6 process scores correlate strongly with task outcomes, supporting FrontierChallenge as a benchmark of Heavy Duty Solver capabilities. These findings show that neither high partial scores nor confident claims of completion reliably indicate that a scientific task has been fully delivered, highlighting the need to evaluate end-to-end workflow execution and the completeness of scientific deliverables together.

cs.AI↗

Effective particle size governs structure and dynamics in rough hard-particle fluids

We numerically investigate how particle surface roughness affects the static and dynamic properties of a hard-particle fluid across a wide range of densities, rho. These simulations of a simple model of granular systems reveal that, although the amplitude and coverage of surface corrugation significantly influence the rho-dependence of system properties, the qualitative behavior of this dependence remains unchanged. These findings can be described quantitatively by introducing an effective particle size, which enables a direct mapping of the rough particle systems to equivalent hard-disk systems. Analytical calculations provide an explicit form of this mapping, and allow us to predict the static and dynamic properties of rough particles using standard liquid-state theories for hard disks.

cond-mat.soft↗

Mutually phase-stable tunable attosecond soft X-ray attosecond pulses from a free-electron laser

We demonstrate the production of mutually phase-stable attosecond X-ray pulse pairs with tunable relative time delays and phases in a cascaded X-ray free-electron laser. We showcase the method in an experiment at the LCLS-II, in which a shaped electron beam is used in a split undulator configuration to generate the two attosecond pulses. We achieve mutual phase stability by reusing microbunching generated in the first undulator in order to seed the FEL process in the second at a detuned frequency. We measure controllable temporal delays between the two pulses directly in the time domain using angular streaking of photoelectrons, with a step size of 250 attoseconds. We then show that the behavior of the X-ray spectrum is consistent with phase stability between the two pulses, with a relative phase that can be easily tuned using inter-undulator phase shifters. This method is particularly well-suited to few to ten eV energy separations and sub to few femtosecond time delays, which are ideal for experiments in the soft X-ray regime for pushing the limits of our models for molecular dynamics and exerting direct coherent control over quantum systems.

physics.acc-ph↗

Connecting heterogeneous dynamics with local entropy

Establishing a robust and physically interpretable link between static structure and heterogeneous relaxation dynamics remains a fundamental challenge in glass physics. Here, we introduce a weighted pair-entropy descriptor based on the conventional two-body excess entropy. For this, we multiply the integrand used to calculate the excess entropy by a weight function that is directly related to the length scale of the pair correlation function. This multiplication does not affect the contribution of the short range order to the local excess entropy, but allows to take into account the structure present on intermediate distances, i.e., the medium-range order. For a canonical two-dimensional Lennard-Jones glass former, the resulting descriptor exhibits a strong correlation with particle-level dynamical propensity at long times (multiples of the alpha-relaxation time), with a maximum structure--dynamics correlation reaching about 0.9, substantially outperforming the predictive power of the conventional local pair excess entropy. These results demonstrate that incorporating a physically motivated structural length scale into entropy-based descriptors markedly enhances their predictive power while preserving physical interpretability. Our findings provide a simple and general framework for investigating structure--dynamics correlations in glass-forming systems.

cond-mat.dis-nn↗

Efficient primal--dual splitting methods for a Poisson-constrained JKO scheme for Poisson-Nernst-Planck models

The Poisson--Nernst--Planck (PNP) equations strongly couple ionic transport and electrostatic interactions through the Poisson equation, posing substantial numerical challenges under small permittivity and complex potential boundary conditions. Underlying these equations is a natural Wasserstein gradient-flow structure, in which the Poisson equation serves as a local realization of the nonlocal electrostatic interaction energy. Exploiting this structure, we formulate each time step as a constrained convex minimization problem where the ionic continuity equations and the Poisson equation are incorporated as linear constraints, allowing the concentrations, fluxes, and electrostatic potential to be updated simultaneously. The variational structure of the scheme intrinsically guarantees the dissipation of the original free energy, mass conservation, and nonnegativity of ionic concentrations under general electrostatic boundary conditions. Moreover, the framework is structurally modular: extending from classical to modified PNP models with steric interactions and concentration-gradient corrections requires only modifying the energy functional, while all structure-preserving properties are automatically retained. To efficiently solve the resulting large-scale constrained problems, we develop preconditioned and transformed primal--dual algorithms equipped with tailored fast dual solvers, namely DCT-based direct and Schur-complement iterative methods, that exploit the coupled block structure of the PDE constraints. Numerical experiments on classical and modified PNP systems demonstrate the accuracy and structure-preserving properties of the scheme, and show that the proposed algorithms converge reliably in strongly coupled small-permittivity regimes without significant growth in computational cost.

math.NA↗

DP-JMRNet: A Deep Unfolding Network for Differential Phase Preservation in Sparse Bitemporal SAR Reconstruction

Complex SAR imagery is usually visualized and evaluated mainly through its magnitude. Phase is retained in the complex data but is rarely treated as a direct image-quality objective. Existing sparse reconstruction methods typically focus on magnitude fidelity and single-epoch complex reconstruction accuracy. However, the phase difference between two acquisitions is what drives line-of-sight deformation retrieval in InSAR, from ground subsidence monitoring to earthquake deformation mapping. This paper proposes the Differential-Phase-Oriented Joint Masked Reconstruction Network (DP-JMRNet), which uses deep unfolding to reconstruct the two epochs jointly from masked observations under a differential-phase objective. An exchange-equivariant interaction module makes the reconstruction independent of epoch ordering. A coherence-aware gate opens cross-epoch sharing in coherent regions and closes it where the two epochs disagree. On simulated bitemporal SAR data, DP-JMRNet attains the lowest differential-phase RMSE at 30\%, 40\%, and 50\% sampling rate, while maintaining competitive amplitude and complex-image fidelity. This corresponds to a 47.5\%--51.3\% reduction over the best baseline, achieved with one third of its parameters. The same trend is validated on three Sentinel-1 scenes. A systematic study of acquisition design further shows that sharing the same aperture support across epochs is necessary for phase fidelity, whereas optimizing the sampling mask does not improve the differential phase. The code and data are available at https://github.com/JasonBao05/coherent-sar-unfolding.

eess.SP↗

Robust Output Regulation of Uncertain Linear Time-Varying Systems

Robust output regulation for linear time-varying systems has remained an open problem for decades. By augmenting the classical immersion viewpoint, we propose the trajectory-matching system immersion framework. It reformulates the regulator equation as a forced system and demonstrates that finding an internal model is equivalent to reproducing the non-decaying output trajectories of this forced system by constructing an unforced one. This perspective yields an exact algebraic boundary for finite-dimensional internal models, termed finite linear parameterization. It further reveals a distinctive obstruction in time-varying systems: even highly structured, finite-dimensional affine parametric uncertainties can generate infinite-dimensional families of non-decaying error-zeroing mappings, thereby precluding exact robust regulation via linear finite-dimensional internal models in general. Hence, we develop a general finite-dimensional design for approximate robust regulation, which yields a bounded tracking error and avoids explicitly solving the regulator equation. Additionally, it recovers exact regulation for certain structured uncertainty classes. Overall, these results clarify the intrinsic limitation of exact finite-dimensional robust regulation for uncertain LTV systems and provide a general and constructive framework for designing LTV internal-model-based regulators.

eess.SY↗

Mapping metallic d-wave altermagnetism across the TiNiSi structural family

The prospect of using altermagnets as switchable sources of perpendicularly polarized spin currents has intensified the search for candidate materials, yet metallic d-wave systems with sizable spin-splitter responses remain scarce. Here, we identify an empirical magnetic motif that supports metallic d-wave altermagnetism in the TiNiSi structural family: ferromagnetically ordered zigzag chains with antiferromagnetic interchain coupling in a relatively low-symmetry crystal environment. The TiNiSi structure type combines this motif with broad chemical flexibility and competing magnetic ground states. By combining first-principles screening of thermodynamic stability and magnetic ground states across 280 ternary systems, we identify 16 metallic d-wave altermagnets. This set recovers four experimentally known members---WFeB, NbMnP, TaMnP, and NbMnAs---and yields 12 new predictions, of which ScMnP, TaMnAs, ScMnAs, MoMnAs, MoMnSi, and WMnSi are the most promising. Noncollinear calculations indicate that the collinear altermagnetic configuration is the ground state across them. Each of the six leading new candidates has a nonzero spin-splitter angle and a finite anomalous Hall conductivity. Notably, ScMnP and TaMnAs exhibit strong spin-splitter responses despite modest altermagnetic band splitting. These results establish TiNiSi-type metallic d-wave altermagnets as a chemically versatile platform for efficient charge-to-spin conversion and provide an empirical magnetic-motif-guided route to identifying further candidates.

cond-mat.mtrl-sci↗

Adjoint Method versus Physics-Informed Neural Networks in PDE-Constrained Inverse Problems

Inverse problems governed by partial differential equations (PDEs) are central to computational mechanics and are commonly solved by adjoint-based optimization, while physics-informed neural networks (PINNs) have emerged as a flexible alternative. Their relative performance remains difficult to assess because the two approaches are often compared under different formulations, parameterizations, optimizers, and regularization choices. We present a controlled comparison of adjoint optimization and PINNs for PDE-constrained inverse problems. From a common abstract formulation, we instantiate both methods on identical domains, governing equations, observation models, and regularization terms, while matching the optimizer, unknown parameterization, and arithmetic precision wherever applicable. The benchmarks include unsteady Burgers, noisy Darcy permeability inversion, three-dimensional Allen-Cahn reaction identification, and unsteady Navier-Stokes viscosity identification. The results show that the representation of the unknown largely determines the preferred method: grid-based fields favor the discrete adjoint, whereas neural representations are native to PINNs and relevant for closure and constitutive modeling. For time-dependent problems, adjoint inversion can be dominated by trajectory storage and differentiation, while PINNs provide satisfactory reconstructions at lower cost. A PINN-warm-started adjoint strategy then recovers adjoint-level accuracy at about half the cost.

math.NA↗