Papers for

algorithmic trading developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Neural method improves volatility forecasts with time series data

Nonparametric GARCH: An Iterated Neural Estimator

Abstract: We study nonparametric estimation and forecasting for GARCH-type processes and propose an iterated neural estimator that alternates between estimating the recursion map and updating the unobserved conditional variances. Under mild conditions, we establish finite-sample bounds for the time-averaged in-sample variance-path error and show that the estimator is minimax rate-optimal up to logarithmic factors. Under stationarity and mixing conditions, we establish the same rate for recursion-map estimation and derive finite-sample bounds for out-of-sample variance forecasts and expected excess Gaussian quasi-likelihood (QLIKE) loss. The convergence rates depend on the true lag orders and remain unchanged when the fitted orders are overspecified. Simulation studies illustrate the effectiveness of our estimators under nonlinear and time-varying volatility dynamics. Real-data applications suggest that our neural methods perform competitively and can incorporate option-price and high-frequency information.

Tue 3 NovMachine Learning
The gist
Predicting how variable something like financial market volatility will be is tricky, especially when volatility changes in complex ways. The authors introduce a new approach that uses neural networks to estimate volatility without assuming a fixed model shape. They test their method showing it can learn better patterns and give more accurate forecasts, even when the data behaves nonlinearly or changes over time. Their approach also performs well on real financial data, including prices from options and high-frequency trades.
Open → 2611.04157v1

Traders detect mismatches in sequential trading decisions and reports

FIDES-Live: Evaluating Behavioral Concordance in Sequential Trading Agents

Abstract: Sequential trading agents produce decisions, orders, execution receipts, account states, and reports that need not agree, even when the final portfolio value is correctly computed. We present FIDES-Live, an operational extension of FIDES from generated strategy concordance to the audit of sequential agent traces. The protocol separates structured decision validity, optional numerical commitment adherence, execution and ledger reconciliation, and receipt- grounded reporting, with explicit coverage and unscorable outcomes. We retrospectively audit ten requested inference routes over 7,299 cryptocurrency account-rounds and a 310-round equity pilot, using real market observations and local paper execution. Cryptocurrency decision validity is 97.35% and structured reporting accuracy is 90.81% among scorable responses, but route-level decision and reporting performance can diverge sharply. Commitment adherence is 94.36% overall; it falls to 62.63% on constraints emitted with nonempty order proposals, compared with 97.56% for valid empty proposals. All retained cash and position transitions reconcile with recorded fills, while execution controls and unavailable quotes explain separate rejection populations. Short-window marked returns provide descriptive context rather than a new test of whether concordance predicts alpha. These observations motivate reporting concordance, evidence coverage, activity, and financial outcomes separately. They do not establish long-run trading skill, semantic faithfulness of explanations, or causal benefits from audit feedback.

Tue 27 OctCryptography and SecurityArtificial Intelligence
The gist
Trading systems make many linked decisions and reports that should match up, but sometimes they don’t. The authors created FIDES-Live, a tool that checks if a trading agent’s different steps like decisions, orders, and reports agree with each other. They used it on thousands of cryptocurrency trades and a small stock trading test. The tool found some mismatches and shows that evaluating various parts like decisions and reports separately helps understand where problems happen, but it doesn’t prove long-term trading skill or improvements yet.
Open → 2610.36476v1

Market maker strategies shape bid ask spreads in volatile assets

Equilibria and Learning in Competitive Market Making

Abstract: We propose a market-making game played among $N \ge 2$ strategic market makers and a single non-strategic representative trader. In a continuous quote space, standard finite-game arguments do not apply, while non-convex and discontinuous payoffs rule out classical continuous existence results and complicate learning. Nonetheless, we characterize pure-strategy Nash equilibria (PSNEs) and show that at least one PSNE always exists under minimal assumptions on the underlying asset value distribution, and that the equilibrium bid-ask spread widens strictly with asset value volatility. To obtain a tractable learning framework, we discretize prices and, under an additional regularity condition, show that the time-averaged play of no-internal-regret learners approaches the continuous Nash price envelope as the tick size vanishes. Finally, we empirically validate our theoretical results through numerical simulations.

Thu 22 OctComputer Science and Game TheoryMachine Learning
The gist
The paper studies how multiple market makers compete when setting prices for buying and selling financial assets with changing values. The authors show that there is always a stable way for these market makers to set prices so that none wants to change, even though the game is complicated by how prices can vary continuously and payoffs can jump. They find that when asset values are more volatile, the difference between buying and selling prices tends to increase. They also show how simplified models of learning can help market makers approximate these optimal prices over time, with simulations supporting their findings.
Open → 2610.30891v1

Execution assumptions reshape short-term trading agent rankings

How Execution Assumptions Change Short-Horizon Sharpe Rankings: Evidence from a Synthetic Trading Benchmark

