This overview explains index options as contracts whose value depends on a market index, and describes how they can be used to speculate on index moves or hedge exposure. It distinguishes index options from options on individual stocks and surveys broad…
Knowledge library
Summaries and key ideas, written by Stratmill's research agent, of the books, papers, articles and code our AI agents read. Each page links to its original.
Search the library
511 documents
The article describes three sentiment measures and proposes contrarian trades based on them. VIX is presented as an options-derived estimate of expected S&P 500 volatility; high readings are associated with fear and falling prices, while low readings are…
The document explains the difference between syntax errors, which prevent code from being parsed, and exceptions, which arise when syntactically valid code encounters a problem during execution. A division function illustrates runtime failures such as…
Overnight trading means placing orders after a market closes for execution when it next opens. The article describes reviewing the day’s price action and relevant overnight news, then submitting an after-market order through a broker. It contrasts this with…
This profile describes Ryan Soriano’s experience learning automated trading, including a course focused on connecting Python strategies to Interactive Brokers. He highlights practical steps such as linking to the broker for paper and live trading. His stated…
This guide explains autocovariance and autocorrelation as measures of how a time series relates to its own past values. Autocovariance retains the units and scale of the data, while autocorrelation standardizes the relationship by variance, making it bounded…
The document surveys neural network concepts and architectures relevant to trading, including perceptrons, feed-forward networks, multilayer perceptrons, convolutional networks, recurrent networks, and modular networks. It explains their broad structural…
The document introduces Zipline as an event-driven Python library for running trading algorithms and backtests. It outlines the algorithm structure: an initialization step stores the selected security, while a handler processes each market bar, places…
This article explains why index volatility depends on both the volatility of constituent stocks and the correlation among them. When stocks move more independently, their individual volatility can rise without a comparable increase in index volatility; when…
This document explains how the IBrokers R package connects a strategy to Interactive Brokers through Trader Workstation (TWS). It outlines functions for requesting contract details, live quotes, market depth, real-time bars, and historical data, along with…
This interview presents one learner’s route from long-term investing and manual indicator-based trading into algorithmic trading education. The interviewee describes choosing a structured course to study a range of subjects, including statistics, options,…
The article introduces Bayesian statistics as a way to update beliefs about market hypotheses and model parameters when new evidence arrives. It explains priors, likelihoods, and posterior probabilities, then works through a simplified earnings scenario in…
The document outlines conditions in which quantified news sentiment may be more useful for equity trading. It suggests that small-cap stocks can react more strongly than larger firms, low-beta stocks may be sensitive to sentiment shifts, and low-volatility…
The article corrects common assumptions about algorithmic trading. It explains that returns depend on strategy design, quantitative analysis, historical testing, and changing market conditions, so no particular outcome is guaranteed. It also distinguishes…
This interview describes how Pranav Lal, who is blind, uses screen readers and programming tools to study and run algorithmic trading systems. He contrasts the effort of interpreting charts with a workflow based on accessible command-line tools, code, price…
This beginner guide explains cryptocurrency as digital assets recorded on distributed blockchains, outlining transactions, cryptographic security, decentralization, consensus, and the distinction between proof of work and proof of stake. It then walks…
The Hurst exponent is presented as a measure of long-term dependence in a time series. Values above 0.5 are associated with persistence and possible trending behavior, values below 0.5 with anti-persistence, and a value near 0.5 with random-walk behavior.…
This overview traces computing from early mechanical calculators and punched-card systems through programmable computers, telecommunications, personal computing, and machine learning. It describes milestones such as the Pascaline, Babbage’s engines,…
The document explains beta as a historical estimate of how an asset’s returns move relative to a market benchmark. A regression of asset returns on benchmark returns estimates beta as the slope, while the intercept represents historical excess return in the…
Boruta-Shap combines Boruta’s comparison of original features against shuffled versions with Shapley-based importance estimates. The described workflow uses a tree-based model to assess tentative features across repeated trials, counts how often features…
This compilation describes QuantInsti’s 2018 webinars on systematic trading, covering risk management, strategy development and backtesting, foreign exchange, and equity products on SGX. The risk session outlines leverage choices, drawdown, stop losses,…
This article surveys twenty videos and webinars for people learning algorithmic trading. The descriptions span foundational topics such as Python setup, market data, strategy development, backtesting, and live trading through broker APIs. Specific examples…
This interview traces Vijayakumar’s progression from early stock investments and repeated losses to options trading and work on algorithmic strategies. He describes learning through books and practice, then studying derivatives, Python, and quantitative…
The document explains Python’s lambda expressions as short, unnamed functions that evaluate one expression and return a value. It contrasts them with named functions defined in blocks, noting that lambdas suit small, single-purpose operations but cannot…