Online financial markets can be represented as complex systems where trading dynamics can be captured and characterized at different resolutions and time scales. In this work, we develop a methodology based on non-negative tensor factorization (NTF) aimed at extracting and revealing the multi-timescale trading dynamics…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,786 papers · 148 categories
Trend · papers per month
48 results for “Online Trading”
Paper proposes a deep reinforcement learning model for forex trading that considers transaction costs.
problem Trading in forex markets with high transaction costs and non-stationary data.
method Deep reinforcement learning model considering transaction costs and online learning.
result Maximizes profit while keeping transaction costs low in non-stationary markets.
Online trading platforms manipulate profits and losses, causing 82% of retail traders to lose money.
problem Manipulation of online trading platforms leading to financial losses for retail traders.
method Independent recording of trade details using REST API responses, comparison with broker reviews.
result 82% of retail traders lose money due to platform technical issues.
Detecting Toxic Flowq-fin.TR
Paper develops a fast Bayesian method to predict toxic trades in financial transactions.
problem Predicting and managing toxic trades in financial transactions.
method PULSE: an online learning Bayesian procedure for neural networks.
result Neural networks trained with PULSE outperform traditional methods in predicting toxic trades.
Agent learns to trade currency pairs with improved risk management.
problem Improving systematic FX trading performance with online transfer learning.
method Online inductive transfer learning using feature representation from Gaussian mixture model to a reinforcement learning agent.
result Annualized portfolio information ratio of 0.52, compound return of 9.3%.
Brokerage algorithm learns from context to minimize trading regret.
problem Minimizing trading regret in a sequential brokerage problem.
method Design of algorithms with optimal theoretical regret guarantees.
result Optimal theoretical regret guarantees under various assumptions.
Prospect theory is widely viewed as the best available descriptive model of how people evaluate risk in experimental settings. According to prospect theory, people are risk-averse with respect to gains and risk-seeking with respect to losses, a phenomenon called "loss aversion". Despite of the fact that prospect theory…
Batch Thompson Sampling reduces exploration-exploitation trade-off in online decision making.
problem Balancing exploration and exploitation in online decision making.
method Introducing a batch Thompson Sampling framework for stochastic multi-arm bandit and linear contextual bandit problems.
result Achieves asymptotic regret bound with batch queries, significantly reducing interactions.
The paper explores trade-offs between regret and variance in online learning algorithms.
problem Investigating the trade-offs between regret and variance in online learning.
method Analysis of the Exponentially Weighted Average (EWA) algorithm and its variants.
result A variant of EWA either achieves negative regret or guarantees a logarithmic bound on both variance and regret.
Paper presents a deep reinforcement learning algorithm for online trading without offline training.
problem Developing a fully online trading algorithm without offline training.
method Double Deep -learning with Fast Learning Networks, defining terminal states for money conservation.
result The algorithm outperforms random action trading and captures different market trends.
Maximizing trading volume in online learning framework between traders.
problem Maximizing the total number of trades between traders with unknown valuations.
method Developed algorithms for brokers to maximize trading volume under different feedback scenarios.
result Achieved logarithmic and poly-logarithmic regret rates for different feedback models.
Paper analyzes trade-offs between static and dynamic regret in online learning.
problem Analyzing trade-offs between static and dynamic regret in online learning.
method Rigorously characterizes the effect of forgetting factors for online Newton algorithms and proposes a novel gradient descent step size rule.
result Achieves dynamic regret of max{O(log T), O(√TV)} for exp-concave and strongly convex objectives.
We study an online multi-task learning setting, in which instances of related tasks arrive sequentially, and are handled by task-specific online learners. We consider an algorithmic framework to model the relationship of these tasks via a set of convex constraints. To exploit this relationship, we design a novel algori…
We use an adversarial expert based online learning algorithm to learn the optimal parameters required to maximise wealth trading zero-cost portfolio strategies. The learning algorithm is used to determine the relative population dynamics of technical trading strategies that can survive historical back-testing as well a…
This paper examines how wash traders exploit market conditions in Bitcoin, finding strategic timing and spillover effects.
problem Wash trading in cryptocurrency markets to inflate volume and manipulate market conditions.
method Analysis of 18 million Mt. Gox transactions, exogenous demand shock study.
result Wash trading intensifies in low legitimate trading volume and responds to demand shocks, indicating strategic behavior.
This research aims to identify how Bitcoin-related news publications and online discourse are expressed in Bitcoin exchange movements of price and volume. Being inherently digital, all Bitcoin-related fundamental data (from exchanges, as well as transactional data directly from the blockchain) is available online, some…
Statistical arbitrage is a class of financial trading strategies using mean reversion models. The corresponding techniques rely on a number of assumptions which may not hold for general non-stationary stochastic processes. This paper presents an alternative technique for statistical arbitrage based on online learning w…
FPML algorithm reduces regret by limiting the number of arms chosen per round.
problem Adversarial online learning with resource budget constraints.
method Follow the Perturbed Multiple Leaders (FPML) algorithm.
result Achieves expected regret .
We present a universal algorithm for online trading in Stock Market which performs asymptotically at least as good as any stationary trading strategy that computes the investment at each step using a fixed function of the side information that belongs to a given RKHS (Reproducing Kernel Hilbert Space). Using a universa…
Computing trading strategies based on financial sentiment data using evolutionary optimizationq-fin.PM
In this paper we apply evolutionary optimization techniques to compute optimal rule-based trading strategies based on financial sentiment data. The sentiment data was extracted from the social media service StockTwits to accommodate the level of bullishness or bearishness of the online trading community towards certain…
We present a unified framework for Batch Online Learning (OL) for Click Prediction in Search Advertisement. Machine Learning models once deployed, show non-trivial accuracy and calibration degradation over time due to model staleness. It is therefore necessary to regularly update models, and do so automatically. This p…
Improved LSTM cell for high-frequency trading forecasts.
problem Precise stock price forecasting with minimal lags.
method Revised long short-term memory (LSTM) cell with optimal gate/state selection.
result Lower forecasting error compared to other recurrent neural networks.
We present an online approach to portfolio selection. The motivation is within the context of algorithmic trading, which demands fast and recursive updates of portfolio allocations, as new data arrives. In particular, we look at two online algorithms: Robust-Exponentially Weighted Least Squares (R-EWRLS) and a regulari…
Optimal sampling reduces power grid data analysis costs.
problem Efficient online analysis of high-speed, correlated IoT data.
method D-optimality criterion-based sampling methods combining Bernoulli and leverage score sampling.
result Leverage score sampling improves computational efficiency and outperforms benchmarks.
Motivated by the practical challenge in monitoring the performance of a large number of algorithmic trading orders, this paper provides a methodology that leads to automatic discovery of the causes that lie behind a poor trading performance. It also gives theoretical foundations to a generic framework for real-time tra…
The study uses machine learning to predict financial market trends.
problem Predicting financial market trends using low-frequency data.
method Modular online machine learning framework using stacked autoencoders and neural networks.
result The approach can predict financial market feature fluctuations effectively.
Paper develops online statistical inference methods for stochastic optimization using Kiefer-Wolfowitz algorithms.
problem Online statistical inference of model parameters in stochastic optimization problems.
method Kiefer-Wolfowitz algorithm with random search directions, asymptotic distribution analysis.
result Developed valid confidence intervals for online statistical inference.
Spurred by the enthusiasm surrounding the "Big Data" paradigm, the mathematical and algorithmic tools of online optimization have found widespread use in problems where the trade-off between data exploration and exploitation plays a predominant role. This trade-off is of particular importance to several branches and ap…
Study shows observing order book can significantly improve online market making performance.
problem Online market making with private valuations and limited feedback.
method Introduces action-dependent feedback model and proposes elimination-based and explore-then-perturb algorithms.
result Achieves regret bounds with high probability in various settings.
Editorial discusses nine challenges in modern algorithmic trading.
problem Challenges in modern algorithmic trading and controls.
method Discussion of challenges without proposing solutions.
result No specific new results or findings.
The aim of this paper is to explain how parameters adjustments can be integrated in the design or the control of automates of trading. Typically, we are interested by the online estimation of the market impacts generated by robots or single orders, and how they/the controller should react in an optimal way to the infor…
Conditional Value-at-Risk for Quantitative Trading: A Direct Reinforcement Learning Approachq-fin.TR
A new trading system learns to minimize risk and maximize returns in real markets.
problem Optimizing trading strategies under risk constraints in financial markets.
method Direct Reinforcement Learning with Conditional Value-at-Risk as the risk measure.
result The proposed algorithm outperforms traditional methods in real-world financial markets, demonstrating robustness and profitability.
We consider an agent who is involved in a Markov decision process and receives a vector of outcomes every round. Her objective is to maximize a global concave reward function on the average vectorial outcome. The problem models applications such as multi-objective optimization, maximum entropy exploration, and constrai…
Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.
problem How to efficiently use online data to improve RL policies using only offline data.
method A three-stage hybrid RL algorithm that uses reward-agnostic exploration and model-based offline RL.
result The hybrid RL algorithm outperforms both pure offline and pure online RL in sample complexity.
R package for online forecasting in various fields.
problem Frequent updates of forecasts in online settings.
method Generalized setup for time-adaptive fitting of dynamical and non-linear models.
result Effective use of forecasts as model inputs in operational settings.
Cost-Sensitive Online Classification has drawn extensive attention in recent years, where the main approach is to directly online optimize two well-known cost-sensitive metrics: (i) weighted sum of sensitivity and specificity; (ii) weighted misclassification cost. However, previous existing methods only considered firs…
Online Learning of Order Flow and Market Impact with Bayesian Change-Point Detection Methodsq-fin.TR
Paper proposes BOCPD for real-time order flow and market impact prediction.
problem Persistent order flow patterns in financial markets.
method Bayesian online change-point detection (BOCPD) with score-driven approach.
result Model outperforms existing models in predicting order flow and market impact.
This document constitutes the final report of the contractual activity between Directa SIM and Dipartimento di Automatica e Informatica, Politecnico di Torino, on the research topic titled "quantificazione del rischio di un portafoglio di strumenti finanziari per trading online su device fissi e mobili."
Finite Sample Guarantees for Distributed Online Parameter Estimation with Communication Costseess.SY
The paper provides bounds on estimation error in a distributed online learning setting.
problem Estimating an unknown parameter in a distributed and online manner with finite sample guarantees.
method Proposes a distributed online estimation algorithm that improves accuracy through communication, providing non-asymptotic bounds on estimation error.
result Demonstrates a trade-off between estimation error and communication costs, and determines a stopping time for communication based on desired accuracy.
Bayesian framework for online consensus prediction from expert feedback.
problem Online classification with expert consensus prediction, cost-effective.
method General Bayesian framework for dynamic expert consensus estimation.
result Demonstrated superior performance on large-scale crowdsourced datasets.
New coverage conditions improve sample efficiency in online reinforcement learning.
problem Improving sample efficiency in online reinforcement learning with function approximation.
method Identifying and studying new coverage conditions for online reinforcement learning.
result Improved regret bounds achieved with new coverage conditions.
This paper explores deep learning for financial trading, integrating sentiment analysis.
problem Maximizing profit and minimizing loss in financial trading.
method Supervised and reinforcement learning schemes, integrating sentiment analysis.
result Demonstrates the effectiveness of deep learning methods in financial trading.
Develops a method to estimate optimal policy value in online learning.
problem Challenges in evaluating ongoing policies in online learning environments.
method Doubly Robust Interval Estimation (DREAM) method.
result Valid inference on online conditional mean estimator with asymptotically normal distribution.
Two new algorithms reduce online kernel regression's computational cost while maintaining optimal regret bounds.
problem Trade-off between regret and computational cost in online kernel regression.
method AOGD-ALD and NONS-ALD algorithms dynamically maintain nearly orthogonal basis to approximate kernel mapping and control approximate error.
result Achieves nearly optimal regret bounds at sublinear computational complexity.
Develops a new method for online conformal prediction without manual tuning.
problem Achieving long-run coverage for arbitrary data streams in an informative manner.
method Linearized regret theory and universal portfolio algorithms.
result Strong finite-time bounds on miscoverage for UP-OCP, outperforming prior methods.
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum Statescs.LG
New algorithm reduces regret in online portfolio and quantum state learning.
problem Efficiently learning portfolios and quantum states online with minimal regret.
method BISONS algorithm for online portfolio selection, SCHRODINGER'S BISONS for quantum states, with polylogarithmic regret.
result First efficient algorithm with polylogarithmic regret for online portfolio selection and quantum states.
Reinforcement learning crypto agent achieves high returns on Bitcoin derivatives.
problem Maximizing returns on volatile cryptocurrency markets.
method Online transfer learning with an echo state network and recurrent reinforcement learning.
result Achieves a total return of 350%, net of transaction costs, over five years.
Develops a new flexible grid trading model using ANN and SSO.
problem Improving automated trading strategies in financial markets.
method Combines SSO algorithm with ANN for optimizing trading parameters.
result Provides a robust and efficient trading model with better returns.