Modified swarm-based metaheuristics enhance Gradient Descent initialization performance: Application for EEG spatial filtering
원문 초록
Gradient Descent (GD) approximators often fail in the solution space with multiple scales of convexities, i.e., in subspace learning and neural network scenarios. To handle that, one solution is to run GD multiple times from different randomized initial states and select the best solution over all experiments. However, this idea is proved impractical in plenty of cases. Even Swarm-based optimizers like Particle Swarm Optimization (PSO) or Imperialistic Competitive Algorithm (ICA), as commonly used GD initializers, have failed to find optimal solutions in some applications. In this paper, Swarm-based optimizers like ICA and PSO are modified by a new optimization framework to improve GD optimization performance. This improvement is for applications with high number of convex localities in multiple scales. Performance of the proposed method is analyzed in a nonlinear subspace filtering objective function over EEG data. The proposed metaheuristic outperforms commonly used baseline optimizers as GD initializers in both the EEG classification accuracy and EEG loss function fitness. The optimizers have been also compared to each other in some of CEC 2014 benchmark functions, where again our method outperforms other algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Dataset combining EEG, eye-tracking, and high-speed video for ocular activity analysis across BCI paradigms
A Statistical Approach for Synthetic EEG Data Generation
Decoding Covert Speech from EEG Using a Functional Areas Spatio-Temporal Transformer
EEG-CLIP : Learning EEG representations from natural language descriptions
Spatial Distillation based Distribution Alignment (SDDA) for Cross-Headset EEG Classification
Toward Foundational Model for Sleep Analysis Using a Multimodal Hybrid Self-Supervised Learning Framework
토론
이 논문과 연결된 포럼 글이 아직 없습니다.