Searcharxiv⌕ Search

arXiv subjects

Qiong Zhang

Publications and source records attributed to Qiong Zhang.

At least 19 recordsLinked to original sources
arXiv2026

Byzantine-tolerant distributed learning of finite mixture models under partial corruptions

Finite mixture models characterize heterogeneous populations and are increasingly fitted to distributed data using split-and-conquer procedures that aggregate local mixture estimates at a central server. The aggregation step can be seriously compromised when transmitted local mixture estimates are partially or completely corrupted. To guard against Byzantine failures, existing robust aggregation methods have been developed for settings in which a local mixture estimate is either entirely authentic or entirely corrupted. Such methods can discard useful information when only some component estimates are corrupted. We consider component-wise Byzantine failure, in which some component estimates may be corrupted, but for each mixture component, a majority of the corresponding local estimates remain authentic. We propose component-wise filtered mixture reduction (CFMR), which selects a data-driven anchor, aligns transmitted components, filters each aligned cluster by a majority radius, and aggregates the retained estimates through mixture reduction. By filtering out only unreliable components, CFMR preserves authentic information from partially corrupted machines without requiring knowledge of the failure rates. We establish an adaptive convergence bound for CFMR and show that, under suitable conditions, it attains the oracle rate that would be achieved if the authentic component estimates were known in advance. Simulations and a real-data application show that CFMR remains close to the component-level oracle, whereas whole-machine filtering and unprotected aggregation can deteriorate substantially.

stat.ME↗
arXiv2026

FedSPM: Routing-Enabled Federated Learning under Dual Heterogeneity via Semiparametric Mixture

Routing-prediction federated learning has emerged as a new paradigm that reframes inter-client heterogeneity as a resource for system-level intelligence: at inference time, the server routes each external query to the best-matched client for prediction. Existing approaches, however, typically treat each client as internally homogeneous, overlooking latent subpopulations within local data. For example, patients with the same diagnosis at one hospital may exhibit morphologically distinct disease subtypes. The coexistence of inter-client and intra-client heterogeneity, which we call dual heterogeneity, can impair both routing and prediction. To address this challenge, we propose FedSPM, a routing-enabled semiparametric mixture framework that represents each client using client-specific latent components. Each component combines a predictive distribution for classification with a feature distribution for routing. To flexibly model feature distributions while effectively sharing information across clients, FedSPM models their density ratios relative to a common nonparametric measure estimated via empirical likelihood. We develop a federated expectation-maximization algorithm that optimizes a tractable surrogate and prove convergence of the exact profiled objective at the standard $\mathcal{O}(1/\sqrt{T})$ rate when the surrogate errors are properly controlled. Experiments on controlled benchmarks and real-world medical data demonstrate consistent improvements in routing and prediction under dual heterogeneity. Code is available at https://github.com/zijianwang0510/FedSPM.

cs.LG↗
arXiv2026

Forgettable Federated Linear Learning with Certified Data Unlearning

Federated Learning (FL) enables collaborative model training across distributed clients while preserving user privacy. Recently, Federated Unlearning (FU) has emerged to address the "right to be forgotten" and to remove the influence of poisoned or target clients without retraining the entire FL system. However, many FU methods require communication with retained or target clients, introduce additional security risks, or store historical models, limiting their efficiency and practicality. Moreover, most FU methods for deep neural networks (DNNs) lack theoretical certification due to the complexity of nonlinear models and their training dynamics. In this work, we introduce Forgettable Federated Linear Learning, a training and unlearning framework for DNNs. Our approach uses pre-trained models to linearly approximate DNNs and achieve performance comparable to the original networks through Federated Linear Training. We further present a certified, efficient, and secure unlearning strategy that enables the server to remove a target client's influence without additional client communication or storage. Extensive experiments on small- to large-scale datasets, using both convolutional neural networks and modern foundation models, show that our method balances model accuracy with effective target-client unlearning. This work provides a practical pipeline for efficient and trustworthy FU. Code: https://github.com/Nanboy-Ronan/2F2L-Federated-Unlearning

cs.LG↗
arXiv2026

Percolation of a cohesive fine particle in a static bed

Percolation of fine particles (fines) in a static bed of larger particles is central to many industrial and natural processes. Non-cohesive fines either pass through the bed or become trapped depending on multiple factors including particle sizes, friction and restitution coefficients, and size-polydispersity. Here we consider the additional factor of cohesion. We use the discrete element method to simulate gravity-driven percolation of cohesive fine particles through a static bed of randomly packed large particles; fines interact with bed particles but not with each other. A large-to-fine particle diameter ratio of 7 geometrically permits non-cohesive fines to pass the narrowest pore throats formed by the large particles so they can freely percolate. However, sufficiently large cohesion and friction lead to non-geometric trapping. Fines are trapped when they fail to rebound after a collision, due to large cohesion, low restitution, and low collision velocity, and any subsequent rolling or sliding is insufficient to cause detachment. This establishes a sequence of local interactions -- collision, adhesion, and post-contact motion -- that governs the ultimate fate of a fine particle. A collisional model that incorporates a trapping probability per collision and a collision frequency predicts the trapping distance in the regime dominated by collision-induced trapping. For non-rebounding collisions, frictional effects are enhanced by cohesion and, when large enough, prevent the fine particle from subsequently detaching. A static equilibrium condition based on force balance predicts whether a fine particle remains stationary after contact. These results show that percolation of cohesive fine particles is not determined by geometric accessibility alone, but also by particle-scale interaction dynamics that can override geometric expectations.