Abstract: Backtests of LLM trading agents often assume that every order fills at the closing price. We ask whether this choice changes only reported returns or also the order of the agents. Five prompted LLM signal policies and seven classical baselines trade the same synthetic price paths under six execution settings, from near-ideal fills to latency, spread, participation, and impact stresses. The main experiment contains $2{,}462$ runs with matched decision frequencies and paired market paths. On the compressed two-asset board, agreement between the near-ideal and default-stress rankings falls to Kendall $τ_b=0.21$ in the high-volatility regime, compared with $0.82$ in the calm regime. The seed-bootstrap intervals, $[0.00,0.52]$ and $[0.48,0.94]$, are wide and overlap. On a fixed 11-policy board, agreement rises from 0.24 with two assets to 0.85 with ten; the two-asset point estimate differs substantially from the wider settings we tested. Rank changes are related to turnover, and comparisons with buy-and-hold also depend on how that anchor is initialized. The experiment does not compare LLM trading skill. It shows that, on a short horizon, an execution convention can become part of the benchmark's headline. Execution assumptions and rank stability should be reported alongside returns.

Sun 4 OctMachine Learning
The gist
Backtests of trading agents often assume that every trade fills at the closing price, but the authors show this can change not just returns but the ranking order of these agents. They tested several AI and classical trading strategies on synthetic data under various realistic trading conditions like latency and market impact. Results show that in volatile markets, rankings differ much more than in calm markets. This means that how trades are executed should be clearly reported when comparing trading agent performance.
Open → 2610.05077v1

AlphaPADI improves formula discovery for stock return prediction pools

AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion

Abstract: Formulaic alpha discovery seeks symbolic expressions that predict cross-sectional asset returns. In deployment, multiple formulas are combined into an alpha pool, where each formula is valued through the complementary information it contributes to joint predictive performance. While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges. First, generating formulas individually leaves pool context and inter-formula complementarity outside the generative state. Second, formula-wise generation lacks a unified mechanism for preserving and revising structures at different levels. Third, pool-level rewards jointly reflect predictive performance and redundancy but cannot be differentiated directly through symbolic evaluation to train the generator. To overcome these challenges, we introduce AlphaPADI (Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion), a novel framework built around three components: (1) grammar-constrained buffer initialization that constructs syntactically valid pool candidates, (2) pool-aware hierarchical diffusion that reconstructs complete pools at multiple structural scales under the current pool context, and (3) reward-guided pool refinement that evaluates joint predictive performance and inner diversity, updates the elite buffer, and trains the reverse model through reconstruction and preference learning. Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.

Sun 4 OctComputational Engineering, Finance, and Science
The gist
Formulaic alpha discovery is about finding math formulas that predict stock returns. The authors identified that previous methods generate formulas one by one and don't consider how formulas work together as a group. Their new method, AlphaPADI, creates groups of formulas all at once, ensures these formulas follow rules, and improves the group by checking how well they predict stocks and how different each formula is. Tests showed their approach works better than other methods on Chinese and U.S. stock data.
Open → 2610.04959v1

Czar loss improves direction predictions for financial returns

Introducing the CZAR Loss: A Tailored Objective Function for Financial Log-Return Predictions

