Search arXiv⌕ Search

arXiv subjects

Hui Yu

Publications and source records attributed to Hui Yu.

At least 19 recordsLinked to original sources

Asymptotically Compatible Variational Energy Dissipation Laws and Structure-Preserving Variable-Step Linear Relaxation Schemes for a Subdiffusive Tumor-Nutrient Model

In this work, we develop a mass-conservative subdiffusive tumor-nutrient model coupled through chemotaxis and memory-dependent reaction exchange, together with structure-preserving variable-step linear relaxation schemes. A weighted Riemann-Liouville identity is proved and used to construct a variational energy and the associated energy dissipation law for the proposed model. Both the model and the associated variational energy dissipation law are asymptotically compatible with their integer-order counterparts as the fractional order approaches one. For numerical approximation, we discretize the Riemann-Liouville fractional derivatives using the L1R formula on nonuniform time meshes and derive the associated discrete weighted inequality. We first construct a variable-step linear relaxation scheme for the subdiffusive model. Then, to mitigate alternating perturbations induced by the auxiliary-variable error and amplified by the L1R convolution at small fractional orders, we construct a temporally damped linear relaxation scheme. Since temporal damping leaves the auxiliary-variable recurrence unchanged, we further introduce an a posteriori relaxation correction to reduce alternating errors in the auxiliary variable. All three schemes preserve total mass, are proven to satisfy discrete variational energy dissipation laws using the discrete weighted inequality, and remain consistent with the integer-order limit. Several numerical examples are presented to validate the accuracy and stability of the proposed schemes.

math.NA↗

Singular set estimates in quasilinear Alt-Caffarelli problems

For a nonnegative, uniformly convex function $Φ$, we study nonnegative minimizers of the quasilinear Alt-Caffarelli energy $\int_ΩΦ(\nabla u)+χ_{\{u>0\}}$. Under mild regularity assumptions on $Φ$, we show that the codimension of the singular set of the free boundary is at least $2+η$ for a positive $η$. With a singular minimizer in three dimensions in a forthcoming work, this result is sharp as long as integer dimensions are considered. Our proof method is flexible, and we use it to also prove a similar result for minimizers of the $p$-Laplacian counterpart of the Alt-Caffarelli energy.

math.AP↗

Regularized free deconvolution for spectral repair of resampling distortion in high-dimensional particle filters

Resampling is the standard remedy for weight degeneracy in particle filters, but in high dimensions it distorts the spectrum of the ensemble covariance in a way that is computable from the importance weights. This paper studies the inverse problem: recovering the pre-resampling spectrum from the observed weights and the empirical spectrum alone, and using it without biasing the filter. We first show that the forward spectral law extends to random importance weights once one conditions on the weights together with the realized offspring counts, rather than on the weights alone. We then construct a regularized free-deconvolution estimator, prove its consistency with an explicit error budget at a fixed resolution scale, and certify model mismatch through a computable forward residual. The repaired spectrum enters the filter only as the preconditioner of a Metropolis-adjusted rejuvenation move, so that spectral error affects mixing efficiency but not the invariant target. For the full filtering cycle, we derive a geometrically summable error recursion under stable scalar dynamics and an explicit law for the cost of abstaining from repair. Pre-registered simulations show that the inversion reduces the spectral error by an order of magnitude, that the corrected preconditioner recovers about 90% of the oracle's sampling efficiency in an anisotropic regime, and that the cost of abstention depends on when abstentions occur rather than on how many. The repair recovers eigenvalue laws, not eigenvectors, and is certified only within an explicitly stated exogenous-weight regime.

cs.LG↗

HiFloat4 Format for Language Model Pre-training on Ascend NPUs

Training large foundation models at low numerical precision is one of the most promising directions for reducing the compute and memory cost of modern AI. Recent 4-bit floating-point formats such as MXFP4 and NVFP4 can be applied to linear GEMM operations in LLMs, but their limited dynamic range introduces numerical instability that prior work addresses by stacking stabilization mechanisms, typically executed at higher precision and partially eroding the efficiency gains that motivate FP4. In this work, we argue that numerical format design is itself a first-class lever for stable FP4 training, and present the first systematic study of FP4 LLM pretraining on energy-efficient Huawei Ascend NPUs. We compare the recently proposed HiFloat4 (HiF4) format against both MXFP4 and NVFP4, holding one recipe fixed across all three formats across dense (OpenPangu-1B, Llama3-8B) and Mixture-of-Experts (Qwen3-MoE-30B) architectures and executing all linear and expert GEMMs in FP4. At matched storage --- NVFP4 and HiF4 both spend 4.5 bits per value --- the three formats differ far more in what they require before they will train at all than in final accuracy. HiF4 reaches a relative loss of 1.55\% with no stabilization, below fully stabilized MXFP4 (1.79\%) and below NVFP4 carrying the per-tensor scaling it cannot train without (2.00\%); NVFP4 diverges under every combination of stochastic rounding and Hadamard transform we tried. Our results suggest that stable, accurate FP4 training does not require an ever-growing stack of stabilization techniques; it requires the right numerical format.

