惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

IT之家
IT之家
腾讯CDC
博客园 - Franky
S
SegmentFault 最新的问题
美团技术团队
阮一峰的网络日志
阮一峰的网络日志
J
Java Code Geeks
Y
Y Combinator Blog
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
MongoDB | Blog
MongoDB | Blog
I
InfoQ
T
Tailwind CSS Blog
Hugging Face - Blog
Hugging Face - Blog
B
Blog RSS Feed
博客园 - 叶小钗
博客园_首页
有赞技术团队
有赞技术团队
雷峰网
雷峰网
量子位
小众软件
小众软件
月光博客
月光博客
U
Unit 42
D
DataBreaches.Net

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant
Handling Non-Stationary Time Series: Building a Probabili...
Artem · 2026-05-21 · via DEV Community

If you have ever tried to apply Machine Learning to financial time series, you know the heartbreak of the "perfect backtest." You build a model, train it on historical OHLC (Open, High, Low, Close) data, and it predicts the next sequence beautifully. Then you deploy it to production, the market regime shifts, and your model falls apart.
The core issue is that financial markets are highly non-stationary and chaotic. Deterministic models—those trying to predict a single, exact future price - are statistically fragile. They assume the future will exactly mirror the past.
At AEMMtrader, we spent the last year entirely rethinking our architecture. We stopped trying to predict one path and built a Python-based forecasting engine that treats the market as a probabilistic "multiverse," combining the non-linear regression power of XGBoost with the stress-testing capabilities of Monte Carlo simulations.
Here is a deep dive into the architecture and the Python code powering our engine.

1. The Core Engine: Why XGBoost?

While Deep Learning (LSTMs, Transformers) gets a lot of hype, tree-based models like Gradient Boosted Decision Trees (XGBoost) consistently outperform them on structured, tabular data.
However, feeding raw price data into an XGBoost model is a recipe for overfitting. Our feature vector engineers metrics that describe the state of the market rather than absolute prices:

  • Volatility-Adjusted Returns: Measuring the energy of a move.
  • Momentum and Relative Volume: Capturing sudden institutional liquidity shifts.
  • RSI dynamically calculated via Pandas: To gauge mean-reversion probabilities.

2. Injecting Chaos: The Monte Carlo Layer

Even with great features, XGBoost can overfit to recent market noise. To prevent "fake breakouts," we wrap our predictive model in a Monte Carlo simulation loop.

Instead of running the model once, we run it 30 independent times. During each simulation, we inject calibrated stochastic noise into the input features (both price and volume). If the underlying signal is robust, the model will fight through the noise and converge on the same destination. If it's just market noise, the 30 paths will scatter randomly, and our engine flags the asset state as "Neutral."

3. The Architectural Blueprint (Python)

To protect our proprietary logic, I won't share the exact production code, but here is the foundational architecture of how we built the engine. Instead of a monolithic script, we broke the problem down into three independent logical blocks.

Block A: State-Based Feature Engineering

We never feed raw prices into the XGBoost model. Instead, we transform the price action into a vector that describes the "energy" and "state" of the market.

import pandas as pd
import numpy as np
import xgboost as xgb

class ProbabilisticEngine:
    def __init__(self, timeframe):
        self.timeframe = timeframe
        self.model = xgb.XGBRegressor(max_depth=5, n_estimators=80) # Base concept

    def _engineer_features(self, df):
        """
        Calculates the state of the market rather than absolute price.
        """
        features = pd.DataFrame(index=df.index)

        # 1. Energy: Logarithmic returns
        features["log_ret"] = np.log(df["close"] / df["close"].shift(1))

        # 2. Institutional Activity: Relative volume spikes
        features["vol_rel"] = df['tick_volume'] / df['tick_volume'].rolling(20).mean()

        # 3. Market Structure: Custom momentum and mean-reversion metrics
        # (Proprietary calculations omitted)
        features["momentum"] = self._calculate_momentum(df)

        return features.dropna()

Enter fullscreen mode Exit fullscreen mode

Block B: The Monte Carlo Multiverse Loop

This is the heart of the engine. Once the model predicts the base mathematical expectation for the next candle, we inject stochastic noise (based on recent market volatility) and simulate the future 30 times.