cond-mat.soft↗
arXiv2026

TabClustPFN: A Prior-Fitted Network for Tabular Data Clustering

Clustering tabular data is a fundamental yet challenging problem due to heterogeneous feature types, diverse data-generating mechanisms, and the absence of transferable inductive biases across datasets. Prior-fitted networks (PFNs) have recently demonstrated strong generalization in supervised tabular learning by amortizing Bayesian inference under a broad synthetic prior. Extending this paradigm to clustering is nontrivial: clustering is unsupervised, admits a combinatorial and permutation-invariant output space, and requires inferring the number of clusters. We introduce TabClustPFN, a prior-fitted network for tabular data clustering that performs amortized Bayesian inference over both cluster assignments and cluster cardinality. Pretrained on synthetic datasets drawn from a flexible clustering prior, TabClustPFN clusters unseen datasets in a single forward pass, without dataset-specific retraining or hyperparameter tuning. The model naturally handles heterogeneous numerical and categorical features and adapts to a wide range of clustering structures. Experiments on synthetic data and curated real-world tabular benchmarks show that TabClustPFN outperforms classical, deep, and amortized clustering baselines, while exhibiting strong robustness in out-of-the-box exploratory settings. Code is available at https://github.com/Tianqi-Zhao/TabClustPFN.

cs.LG↗
arXiv2026

PFN-TS: Thompson Sampling for Contextual Bandits via Prior-Data Fitted Networks

Thompson sampling is a widely used strategy for contextual bandits: at each round, it samples a reward function from a Bayesian posterior and acts greedily under that sample. Prior-data fitted networks (PFNs), such as TabPFN v2+ and TabICL v2, are attractive candidates for this purpose because they approximate Bayesian posterior predictive distributions in a single forward pass. However, PFNs predict noisy future rewards, while Thompson sampling requires uncertainty over the latent mean reward function. We propose PFN-TS, a Thompson sampling algorithm that converts PFN posterior predictives into mean-reward samples using a subsampled predictive central limit theorem. The method estimates posterior variance from a geometric grid of $O(\log n)$ dataset prefixes rather than the full $O(n)$ predictive sequence used in previous predictive-sequence approaches, and reuses TabICL's cached representations across rounds. We prove consistency of the subsampled variance estimator and give a Bayesian regret bound that decomposes PFN-TS regret into exact posterior-sampling regret under the PFN prior plus approximation terms. Empirically, PFN-TS achieves the best average rank across nonlinear synthetic and OpenML classification-to-bandit benchmarks, remains competitive on linear and BART-generated rewards, and attains the highest estimated policy value in an offline mobile-health evaluation. Code is available at https://anonymous.4open.science/r/PFN_TS-36ED/.

stat.ML↗
arXiv2026

Verification Mirage: Mapping the Reliability Boundary of Self-Verification in Medical VQA

Self-verification, re-invoking the same vision language model (VLM) in a fresh context to check its own generated answer, is increasingly used as a default safety layer for medical visual question answering (VQA). We argue that this practice is fundamentally unreliable. We introduce [METHOD NAME], a diagnostic framework for mapping the reliability boundary of medical VLM self-verification by decomposing verifier behavior into discrimination capability and agreement bias. Because the verifier and answer generator are capacity-coupled, the verifier can overly agree with the generator, creating a verification mirage: a regime with both high verifier error and high agreement bias, driven by false acceptance of incorrect answers. Evaluating six open-weight VLMs across five medical VQA datasets and seven medical tasks, we find that this boundary is strongly task-conditioned. Knowledge-intensive clinical tasks fall deepest into the mirage, simpler tasks are more resistant, and perceptual tasks lie in between. Verification also fails to provide an independent safety signal: logistic mixed-effects analysis shows that verifier error and agreement bias become more likely when the generator is wrong, while saliency analyses show that verifiers under-attend to image evidence relative to generators, a phenomenon we call the lazy verifier. Cross-verification reduces but does not eliminate the mirage. Moreover, when verification is reused in multi-turn actor-verifier loops, most initially wrong answers become locked in by false verification. Since our experiments use clean benchmarks, the observed reliability boundary likely underestimates failures in real clinical deployment.

cs.CV↗
arXiv2026

Estimating Decision Uncertainty from Preference Uncertainty: Application to Ground Vehicle Design

