Related papers: Linear Trading Position with Sparse Spectrum
To predict the future movements of stock markets, numerous studies concentrate on daily data and employ various machine learning (ML) models as benchmarks that often vary and lack standardization across different research works. This paper…
Matrix recovery from sparse observations is an extensively studied topic emerging in various applications, such as recommendation system and signal processing, which includes the matrix completion and compressed sensing models as special…
Financial market forecasting remains a formidable challenge despite the surge in computational capabilities and machine learning advancements. While numerous studies have underscored the precision of computer-generated market predictions,…
The focus of this paper is on identifying the most effective selling strategy for pairs trading of stocks. In pairs trading, a long position is held in one stock while a short position is held in another. The goal is to determine the…
In this paper, we propose a data-driven sliding window approach to solve a log-optimal portfolio problem. In contrast to many of the existing papers, this approach leads to a trading strategy with time-varying portfolio weights rather than…
Progressive Hedging is a popular decomposition algorithm for solving multi-stage stochastic optimization problems. A computational bottleneck of this algorithm is that all scenario subproblems have to be solved at each iteration. In this…
Spectral clustering is one of the fundamental unsupervised learning methods widely used in data analysis. Sparse spectral clustering (SSC) imposes sparsity to the spectral clustering and it improves the interpretability of the model. This…
We study a systematic approach to a popular Statistical Arbitrage technique: Pairs Trading. Instead of relying on two highly correlated assets, we replace the second asset with a replication of the first using risk factor representations.…
In this paper, we show a way to exploit sparsity in the problem data in a primal-dual potential reduction method for solving a class of semidefinite programs. When the problem data is sparse, the dual variable is also sparse, but the primal…
This paper examines the implementation of a statistical arbitrage trading strategy based on co-integration relationships where we discover candidate portfolios using multiple factors rather than just price data. The portfolio selection…
We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work [17], where the single vector signal can be…
The stochastic inverse eigenvalue problem aims to reconstruct a stochastic matrix from its spectrum. While there exists a large literature on the existence of solutions for special settings, there are only few numerical solution methods…
Optimal execution of portfolio transactions is the essential part of algorithmic trading. In this paper we present in simple analytical form the optimal trajectory for risk-averse trader with the assumption of exponential market recovery…
Pairs trading is a market-neutral strategy that exploits historical correlation between stocks to achieve statistical arbitrage. Existing pairs-trading algorithms in the literature require rather restrictive assumptions on the underlying…
We present a deep long short-term memory (LSTM)-based neural network for predicting asset prices, together with a successful trading strategy for generating profits based on the model's predictions. Our work is motivated by the fact that…
We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of…
This paper presents a framework of imitating the principal investor's behavior for optimal pricing and hedging options. We construct a non-deterministic Markov decision process for modeling stock price change driven by the principal…
This paper develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time mathematical finance, does not rely on stochastic integrals or other…
We introduce a new sparse sliced inverse regression estimator called Cholesky matrix penalization and its adaptive version for achieving sparsity in estimating the dimensions of the central subspace. The new estimators use the Cholesky…
In this paper, a continuous and non-convex promoting sparsity fraction function is studied in two sparse portfolio selection models with and without short-selling constraints. Firstly, we study the properties of the optimal solution to the…