Search arXivSearch

arXiv subjects

Ye Liang

Publications and source records attributed to Ye Liang.

At least 19 recordsLinked to original sources

Cluster-induced target shift and synthetic approximation for high-dimensional clustered data

In high-dimensional clustered data, covariates whose distributions differ across clusters can act as proxies for unobserved cluster effects. We show that the marginal-model LASSO implicitly uses sparse combinations of such covariates to shift the estimation target from structural coefficients to a contaminated vector, which inflates false selections. We therefore propose the Synthetic Heterogeneous-Effects LASSO (SHEL), which augments the regression design with separately penalized, outcome-independent, cluster-constant synthetic covariates to correct the cluster-induced target shift. Under a fixed nuisance-effects formulation, we derive oracle properties and establish consistency of the structural coefficients when the residual heterogeneity is weakly aligned with the augmented design. We also demonstrate the distinction between the structural parameter under small residual heterogeneity and the population working parameter when residual heterogeneity persists. Further, we develop a debiased estimator with a cluster-robust sandwich variance, and establish asymptotic results. Simulations show far fewer false selections than the marginal LASSO, and an analysis of longitudinal neutrophil transcriptomic data from hospitalized COVID-19 patients yields a more parsimonious gene set that retains the severity markers of the original study.

stat.ME

Size-Selective Threshold Harvesting under Nonlocal Crowding and Exogenous Recruitment

We propose a nonlinear size-structured fishery model for externally recruited stocks under size-selective harvesting. The population density satisfies a McKendrick--von Foerster transport equation in which growth and natural mortality depend on a nonlocal crowding index, while harvesting acts as a bounded size-dependent mortality control. Unlike standard self-recruiting formulations, recruitment is prescribed as a lower-boundary inflow, making the model suitable for enhancement fisheries or analyses conditional on juvenile input. For the no-harvest baseline, we derive the stationary size profile and reduce the nonlinear equilibrium problem to a scalar closure equation, proving existence and uniqueness under a net monotonicity condition. We introduce an intrinsic replacement index and show why, in this externally forced setting, it is a viability diagnostic rather than a persistence threshold. A formal state--adjoint system yields a bang--bang switching rule; under weak coupling and single crossing, the optimal policy has a threshold structure. Numerical experiments validate the approximation and sensitivity trends

math.OC

Design-Assisted Regression

We consider regression problems in which the marginal distribution of the covariates is informative for estimation and variable selection, rather than merely auxiliary. Motivated by random-design, high-dimensional, and latent-effect settings, we propose a general design-assisted regression framework in which the estimating criterion depends on both the conditional model for $Y \mid \bfX$ and structured features of the covariate distribution. The framework identifies two roles of design information: stabilizing weak design directions through quadratic regularization and correcting latent-effect distortion through nuisance augmentation. We establish oracle properties for the resulting estimator, separate the effects of stochastic error, shrinkage, and approximation, and compare it with a benchmark sparse procedure that ignores design information. These results show that the proposed framework improves estimation while preserving first-order prediction performance. Numerical studies and two real-data applications illustrate the practical impact of incorporating design information.

stat.ME

DR-LabStack: Design and Implementation of a Clinician-Facing Web System for Diabetic Retinopathy Prediction

Pretrained diabetic retinopathy (DR) prediction models differ in their input fields, serialization formats, preprocessing requirements, and output semantics. Making these models accessible through a common clinical interface therefore requires explicit coordination between the user interface and the inference service. We designed and implemented DR-LabStack, a React-Flask web system integrating four externally developed pretrained models: RuleFit, Pruned RuleFit, Elaborative XGBoost, and Two-level Ensemble. A shared form retrieves ordered model features, renders model-specific numerical and categorical controls, and constructs a positional input vector. Backend adapters load heterogeneous artifacts and apply the ensemble's accompanying scaler, while a common JSON response supports binary classification display alongside method and source information. Functional evaluation on September 8, 2026 used copied application files and real model artifacts in a documented isolated environment. All four models loaded and exposed their 14-, 6-, 8-, and 25-field contracts. Sixty-two Flask test-client requests characterized service behavior; 12 limited-vector checks confirmed invocation-path and threshold consistency. Twenty-four browser-component scenarios with mocked transport verified input ordering and result rendering and characterized input-validation behavior. The resulting system demonstrates a reusable interaction and serving workflow for heterogeneous DR models. The contribution is web-system design, integration, and software functionality; clinical effectiveness and clinician usability require separate evaluation.

