Search

• Algorithmic trading using self-attention based recurrent reinforcement learning is developed. • Self-attention layer reallocates temporal weights in the sequence of temporal embedding. • Hybrid loss feature is incorporated to have predictive and reconstructive power. Algorithmic trading based on machine learning has the advantage of using intrinsic features and embedded causality in complex stock price time series. We propose a novel algorithmic trading model based on recurrent reinforcement learning, optimized for making consecutive trading signals. This paper elaborates on how temporal features from complex observation are optimally extracted to maximize the expected rewards of the reinforcement learning model. Our model incorporates the hybrid learning loss to allow sequences of hidden features for reinforcement learning to contain the original state's characteristics fully. The self-attention mechanism is also introduced to our model for learning the temporal importance of the hidden representation series, which helps the reinforcement learning model to be aware of temporal dependence for its decision-making. In this paper, we verify the effectiveness of proposed model using some major market indices and the representative stocks in each sector of S&P500. The augmented structure that we propose has a significant dominance on trading performance. Our proposed model, self-attention based deep direct recurrent reinforcement learning with hybrid loss (SA-DDR-HL), shows superior performance over well-known baseline benchmark models, including machine learning and time series models. [ABSTRACT FROM AUTHOR]

The calculation of pullback by the analysis of strain on pipe shows that it involves many disciplines. It is hard to build a mechanical model that is very consistent with the actual working conditions and with the general applicability. After summarizing the calculation method of domestic and foreign authorities or national standards, the paper derives a set of its own formulas. Based on statistical data of actual projects, the paper develops a formula more suitable for ultra-long pullback by comparing the computing result with the actual measured drag force, that is for engineering design and site construction personnel reference. The calculated value of ultra-long pullback coincides well with the engineering value. Three components of pullback resistance, all occupy a high proportion in back-dragging load, and the contribution of the pullback load weights back Trawler changes dynamically. Thus proving that the method is a reasonable, simple, reliable and effective method to predict pipeline status, and makes a useful exploration for the research to improve the existing prediction models in the future. [ABSTRACT FROM AUTHOR]

This paper introduces a new probabilistic graphical model called gated Bayesian network (GBN). This model evolved from the need to represent processes that include several distinct phases. In essence, a GBN is a model that combines several Bayesian networks (BNs) in such a manner that they may be active or inactive during queries to the model. We use objects called gates to combine BNs, and to activate and deactivate them when predefined logical statements are satisfied. In this paper we also present an algorithm for semi-automatic learning of GBNs. We use the algorithm to learn GBNs that output buy and sell decisions for use in algorithmic trading systems. We show how the learnt GBNs can substantially lower risk towards invested capital, while they at the same time generate similar or better rewards, compared to the benchmark investment strategy buy-and-hold . We also explore some differences and similarities between GBNs and other related formalisms. [ABSTRACT FROM AUTHOR]

Fuzzy rule-based systems are widely applied for real-world decision support, such as policy formation, public health analysis, medical diagnosis, and risk assessment. However, they face significant challenges when the application problem at hand suffers from the "curse of dimensionality" or "sparse knowledge base". Combination of hierarchical fuzzy rule models and fuzzy rule interpolation offers a potentially efficient and effective approach to dealing with both of these issues simultaneously. In particular, backward fuzzy rule interpolation (B-FRI) facilitates approximate reasoning to be performed given a sparse rule base where rules do not fully cover all observations or the observations are not complete, missing antecedent values in certain available rules. This paper presents a hierarchical bidirectional fuzzy reasoning mechanism by integrating hierarchical rule structures and forward/backward rule interpolation. A computational method is proposed, building on the resulting hierarchical bidirectional fuzzy interpolation to maintain consistency in sparse fuzzy rule bases. The proposed techniques are utilised to address a range of decision support problems, successfully demonstrating their efficacy. [ABSTRACT FROM AUTHOR]

Abstract: Clustering is a popular non-directed learning data mining technique for partitioning a dataset into a set of clusters (i.e. a segmentation). Although there are many clustering algorithms, none is superior on all datasets, and so it is never clear which algorithm and which parameter settings are the most appropriate for a given dataset. This suggests that an appropriate approach to clustering should involve the application of multiple clustering algorithms with different parameter settings and a non-taxing approach for comparing the various segmentations that would be generated by these algorithms. In this paper we are concerned with the situation where a domain expert has to evaluate several segmentations in order to determine the most appropriate segmentation (set of clusters) based on his/her specified objective(s). We illustrate how a data mining process model could be applied to address this problem. [Copyright &y& Elsevier]