Abstract: In quantitative finance, standard regression losses are misaligned with the economics of return prediction. As the conditional mean of financial log-returns is close to zero, symmetric losses such as the mean squared and mean absolute errors make the constant zero forecast a near-optimal solution, penalizing models with genuine but noisy directional skill. This applies both during training, where predictions shrink toward zero, and during evaluation, where trivial forecasters can lead loss-based rankings. Under a Gaussian linear prediction model, we show that all symmetric monotonic losses share a universal breakeven directional accuracy against the zero predictor, which rises sharply and becomes unobtainable as the prediction noise approaches the standard deviation of the returns. We introduce the CZAR (Composite Zero-Agnostic Return) loss function, a piecewise quadratic loss built around five key requirements: convexity in the prediction, asymmetry with true return direction that vanishes at zero, near-linear penalization of undershoots and wrong-direction predictions, divergence for large errors, and an adaptive loss floor for evaluation. CZAR is provably convex in the prediction at fixed true value, has closed-form gradient and Hessian suitable for custom objectives in gradient-boosted libraries, and its four hyperparameters reduce to a single choice through correlated defaults. In idealized tests, the minimum directional accuracy required for a CZAR-evaluated forecaster to outperform the zero predictor under mean log loss remains near the 50% chance level, whereas the corresponding threshold for symmetric losses rises sharply with prediction noise. This advantage persists under heavy-tailed return distributions. In a LightGBM experiment on intraday BTC log-returns, CZAR-trained models reduce the `zero-returns bias' and improve directional accuracy on large-magnitude returns.

Mon 28 SeptMachine LearningComputational Engineering, Finance, and Science
The gist
Predicting financial returns is hard because most returns are near zero, so usual prediction methods just guess zero and get rewarded. The authors show that common losses unfairly favor zero predictions even when models have useful directional guesses. They propose a new CZAR loss that focuses on getting the direction right and penalizes wrong predictions differently. This helps models learn and evaluate return predictions better, especially for big changes.
Open → 2609.36061v1

Online method adapts portfolio window size to reduce trading costs

Cost-Sensitive Online Window Size Selection for Portfolio Management

Abstract: This paper investigates cost-sensitive online window size selection for portfolio management under changing market conditions. Specifically, we propose a two-level framework that constructs portfolios using candidate window sizes and dynamically aggregates them through online learning. By treating candidate window sizes as ``experts,'' we dynamically update their aggregation weights using turnover-inclusive losses. Moreover, we derive finite-horizon cost-sensitive tracking-regret bounds that account for turnover of the aggregated portfolio, with static regret as a special case. Under bounded losses and cost rates, suitably tuned Fixed Share achieves asymptotically no tracking regret for sublinear switching budgets, with Hedge covering the static case.

Thu 24 SeptMachine Learning
The gist
Choosing how far back in time to look at stock prices matters for investment strategies, especially when markets change. This paper shows a new way to automatically pick and combine different time windows so portfolios adapt better over time without excessive trading costs. The authors treat each window choice as an expert and update their influence based on both performance and trading costs. Their approach comes with mathematical guarantees on how well it tracks the best switching strategy under realistic cost conditions.
Open → 2609.29887v1

Agent system uses past trading memory to improve financial decisions

Agent Memory with Episodic Retrieval for Financial Decision-Making

Abstract: Large language models (LLMs) have demonstrated strong capabilities in financial analysis and reasoning, inspiring recent advances in agent-based trading frameworks. While these systems show promise, prior approaches either emphasize long-horizon forecasting or operate as stateless analyzers, limiting their applicability to the demands of trading in complicated settings. To address these gaps, we introduce META (Memory Enhanced Trading Agent), the first RAG-like episodic-memory-augmented multi-agent framework for financial decision making. META integrates a family of specialized indicator agents (e.g., Trend, MACD, Stochastic, RSI, SMA, AVWAP, Heikin-Ashi) with a Decision Agent that fuses their reports, and a Memory module that retrieves and updates past trading episodes encoded as market state embeddings with outcomes and reflections. By recalling relevant experiences and adaptively reweighting signals under similar market regimes, META achieves improved directional accuracy and robustness under short-horizon evaluation. Our results demonstrate that episodic memory provides a powerful mechanism for regime-aware, interpretable, and low-latency decision-making in trading and decision making. The code of this project is released on GitHub.

Wed 23 SeptArtificial Intelligence
The gist
Financial trading is complicated and requires quick decisions based on lots of information. The authors created META, a system that remembers past trading experiences and uses that memory to make better decisions today. META combines several specialized expert agents with a decision maker and a memory module that recalls similar past market situations. This helps the system adapt to changing market conditions and make more accurate short-term predictions.
Open → 2609.28771v1

AlphaRJM improves formulaic alpha discovery using reward-jump memory

AlphaRJM: Reward-Jump Memory for Stochastic Return-Guided Alpha Discovery

Abstract: Formulaic alpha discovery is a pool-dependent symbolic search problem in which informative feedback is observed primarily when a complete expression is evaluated. This delayed feedback creates two coupled difficulties: the retained alpha pool does not preserve the full history of realized evaluation feedback, and the value of an intermediate construction action is uncertain because its consequence depends on the formula eventually completed. We introduce AlphaRJM, which addresses these difficulties through Reward-Jump Memory, an event-driven latent state that remains fixed during token construction and updates only at terminal evaluation events using the realized pool reward and evaluation outcome, and an action-conditioned SDE return critic that represents future discounted discovery returns with stochastic particles. The particles guide action selection through their mean and uncertainty and are learned using a distributional Bellman objective combining energy-distance matching, mean calibration, and jump regularization. Empirically, AlphaRJM delivers strong and stable gains across multiple equity universes, forecasting horizons, and random seeds, while ablations confirm the complementary roles of persistent evaluation history, stochastic return modeling, and distributional supervision.

Tue 8 SeptMachine Learning
The gist
Finding formulas that predict stock returns is tricky because feedback only comes after a complete formula is evaluated, making it hard to judge partial progress. The authors introduce AlphaRJM, which keeps track of rewards from complete formulas in a special memory that only updates when a formula finishes. It also models future payoffs with a technique that accounts for uncertainty. Together, these approaches help select better actions when building formulas and lead to more stable and better predictions in stock markets.
Open → 2609.08581v1