cs.LG

RiVaT-Fuse: Reliability-Calibrated Variational Tensor Fusion for Multimodal Prediction under Modality Uncertainty

Image-metadata prediction requires fusing heterogeneous evidence whose reliability can vary across samples and latent factors. Existing representation-level fusion methods typically choose an aggregation architecture, such as concatenation, gating, conditional modulation, or attention, without explicitly defining what the fused representation should mean under modality uncertainty. We propose RiVaT-Fuse, a reliability-calibrated variational tensor fusion framework that defines fusion as sample-wise latent-state estimation. Rather than producing a fused vector by direct aggregation, RiVaT-Fuse estimates a consensus latent state through a variational objective that balances image evidence, metadata evidence, structured cross-modal interaction, and stability. The resulting framework replaces scalar modality confidence with matrix-valued trust geometry, decomposes interaction into additive, multiplicative, and relational components, and couples the latent state with conditional robustness and structured multi-task prediction. We provide well-posedness and stability interpretations of the latent solve and instantiate the framework with efficient low-rank-plus-diagonal trust operators. On an image-level image-metadata prediction benchmark, RiVaT-Fuse achieves the strongest overall predictive rank among direct representation-level baselines while improving probability and label stability under perturbation.

cs.LG

Age-Structured Harvesting Models: A Structural Comparison of Rate-Control and Effort-Control Optimality Systems

We study optimal harvesting in continuous-time, age-structured population models of McKendrick--von Foerster type, and we compare two harvesting mechanisms. In the \emph{rate-control} formulation, harvesting enters the state equation as an additive removal term; in the \emph{effort-control} formulation, harvesting acts multiplicatively as an additional mortality intensity and the mortality coefficient depends on the aggregate stock. For the rate-control problem we first establish existence of an optimal control for the infinite-horizon discounted problem, and we then derive, \emph{under explicitly stated regularity and constraint-qualification assumptions}, a conditional Pontryagin-type necessary optimality system consisting of the adjoint equation, the terminal-age and transversality conditions, the switching relations for the distributed and boundary controls, and the complementary-slackness relation for the state constraint. For the effort-control problem we \emph{formally} derive the associated adjoint equation and identify the nonlocal coupling term generated by aggregate (density) dependence, with the sign of that term verified by a step-by-step variational computation; a rigorous infinite-horizon maximum principle for this nonlinear, nonlocally coupled problem is beyond the present scope and is stated as such. We complement the analysis with autonomous stationary reductions, with explicit representations of the state and adjoint, and with a reproducible numerical study. The central message is structural: the harvesting mechanism is not a cosmetic modelling choice. Rate-control produces an additive/affine/local optimality structure, whereas effort-control produces a multiplicative/nonlinear/nonlocal one, with direct consequences for persistence, stationary profiles, and bioeconomic interpretation.

math.OC

Bilinear control of age--space structured populations

We study constrained bilinear optimal control for nonlocal age--space structured population equations with renewal boundary conditions and endogenous surveillance feedback. The control acts as a coefficient in a mixed transport--diffusion equation, while a scalar observable generated by the state enters both the interior dynamics and the renewal law. This produces a nonlinear closed-loop control-to-state map and a feedback-dependent adjoint system. Using a characteristic mild formulation rather than a standard Lions--Magenes argument, we establish closed-loop well-posedness and Fréchet differentiability. We then derive the reduced and feedback-corrected adjoint equations. The feedback derivative is identified as a low-rank perturbation \(\ell_{\bar y,\bar u}(p)(t)χ(a,x)\); in the Volterra-kernel regime, the associated transfer operator is quasinilpotent, yielding an explicit resolvent representation of the adjoint. Finally, we prove first-order optimality conditions and decompose the switching function into reduced and feedback-induced components.

math.OC

Rigorous Analysis of a Nonlocal Transport--Renewal System for Physiologically Structured Populations

