Arrow Research search

Author name cluster

Xiaoxue Yang

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.

2 papers
1 author row

Possible papers

2

TMLR Journal 2025 Journal Article

Balanced Mixed-Type Tabular Data Synthesis with Diffusion Models

  • Zeyu Yang
  • Han Yu
  • Peikun Guo
  • Khadija Zanna
  • Xiaoxue Yang
  • Akane Sano

Diffusion models have emerged as a robust framework for various generative tasks, including tabular data synthesis. However, current tabular diffusion models tend to inherit bias in the training dataset and generate biased synthetic data, which may influence discriminatory actions. In this research, we introduce a novel tabular diffusion model that incorporates sensitive guidance to generate fair synthetic data with balanced joint distributions of the target label and sensitive attributes, such as sex and race. The empirical results demonstrate that our method effectively mitigates bias in training data while maintaining the quality of the generated samples. Furthermore, we provide evidence that our approach outperforms existing methods for synthesizing tabular data on fairness metrics such as demographic parity ratio and equalized odds ratio, achieving improvements of over $10\%$. Our implementation is available at https://github.com/comp-well-org/fair-tab-diffusion.

TCS Journal 2016 Journal Article

On conditional fault tolerance and diagnosability of hierarchical cubic networks

  • Shuming Zhou
  • Sulin Song
  • Xiaoxue Yang
  • Lanxiang Chen

Fault tolerance is especially important for interconnection networks, since the growing size of networks increases their vulnerability to component failures. A classical measure for the fault tolerance of a network in the case of vertex failures is its connectivity. Given a network based on a graph G and a positive integer h, the R h -connectivity of G is the minimum cardinality of a set of vertices in G, if any, whose deletion disconnects G, and the minimum degree of every connected component is at least h. This paper investigates the R h -connectivity ( h = 1, 2 ) of the hierarchical cubic network HCN n ( n ≥ 2 ), and shows that κ 1 ( HCN n ) = 2 n, κ 2 ( HCN n ) = 4 n − 4, respectively. Furthermore, the paper establishes the conditional diagnosability of HCN n under the PMC diagnostic model.

v2026.09.13