SearcharxivSearch

arXiv subjects

Shudong Sun

Publications and source records attributed to Shudong Sun.

9 recordsLinked to original sources

Quantifying Data Similarity Using Cross Learning

Measuring dataset similarity is fundamental in machine learning, particularly for transfer learning and domain adaptation. In the context of supervised learning, most existing approaches quantify similarity of two data sets based on their input feature distributions, neglecting label information and feature-response alignment. To address this, we propose the Cross-Learning Score (CLS), which measures dataset similarity through bidirectional generalization performance of decision rules. We establish its theoretical foundation by linking CLS to cosine similarity between decision boundaries under canonical linear models, providing a geometric interpretation. A robust ensemble-based estimator is developed that is easy to implement and bypasses high-dimensional density estimation entirely. For transfer learning applications, we introduce a "transferable zones" framework that categorizes source datasets into positive, ambiguous, and negative transfer regions. To accommodate deep learning, we extend CLS to encoder-head architectures, aligning with modern representation-based pipelines. Extensive experiments on synthetic and real-world datasets validate the effectiveness of CLS for similarity measurement and transfer assessment.

stat.ML

Optimal Pair Matching Combined with Machine Learning Predicts a Significant Reduction in Myocardial Infarction Risk in African Americans following Omega-3 Fatty Acid Supplementation

Conflicting clinical trial results on omega-3 highly unsaturated fatty acids (n-3 HUFA) have prompted uncertainty about their cardioprotective effects. While the VITAL trial found no overall cardiovascular benefit from n-3 HUFA supplementation, its substantial African American (AfAm) enrollment provided a unique opportunity to explore racial differences in response to n-3 HUFA supplementation. The current observational study aimed to simulate randomized clinical trial (RCT) conditions by matching 3,766 AfAm and 15,553 non-Hispanic White (NHW) individuals from the VITAL trial utilizing propensity score matching to address the limitations related to differences in confounding variables between the two groups. Within matched groups (3,766 AfAm and 3,766 NHW), n-3 HUFA supplementation's impact on myocardial infarction (MI), stroke, and cardiovascular disease (CVD) mortality was assessed. A weighted decision tree analysis revealed belonging to the n-3 supplementation group as the most significant predictor of MI among AfAm but not NHW. Further logistic regression using the LASSO method and bootstrap estimation of standard errors indicated n-3 supplementation significantly lowered MI risk in AfAm (OR 0.17, 95% CI [0.048, 0.60]), with no such effect in NHW. This study underscores the critical need for future RCT to explore racial disparities in MI risk associated with n-3 HUFA supplementation and highlights potential causal differences between supplementation health outcomes in AfAm versus NHW populations.

q-bio.QM

Partial Consensus and Conservative Fusion of Gaussian Mixtures for Distributed PHD Fusion

We propose a novel consensus notion, called "partial consensus", for distributed GM-PHD (Gaussian mixture probability hypothesis density) fusion based on a peer-to-peer (P2P) sensor network, in which only highly-weighted posterior Gaussian components (GCs) are disseminated in the P2P communication for fusion while the insignificant GCs are not involved. The partial consensus does not only enjoy high efficiency in both network communication and local fusion computation, but also significantly reduces the affect of potential false data (clutter) to the filter, leading to increased signal-to-noise ratio at local sensors. Two "conservative" mixture reduction schemes are advocated for fusing the shared GCs in a fully distributed manner. One is given by pairwise averaging GCs between sensors based on Hungarian assignment and the other is merging close GCs based a new GM merging scheme. The proposed approaches have a close connection to the conservative fusion approaches known as covariance union and arithmetic mean density. In parallel, average consensus is sought on the cardinality distribution (namely the GM weight sum) among sensors. Simulations for tracking either a single target or multiple targets that simultaneously appear are presented based on a sensor network where each sensor operates a GM-PHD filter, in order to compare our approaches with the benchmark generalized covariance intersection approach. The results demonstrate that the partial, arithmetic average, consensus outperforms the complete, geometric average, consensus.

eess.SY

Joint Smoothing, Tracking, and Forecasting Based on Continuous-Time Target Trajectory Fitting

We present a continuous time state estimation framework that unifies traditionally individual tasks of smoothing, tracking, and forecasting (STF), for a class of targets subject to smooth motion processes, e.g., the target moves with nearly constant acceleration or affected by insignificant noises. Fundamentally different from the conventional Markov transition formulation, the state process is modeled by a continuous trajectory function of time (FoT) and the STF problem is formulated as an online data fitting problem with the goal of finding the trajectory FoT that best fits the observations in a sliding time-window. Then, the state of the target, whether the past (namely, smoothing), the current (filtering) or the near-future (forecasting), can be inferred from the FoT. Our framework releases stringent statistical modeling of the target motion in real time, and is applicable to a broad range of real world targets of significance such as passenger aircraft and ships which move on scheduled, (segmented) smooth paths but little statistical knowledge is given about their real time movement and even about the sensors. In addition, the proposed STF framework inherits the advantages of data fitting for accommodating arbitrary sensor revisit time, target maneuvering and missed detection. The proposed method is compared with state of the art estimators in scenarios of either maneuvering or non-maneuvering target.

