arXiv subjects

Qiong Zhang

Publications and source records attributed to Qiong Zhang.

At least 37 records · Page 2Linked to original sources

arXiv2026

Stability of the Timoshenko Beam Equation with One Weakly Degenerate Local Kelvin-Voigt Damping

We consider the Timoshenko beam equation with locally distributed Kelvin-Voigt damping, which affects either the shear stress or the bending moment. The damping coefficient exhibits a singularity, causing its derivative to be discontinuous. By using the frequency domain method and multiplier technique, we prove that the associated semigroup is polynomial stability. Specifically, regardless of whether the local Kelvin-Voigt damping acts on the shear stress or the bending moment, the system decays polynomially with rate $t^{-\frac{1}{2}}$.

math.OC↗

arXiv2026

Polynomial Stability for Weakly Coupled System with Partial Controls

We study the stability of general weakly coupled systems subject to a reduced number of local or boundary controls. We show that, under Kalman's rank condition, the exponential stability of the underlying scalar equation implies polynomial stability of the full coupled system. Moreover, the decay rate remains unchanged regardless of the number of equations in the system. The proof relies on resolvent estimates and a clever exploitation of Kalman's rank condition to ensure effective transmission of damping across the coupled equations. The abstract result is applied to several concrete models, including systems of wave equations with local viscous, local viscoelastic, or boundary damping; systems of plate equations with internal damping; and thermoelastic systems of type III. Moreover, the optimality of the decay rate is established via spectral analysis.

math.OC↗

arXiv2026

A Decision Analysis Framework for High-fidelity and Low-fidelity Systems with Applications in Manufacturing Processes

Optimizing complex manufacturing processes often involves a trade-off between data accuracy and acquisition cost. High-fidelity data are accurate but limited, while low-fidelity data are abundant but often biased. Balancing these two sources is critical for efficient manufacturing optimization. To address this challenge, we develop a decision analysis framework based on multi-fidelity Gaussian process (GP) modeling based on the Kennedy-O'Hagan (KOH) framework. We propose a systematic Bayesian calibration approach using multi-fidelity GPs that explicitly quantifies the model discrepancy, and an algorithm that combines posterior sampling of calibration parameters with predictive sampling to characterize the distribution of optimal input settings and their associated uncertainty. These components are integrated into a five-stage practical workflow for the optimization of manufacturing processes. Through an illustrative example and two real-world applications in composite cure cycle optimization and injection molding process control, we demonstrate how the framework integrates information from both high-fidelity and low-fidelity data sources to support decision-making under parameter uncertainty.

stat.ME↗

arXiv2026

See-in-Pairs: Reference Image-Guided Comparative Vision-Language Models for Medical Diagnosis

Medical image diagnosis is challenging because many diseases resemble normal anatomy and exhibit substantial interpatient variability. Clinicians routinely rely on comparative diagnosis, such as referencing cross-patient healthy control images to identify subtle but clinically meaningful abnormalities. Although healthy reference images are abundant in practice, existing medical vision-language models (VLMs) primarily operate in a single-image or single-series setting and lack explicit mechanisms for comparative diagnosis. This work investigates whether incorporating clinically motivated comparison can enhance VLM performance. We show that providing VLMs with both a query image and a matched healthy reference image, accompanied by cross-patient comparative prompts, significantly improves diagnostic performance. This performance can be further augmented by lightweight supervised fine-tuning (SFT) on a small amount of data. At the same time, we evaluate multiple strategies for selecting reference images, including random sampling, demographic attribute matching, embedding-based retrieval, and cross-center selection, and find consistently strong performance across all settings. Finally, we investigate why comparative diagnosis is effective theoretically, and observe improved sample efficiency and tighter alignment between visual and textual representations. Our findings highlight the clinical relevance of comparison-based diagnosis, provide practical strategies for incorporating reference images into VLMs, and demonstrate improved performance across diverse medical imaging tasks.

cs.CV↗

arXiv2026

Beyond Aggregation: Guiding Clients in Heterogeneous Federated Learning

Federated learning (FL) is increasingly adopted in domains like healthcare, where data privacy is paramount. A fundamental challenge in these systems is statistical heterogeneity-the fact that data distributions vary significantly across clients (e.g., different hospitals may treat distinct patient demographics). While current FL algorithms focus on aggregating model updates from these heterogeneous clients, the potential of the central server remains under-explored. This paper is motivated by a healthcare scenario: could a central server not only coordinate model training but also guide a new patient to the hospital best equipped for their specific condition? We generalize this idea to propose a novel paradigm for FL systems where the server actively guides the allocation of new tasks or queries to the most appropriate client. To enable this, we introduce a density ratio model and empirical likelihood-based framework that simultaneously addresses two goals: (1) learning effective local models on each client, and (2) finding the best matching client for a new query. Empirical results demonstrate the framework's effectiveness on benchmark datasets, showing improvements in both model accuracy and the precision of client guidance compared to standard FL approaches. This work opens a new direction for building more intelligent and resource-efficient FL systems that leverage heterogeneity as a feature, not just a bug. Code is available at https://github.com/zijianwang0510/FedDRM.git.