cs.LG↗

Recovering the spatiotemporally dependent diffusion and advection coefficients in a pathway-based Keller--Segel model

We investigate an inverse coefficient problem for an augmented Keller--Segel model arising in the description of phototactic and chemotactic population dynamics. The spatiotemporal evolution of the population density is governed by an advection-diffusion equation in which both the diffusion coefficient and the advection coefficient depend on space and time. Due to the underlying intracellular adaptation mechanism, even in a time-independent external environment, the diffusion coefficient \(D(x,t)\) and the scalar advection coefficient \(K(x,t)\) remain time-dependent and relax exponentially toward their respective steady-state profiles. Importantly, their relaxation is governed by the same rate, determined by the intracellular adaptation dynamics. From internal measurements of the density, we establish conditional Lipschitz stability for recovering either coefficient when the other is known, and derive cross-sensitivity estimates quantifying the compensation between diffusion and advection perturbations that produce the same density data. We further identify a finite-time separation between the transient and steady regimes: the full dynamics admit an exponentially accurate frozen-coefficient approximation at late times. When the steady-state coefficients are known, we also prove unique identification of the relaxation rate from the long-time behavior of the solution. Finally, we derive an explicit linearization of the forward map and, motivated by the temporal separation above, develop a two-stage gradient-based reconstruction strategy. Numerical experiments demonstrate the feasibility of the proposed method.

math.AP↗

FPGN: Redefining Ultra-Fast Programmable Gate-based Neural Acceleration with Differentiable LUTs

Achieving nanosecond-scale inference latency for deep neural networks (DNNs) has become a primary architectural concern for latency-critical applications. While Field-Programmable Gate Arrays (FPGAs) offer a promising substrate for low-latency inference, conventional FPGA accelerators remain arithmetic-centric, using LUTs primarily as building blocks for numerical operators and peripheral logic. In contrast, recent LUT-native neural networks treat LUTs as learnable neurons, revealing promising theoretical potential to exploit their intrinsic logic expressivity. However, existing methods are largely confined to algorithmic optimizations, failing to translate this theoretical potential into high-performance FPGA accelerators. Specifically, their differentiable formulations do not faithfully match FPGA LUT primitives, their physically-unaware topologies compromise routability and timing closure, and their lack of automated optimization flow hinders systematic design space exploration (DSE) and efficient hardware implementation. In this paper, we propose FPGN, an end-to-end physically-aware framework that closes the gap between LUT-native learning and latency-optimized FPGA implementation. FPGN addresses these challenges through (i) a hardware-aligned differentiable formulation for training FPGA-native LUT neurons, (ii) a structured LUT-native topology with a streaming hardware architecture to improve routing locality and timing closure, and (iii) a latency-driven compiler that leverages high-fidelity analytical Quality of Results models to automate DSE and hardware generation. Experiments show that FPGN achieves up to 205$\times$ latency reduction compared to representative FPGA-based BNN accelerators and up to 30$\times$ higher LUT efficiency than prior differentiable LUT-native networks, while maintaining competitive inference accuracy.

cs.AR↗

Physics-Knowledge-Guided Hybrid Neural Learning for Arctic Sea Ice Concentration Evolution and Short-Range Prediction

Accurate modeling of sea ice concentration (SIC) evolution is essential for polar climate assessment and short?range sea ice prediction. Numerical and data-driven approaches constitute major foundations for SIC modeling, but the former often require complex parameterizations and substantial compu?tation, whereas the latter rarely encode physical dependencies explicitly. This study presents the Physics-Informed Hybrid Ice Model (PIHIM), a differentiable data-driven hybrid ice model for daily SIC evolution that organizes its network structure according to the physical dependencies encoded in the sea ice continuity equation and explicitly accounts for dynamical transport, ther?modynamically driven areal growth and loss, and unresolved local processes. PIHIM preserves the representation capacity of deep learning while providing a process-decomposed formulation of ice displacement, freeze-melt areal change, and local error closure. Two evaluation settings are adopted: reanalysis-forced simulation examines SIC evolution stability under reanalysis forcing, and forecast-forced prediction assesses short-range performance un?der forecast-forced conditions, with reanalysis and observational SIC serving as verification references. Results indicate enhanced ice-edge preservation and error-growth control in reanalysis?forced simulation, while PIHIM retains measurable short-range prediction skill under forecast-forced conditions. Our code will be made publicly available after the paper is accepted.

