Electrical storm (ES) is a serious arrhythmic syndrome that is characterized by recurrent episodes of ventricular arrhythmias. Electrical storm is associated with increased mortality and morbidity despite the use of implantable cardioverter-defibrillators (ICDs). Predicting ES could be essential; however, models for predicting this event have never been developed. The goal of this study was to construct and validate machine learning models to predict ES based on daily ICD remote monitoring summaries. Daily ICD summaries from 19 935 patients were used to construct and evaluate two models [logistic regression (LR) and random forest (RF)] for predicting the short-term risk of ES. The models were evaluated on the parts of the data not used for model development. Random forest performed significantly better than LR (P < 0.01), achieving a test accuracy of 0.96 and an area under the curve (AUC) of 0.80 (vs. an accuracy of 0.96 and an AUC of 0.75). The percentage of ventricular pacing and the daytime activity were the most relevant variables in the RF model. The use of large-scale machine learning showed that daily summaries of ICD measurements in the absence of clinical information can predict the short-term risk of ES.

Image registration aims to find geometric transformations that align images. Most algorithmic and deep learning-based methods solve the registration problem by minimizing a loss function, consisting of a similarity metric comparing the aligned images, and a regularization term ensuring smoothness of the transformation. Existing similarity metrics like Euclidean Distance or Normalized Cross-Correlation focus on aligning pixel intensity values or correlations, giving difficulties with low intensity contrast, noise, and ambiguous matching. We propose a semantic similarity metric for image registration, focusing on aligning image areas based on semantic correspondence instead. Our approach learns dataset-specific features that drive the optimization of a learning-based registration model. We train both an unsupervised approach extracting features with an auto-encoder, and a semi-supervised approach using supplemental segmentation data. We validate the semantic similarity metric using both deep-learning-based and algorithmic image registration methods. Compared to existing methods across four different image modalities and applications, the method achieves consistently high registration accuracy and smooth transformation fields.

Quantum dot arrays possess ground states governed by Coulomb energies, utilized prominently by singly occupied quantum dots, each implementing a spin qubit. For such quantum processors, the controlled transitions between ground states are of operational significance, as these allow the control of quantum information within the array such as qubit initialization and entangling gates. For few-dot arrays, ground states are traditionally mapped out by performing dense raster-scan measurements in control-voltage space. These become impractical for larger arrays due to the large number of measurements needed to sample the high-dimensional gate-voltage hypercube and the comparatively little information extracted. We develop a hardware-triggered detection method based on reflectometry, to acquire measurements directly corresponding to transitions between ground states. These measurements are distributed sparsely within the high-dimensional voltage space by executing line searches proposed by a learning algorithm. Our autonomous software-hardware algorithm accurately estimates the polytope of Coulomb blockade boundaries, experimentally demonstrated in a $2\times 2$ array of silicon quantum dots.

Learning covariance matrices of Gaussian distributions is at the heart of most variable-metric randomized algorithms for continuous optimization. If the search space dimensionality is high, updating the covariance or its factorization is computationally expensive. Therefore, we adopt an algorithm from numerical mathematics for rank-one updates of Cholesky factors. Our methods results in a quadratic time covariance matrix update scheme with minimal memory requirements. The numerically stable algorithm leads to triangular Cholesky factors. Systems of linear equations where the linear transformation is defined by a triangular matrix can be solved in quadratic time. This can be exploited to avoid the additional iterative update of the inverse Cholesky factor required in some covariance matrix adaptation algorithms proposed in the literature. When used together with the (1+1)-CMA-ES and the multi-objective CMA-ES, the new method leads to a memory reduction by a factor of almost four and a faster covariance matrix update. The numerical stability and runtime improvements are demonstrated on a set of benchmark functions.

The unbounded population multi-objective covariance matrix adaptation evolution strategy~(UP-MO-CMA-ES) aims at maximizing the total hypervolume covered by all evaluated points. It adds all non-dominated solutions found to its population and employs Gaussian mutations with adaptive covariance matrices to also solve ill-conditioned problems. A novel recombination operator adapts the covariance matrices to point along the Pareto front. The UP-MO-CMA-ES is combined with a parallel exploration strategy and empirically evaluated on the bi-objective BBOB-biobj benchmark problems. Results show that the algorithm can reliably solve ill-conditioned problems as well as weakly-structured problems. However, it is less suited for the rugged multi-modal objective functions in the benchmark.