cs.LG↗

arXiv2026

Minimum Wasserstein distance estimator under covariate shift: closed-form, super-efficiency and irregularity

Covariate shift arises when covariate distributions differ between source and target populations while the conditional distribution of the response remains invariant, and it underlies problems in missing data and causal inference. We propose a minimum Wasserstein distance estimation framework for inference under covariate shift that avoids explicit modeling of outcome regressions or importance weights. The resulting W-estimator admits a closed-form expression and is numerically equivalent to the classical 1-nearest neighbor estimator, yielding a new optimal transport interpretation of nearest neighbor methods. We establish root-$n$ asymptotic normality and show that the estimator is not asymptotically linear, leading to super-efficiency relative to the semiparametric efficient estimator under covariate shift in certain regimes, and uniformly in missing data problems. Numerical simulations, along with an analysis of a rainfall dataset, underscore the exceptional performance of our W-estimator.

stat.ME↗

arXiv2026

Uncertainty Analysis of Experimental Parameters for Reducing Warpage in Injection Molding

Injection molding is a critical manufacturing process, but controlling warpage remains a major challenge due to complex thermomechanical interactions. Simulation-based optimization is widely used to address this, yet traditional methods often overlook the uncertainty in model parameters. In this paper, we propose a data-driven framework to minimize warpage and quantify the uncertainty of optimal process settings. We employ polynomial regression models as surrogates for the injection molding simulations of a box-shaped part. By adopting a Bayesian framework, we estimate the posterior distribution of the regression coefficients. This approach allows us to generate a distribution of optimal decisions rather than a single point estimate, providing a measure of solution robustness. Furthermore, we develop a Monte Carlo-based boundary analysis method. This method constructs confidence bands for the zero-level sets of the response surfaces, helping to visualize the regions where warpage transitions between convex and concave profiles. We apply this framework to optimize four key process parameters: mold temperature, injection speed, packing pressure, and packing time. The results show that our approach finds stable process settings and clearly marks the boundaries of defects in the parameter space.

stat.ME↗

arXiv2025

Exact boundary controllability and stabilizability of a degenerated Timoshenko beam

This paper investigates the boundary controllability and stabilizability of a Timoshenko beam subject to degeneracy at one end, while control is applied at the opposite boundary. Degeneracy in this context is measured by the real parameters for $μ_a\in [0,2)$ for $a\in\{K,EI\}$, where $K(x)$ denotes shear stiffness and $EI(x)$ bending stiffness. We differentiate between weak degeneracy $μ_a\in [0,1)$ and strong degeneracy $μ_a\in [1,2)$, which may occur independently in shear and bending. Our study establishes observability inequalities for both weakly and strongly degenerate equations under Dirichlet, Robin, and Neumann boundary conditions. Using energy multiplier techniques and the Hilbert Uniqueness Method (HUM), we derive conditions for exact boundary controllability and show that appropriate boundary state and velocity feedback controls at the non-degenerate end can stabilize the system exponentially. Extending results previously obtained for the 1-dimensional wave equation in \cite{AlabauCannarsaLeugering2017}, this study highlights new control strategies and stabilization effects specific to the degenerate Timoshenko beam system, addressing challenges pertinent to real-world structural damping and control applications.

math.OC↗

arXiv2025

TabPFN: One Model to Rule Them All?

Hollmann et al. (Nature 637 (2025) 319-326) recently introduced TabPFN, a transformer-based deep learning model for regression and classification on tabular data, which they claim "outperforms all previous methods on datasets with up to 10,000 samples by a wide margin, using substantially less training time." Furthermore, they have called TabPFN a "foundation model" for tabular data, as it can support "data generation, density estimation, learning reusable embeddings and fine-tuning". In this paper, we provide a tailored explanation of how TabPFN works for a statistics audience, by emphasizing its interpretation as approximate Bayesian inference. We then explore the significance of TabPFN to the field of statistics: We show that an out-of-the-box application of TabPFN can sometimes outperform specialized state-of-the-art methods for semi-supervised parameter estimation, prediction under covariate shift, and heterogeneous treatment effect estimation. As a partial explanation for the predictive effectiveness of TabPFN, we show that it can simultaneously adapt to both nonparametric structure and parametric structure, for instance, sometimes outperforming LASSO even when assumptions are correctly specified. All experiments can be reproduced using the code provided at https://github.com/qinglong-tian/tabpfn_study (https://github.com/qinglong-tian/tabpfn_study).