We develop a rigorous analytical framework for a class of physiologically structured population models with two internal state variables, nonlocal ecological feedbacks, dynamic resources, inter-zone transfer, and selective harvesting. The full model is a coupled nonlinear PDE--ODE transport--renewal system with endogenous inflow at the recruitment boundary, a setting in which transport, nonlocal dependence, and boundary renewal interact at the same level. For this full nonautonomous multi-zone system, we prove finite-horizon well-posedness in a positive $L^{1}$-based state space, including global existence on arbitrary bounded time intervals, uniqueness, nonnegativity, and continuous dependence on initial data, environmental forcing, and harvesting effort. We then isolate an autonomous single-zone reduction at extinction and construct a positive compact next-generation operator on the recruit space. In a further nonlinear stationary reduction, we prove that supercriticality of the basic reproduction number $\mathcal R_{0}>1$ yields existence of a nontrivial stationary state under a parametrized compact-operator hypothesis encoding density-dependent renewal feedback. Finally, for a finite-horizon harvest objective over a compact Lipschitz-regular admissible class, we establish existence of an optimal control. The results separate what can be proved for the full climate-explicit system from what can be justified only after autonomous reduction, thereby clarifying the mathematical scope of threshold and control theory for structured populations.

math.AP

Parity-Skeleton First-Passage Dynamics and Optimal Intervention in Two-Sided Discrete Monitoring Systems

Two-sided threshold crossings arise in discrete monitoring systems whenever intervention is triggered by departure from an operating band. This paper develops a finite-state first-passage framework based on a biased random walk with symmetric absorbing barriers. To remove parity gaps of the raw hitting time, we analyse a parity-corrected lifetime through even- and odd-state Markov skeletons. Adjacent-row likelihood-ratio inequalities verify the monotonicity condition and establish increasing failure rate and new-better-than-used properties. These ageing properties yield log-concave survival probabilities and geometric persistence bounds. Substochastic-matrix formulas are derived for survival, hazard, mean lifetime, state-conditioned remaining useful life, and finite-horizon crossing risk. A renewal-cost criterion then converts the first-passage distribution into an optimal preventive-intervention schedule. Model parameters are obtained by matching the drift and variance of observed increments to a two-point random-walk approximation, with a rolling-window extension for nonstationary regimes. Numerical experiments compare exact calculations with Monte Carlo diagnostics, moment-matched inverse-Gaussian and Weibull benchmarks, serially correlated increments, calibration perturbations, and fixed-interval policies. A synthetic remote-patient-monitoring example illustrates how discrete physiological deviations can be mapped to transparent risk scores and personalized review schedules. The framework provides an auditable link between discrete stochastic dynamics, remaining-lifetime prediction, and condition-based intervention, while separating mathematical validation from clinical validation.

math.AP

Multiplier Sensitivity in Isoperimetric Optimal Control

We study finite-horizon optimal control problems with scalar isoperimetric constraints from a function-space duality perspective. Controls are treated as elements of weakly compact subsets of \(L^\infty(0,T;\mathbb R^m)\), while the state equation induces a control-to-state map into \(W^{1,\infty}(0,T;\mathbb R^n)\). For linear dynamics, concave payoff, and an affine isoperimetric functional, we prove that the constrained value function has an interval domain, is concave, and admits a Fenchel--Moreau dual representation. This yields a superdifferential formula identifying the negative of the dual multiplier with the sensitivity of the value function with respect to the constraint level. A constraint qualification is then used to identify the dual multiplier with the normal Pontryagin multiplier of the augmented isoperimetric system. We also treat linear-quadratic problems with a single quadratic equality constraint by reducing them to quadratic forms on a Hilbert space. The resulting analysis separates the validity of the envelope formula from the regularity needed for Riccati synthesis, showing that sensitivity may persist even when the modified control-weight operator becomes singular.

math.AP

Reflected Optimal Stopping with a Max-Type Payoff: Measure-Valued Stopping Gains and Killed Resolvent Representation