cs.AI↗

One-Step Evolution for Long-Time Extrapolation: An Error-Bound-Informed and Prior-Guided Neural Residual Framework for Autonomous PDEs

Accurate simulation of the long-time evolution of systems governed by partial differential equations (PDEs) is central to scientific computing. Among existing deep learning?based approaches for solving PDEs, neural operators typically rely on extensive trajectory data, whereas physics-informed meth?ods often exhibit limited stability during long-time extrapolation. For a well-posed autonomous PDE, long-time trajectories can be generated by repeated composition of a fixed-step evolution operator; hence, long-time extrapolation depends on controlling the approximation error of this operator and the propagation of that error under recursive composition. Accordingly, we propose a numerical-prior-guided, physics-constrained method trained without ground-truth trajectory supervision: a low-cost numerical prior reduces the difficulty of approximating the one?step evolution operator, while a weak-form PDE residual provides a computable proxy for the one-step error term in the error?propagation bound. We validate the method on five benchmark cases spanning four PDE classes and compare it with ten physics?informed learning methods under a unified protocol that excludes ground-truth trajectories from training and model selection. The results indicate that, in all five cases, the proposed method reduces long-time extrapolation error relative to the numerical prior and outperforms the best competing baseline in each case, thereby improving long-time simulation accuracy across different PDEs without ground-truth trajectory supervision. The source code developed for this paper will be made publicly available upon acceptance of the manuscript.

cs.AI↗

Structured Neural Modeling of Daily Arctic Sea-Ice Concentration Evolution: Physical-Trajectory-Driven Learning and Forecast-Domain Adaptation

Accurate modeling of the daily evolution of sea ice concentration (SIC) is central to improving the credibility and operational forecasting capability of deep learning-based sea ice prediction. However, existing deep learning methods often couple the underlying sea ice evolution relationships and data errors within high-dimensional nonlinear mappings, making it difficult to construct a stable and verifiable evolution core and apply it reliably to practical forecasting. To address this issue, this study proposes a reanalysis-forecast dual-domain decoupled framework for learning sea ice evolution operators. The framework builds upon a lightweight physical baseline to generate daily evolution trajectories, employs a temporally constrained joint multi-lead compensation network to com?pensate for unresolved processes, and introduces an ice-mass?aware transport mechanism to suppress numerical dissipation. In the forecasting stage, the parameters of the base evolution core are fixed, while a lightweight variable-semantic adaptation mechanism calibrates inter-domain distributions and evolution responses, thereby separating forecast-domain errors from base evolution errors. Experiments show that the constructed base evolution core can accurately and stably simulate daily sea ice evolution at both short-term and annual scales under reanal?ysis forcing, and can be effectively transferred to the forecast domain through lightweight adaptation, achieving stable prac?tical forecasting capability while preserving the base evolution structure. The source code will be made publicly available at https://github.com/zhangmaqun65535/SNM upon acceptance of this manuscript.

physics.ao-ph↗

Sediment Concentration Estimation via Multiscale Inverse Problem and Stochastic Homogenization

We develop a multiscale framework for estimating sediment concentration in water flow from acoustic wave measurements. At the microscopic scale, the sediment distribution is modeled by a spatially inhomogeneous Poisson cloud, while the quantity of interest is its macroscopic concentration. For the associated random wave model, we derive an effective medium whose coefficient is explicitly related to the local probability of sediment occurrence. This effective description avoids resolving individual sediment particles and provides a computationally tractable forward model for inversion. We then formulate the recovery of the effective medium, and hence the sediment concentration, as an inverse medium problem from partial boundary measurements, and investigate numerical strategies including model mollification and shot averaging. Numerical experiments demonstrate that the effective model captures the macroscopic wave behavior and can be used to obtain accurate estimates of sediment concentration.

math.NA↗

A Thermodynamically Consistent Cahn-Hilliard-Navier-Stokes Model for Tumor Growth

