Arrow Research search

Author name cluster

Yuedong Wang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

EAAI Journal 2022 Journal Article

Learning-based airborne sensor task assignment in unknown dynamic environments

  • Jing He
  • Yuedong Wang
  • Yan Liang
  • Jinwen Hu
  • Shi Yan

In sensor management, the existing researches rely on traditional system modeling and strive to maximize the information superiority. In fact, on the one hand, complex environmental disturbance, incomplete information or uncooperative behavior in air combat missions often bring out unknown system evolution; on the other hand, to take full advantage of sensor effectiveness is of course essential, but more importantly, the detection security is the primary guarantee. This paper proposes the airborne sensor task assignment problem in unknown dynamic environments. Different from traditional methods that minimize the estimation error covariance or information entropy based on system dynamic model, our scheme needs to maximize agent survival while maintaining the necessary sensor detection without such model support. In assignment implementation, it is not straightforward to apply existing reinforcement learning methods, but design the state space and rewards ingeniously to meet the actual combat requirements. First, instead of selecting the locations of agents and targets as fundamental and infinite state variables, we consider the situation variables, such as target threat ranking together with cumulative radiation and information acquisition indication of sensors, which are all discrete state variables to reduce computational burden. Second, the reward structure is also designed based on the complex constraints of the mission, which is to encourage lower assignment risk and relatively full utilization of sensing, while penalizing too dangerous continuance assignment and inadequate assignment revenue. Simulations show that our proposed scheme achieves the desirable mission completion rate and the acceptable target tracking accuracy.

JMLR Journal 2022 Journal Article

Nonparametric Neighborhood Selection in Graphical Models

  • Hao Dong
  • Yuedong Wang

The neighborhood selection method directly explores the conditional dependence structure and has been widely used to construct undirected graphical models. However, except for some special cases with discrete data, there is little research on nonparametric methods for neighborhood selection with mixed data. This paper develops a fully nonparametric neighborhood selection method under a consolidated smoothing spline ANOVA (SS ANOVA) decomposition framework. The proposed model is flexible and contains many existing models as special cases. The proposed method provides a unified framework for mixed data without any restrictions on the type of each random variable. We detect edges by applying an L1 regularization to interactions in the SS ANOVA decomposition. We propose an iterative procedure to compute the estimates and establish the convergence rates for conditional density and interactions. Simulations indicate that the proposed methods perform well under Gaussian and non-Gaussian settings. We illustrate the proposed methods using two real data examples. [abs] [ pdf ][ bib ] &copy JMLR 2022. ( edit, beta )

NeurIPS Conference 1993 Conference Paper

Structured Machine Learning for 'Soft' Classification with Smoothing Spline ANOVA and Stacked Tuning, Testing and Evaluation

  • Grace Wahba
  • Yuedong Wang
  • Chong Gu
  • Ronald Klein, MD
  • Barbara Klein, MD

We describe the use of smoothing spline analysis of variance (SS(cid: 173) ANOVA) in the penalized log likelihood context, for learning (estimating) the probability p of a '1' outcome, given a train(cid: 173) ing set with attribute vectors and outcomes. p is of the form pet) = eJ(t) /(1 + eJ(t)), where, if t is a vector of attributes, f is learned as a sum of smooth functions of one attribute plus a sum of smooth functions of two attributes, etc. The smoothing parameters governing f are obtained by an iterative unbiased risk or iterative GCV method. Confidence intervals for these estimates are available. Introduction to 'soft' classification and the bias-variance tradeoff. In medical risk factor analysis records of attribute vectors and outcomes (0 or 1) for each example (patient) for n examples are available as training data. Based on the training data, it is desired to estimate the probability p of the 1 outcome for any

v2026.09.13