stat.AP

Do we always need a filter?

Since the groundbreaking work of the Kalman filter in the 1960s, considerable effort has been devoted to various discrete time filters for dynamic state estimation, especially including dozens of different types of suboptimal implementations of the Bayes filters. This has been accompanied by the rapid development of simulation/approximation theories and technologies. While admitting the success of filters in many cases, this study investigates the failure cases when they are in fact ineffective for state estimation. Several classic models have shown that the straightforward observation-only (O2) inference that does not need system modeling can perform better (in terms of both accuracy and computing speed) for estimation than filters. Special attention has been paid to quantitatively analyze when and why a filter will not outperform the O2 inference from the information fusion perspective. Thanks to the rapid development of advanced sensors, the O2 inference is not only engineering friendly and computationally fast but can also be very accurate and reliable by fusing the information received from multiple sensors. The statistical attributes of the multi-sensor O2 inference are analyzed and demonstrated through simulations. In the situation with limited sensors, the O2 approach can work jointly with existing clutter filtering and data association algorithms for multi-target tracking in clutter environments. Given an adequate number of sensors, the O2 approach can employ the multi-sensor data fusion to deal with clutter and can handle the very general multi-target tracking scenario with no background information.

stat.AP

Fighting Sample Degeneracy and Impoverishment in Particle Filters: A Review of Intelligent Approaches

During the last two decades there has been a growing interest in Particle Filtering (PF). However, PF suffers from two long-standing problems that are referred to as sample degeneracy and impoverishment. We are investigating methods that are particularly efficient at Particle Distribution Optimization (PDO) to fight sample degeneracy and impoverishment, with an emphasis on intelligence choices. These methods benefit from such methods as Markov Chain Monte Carlo methods, Mean-shift algorithms, artificial intelligence algorithms (e.g., Particle Swarm Optimization, Genetic Algorithm and Ant Colony Optimization), machine learning approaches (e.g., clustering, splitting and merging) and their hybrids, forming a coherent standpoint to enhance the particle filter. The working mechanism, interrelationship, pros and cons of these approaches are provided. In addition, Approaches that are effective for dealing with high-dimensionality are reviewed. While improving the filter performance in terms of accuracy, robustness and convergence, it is noted that advanced techniques employed in PF often causes additional computational requirement that will in turn sacrifice improvement obtained in real life filtering. This fact, hidden in pure simulations, deserves the attention of the users and designers of new filters.

cs.AI

Numerical Fitting-based Likelihood Calculation to Speed up the Particle Filter

The likelihood calculation of a vast number of particles is the computational bottleneck for the particle filter in applications where the observation information is rich. For fast computing the likelihood of particles, a numerical fitting approach is proposed to construct the Likelihood Probability Density Function (Li-PDF) by using a comparably small number of so-called fulcrums. The likelihood of particles is thereby analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed by utilizing the observation, which can significantly reduce the computation and enables real time filtering. The proposed approach guarantees the estimation quality when an appropriate fitting function and properly distributed fulcrums are used. The details for construction of the fitting function and fulcrums are addressed respectively in detail. In particular, to deal with multivariate fitting, the nonparametric kernel density estimator is presented which is flexible and convenient for implicit Li-PDF implementation. Simulation comparison with a variety of existing approaches on a benchmark 1-dimensional model and multi-dimensional robot localization and visual tracking demonstrate the validity of our approach.

cs.IT

Roughening Methods to Prevent Sample Impoverishment in the Particle PHD Filter

Mahler's PHD (Probability Hypothesis Density) filter and its particle implementation (as called the particle PHD filter) have gained popularity to solve general MTT (Multi-target Tracking) problems. However, the resampling procedure used in the particle PHD filter can cause sample impoverishment. To rejuvenate the diversity of particles, two easy-to-implement roughening approaches are presented to enhance the particle PHD filter. One termed as "separate-roughening" is inspired by Gordon's roughening procedure that is applied on the resampled particles. Another termed as "direct-roughening" is implemented by increasing the simulation noise of the state propagation of particles. Four proposals are presented to customize the roughening approach. Simulations are presented showing that the roughening approach can benefit the particle PHD filter, especially when the sample size is small.

cs.OH

Adapting sample size in particle filters through KLD-resampling

This letter provides an adaptive resampling method. It determines the number of particles to resample so that the Kullback-Leibler distance (KLD) between distribution of particles before resampling and after resampling does not exceed a pre-specified error bound. The basis of the method is the same as Fox's KLD-sampling but implemented differently. The KLD-sampling assumes that samples are coming from the true posterior distribution and ignores any mismatch between the true and the proposal distribution. In contrast, we incorporate the KLD measure into the resampling in which the distribution of interest is just the posterior distribution. That is to say, for sample size adjustment, it is more theoretically rigorous and practically flexible to measure the fit of the distribution represented by weighted particles based on KLD during resampling than in sampling. Simulations of target tracking demonstrate the efficiency of our method.

stat.AP