We study an infinite-horizon optimal stopping problem for a two-dimensional normally reflected diffusion in the quadrant with payoff \(G(x_1,x_2)=x_1\vee αx_2\). The problem combines three features that complicate the usual free-boundary analysis: reflection on the coordinate axes, a genuinely two-dimensional stopping region, and a nonsmooth max-type reward. We formulate the associated reflected obstacle problem, prove a verification theorem under explicit Itô--Krylov--Tanaka admissibility and measure-superharmonicity assumptions, and derive a conditional epigraph structure for the stopping set. The main technical point is that the stopping-gain object \(Γ=c+rG-\mathcal LG\) is a signed measure rather than a function. Its diagonal component is $Γ^Δ(dx) = -\frac{n^\top a(x)n}{2\sqrt{1+α^2}}σ_Δ(dx)$, $n=(1,-α)$, which shows that pointwise stopping-gain sign conditions must be interpreted with care. We also prove that the correct potential representation is the killed-resolvent formula $V(x)=G(x)-R_r^{\mathcal C}Γ(x)$, rather than the unrestricted reflected resolvent. A constant-coefficient reflected Brownian example illustrates the diagonal singular term explicitly.

math.AP

Delay-Penalty Comparison for Sequential Testing and Quickest Detection in State-Dependent Diffusion Models

We study sequential testing and Bayesian quickest detection for diffusion observations whose drift changes between two alternatives while the signal-to-noise ratio may depend on the current observation. In this setting the posterior probability is generally not a closed one-dimensional Markov statistic: the natural sufficient state is the augmented process consisting of the posterior (or likelihood ratio) and the observed diffusion. We formulate both testing and quickest detection within this common filtering framework and identify the corresponding degenerate free-boundary problems. The main contribution is a delay-penalty comparison principle. For a common terminal false-alarm or terminal decision cost, a pointwise larger running delay penalty increases the value of continuation, shrinks the continuation region, and yields earlier stopping. When the stopping set has a one-sided posterior representation, this gives an order relation for the optimal alarm boundaries. The result applies to linear delay costs and to nonlinear marginal delay penalties after the appropriate Markovian augmentation, and is illustrated by a constant signal-to-noise Shiryaev example in which the alarm threshold is computed numerically and shown to be monotone in the delay cost. The framework clarifies how state-dependent information and nonlinear delay costs jointly affect the geometry of sequential testing and quickest-detection rules.

math.AP

A Measure-Valued Obstacle Problem for an Obliquely Reflected Diffusion with a Max-Type Payoff

We study an obliquely reflected optimal stopping problem in the nonnegative quadrant with nonsmooth max-type payoff \(G(x)=x_1\veeαx_2\), and we develop a measure-valued potential-theoretic formulation of the associated obstacle problem. The kink of \(G\) on the diagonal \(x_1=αx_2\) produces a singular surface measure in the distributional generator, while the oblique reflection directions generate boundary local-time contributions on the coordinate faces. Together with the absolutely continuous stopping gain, these terms define a total signed stopping measure \(\Gtot\). We derive the corresponding reflected Itô--Tanaka identity, prove a killed-resolvent representation of the value function in the continuation region, and show that the unrestricted reflected resolvent is generally incorrect because the process is not absorbed on the stopping set. The free boundary is formulated through a continuation-side trace condition for the killed potential. Under a vertical monotonicity hypothesis on \(V-G\), the stopping set is shown to have an epigraph form. We finally prove a verification theorem: any admissible epigraph candidate satisfying contact, strict continuation, reflected Neumann compatibility, growth, the trace condition, and measure-superharmonicity coincides with the value function, and its first entry time is optimal.

math.AP

Killed resolvents and measure-valued stopping gains for reflected optimal stopping with max-type rewards

We study an infinite-horizon optimal stopping problem for a normally reflected two-dimensional diffusion in the positive quadrant with nonsmooth max-type reward \(G(x_1,x_2)=x_1\vee αx_2\). The paper develops a conditional measure-theoretic framework for the associated reflected obstacle problem. The main innovation is to show that the stopping gain \(Γ=c+rG-\mathcal LG\) is a signed measure, not a function: the kink of \(G\) generates an explicit negative surface measure on \(Δ=\{x_1=αx_2\}\). We then prove that the correct potential representation uses the resolvent of the reflected diffusion killed on first entry into the stopping set, rather than the unrestricted reflected resolvent. Under explicit monotonicity, regularity, and measure-superharmonicity assumptions, we derive an epigraph representation, a continuation-side boundary-trace condition, and a candidate verification theorem. The framework clarifies hidden regularity and uniqueness assumptions in multidimensional nonsmooth optimal stopping.

