Proximal Policy-Guided Hyperparameter Optimization for Mitigating Model Decay in Cryptocurrency Scam Detection
- Authors
- Choi, Su-Hwan; Choi, Sang-Min; Buu, Seok-Jun
- Issue Date
- Mar-2025
- Publisher
- MDPI AG
- Keywords
- model decay; hyperparameter optimization (HPO); reinforcement learning (RL); proximal policy optimization (PPO); cryptocurrency security; fraud detection
- Citation
- Electronics (Basel), v.14, no.6
- Indexed
- SCIE
SCOPUS
- Journal Title
- Electronics (Basel)
- Volume
- 14
- Number
- 6
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/77703
- DOI
- 10.3390/electronics14061192
- ISSN
- 2079-9292
2079-9292
- Abstract
- As cryptocurrency transactions continue to grow, detecting scams within transaction records remains a critical challenge. These transactions can be represented as dynamic graphs, where Neural Network Convolution (NNConv) models are widely used for detection. However, NNConv models suffer from model decay due to evolving transaction patterns, the introduction of new users, and the emergence of adversarial techniques designed to evade detection. To address this issue, we propose an automated, periodic hyperparameter optimization method based on proximal policy optimization (PPO), a reinforcement learning algorithm designed for dynamic environments. By leveraging PPO's stable policy updates and efficient exploration strategies, our approach continuously refines hyperparameters to sustain model performance without frequent retraining. We evaluate the proposed method on a large-scale cryptocurrency transaction dataset containing 2,973,489 nodes and 13,551,303 edges. The results demonstrate that our method achieves an F1 score of 0.9478, outperforming existing graph-based approaches. These findings validate the effectiveness of PPO-based optimization in mitigating model decay and ensuring robust cryptocurrency scam detection.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.