This work develops a thermodynamically consistent phase-field model for tumor growth based on the energetic variational framework. The model couples the Cahn-Hilliard equations for tumor evolution and nutrient transport with the incompressible Navier-Stokes equations. A first-order time discretization scheme based on the Multiple Scalar Auxiliary Variables (MSAV) approach together with a pressure-correction strategy is proposed to efficiently handle the nonlinear and coupled structure of the system. The proposed scheme is rigorously proved to be unconditionally energy stable and mass conservative. Furthermore, optimal first-order temporal error estimates are established for the tumor phase-field variable, the nutrient concentration, and the fluid velocity. Finally, numerical experiments demonstrate the effectiveness and robustness of the proposed method and verify the theoretical convergence rates.

math.NA↗

LaCoVL-FER: Landmark-Guided Contrastive Learning Network with Vision-Language Enhancement for Facial Expression Recognition

Facial Expression Recognition (FER) in the wild requires models to identify subtle expression cues under large variations in pose, occlusion, illumination, and identity. Recent FER methods improve robustness by introducing visual attention, facial landmarks, or vision-language models as auxiliary priors. However, these priors are typically integrated in a static manner, failing to capture instance-specific facial variations, thereby resulting in severe attention redundancy and representation instability. To address this issue, we propose LaCoVL-FER, a landmark-guided contrastive learning network with vision-language enhancement for FER, which shifts FER from static prior injection to sample-adaptive prior refinement. Specifically, a Landmark-Guided Adaptive Encoder (LGAE) calibrates regional appearance features with landmark geometry through Bi-branch Gated Cross Attention (BGCA), suppressing noisy responses and producing expression-relevant representations. In parallel, a Vision-Language Enhancement Strategy (VLES) refines the generalizable visual features from a frozen CLIP image encoder into expression-specific visual representations. Based on them, an Expression-Conditioned Prompting (ECP) mechanism adapts fixed class-level textual prompts from the frozen CLIP text encoder into instance-aware textual representations. The resulting visual-textual representations are aligned as adaptive semantic priors to enhance robustness and generalization. Quantitative and qualitative experiments show that LaCoVL-FER outperforms state-of-the-art methods on RAF-DB, FERPlus, and AffectNet. The code is available at https://github.com/ylin06804/LaCoVL-FER.

cs.CV↗

A Pragmatic VLA Foundation Model

Offering great potential in robotic manipulation, a capable Vision-Language-Action (VLA) foundation model is expected to faithfully generalize across tasks and platforms while ensuring cost efficiency (e.g., data and GPU hours required for adaptation). To this end, we develop LingBot-VLA with around 20,000 hours of real-world data from 9 popular dual-arm robot configurations. Through a systematic assessment on 4 robotic platforms, each completing 100 tasks with 130 post-training episodes per task, our model achieves clear superiority over competitors, showcasing its strong performance and broad generalizability. We have also built an efficient codebase, which delivers a throughput of 261 samples per second with an 8-GPU training setup, representing a 1.5~2.8$\times$ (depending on the relied VLM base model) speedup over existing VLA-oriented codebases. The above features ensure that our model is well-suited for real-world deployment. To advance the field of robot learning, we provide open access to the code, base model, and benchmark data, with a focus on enabling more challenging tasks and promoting sound evaluation standards.

cs.RO↗

Concentration of cones in the Alt-Phillips problem

We study minimizing cones in the Alt-Phillips problem when the exponent γ is close to 1. When γ converges to 1, we show that the cones concentrate around symmetric solutions to the classical obstacle problem. To be precise, the limiting profiles are radial in a subspace and invariant in directions perpendicular to that subspace.

math.AP↗

Quantum Pontus-Mpemba Effects in Real and Imaginary-time Dynamics

The quantum Pontus-Mpemba effect (QPME) is a counterintuitive phenomenon wherein a quantum system relaxes more rapidly through a two-step evolution protocol than through direct evolution under a symmetric Hamiltonian alone. In this protocol, the system first evolves under a symmetry-breaking Hamiltonian and then switches to a symmetric one. We demonstrate that QPME occurs under both real-time and imaginary-time dynamics with respect to $U(1)$-symmetry. Using tilted ferromagnetic initial states, we demonstrate that a transient asymmetric evolution significantly accelerates thermalization or convergence to the ground state for both real-time and imaginary-time evolutions, respectively. The effect is pronounced for small tilt angles, while larger tilts or antiferromagnetic initial states suppress it. Numerical evidence across different system sizes confirms the robustness of QPME, demonstrating its stability in the thermodynamic limit. This work extends the framework of nonequilibrium quantum phenomena to incorporate active state preparation, with direct implications for the implementation of quantum simulation.

