Maximizing SER Performance with ICR-SEA: A Novel Framework for Grid-Search Optimization

This proposed work develops a novel strategy to optimize CNN-LSTM (Convolutional Neural Network-Long Short-Term Memory for SER (Speech Emotion Recognition) using Mel-spectrograms as input features with the RAVDESS (Ryerson Audio-Visual Database of Emotional Speech and Song) data corpus. Data pre-preparation, including dataset class balancing and augmentation improves model generalization. The hyperparameter tuning strategy employs the Iterative Candidate Refinement with Successive Epoch Adjustment (ICR-SEA) algorithm, which efficiently tunes the CNN-LSTM architecture and training parameters. This approach systematically filters best candidates while dynamically adjusting the number of training epochs, ensuring computational effectiveness. This hyperparameter tuning process investigates changes in convolutional filters, kernel sizes, dense layer sizes, dropout rates, batch sizes, learning rates, and epochs. The top-performing candidate model is precisely evaluated and filtered for the next iteration. The optimized model reaches a classification accuracy of 85.36% approximately during hyperparameter tuning. This research emphasizes the effectiveness of the ICR-SEA algorithm in hyperparameter optimization and the significance of data augmentation in improving the generalizability and performance of emotion recognition systems, setting a benchmark for future work with the RAVDESS dataset.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/apsit63993.2025.11086109
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Maximizing SER Performance with ICR-SEA: A Novel Framework for Grid-Search Optimization

Tarun Rathi, Manoj Tripathy
Distributed and Parallel Computing Systems
article

Maximizing SER Performance with ICR-SEA: A Novel Framework for Grid-Search Optimization

Tarun Rathi, Manoj Tripathy
article en

Abstract

This proposed work develops a novel strategy to optimize CNN-LSTM (Convolutional Neural Network-Long Short-Term Memory for SER (Speech Emotion Recognition) using Mel-spectrograms as input features with the RAVDESS (Ryerson Audio-Visual Database of Emotional Speech and Song) data corpus. Data pre-preparation, including dataset class balancing and augmentation improves model generalization. The hyperparameter tuning strategy employs the Iterative Candidate Refinement with Successive Epoch Adjustment (ICR-SEA) algorithm, which efficiently tunes the CNN-LSTM architecture and training parameters. This approach systematically filters best candidates while dynamically adjusting the number of training epochs, ensuring computational effectiveness. This hyperparameter tuning process investigates changes in convolutional filters, kernel sizes, dense layer sizes, dropout rates, batch sizes, learning rates, and epochs. The top-performing candidate model is precisely evaluated and filtered for the next iteration. The optimized model reaches a classification accuracy of 85.36% approximately during hyperparameter tuning. This research emphasizes the effectiveness of the ICR-SEA algorithm in hyperparameter optimization and the significance of data augmentation in improving the generalizability and performance of emotion recognition systems, setting a benchmark for future work with the RAVDESS dataset.

Indian Institute of Technology Roorkee (IN)
Life below water
Openalex Percentile: Top 80%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.