Jaganmohan Chandrasekaran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jaganmohan Chandrasekaran has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- D. Richard Kuhn
National Institute of Standards and Technology, Gaithersburg, MD, USA
4 shared publications - Raghu N. Kacker
National Institute of Standards and Technology, Gaithersburg, MD, USA
4 shared publications - Erin Lanus
National Security Institute Virginia Tech Arlington VA USA
2 shared publications - Laura Freeman
Virginia Tech
2 shared publications - Mohammad S. Raunak
National Institute of Standards and Technology, Gaithersburg, MD, USA
2 shared publications - Tyler Cody
Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA
2 shared publications
Latest Publications
- 27 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (7) , 16-26
Leveraging Combinatorial Coverage in the Machine Learning Product Lifecycle
The data-intensive nature of machine learning (ML)-enabled systems introduces unique challenges in test and evaluation. We present an overview of combinatorial coverage, exploring its applications across the ML-enabled system lifecycle and its potential to address key limitations in performing test and evaluation for ML-enabled systems.
- 27 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (7) , 16-26
Leveraging Combinatorial Coverage in the Machine Learning Product Lifecycle
The data-intensive nature of machine learning (ML)-enabled systems introduces unique challenges in test and evaluation. We present an overview of combinatorial coverage, exploring its applications across the ML-enabled system lifecycle and its potential to address key limitations in performing test and evaluation for ML-enabled systems.
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (5) , 86-90
Assured Autonomy Through Combinatorial Methods
Many conventional software engineering methods for high-trust software are not well suited to assured autonomy, but concepts from combinatorial testing can add confidence by providing a quantitative measure of the usefulness of a dataset.
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (5) , 86-90
Assured Autonomy Through Combinatorial Methods
Many conventional software engineering methods for high-trust software are not well suited to assured autonomy, but concepts from combinatorial testing can add confidence by providing a quantitative measure of the usefulness of a dataset.
- Open Access
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 140-149
A Combinatorial Approach to Hyperparameter Optimization
In machine learning, hyperparameter optimization (HPO) is essential for effective model training and significantly impacts model performance. Hyperparameters are predefined model settings which fine-tune the model's behavior and are critical to modeling complex data patterns. Traditional HPO approaches such as Grid Search, Random Search, and Bayesian Optimization have been widely used in this field. However, as datasets grow and models increase in complexity, these approaches often require a significant amount of time and resources for HPO. This research introduces a novel approach using t-way testing---a combinatorial approach to software testing used for identifying faults with a test set that covers all t-way interactions---for HPO. T-way testing substantially narrows the search space and effectively covers parameter interactions. Our experimental results show that our approach reduces the number of necessary model evaluations and significantly cuts computational expenses while still outperforming traditional HPO approaches for the models studied in our experiments.
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 140-149
Open AccessA Combinatorial Approach to Hyperparameter Optimization
In machine learning, hyperparameter optimization (HPO) is essential for effective model training and significantly impacts model performance. Hyperparameters are predefined model settings which fine-tune the model's behavior and are critical to modeling complex data patterns. Traditional HPO approaches such as Grid Search, Random Search, and Bayesian Optimization have been widely used in this field. However, as datasets grow and models increase in complexity, these approaches often require a significant amount of time and resources for HPO. This research introduces a novel approach using t-way testing---a combinatorial approach to software testing used for identifying faults with a test set that covers all t-way interactions---for HPO. T-way testing substantially narrows the search space and effectively covers parameter interactions. Our experimental results show that our approach reduces the number of necessary model evaluations and significantly cuts computational expenses while still outperforming traditional HPO approaches for the models studied in our experiments.
- 1 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-140
Effectiveness of dataset reduction in testing machine learning algorithms
Many machine learning algorithms examine large amounts of data to discover insights from hidden patterns. Testing these algorithms can be expensive and time-consuming. There is a need to speed up the testing process, especially in an agile development process, where testing is frequently performed. One approach is to replace big datasets with smaller datasets produced by random sampling. In this paper, we report a set of experiments that are designed to evaluate the effectiveness of using reduced datasets produced by random sampling for testing machine learning algorithms. In our experiments, we use as subject programs four supervised learning algorithms from the Waikato Environment for Knowledge Analysis (WEKA). We identify five datasets from Kaggle.com to run with the four learning algorithms. For each dataset, we generate reduced datasets of different sizes using two random sampling strategies, i.e., pure random and stratified random sampling. We execute our subject programs with the original and the reduced datasets, and measure test effectiveness using branch and mutation coverage. Our results indicate that in most cases, reduced datasets of even very small sizes can achieve the same or similar coverage achieved by the original dataset. Furthermore, our results indicate that reduced datasets produced by the two sample strategies do not differ significantly, and branch coverage correlates with mutation coverage.
- 1 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-140
Effectiveness of dataset reduction in testing machine learning algorithms
Many machine learning algorithms examine large amounts of data to discover insights from hidden patterns. Testing these algorithms can be expensive and time-consuming. There is a need to speed up the testing process, especially in an agile development process, where testing is frequently performed. One approach is to replace big datasets with smaller datasets produced by random sampling. In this paper, we report a set of experiments that are designed to evaluate the effectiveness of using reduced datasets produced by random sampling for testing machine learning algorithms. In our experiments, we use as subject programs four supervised learning algorithms from the Waikato Environment for Knowledge Analysis (WEKA). We identify five datasets from Kaggle.com to run with the four learning algorithms. For each dataset, we generate reduced datasets of different sizes using two random sampling strategies, i.e., pure random and stratified random sampling. We execute our subject programs with the original and the reduced datasets, and measure test effectiveness using branch and mutation coverage. Our results indicate that in most cases, reduced datasets of even very small sizes can achieve the same or similar coverage achieved by the original dataset. Furthermore, our results indicate that reduced datasets produced by the two sample strategies do not differ significantly, and branch coverage correlates with mutation coverage.