1 July 2011 in Cybernetics and Systems Analysis
The purpose of this study was to evaluate a signal regularity-based automated seizure prediction algorithm for scalp EEG. Signal regularity was quantified using the Pattern Match Regularity Statistic (PMRS), a statistical measure. The primary feature of the prediction algorithm is the degree of convergence in PMRS (“PMRS entrainment”) among the electrode groups determined in the algorithm training process. The hypothesis is that the PMRS entrainment increases during the transition between interictal and ictal states, and therefore may serve as an indicator for prediction of an impending seizure.
9 June 2025 in Expert Systems with Applications
28 October 2026 in Journal of King Saud University Computer and Information Sciences
Actor-critic methods with theoretical convergence guarantees constitute an important class of algorithms for multi-objective reinforcement learning. To date, existing provable multi-objective actor-critic algorithms are limited to linear critic approximation and conventional stochastic actor updates. Consequently, a gap remains between the theoretical understanding of multi-objective actor-critic methods and the empirical success of deep neural actor-critic algorithms. To fill this gap, we propose a provable M ean- F ield L angevin M ulti- O bjective N eural A ctor- C ritic algorithm, referred to as MFL-MONAC, where mean-field Langevin dynamics is incorporated into both objective-wise critic evaluation and Pareto-guided actor improvement. Concretely, the critic performs regularized mean-field Langevin policy evaluation for each objective, while the actor uses MGDA-based gradient aggregation with momentum to construct a Pareto-guided update direction and applies mean-field Langevin dynamics to induce controlled particle-level exploration. We further establish a finite-time analysis for the MFL-MONAC algorithm, i.e., we show that the MFL-MONAC algorithm achieves ε -Pareto stationarity at a rate of $${{\mathcal{O}}}(1/\sqrt{T})$$ , where T is the number of iterations. Moreover, MFL-MONAC achieves a sufficient sample complexity of $${{\mathcal{O}}}({\varepsilon }^{-6})$$ . Finally, we conduct experiments on representative MORL benchmarks to demonstrate the effectiveness of MFL-MONAC.
1 January 2026 in IEEE Internet of Things Journal