Engineering design problems are often modeled as multi-objective optimization tasks in which a scalarized utility function selects an optimal design from the Pareto set. In practice, preferences are imperfectly known, so uncertainty in the preference model leads to uncertainty in the resulting optimal design. This paper proposes a probabilistic framework that treats preference parameters as random variables and examines how preference uncertainty propagates to decision uncertainty. A random preference vector induces a probability distribution over optimal designs, allowing us to identify which regions of the Pareto front are most likely to be selected and to assess recommendation stability under preference variability. To explain the sources of this variability, we apply variance-based global sensitivity analysis to the induced optimal solutions, using Sobol' indices and Shapley values to quantify the contributions of individual design variables and their dependencies. We further summarize the overall dispersion of the optimal-design distribution using the Fréchet variance, which provides a scalar measure of decision stability under a given preference model. Two vehicle design case studies demonstrate how problem structure can lead to discrete versus continuous decision distributions and show how the proposed quantities support preference-aware design analysis.

stat.AP↗
arXiv2026

Byzantine-tolerant distributed learning of finite mixture models

Traditional statistical methods need to be updated to work with modern distributed data storage paradigms. A common approach is the split-and-conquer framework, which involves learning models on local machines and averaging their parameter estimates. However, this does not work for the important problem of learning finite mixture models, because subpopulation indices on each local machine may be arbitrarily permuted (the "label switching problem"). Zhang and Chen (2022) proposed Mixture Reduction (MR) to address this issue, but MR remains vulnerable to Byzantine failure, whereby a fraction of local machines may transmit arbitrarily erroneous information. This paper introduces Distance Filtered Mixture Reduction (DFMR), a Byzantine tolerant adaptation of MR that is both computationally efficient and statistically sound. DFMR leverages the densities of local estimates to construct a robust filtering mechanism. By analysing the pairwise L2 distances between local estimates, DFMR identifies and removes severely corrupted local estimates while retaining the majority of uncorrupted ones. We provide theoretical justification for DFMR, proving its optimal convergence rate and asymptotic equivalence to the global maximum likelihood estimate under standard assumptions. Numerical experiments on simulated and real-world data validate the effectiveness of DFMR in achieving robust and accurate aggregation in the presence of Byzantine failure.

stat.ME↗
arXiv2026

Neyman-Pearson multiclass classification under label noise via empirical likelihood

In many classification problems, misclassification costs are highly asymmetric, while training labels are often corrupted due to measurement error, annotator variability, or adversarial noise. The Neyman-Pearson multiclass classification (NPMC) framework addresses such asymmetry by controlling class-specific errors, but existing methods assume that training labels are correctly observed. To our knowledge, no existing approach handles NPMC under label noise in the multiclass setting, and the only binary method requires prior knowledge of the noise mechanism. A fundamental difficulty is that, without structural assumptions, noisy-label models are non-identifiable: distinct combinations of class-conditional distributions and noise mechanisms can induce the same observed distribution, preventing recovery of the quantities required for error control. We show that the exponential tilting density ratio model restores identifiability, and leverage this structure to develop an empirical likelihood approach for NPMC with noisy labels. The proposed method jointly estimates clean-label class proportions, posterior probabilities, and the noise mechanism from noisy data, without requiring prior knowledge of the confusion matrix. An expectation-maximization algorithm enables efficient computation. The resulting estimators are root n consistent and asymptotically normal, and the induced classifiers satisfy Neyman-Pearson oracle inequalities in both binary and multiclass settings. Simulation and real-data experiments demonstrate near-oracle performance.

stat.ME↗
arXiv2026

Polynomial Stability of an Elastic Thin Plate on Non-Smooth Domain

This paper studies the polynomial stabilization of an elastic plate with dynamical boundary conditions on a non-smooth domain. To deal with the possible loss of solution regularity induced by boundary singularities, we formulate the problem as a precise variational framework. We prove that for domains with sufficiently small corner angles, the system retains the polynomial decay rate under standard geometric control conditions. In cases where larger corner angles lead to a significant regularity loss, we show that polynomial stability is recovered by introducing a feedback control at the corners.

math.AP↗
arXiv2026

The Stability of a Coupled Degenerate Wave System Under Boundary Control

In this paper, we investigate a system composed of two degenerate wave equations which are connected at one point. By introducing some inequalities on the weighted spaces and employing the frequency domain method, we prove that the system is polynomially stable,which depends on the degree of the degeneracy.

math.AP↗
arXiv2026

Polynomial Stability of a Type II Porous Thermoelastic System with Local Memory Damping

This paper studies the asymptotic behavior of a one-dimensional Type II porous thermoelastic system with a conservative porous structure and local memory damping applied to the elastic component. Using frequency domain resolvent estimates, we prove polynomial decay of the associated semigroup. Our results clarify the effect of local memory damping and provide a unified framework for partially damped porous thermoelastic systems

math.AP↗
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↗