Application of a hybrid algorithm of LSTM and Transformer based on random search optimization for improving rainfall-runoff simulation.

Flood forecasting using traditional physical hydrology models requires consideration of multiple complex physical processes including the spatio-temporal distribution of rainfall, the spatial heterogeneity of watershed sub-surface characteristics, and runoff generation and routing behaviours. Data-driven models offer novel solutions to these challenges, though they are hindered by difficulties in hyperparameter selection and a decline in prediction stability as the lead time extends. This study introduces a hybrid model, the RS-LSTM-Transformer, which combines Random Search (RS), Long Short-Term Memory networks (LSTM), and the Transformer architecture. Applied to the typical Jingle watershed in the middle reaches of the Yellow River, this model utilises rainfall and runoff data from basin sites to simulate flood processes, and its outcomes are compared against those from RS-LSTM, RS-Transformer, RS-BP, and RS-MLP models. It was evaluated against RS-LSTM, RS-Transformer, RS-BP, and RS-MLP models using the Nash-Sutcliffe Efficiency Coefficient (NSE), Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and Bias percentage as metrics. At a 1-h lead time during calibration and validation, the RS-LSTM-Transformer model achieved NSE, RMSE, MAE, and Bias values of 0.970, 14.001m3/s, 5.304m3/s, 0.501% and 0.953, 14.124m3/s, 6.365m3/s, 0.523%, respectively. These results demonstrate the model's superior simulation capabilities and robustness, providing more accurate peak flow forecasts as the lead time increases. The study highlights the RS-LSTM-Transformer model's potential in flood forecasting and the advantages of integrating various data-driven approaches for innovative modelling.

Automatic fitting of multiple-field solid-state NMR spectra.

The NMR lineshapes produced by half-integer quadrupolar nuclei are sensitive to 11 distinct fit parameters per inequivalent site. To date, automatic fitting routines have failed to replace manual parameter insertion and evaluation due to the importance of local minima and the need for fitting multiple-field magic-angle spinning (MAS) and static spectra simultaneously. Herein we introduce a new tool, AMES-Fit (Automatic Multiple Experiment Simulation and Fitting), to automatically find the global best-fit simulation parameters for a series of multiple-field NMR lineshapes. AMES-Fit uses an adaptive step size random search algorithm to dynamically probe parameter space and requires minimal human input. The best fits are obtained in a few minutes of computation time that would otherwise have required several person-hours of work. The program is freely available and open-source.

Role of Optimization in RNA-Protein-Binding Prediction.

RNA-binding proteins (RBPs) play an important role in regulating biological processes, such as gene regulation. Understanding their behaviors, for example, their binding site, can be helpful in understanding RBP-related diseases. Studies have focused on predicting RNA binding by means of machine learning algorithms including deep convolutional neural network models. One of the integral parts of modeling deep learning is achieving optimal hyperparameter tuning and minimizing a loss function using optimization algorithms. In this paper, we investigate the role of optimization in the RBP classification problem using the CLIP-Seq 21 dataset. Three optimization methods are employed on the RNA-protein binding CNN prediction model; namely, grid search, random search, and Bayesian optimizer. The empirical results show an AUC of 94.42%, 93.78%, 93.23% and 92.68% on the ELAVL1C, ELAVL1B, ELAVL1A, and HNRNPC datasets, respectively, and a mean AUC of 85.30 on 24 datasets. This paper's findings provide evidence on the role of optimizers in improving the performance of RNA-protein binding prediction.

Generalization of navigation memory in honeybees.

Flying insects like the honeybee learn multiple features of the environment for efficient navigation. Here we introduce a novel paradigm in the natural habitat, and ask whether the memory of such features is generalized to novel test conditions. Foraging bees from colonies located in 5 different home areas were tested in a common area for their search flights. The home areas differed in the arrangements of rising natural objects or their lack, and in the existence or lack of elongated ground structures. The test area resembled partly or not at all the layout of landmarks in the respective home areas. In particular, the test area lacked rising objects. The search flights were tracked with harmonic radar and quantified by multiples procedures, extracting their differences on an individual basis. Random search as the only guide for searching was excluded by two model calculations. The frequencies of directions of flight sectors differed from both model calculations and between the home areas in a graded fashion. Densities of search flight fixes were used to create heat maps and classified by a partial least squares regression analysis. Classification was performed with a support vector machine in order to account for optimal hyperplanes. A rank order of well separated clusters was found that partly resemble the graded differences between the ground structures of the home areas and the test area. The guiding effect of elongated ground structures was quantified with respect to the sequence, angle and distance from these ground structures. We conclude that foragers generalize their specific landscape memory in a graded way to the landscape features in the test area, and argue that both the existence and absences of landmarks are taken into account. The conclusion is discussed in the context of the learning and generalization process in an insect, the honeybee, with an emphasis on exploratory learning in the context of navigation.

On a Population Sizing Model for Evolution Strategies Optimizing the Highly Multimodal Rastrigin Function.

A model is presented that allows for the calculation of the success probability by which a vanilla Evolution Strategy converges to the global optimizer of the Rastrigin test function. As a result a population size scaling formula will be derived that allows for an estimation of the population size needed to ensure a high convergence security depending on the search space dimensionality.

Erratum: OPRA-RS: A hearing-aid fitting method based on automatic speech recognition and random search.

[This corrects the article DOI: 10.3389/fnins.2022.779048.].

Time Series Forecasting of Motor Bearing Vibration Based on Informer.