cs.LG↗

arXiv2025

Lost in the Middle: An Emergent Property from Information Retrieval Demands in LLMs

The performance of Large Language Models (LLMs) often degrades when crucial information is in the middle of a long context, a "lost-in-the-middle" phenomenon that mirrors the primacy and recency effects in human memory. We propose that this behavior is not simply a flaw indicative of information loss but an adaptation to different information retrieval demands during pre-training: some tasks require uniform recall across the entire input (a long-term memory demand), while others prioritize the most recent information (a short-term memory demand). Consistent with this view, we show that this U-shaped performance curve emerges when LLMs (GPT-2 and Llama variants) are trained from scratch on two simple human memory paradigms simulating long-term and short-term memory demands. Our analysis reveals that while the recency effect directly aligns with short-term memory demand in the training data, the primacy effect is induced by the uniform long-term memory demand and is additionally influenced by the model's autoregressive properties and the formation of attention sinks. Our main findings from simple human memory paradigms also generalize to a sequence completion task, which more closely resembles the next-token prediction process in LLM pre-training. Together, our findings reveal how information retrieval demands, model architecture, and structural attention dynamics during model training can jointly produce positional bias observed in LLMs.

cs.LG↗

arXiv2025

Gaussian Herding across Pens: An Optimal Transport Perspective on Global Gaussian Reduction for 3DGS

3D Gaussian Splatting (3DGS) has emerged as a powerful technique for radiance field rendering, but it typically requires millions of redundant Gaussian primitives, overwhelming memory and rendering budgets. Existing compaction approaches address this by pruning Gaussians based on heuristic importance scores, without global fidelity guarantee. To bridge this gap, we propose a novel optimal transport perspective that casts 3DGS compaction as global Gaussian mixture reduction. Specifically, we first minimize the composite transport divergence over a KD-tree partition to produce a compact geometric representation, and then decouple appearance from geometry by fine-tuning color and opacity attributes with far fewer Gaussian primitives. Experiments on benchmark datasets show that our method (i) yields negligible loss in rendering quality (PSNR, SSIM, LPIPS) compared to vanilla 3DGS with only 10% Gaussians; and (ii) consistently outperforms state-of-the-art 3DGS compaction techniques. Notably, our method is applicable to any stage of vanilla or accelerated 3DGS pipelines, providing an efficient and agnostic pathway to lightweight neural rendering. The code is publicly available at https://github.com/DrunkenPoet/GHAP

cs.CV↗

arXiv2025

Regularity Analysis for Two Coupled Second Order Evolution Equations

We investigate the regularity of the strongly continuous semigroup associated with a system of two coupled second order evolution equations with indirect damping, whose stability was recently studied by Hao et al. By deriving the asymptotic expression of the eigenvalues the generator, we partition the parameter space into several disjoint regions, where the semigroup exhibits either analyticity or Gevrey class regularity. Together with the estimate of the resolvent of the generator on the imaginary axis, we give a complete and sharp regularity characterization for this system.

math.AP↗

arXiv2025

Uncertainty Estimation of the Optimal Decision with Application to Cure Process Optimization

Decision-making in manufacturing often involves optimizing key process parameters using data collected from simulation experiments. Gaussian processes are widely used to surrogate the underlying system and guide optimization. Uncertainty often inherent in the decisions given by the surrogate model due to limited data and model assumptions. This paper proposes a surrogate model-based framework for estimating the uncertainty of optimal decisions and analyzing its sensitivity with respect to the objective function. The proposed approach is applied to the composite cure process simulation in manufacturing.

stat.AP↗

arXiv2025

Sequence-to-Sequence Models with Attention Mechanistically Map to the Architecture of Human Memory Search

Past work has long recognized the important role of context in guiding how humans search their memory. While context-based memory models can explain many memory phenomena, it remains unclear why humans develop such architectures over possible alternatives in the first place. In this work, we demonstrate that foundational architectures in neural machine translation -- specifically, recurrent neural network (RNN)-based sequence-to-sequence models with attention -- exhibit mechanisms that directly correspond to those specified in the Context Maintenance and Retrieval (CMR) model of human memory. Since neural machine translation models have evolved to optimize task performance, their convergence with human memory models provides a deeper understanding of the functional role of context in human memory, as well as presenting new ways to model human memory. Leveraging this convergence, we implement a neural machine translation model as a cognitive model of human memory search that is both interpretable and capable of capturing complex dynamics of learning. We show that our model accounts for both averaged and optimal human behavioral patterns as effectively as context-based memory models. Further, we demonstrate additional strengths of the proposed model by evaluating how memory search performance emerges from the interaction of different model components.

q-bio.NC↗

arXiv2025