def generate_multiverse(self, current_state, n_steps=20, simulations=30):
        """
        Generates a matrix of possible future price paths.
        """
        all_paths = []
        historical_volatility = current_state["close"].pct_change().std()

        for _ in range(simulations):
            path = []
            simulated_state = current_state.copy()

            for step in range(n_steps):
                # 1. XGBoost predicts the expected baseline move
                features = self._engineer_features(simulated_state)
                expected_move = self.model.predict(features.tail(1))[0]

                # 2. Inject stochastic noise to simulate market chaos
                price_noise = np.random.normal(0, historical_volatility)
                next_price = simulated_state["close"].iloc[-1] * np.exp(expected_move + price_noise)

                path.append(next_price)

                # 3. Step forward in time (update the simulated state)
                simulated_state = self._update_state(simulated_state, next_price)

            all_paths.append(path)

        return np.array(all_paths) # Returns a shape of (30, 20)

Enter fullscreen mode Exit fullscreen mode

Block C: Synthesizing the Consensus

Having an array of 30 different paths is useless for execution. We must compress this "multiverse" into a clear, actionable signal with a mathematical confidence score.

def extract_signal(self, current_price, all_paths):
        """
        Translates the Monte Carlo matrix into clean probabilities.
        """
        # Calculate the mathematical average of all 30 paths
        mean_path = np.mean(all_paths, axis=0)

        # Calculate Confidence Score based on terminal path locations
        bullish_paths = sum(path[-1] > current_price for path in all_paths)
        buy_probability = bullish_paths / len(all_paths)

        # Calculate dynamic wicks (High/Low) using historical ATR

        return {
            "mean_trajectory": mean_path,
            "confidence_score": buy_probability * 100,
            "direction": "BUY" if buy_probability > 0.5 else "SELL"
        }

Enter fullscreen mode Exit fullscreen mode

4. Synthesizing the "Multiverse" into Actionable Visuals

Most Monte Carlo implementations output a "spaghetti chart" displaying dozens of overlapping lines. This is visually overwhelming.

Instead, look at the np.mean calculation in the code above. The engine calculates the Mean Probability Path across all 30 noise-injected simulations. From this path, it mathematically reconstructs future OHLC candles. The body of the future candle is the mean trajectory, while the wicks (high/low variance) are bound dynamically by a fraction of the Average True Range.

Case Study: EUR/USD on the D1 Timeframe<br>
In the chart above, you can see the sequence of forecasted candles extending to the right. This is not a single deterministic guess. If 21 out of our 30 simulations closed above the starting price despite the injected noise, the underlying mathematical confidence heavily favors the upside.
Case Study: EUR/USD on the D1 Timeframe
In the chart above, you can see the sequence of forecasted candles extending to the right. This is not a single deterministic guess. If 21 out of our 30 simulations closed above the starting price despite the injected noise, the underlying mathematical confidence heavily favors the upside.

5. Smart Caching for Real-Time Performance

To make this viable in production across hundreds of assets and multiple timeframes, we couldn't afford to retrain the XGBoost model on every single tick.

We built an orchestrator layer that implements a smart caching logic based on the timeframe limits:

if model.tf_min >= 1440:  # D1, W1
    retrain_limit = 10
elif model.tf_min == 240:  # H4
    retrain_limit = 18
else:  # H1, M30
    retrain_limit = 24

if new_candles_count < retrain_limit:
    needs_training = False
    model.update_data(df) # Hot reload via state update

Enter fullscreen mode Exit fullscreen mode

If the threshold of new candles isn't met, the model bypasses the heavy .fit() phase, updates the feature array via a hot reload, and recalculates the Monte Carlo matrix in milliseconds.

Final Thoughts

Transitioning from deterministic logic (if RSI < 30 then Buy) to probabilistic machine learning requires a mental shift. It means accepting that markets are chaotic, and our job as quantitative developers is not to predict the exact future, but to trap the price within a mathematical range of probabilities.

If you're interested in seeing how this engine outputs these Monte Carlo OHLC structures in real-time across various timeframes and assets, you can monitor the live dashboard at AEMMtrader.com.

I would love to hear how other Python developers and Data Scientists handle non-stationarity in their ML models. What is your go-to method for preventing overfitting on financial data? Drop your thoughts in the comments!