Electric energy, as an economical and clean energy, plays a significant role in the development of science and technology and the economy. The motor is the core equipment of the power station; therefore, monitoring the motor vibration and predicting time series of the bearing vibration can effectively avoid hazards such as bearing heating and reduce energy consumption. Time series forecasting methods of motor bearing vibration based on sliding window forecasting, such as CNN, LSTM, etc., have the problem of error accumulation, and the longer the time-series forecasting, the larger the error. In order to solve the problem of error accumulation caused by the conventional methods of time series forecasting of motor bearing vibration, this paper innovatively introduces Informer into time series forecasting of motor bearing vibration. Based on Transformer, Informer introduces ProbSparse self-attention and self-attention distilling, and applies random search to optimize the model parameters to reduce the error accumulation in forecasting, achieve the optimization of time and space complexity and improve the model forecasting. Comparing the forecasting results of Informer and those of other forecasting models in three publicly available datasets, it is verified that Informer has excellent performance in time series forecasting of motor bearing vibration and the forecasting results reach 10-2∼10-6.

An Embodied Intelligence-Based Biologically Inspired Strategy for Searching a Moving Target.

Bacterial chemotaxis in unicellular Escherichia coli, the simplest biological creature, enables it to perform effective searching behaviour even with a single sensor, achieved via a sequence of "tumbling" and "swimming" behaviours guided by gradient information. Recent studies show that suitable random walk strategies may guide the behaviour in the absence of gradient information. This article presents a novel and minimalistic biologically inspired search strategy inspired by bacterial chemotaxis and embodied intelligence concept: a concept stating that intelligent behaviour is a result of the interaction among the "brain," body morphology including the sensory sensitivity tuned by the morphology, and the environment. Specifically, we present bacterial chemotaxis inspired searching behaviour with and without gradient information based on biological fluctuation framework: a mathematical framework that explains how biological creatures utilize noises in their behaviour. Via extensive simulation of a single sensor mobile robot that searches for a moving target, we will demonstrate how the effectiveness of the search depends on the sensory sensitivity and the inherent random walk strategies produced by the brain of the robot, comprising Ballistic, Levy, Brownian, and Stationary search. The result demonstrates the importance of embodied intelligence even in a behaviour inspired by the simplest creature.

Using Automatic Speech Recognition to Optimize Hearing-Aid Time Constants.

Automatic speech recognition (ASR), when combined with hearing-aid (HA) and hearing-loss (HL) simulations, can predict aided speech-identification performances of persons with age-related hearing loss. ASR can thus be used to evaluate different HA configurations, such as combinations of insertion-gain functions and compression thresholds, in order to optimize HA fitting for a given person. The present study investigated whether, after fixing compression thresholds and insertion gains, a random-search algorithm could be used to optimize time constants (i.e., attack and release times) for 12 audiometric profiles. The insertion gains were either those recommended by the CAM2 prescription rule or those optimized using ASR, while compression thresholds were always optimized using ASR. For each audiometric profile, the random-search algorithm was used to vary time constants with the aim to maximize ASR performance. A HA simulator and a HL simulator simulator were used, respectively, to amplify and to degrade speech stimuli according to the input audiogram. The resulting speech signals were fed to an ASR system for recognition. For each audiogram, 1,000 iterations of the random-search algorithm were used to find the time-constant configuration yielding the highest ASR score. To assess the reproducibility of the results, the random search algorithm was run twice. Optimizing the time constants significantly improved the ASR scores when CAM2 insertion gains were used, but not when using ASR-based gains. Repeating the random search yielded similar ASR scores, but different time-constant configurations.

OPRA-RS: A Hearing-Aid Fitting Method Based on Automatic Speech Recognition and Random Search.

Hearing-aid (HA) prescription rules (such as NAL-NL2, DSL-v5, and CAM2) are used by HA audiologists to define initial HA settings (e.g., insertion gains, IGs) for patients. This initial fitting is later individually adjusted for each patient to improve clinical outcomes in terms of speech intelligibility and listening comfort. During this fine-tuning stage, speech-intelligibility tests are often carried out with the patient to assess the benefits associated with different HA settings. As these tests tend to be time-consuming and performance on them depends on the patient's level of fatigue and familiarity with the test material, only a limited number of HA settings can be explored. Consequently, it is likely that a suboptimal fitting is used for the patient. Recent studies have shown that automatic speech recognition (ASR) can be used to predict the effects of IGs on speech intelligibility for patients with age-related hearing loss (ARHL). The aim of the present study was to extend this approach by optimizing, in addition to IGs, compression thresholds (CTs). However, increasing the number of parameters to be fitted increases exponentially the number of configurations to be assessed. To limit the number of HA settings to be tested, three random-search (RS) genetic algorithms were used. The resulting new HA fitting method, combining ASR and RS, is referred to as "objective prescription rule based on ASR and random search" (OPRA-RS). Optimal HA settings were computed for 12 audiograms, representing average and individual audiometric profiles typical for various levels of ARHL severity, and associated ASR performances were compared to those obtained with the settings recommended by CAM2. Each RS algorithm was run twice to assess its reliability. For all RS algorithms, ASR scores obtained with OPRA-RS were significantly higher than those associated with CAM2. Each RS algorithm converged on similar optimal HA settings across repetitions. However, significant differences were observed between RS algorithms in terms of maximum ASR performance and processing costs. These promising results open the way to the use of ASR and RS algorithms for the fine-tuning of HAs with potential speech-intelligibility benefits for the patient.