arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.04486cs.LGq-fin.CPstat.ML
收藏

基于监督学习和OCA的交易选择

Trade Selection with Supervised Learning and OCA

A.I. SQUARE CONNECT;Universite Paris Dauphine(巴黎多芬大学)

David Saltiel, Eric Benhamou

摘要:

近年来,用于监督学习的最先进的方法已经越来越多地利用梯度提升技术,主流的有效实现例如xgboost或lightgbm。生成熟练方法的关键点之一是特征选择。它包括选择正确的有价值的有效特征。当面对数百个这样的特征时,选择最佳特征变得至关重要。虽然过滤器和包装器方法已经相当成熟,但嵌入式方法确实是找到最佳特征集所必需的,因为它们是结合了特征过滤和包装的混合方法。在这项工作中,我们解决了通过机器学习从算法策略中找到最佳先验交易的问题。我们得到这个新的方法,使用坐标上升优化和使用块变量。我们比较我们的方法递归特征消除(RFE)和二进制坐标上升(BCA)。我们展示了一个现实生活中的例子,这种方法的能力,选择好的行业的先验。这种方法不仅优于初始交易策略,因为它避免了亏损的交易,它也优于其他方法,具有最小的特征集和最高的分数在同一时间。这种方法的兴趣超出了这个简单的贸易分类问题,因为它是一个非常通用的方法来确定最佳的功能集,使用一些信息的功能关系,以及使用坐标上升优化。

英文摘要:

In recent years, state-of-the-art methods for supervised learning have exploited increasingly gradient boosting techniques, with mainstream efficient implementations such as xgboost or lightgbm. One of the key points in generating proficient methods is Feature Selection (FS). It consists in selecting the right valuable effective features. When facing hundreds of these features, it becomes critical to select best features. While filter and wrappers methods have come to some maturity, embedded methods are truly necessary to find the best features set as they are hybrid methods combining features filtering and wrapping. In this work, we tackle the problem of finding through machine learning best a priori trades from an algorithmic strategy. We derive this new method using coordinate ascent optimization and using block variables. We compare our method to Recursive Feature Elimination (RFE) and Binary Coordinate Ascent (BCA). We show on a real life example the capacity of this method to select good trades a priori. Not only this method outperforms the initial trading strategy as it avoids taking loosing trades, it also surpasses other method, having the smallest feature set and the highest score at the same time. The interest of this method goes beyond this simple trade classification problem as it is a very general method to determine the optimal feature set using some information about features relationship as well as using coordinate ascent optimization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