math.PR

Time and Killed Resolvents in Reflected Optimal Stopping with a Max Payoff

We study infinite-horizon optimal stopping for normally reflected two-dimensional diffusions in the positive quadrant with max payoff \(G(x_1,x_2)=x_1\veeαx_2\). The non-smooth payoff produces a singular stopping-gain measure on the kink set \(Δ=\{x_1=αx_2\}\). We prove $\displaystyle Γ^Δ(dx) = -\frac{n^\top a(x)n}{2\sqrt{1+α^2}}\,σ_Δ(dx)$, with $n=(1,-α)$, so the diagonal component is non-positive and strictly negative under local ellipticity. This implies that every interior kink point lies in the continuation region. We further show that the correct value representation uses the resolvent killed at first entry into the stopping set, $\displaystyle V=G-R_r^{\mathcal C}Γ$, and give a closed-form reflected Brownian counter-example showing that the unrestricted reflected resolvent is generally wrong. A reflected Brownian benchmark and numerical experiments illustrate the local-time, resolvent-gap, and diagonal-avoidance mechanisms.

math.AP

Spectral perturbation theory for wall-admittance effects on compressible boundary-layer instability

Thin wall treatments modify high-speed boundary-layer instability through the pressure they admit or absorb at the wall. This paper develops a unified admittance formulation for such effects on trapped compressible Rayleigh modes. For a simple rigid-wall eigenpair, we prove the spectral sensitivity law \[ c(A)=c_0+KA+\mathcal O(|A|^2), \qquad δσ=α\Imag(KA)+\mathcal O(|A|^2), \] where \(A\) is the wall admittance and \(K\) is an explicit functional of the rigid-wall eigenfunction. The formula separates wall physics from outer-mode physics and yields a phase criterion for stabilisation. Matched asymptotics show that viscous and thermal wall layers, blind-pore coatings and shallow non-separating roughness all reduce to this same boundary condition, with additive leading admittances. Mach-4.5 computations validate the sensitivity coefficient and demonstrate porous damping, viscous-wall damping and sign-changing reactive roughness effects.

physics.flu-dyn

Mountain Muography for China Jinping Underground Laboratory

The China Jinping Underground Laboratory (CJPL), located $\sim 2,400$~m beneath Jinping Mountain, is one of the world's deepest and largest ($\sim 300{,}000~\mathrm{m}^3$) underground facilities, hosting dark matter, nuclear astrophysics, and neutrino experiments. We report the first muon radiography (muography) conducted at this extraordinary depth. Cosmic muons detected by a one-ton prototype developed for the Jinping Neutrino Experiment were used to perform non-invasive subsurface density mapping over a 3~km lateral range. The 1.3~m diameter detector provides nearly isotropic acceptance and an angular resolution of $\sim 4.5^\circ$. By correlating the predicted surface muon flux distributions with the underground measurements, we reconstruct a directional opacity map that constrains the density structure of the overburden and shows excellent agreement with satellite-derived terrain models. This work demonstrates the feasibility of muography at extreme depths with kilometer-scale overburden and establishes a robust methodology for future geophysical applications and large-scale facilities, such as the full Jinping Neutrino Experiment. Based on this validated overburden model, we further predict the total muon fluxes for the eight experimental halls in CJPL-II, providing essential input for their physics programs.

hep-ex

Molecular structure, electric property, and scintillation and quenching of liquid scintillators

Liquid scintillators are widely used in particle and nuclear physics. Understanding the scintillation and quenching mechanisms is a fundamental issue in designing a high-light-yield liquid scintillator. In this work, the basic scintillation process for two-component liquid scintillators is discussed, highlighting the processes of excitation, ionization, and anion-cation recombination. A molecule's polar group, polarization characteristics, and the corresponding material's dielectric constant are found to be correlated with a liquid scintillator's scintillation efficiency. Polar groups and high relative dielectric constant (permittivity) can cause quenching and should be avoided. The tellurium loading scheme in the liquid scintillator of the SNO+ experiment, TeBD, is discussed. The hydroxyl groups introduce polar structures in the TeBD, and for the first time, the relative dielectric constant of TeBD is measured to be $16\pm1$. These discussions explain part of the quenching of the TeBD liquid scintillator.

physics.ins-det