No abstract

Recent work presented a framework for space-time-resolved neurophysiological process imaging that augments existing electromagnetic source imaging techniques. In particular, a nonlinear Analytic Kalman filter (AKF) has been developed to efficiently infer the states and parameters of neural mass models believed to underlie the generation of electromagnetic source currents. Unfortunately, as the initialization determines the performance of the Kalman filter, and the ground truth is typically unavailable for initialization, this framework might produce suboptimal results unless significant effort is spent on tuning the initialization. Notably, the relation between the initialization and overall filter performance is only given implicitly and is expensive to evaluate; implying that conventional optimization techniques, e.g. gradient or sampling based, are inapplicable. To address this problem, a novel efficient framework based on blackbox optimization has been developed to find the optimal initialization by reducing the signal prediction error. Multiple state-of-the-art optimization methods were compared and distinctively, Gaussian process optimization decreased the objective function by 82.1% and parameter estimation error by 62.5% on average with the simulation data compared to no optimization applied. The framework took only 1.6[Formula: see text]h and reduced the objective function by an average of 13.2% on 3.75[Formula: see text]min 4714-source channel magnetoencephalography data. This yields an improved method of neurophysiological process imaging that can be used to uncover complex underpinnings of brain dynamics.

Rule ensembles are designed to provide a useful trade-off between predictive accuracy and model interpretability. However, the myopic and random search components of current rule ensemble methods can compromise this goal: they often need more rules than necessary to reach a certain accuracy level or can even outright fail to accurately model a distribution that can actually be described well with a few rules. Here, we present a novel approach aiming to fit rule ensembles of maximal predictive power for a given ensemble size (and thus model comprehensibility). In particular, we present an efficient branch-and-bound algorithm that optimally solves the per-rule objective function of the popular second-order gradient boosting framework. Our main insight is that the boosting objective can be tightly bounded in linear time of the number of covered data points. Along with an additional novel pruning technique related to rule redundancy, this leads to a computationally feasible approach for boosting optimal rules that, as we demonstrate on a wide range of common benchmark problems, consistently outperforms the predictive performance of boosting greedy rules.