Ching Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ching Chang has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Wen-Chih Peng
National yang Ming Chiao Tung University
3 shared publications - Fang Sun
University of California, Los Angeles, Los Angeles, CA, USA
2 shared publications - Kaiqiao Han
University of California, Los Angeles, Los Angeles, CA, USA
2 shared publications - Tien-Fu Chen
Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan
2 shared publications - Wei Wang
Macao Polytechnic University
2 shared publications - Xiao Luo
University of Wisconsin–Madison, Madison, WI, USA
2 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13375-13378
Beyond Prediction: Toward Verifiable Physiological Waveform Reasoning: Advances, Challenges, and Future Directions
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13375-13378
Open AccessBeyond Prediction: Toward Verifiable Physiological Waveform Reasoning: Advances, Challenges, and Future Directions
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 9894-9905
FD-Bench: A Modular and Fair Benchmark for Data-driven Fluid Simulation
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 9894-9905
Open AccessFD-Bench: A Modular and Fair Benchmark for Data-driven Fluid Simulation
- Open Access
- 29 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Training Recipes for Agentic Reinforcement Learning in LLMs: A Survey
Standard alignment pipelines like RLHF often fail to instill the robustness required for complex agentic tasks. This survey systematizes Agentic Reinforcement Learning, a paradigm that optimizes policies directly against environmental feedback within a Contextual POMDP framework. Unlike prior reviews cataloging agent capabilities, we focus on the engineering of training recipes necessary to build generalist agents from scratch. Our taxonomy examines schemes for rollout and optimization, infrastructure for high-throughput training, and environments that formalize interaction settings, alongside evaluation benchmarks distinguishing active training gyms from held-out certifications. By synthesizing these disparate components into a unified framework, we aim to accelerate the development of robust, nextgeneration autonomous agents.
- 29 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessTraining Recipes for Agentic Reinforcement Learning in LLMs: A Survey
Standard alignment pipelines like RLHF often fail to instill the robustness required for complex agentic tasks. This survey systematizes Agentic Reinforcement Learning, a paradigm that optimizes policies directly against environmental feedback within a Contextual POMDP framework. Unlike prior reviews cataloging agent capabilities, we focus on the engineering of training recipes necessary to build generalist agents from scratch. Our taxonomy examines schemes for rollout and optimization, infrastructure for high-throughput training, and environments that formalize interaction settings, alongside evaluation benchmarks distinguishing active training gyms from held-out certifications. By synthesizing these disparate components into a unified framework, we aim to accelerate the development of robust, nextgeneration autonomous agents.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 209-220
PromptTSS: A Prompting-Based Approach for Interactive Multi-Granularity Time Series Segmentation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 209-220
Open AccessPromptTSS: A Prompting-Based Approach for Interactive Multi-Granularity Time Series Segmentation
- Top Cited PapersOpen Access
- 15 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (3) , 1-20
LLM4TS: Aligning Pre-Trained LLMs as Data-Efficient Time-Series Forecasters
Multivariate time-series forecasting is vital in various domains, e.g., economic planning and weather prediction. Deep train-from-scratch models have exhibited effective performance yet require large amounts of data, which limits real-world applicability. Recently, researchers have leveraged the representation learning transferability of pre-trained Large Language Models (LLMs) to handle limited non-linguistic datasets effectively. However, incorporating LLMs with time-series data presents challenges of limited adaptation due to different compositions between time-series and linguistic data, and the inability to process multi-scale temporal information. To tackle these challenges, we propose LLM4TS, a framework for time-series forecasting with pre-trained LLMs. LLM4TS consists of a two-stage fine-tuning strategy: the time-series alignment stage to align LLMs with the nuances of time-series data and the forecasting fine-tuning stage for downstream time-series forecasting tasks. Furthermore, our framework features a novel two-level aggregation method that integrates multi-scale temporal data within pre-trained LLMs, enhancing their ability to interpret time-specific information. In experiments across seven time-series forecasting datasets, LLM4TS is superior to existing state-of-the-art methods compared with trained-from-scratch models in full-shot scenarios and also achieves the highest rank in few-shot scenarios. In addition, evaluations compared with different unsupervised representation learning approaches highlight LLM4TS’s effectiveness with representation learning in forecasting tasks. Ablation studies further validate each component’s contribution to LLM4TS and underscore the essential role of utilizing LLM’s pre-trained weights for optimal performance. The code is available at https://github.com/blacksnail789521/LLM4TS .
- 15 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (3) , 1-20
Top Cited PapersOpen AccessLLM4TS: Aligning Pre-Trained LLMs as Data-Efficient Time-Series Forecasters
Multivariate time-series forecasting is vital in various domains, e.g., economic planning and weather prediction. Deep train-from-scratch models have exhibited effective performance yet require large amounts of data, which limits real-world applicability. Recently, researchers have leveraged the representation learning transferability of pre-trained Large Language Models (LLMs) to handle limited non-linguistic datasets effectively. However, incorporating LLMs with time-series data presents challenges of limited adaptation due to different compositions between time-series and linguistic data, and the inability to process multi-scale temporal information. To tackle these challenges, we propose LLM4TS, a framework for time-series forecasting with pre-trained LLMs. LLM4TS consists of a two-stage fine-tuning strategy: the time-series alignment stage to align LLMs with the nuances of time-series data and the forecasting fine-tuning stage for downstream time-series forecasting tasks. Furthermore, our framework features a novel two-level aggregation method that integrates multi-scale temporal data within pre-trained LLMs, enhancing their ability to interpret time-specific information. In experiments across seven time-series forecasting datasets, LLM4TS is superior to existing state-of-the-art methods compared with trained-from-scratch models in full-shot scenarios and also achieves the highest rank in few-shot scenarios. In addition, evaluations compared with different unsupervised representation learning approaches highlight LLM4TS’s effectiveness with representation learning in forecasting tasks. Ablation studies further validate each component’s contribution to LLM4TS and underscore the essential role of utilizing LLM’s pre-trained weights for optimal performance. The code is available at https://github.com/blacksnail789521/LLM4TS .
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 4803-4810
COKE: Causal Discovery with Chronological Order and Expert Knowledge in High Proportion of Missing Manufacturing Data
Understanding causal relationships between machines is crucial for fault diagnosis and optimization in manufacturing processes. Real-world datasets frequently exhibit up to 90% missing data and high dimensionality from hundreds of sensors. These datasets also include domain-specific expert knowledge and chronological order information, reflecting the recording order across different machines, which is pivotal for discerning causal relationships within the manufacturing data. However, previous methods for handling missing data in scenarios akin to real-world conditions have not been able to effectively utilize expert knowledge. Conversely, prior methods that can incorporate expert knowledge struggle with datasets that exhibit missing values. Therefore, we propose COKE to construct causal graphs in manufacturing datasets by leveraging expert knowledge and chronological order among sensors without imputing missing data. Utilizing the characteristics of the recipe, we maximize the use of samples with missing values, derive embeddings from intersections with an initial graph that incorporates expert knowledge and chronological order, and create a sensor ordering graph. The graph-generating process has been optimized by an actor-critic architecture to obtain a final graph that has a maximum reward. Experimental evaluations in diverse settings of sensor quantities and missing proportions demonstrate that our approach compared with the benchmark methods shows an average improvement of 39.9% in the F1-score. Moreover, the F1-score improvement can reach 62.6% when considering the configuration similar to real-world datasets, and 85.0% in real-world semiconductor datasets. The source code is available at https://github.com/OuTingYun/COKE.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 4803-4810
Open AccessCOKE: Causal Discovery with Chronological Order and Expert Knowledge in High Proportion of Missing Manufacturing Data
Understanding causal relationships between machines is crucial for fault diagnosis and optimization in manufacturing processes. Real-world datasets frequently exhibit up to 90% missing data and high dimensionality from hundreds of sensors. These datasets also include domain-specific expert knowledge and chronological order information, reflecting the recording order across different machines, which is pivotal for discerning causal relationships within the manufacturing data. However, previous methods for handling missing data in scenarios akin to real-world conditions have not been able to effectively utilize expert knowledge. Conversely, prior methods that can incorporate expert knowledge struggle with datasets that exhibit missing values. Therefore, we propose COKE to construct causal graphs in manufacturing datasets by leveraging expert knowledge and chronological order among sensors without imputing missing data. Utilizing the characteristics of the recipe, we maximize the use of samples with missing values, derive embeddings from intersections with an initial graph that incorporates expert knowledge and chronological order, and create a sensor ordering graph. The graph-generating process has been optimized by an actor-critic architecture to obtain a final graph that has a maximum reward. Experimental evaluations in diverse settings of sensor quantities and missing proportions demonstrate that our approach compared with the benchmark methods shows an average improvement of 39.9% in the F1-score. Moreover, the F1-score improvement can reach 62.6% when considering the configuration similar to real-world datasets, and 85.0% in real-world semiconductor datasets. The source code is available at https://github.com/OuTingYun/COKE.