Numerical Simulation Informed Rapid Cure Process Optimization of Composite Structures using Constrained Bayesian Optimization

The present study aimed to solve the cure optimization problem of laminated composites through a statistical approach. The approach consisted of using constrained Bayesian Optimization (cBO) along with a Gaussian process model as a surrogate to rapidly solve the cure optimization problem. The approach was implemented to two case studies including the cure of a simpler flat rectangular laminate and a more complex L-shaped laminate. The cure optimization problem with the objective to minimize cure induced distortion was defined for both case studies. The former case study was two-variable that is used two cure cycle parameters as design variables and was constrained to achieve full cure, while the latter was four-variable and had to satisfy constraints of full cure as well as other cure cycle parameters. The performance of cBO for both case studies was compared to the traditional optimization approach based on Genetic Algorithm (GA). The comparison of results from GA and cBO including deformation and final degree of cure showed significant agreement (error < 4%). The computational efficiency of cBO was calculated by comparing the convergence steps for GA (>1000) and cBO (<50). The computational efficiency of cBO for all optimization cases was found to be > 96%. The case studies conclude that cBO is promising in terms of computational time and accuracy for solving the cure optimization problem.

stat.AP↗

arXiv2025

Constrained Bayesian Optimization under Bivariate Gaussian Process with Application to Cure Process Optimization

Bayesian Optimization, leveraging Gaussian process models, has proven to be a powerful tool for minimizing expensive-to-evaluate objective functions by efficiently exploring the search space. Extensions such as constrained Bayesian Optimization have further enhanced Bayesian Optimization's utility in practical scenarios by focusing the search within feasible regions defined by a black-box constraint function. However, constrained Bayesian Optimization in is developed based on the independence Gaussian processes assumption between objective and constraint functions, which may not hold in real-world applications. To address this issue, we use the bivariate Gaussian process model to characterize the dependence between the objective and constraint functions and developed the constrained expected improvement acquisition function under this model assumption. We show case the performance of the proposed approach with an application to cure process optimization in Manufacturing.

stat.CO↗

arXiv2025

CliniChat: A Multi-Source Knowledge-Driven Framework for Clinical Interview Dialogue Reconstruction and Evaluation

Large language models (LLMs) hold great promise for assisting clinical interviews due to their fluent interactive capabilities and extensive medical knowledge. However, the lack of high-quality interview dialogue data and widely accepted evaluation methods has significantly impeded this process. So we propose CliniChat, a framework that integrates multi-source knowledge to enable LLMs to simulate real-world clinical interviews. It consists of two modules: Clini-Recon and Clini-Eval, each responsible for reconstructing and evaluating interview dialogues, respectively. By incorporating three sources of knowledge, Clini-Recon transforms clinical notes into systematic, professional, and empathetic interview dialogues. Clini-Eval combines a comprehensive evaluation metric system with a two-phase automatic evaluation approach, enabling LLMs to assess interview performance like experts. We contribute MedQA-Dialog, a high-quality synthetic interview dialogue dataset, and CliniChatGLM, a model specialized for clinical interviews. Experimental results demonstrate that CliniChatGLM's interview capabilities undergo a comprehensive upgrade, particularly in history-taking, achieving state-of-the-art performance.

cs.CL↗

arXiv2025

S4M: S4 for multivariate time series forecasting with Missing values

Multivariate time series data play a pivotal role in a wide range of real-world applications. However, the presence of block missing data introduces significant challenges, often compromising the performance of predictive models. Traditional two-step approaches, which first impute missing values and then perform forecasting, are prone to error accumulation, particularly in complex multivariate settings characterized by high missing ratios and intricate dependency structures. In this work, we introduce S4M, an end-to-end time series forecasting framework that seamlessly integrates missing data handling into the Structured State Space Sequence (S4) model architecture. Unlike conventional methods that treat imputation as a separate preprocessing step, S4M leverages the latent space of S4 models to directly recognize and represent missing data patterns, thereby more effectively capturing the underlying temporal and multivariate dependencies. Our framework comprises two key components: the Adaptive Temporal Prototype Mapper (ATPM) and the Missing-Aware Dual Stream S4 (MDS-S4). The ATPM employs a prototype bank to derive robust and informative representations from historical data patterns, while the MDS-S4 processes these representations alongside missingness masks as dual input streams to enable accurate forecasting. Through extensive empirical evaluations on diverse real-world datasets, we demonstrate that S4M consistently achieves state-of-the-art performance. These results underscore the efficacy of our integrated approach in handling missing data, showcasing its robustness and superiority over traditional imputation-based methods. Our findings highlight the potential of S4M to advance reliable time series forecasting in practical applications, offering a promising direction for future research and deployment. Code is available at https://github.com/WINTERWEEL/S4M.git.

cs.LG↗