Jie Si Yang

Jie Si Yang

Auto-generated profile, based on publicly available information

Jie Si Yang

The University of Utah, Salt Lake City, UT, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 November 2025 in IEEE Access
Verified
Journal Article
Open access
SYShiyu Yang
Shiyu Yang
GDGuanyu Ding
Guanyu Ding
ZCZifan Chen
Zifan Chen
JYJie Si Yang
Jie Si Yang
Modern distributed computing systems face significant challenges in achieving optimal resource utilization and maintaining performance stability when operating in heterogeneous cluster environments with dynamic workloads. Existing task scheduling approaches often rely on heuristic rules or static policies that fail to adapt to runtime variations such as node failures, load fluctuations, and heterogeneous resource capacities. To address these limitations, we propose GART (Graph-based Adaptive Robust Task scheduling), a novel framework that leverages graph neural networks (GNN) and reinforcement learning for intelligent task scheduling in distributed systems. GART models distributed task workflows as directed acyclic graphs (DAGs) and employs a specially designed GNN architecture to capture complex inter-task dependencies and resource requirements. The framework learns optimal scheduling policies through deep reinforcement learning, enabling adaptive decision-making that responds to dynamic system conditions. Our approach incorporates a robust scheduling mechanism that maintains high throughput and low latency even under adverse conditions including node failures and sudden load spikes. Extensive experiments on the Alibaba cluster trace dataset demonstrate that GART achieves 23.7% improvement in average job completion time, 31.4% reduction in resource imbalance, and 42.6% better resilience to node failures compared to state-of-the-art baseline schedulers including Shortest Job First, Tetrisched, and Decima. The results validate GART’s effectiveness in real-world heterogeneous distributed computing environments and its potential for deployment in production systems.

4 October 2023 in Renewable Energy
Verified
Journal Article
Closed access
CLChien-Liang Liu
Chien-Liang Liu
TCTzu-Yu Chang
Tzu-Yu Chang
JYJie-Si Yang
Jie-Si Yang
KHKai-Bin Huang
Kai-Bin Huang

28 November 2025 in IEEE Access
Verified
Journal Article
Open access
JYJie-Si Yang
Jie-Si Yang
ZZZhuoqi Zeng
Zhuoqi Zeng
ZSZijian Shen
Zijian Shen
Contemporary retrieval-augmented generation systems face a fundamental trade-off between semantic comprehensiveness and computational tractability when scaling to billion-token corpora. We present a unified framework that reconciles this tension through neural-symbolic dual-indexing, wherein sparse graph skeletons constructed from high-centrality document chunks enable structured reasoning, while complementary bipartite keyword indices ensure broad semantic coverage. Our architecture achieves this decomposition by formulating retrieval as a constrained optimization problem over heterogeneous index structures, employing Prize-Collecting Steiner Trees for subgraph extraction and Personalized PageRank for multi-hop traversal. Through synergistic integration of Graph Neural Networks with vector embeddings, the system performs explicit relational reasoning while maintaining sub-second query latency. Empirical evaluation across 6.0 benchmark datasets demonstrates that selective skeleton construction from the top 20.0% of chunks—identified via eigenvector centrality on k-nearest neighbor graphs—yields 10.0× cost reduction relative to exhaustive knowledge graph construction while improving generation quality by 32.4% and retrieval coverage by 92.4%. Furthermore, neural-symbolic coupling enables 7.0-billion parameter models to match GPT-4 performance on multi-hop question answering through single-step graph-guided inference, eliminating iterative retrieval overhead. Production deployments validate sub-200.0ms latency at scale through hierarchical caching strategies that reduce time-to-first-token by 4.0×. The proposed framework establishes dual-indexing as the canonical architecture for enterprise retrieval systems, providing a principled methodology for balancing semantic understanding against structured reasoning in large-scale information access.

13 March 2026 in IEEE Access
Verified
Journal Article
Open access
WZWenyu Zhao
Wenyu Zhao
TCTingjie Chen
Tingjie Chen
JYJie Si Yang
Jie Si Yang
LQLei Qiu
Lei Qiu
The proliferation of cloud-native machine learning platforms has significantly accelerated model development and deployment cycles. However, constructing and maintaining heterogeneous pipeline code spanning multiple languages (Python, YAML, Spark SQL) and cloud-specific configurations remains labor-intensive and error-prone. Existing LLM-based code generation tools lack awareness of runtime constraints and historical execution patterns, frequently producing code with resource misconfigurations or dependency conflicts that fail upon deployment. To address these challenges, we propose AutoML-Pipeline, a closed-loop code generation framework that integrates Retrieval-Augmented Generation (RAG) with reinforcement learning feedback mechanisms. Our approach leverages a knowledge base constructed from successful pipeline execution logs to guide GPT-4 in generating deployment-ready code that adheres to platform-specific constraints. The key innovation lies in a novel Pre-validation Agent that employs simulated execution environments to predict resource consumption and detect dependency conflicts before actual deployment. This agent iteratively refines generated code through a feedback loop informed by predicted execution profiles and dependency graphs. We evaluate our framework on the CodeSearchNet dataset augmented with Azure ML pipeline specifications, demonstrating a 43.7% improvement in first-submission success rate and 31.2% reduction in resource over-provisioning compared to vanilla GPT-4 baselines. Ablation studies confirm that both the RAG retrieval mechanism and pre-validation agent contribute substantially to performance gains. Our work establishes a practical paradigm for integrating large language models with domain-specific runtime intelligence, with potential applications extending to other infrastructure-as-code generation tasks.

1 January 2026 in IEEE Access
Verified
Journal Article
Open access
ZGZixuan Guo
Zixuan Guo
QFQianyi Fang
Qianyi Fang
JYJie-Si Yang
Jie-Si Yang
MRMinjae Rhee
Minjae Rhee

12 May 2026 in IEEE Access
Verified
Journal Article
Open access
ZWZimeng Wang
Zimeng Wang
JYJie Si Yang
Jie Si Yang
WSWenbin Shang
Wenbin Shang
JDJianbo Ding
Jianbo Ding
Talent promotion decisions are critical for organizational success, yet traditional prediction models often suffer from opacity and inherited biases embedded in historical data. These black-box systems not only lack transparency but also perpetuate discriminatory patterns related to sensitive attributes such as gender and geographic location, undermining organizational fairness and employee trust. Moreover, existing evaluation metrics struggle to quantify the unstructured contributions of senior management, leading to poor generalization in complex personnel decisions. To address these challenges, we propose FairPromote, a novel framework that integrates SHAP (SHapley Additive exPlanations) values with adversarial debiasing techniques within an ensemble learning architecture. Our approach simultaneously achieves high prediction accuracy while automatically identifying and mitigating the negative impact of sensitive attributes on promotion decisions. The framework employs a dual-objective optimization strategy: a primary predictor maximizes promotion prediction performance, while an adversarial discriminator minimizes the ability to infer sensitive attributes from learned representations. Through SHAP-based local explanation plots, FairPromote provides instance-level attribution analysis for each personnel decision, addressing the critical trust deficit in algorithmic decision-making systems. We evaluate our framework on the IBM HR Analytics dataset, demonstrating superior performance across multiple dimensions. Experimental results show that FairPromote achieves 91.3% prediction accuracy while reducing demographic parity difference by 68% and equalized odds disparity by 72% compared to baseline models. The SHAP-based interpretations reveal that job involvement, years at company, and performance ratings are the primary drivers of promotion decisions, while successfully neutralizing the influence of gender and marital status.