quant-ph↗

Post-Selection-Free Decoding of Measurement-Induced Area-Law Phases via Neural Networks

Monitored quantum circuits host a rich variety of exotic non-equilibrium phases. Among the most representative examples are measurement-induced phase transitions between distinct area-law entangled states. However, because these transitions are characterized by specific entanglement quantities such as mutual information or topological entanglement entropy that are nonlinear functionals of the density matrix, their experimental observation requires multiple identical quantum trajectories via post-selection, which becomes exponentially unfeasible for large systems. Here, we leverage modern machine learning tools to address this challenge. We devise a neural network architecture combining a convolutional neural network with an attention mechanism, and use raw measurement outcomes directly as input to classify trivial, long-range entangled, and symmetry-protected topological phases. We show that the system's relaxation to a steady-state phase manifests as a sharp convergence in the classifier's accuracy, entirely bypassing the need for quantum state reconstruction. We systematically study the performance of our network as a function of sample size, input data, spatial and temporal constraints, and system size scalability. Our results demonstrate that this approach is robust and post-selection free, offering a practical pathway for experimentally probing measurement-induced phases.

quant-ph↗

Label What Matters: Modality-Balanced and Difficulty-Aware Multimodal Active Learning

Multimodal learning integrates complementary information from different modalities such as image, text, and audio to improve model performance, but its success relies on large-scale labeled data, which is costly to obtain. Active learning (AL) mitigates this challenge by selectively annotating informative samples. In multimodal settings, many approaches implicitly assume that modality importance is stable across rounds and keep selection rules fixed at the fusion stage, which leaves them insensitive to the dynamic nature of multimodal learning, where the relative value of modalities and the difficulty of instances shift as training proceeds. To address this issue, we propose RL-MBA, a reinforcement-learning framework for modality-balanced, difficulty-aware multimodal active learning. RL-MBA models sample selection as a Markov Decision Process, where the policy adapts to modality contributions, uncertainty, and diversity, and the reward encourages accuracy gains and balance. Two key components drive this adaptability: (1) Adaptive Modality Contribution Balancing (AMCB), which dynamically adjusts modality weights via reinforcement feedback, and (2) Evidential Fusion for DifficultyAware Policy Adjustment (EFDA), which estimates sample difficulty via uncertainty-based evidential fusion to prioritize informative samples. Experiments on Food101, KineticsSound, and VGGSound demonstrate that RL-MBA consistently outperforms strong baselines, improving both classification accuracy and modality fairness under limited labeling budgets.

cs.CV↗

Three-dimensional kink modes in solar coronal slabs: group velocities and their implications for impulsively excited waves

Little attention has been paid to group velocities of three-dimensional (3D) MHD waves in solar coronal seismology. This study aims to present a rather comprehensive examination on the group velocities of trapped 3D kink modes in coronal slabs, emphasizing the connection of mode analysis to both mode characterization and impulsively excited 3D kink waves. We work in linear, ideal, pressureless MHD, and take the equilibrium slab to be symmetrically structured only in one transverse direction. The dispersion relation is numerically solved, with the results understood by making in-depth analytical progress. We address both the transverse fundamental and its first overtone. We develop a three-subgroup scheme for categorizing 3D kink modes on the plane spanned by the axial and out-of-plane wavenumbers. The group ($\vec{v}_{\rm gr}$) and phase velocities ($\vec{v}_{\rm ph}$) sit on the same side of the equilibrium magnetic field ($\vec{B}_0$) for the ``$\vec{B}_0$-same-side A'' and ``$\vec{B}_0$-same-side F'' subgroups, which are further discriminated by the directional similarity of $\vec{v}_{\rm gr}$ and $\vec{B}_0$. The ``$\vec{B}_0$-straddling'' subgroup is peculiar in that $\vec{v}_{\rm gr}$ and $\vec{v}_{\rm ph}$ lie astride $\vec{B}_0$, a feature that cannot be found for waves in unbounded uniform media in pressureless MHD. This ``$\vec{B}_0$-straddling'' subgroup pertains to both the fundamental and its overtones. We further place our results in the context of impulsive waves, employing the method of stationary phase to predict the large-time wavefront morphology in the plane of symmetry of the equilibrium slab. Wavefronts directed toward $\vec{B}_0$ derive exclusively from ``$\vec{B}_0$-straddling'' modes, and are confined to narrow sectors.

astro-ph.SR↗