What the workspace can compute

119 research methods. 43 machine learning models. Not the same registry.

The method catalogue spans the whole research surface: data quality checks, statistical tests, time-series and volatility models, validation schemes, portfolio optimisers, option pricing, factor models and reporting. Only a slice of it is predictive modelling. The 43 machine learning models are the distinct, selectable estimators a researcher actually picks from on the ML Models page, and they carry their own training, validation and explainability path.

Research methods
119across 19 categories
Validated
72checked against a textbook, paper, closed-form identity, hand-worked example, third-party library or regulator source
ML models
4314 classification, 16 regression, 6 clustering, 4 dimensionality reduction, 3 anomaly detection
Forecasting methods
4a distinct code path from the 43
QuantLab The QuantLab method library, listing every catalogued technique by category with its validation status.

01What you actually do here

Five things, in the order the page presents them.

01

Choose a task and a model from the registry

Classification or regression, then a named estimator from the registry — logistic regression through XGBoost and an MLP classifier on the classification side, linear regression through gradient boosting variants on the regression side. Each entry states whether it is seeded for exact reproducibility.

02

Set the pipeline controls before fitting anything

Chronological split, train-only scaler fit, no shuffling and a purged embargo are on by default. The purge gap is floored at the label horizon, not just the embargo you set, because the last rows of training share their outcome with the first rows of test regardless.

03

Train with walk-forward validation switched on

Rolling-origin cross-validation, five folds by default, refitting the scaler inside every fold so the transform cannot leak across it. The model trains fresh on this run’s data and parameters; nothing is served from a cached fit.

04

Tune a search space, then compare candidates on identical data

Model Tuning searches one estimator’s hyperparameter grid and reports whether the fit generalises. Experiment Comparison ranks competing estimators on the same data, split and threshold, sorted by Deflated Sharpe rather than raw Sharpe. Model Comparison itself exercises three fixed classifiers — logistic regression, random forest, XGBoost — not the full fourteen.

05

Read what actually drove the prediction

Permutation importance and partial dependence, both model-agnostic, computed out of sample on the same leakage-safe pipeline the model was trained on — not on the training data, where importance would flatter features the model merely memorised.

43 models, 5 families, one training path

Hover to pause

ClassificationLogistic RegressionClassificationDecision Tree ClassifierClassificationRandom ForestClassificationExtra Trees ClassifierClassificationGradient Boosting ClassifierClassificationHist Gradient Boosting ClassifierClassificationXGBoost ClassifierClassificationSVCClassificationKNN ClassifierClassificationGaussian NBClassificationLDAClassificationQDAClassificationAdaBoost ClassifierClassificationMLP ClassifierClassificationLogistic RegressionClassificationDecision Tree ClassifierClassificationRandom ForestClassificationExtra Trees ClassifierClassificationGradient Boosting ClassifierClassificationHist Gradient Boosting ClassifierClassificationXGBoost ClassifierClassificationSVCClassificationKNN ClassifierClassificationGaussian NBClassificationLDAClassificationQDAClassificationAdaBoost ClassifierClassificationMLP ClassifierClassificationLogistic RegressionClassificationDecision Tree ClassifierClassificationRandom ForestClassificationExtra Trees ClassifierClassificationGradient Boosting ClassifierClassificationHist Gradient Boosting ClassifierClassificationXGBoost ClassifierClassificationSVCClassificationKNN ClassifierClassificationGaussian NBClassificationLDAClassificationQDAClassificationAdaBoost ClassifierClassificationMLP ClassifierClassificationLogistic RegressionClassificationDecision Tree ClassifierClassificationRandom ForestClassificationExtra Trees ClassifierClassificationGradient Boosting ClassifierClassificationHist Gradient Boosting ClassifierClassificationXGBoost ClassifierClassificationSVCClassificationKNN ClassifierClassificationGaussian NBClassificationLDAClassificationQDAClassificationAdaBoost ClassifierClassificationMLP Classifier
RegressionLinear RegressionRegressionRidgeRegressionLassoRegressionElastic NetRegressionDecision Tree RegressorRegressionRandom Forest RegressorRegressionExtra Trees RegressorRegressionGradient Boosting RegressorRegressionHist Gradient Boosting RegressorRegressionXGBoost RegressorRegressionSVRRegressionKNN RegressorRegressionBayesian RidgeRegressionHuber RegressorRegressionAdaBoost RegressorRegressionMLP RegressorRegressionLinear RegressionRegressionRidgeRegressionLassoRegressionElastic NetRegressionDecision Tree RegressorRegressionRandom Forest RegressorRegressionExtra Trees RegressorRegressionGradient Boosting RegressorRegressionHist Gradient Boosting RegressorRegressionXGBoost RegressorRegressionSVRRegressionKNN RegressorRegressionBayesian RidgeRegressionHuber RegressorRegressionAdaBoost RegressorRegressionMLP RegressorRegressionLinear RegressionRegressionRidgeRegressionLassoRegressionElastic NetRegressionDecision Tree RegressorRegressionRandom Forest RegressorRegressionExtra Trees RegressorRegressionGradient Boosting RegressorRegressionHist Gradient Boosting RegressorRegressionXGBoost RegressorRegressionSVRRegressionKNN RegressorRegressionBayesian RidgeRegressionHuber RegressorRegressionAdaBoost RegressorRegressionMLP RegressorRegressionLinear RegressionRegressionRidgeRegressionLassoRegressionElastic NetRegressionDecision Tree RegressorRegressionRandom Forest RegressorRegressionExtra Trees RegressorRegressionGradient Boosting RegressorRegressionHist Gradient Boosting RegressorRegressionXGBoost RegressorRegressionSVRRegressionKNN RegressorRegressionBayesian RidgeRegressionHuber RegressorRegressionAdaBoost RegressorRegressionMLP Regressor
ClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian MixtureClusteringKmeansClusteringHierarchicalClusteringDBSCANClusteringBirchClusteringSpectralClusteringGaussian Mixture
Dimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNEDimensionality ReductionPCADimensionality ReductionKernel PCADimensionality ReductionFast ICADimensionality Reductiont-SNE
Anomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVMAnomaly DetectionIsolation ForestAnomaly DetectionLocal Outlier FactorAnomaly DetectionOne Class SVM

01bThe catalogue as a constellation

119 research methods. Every one named, 72 checked against a reference.

Each point is a method from the workspace's catalogue, clustered by category. Hover to read its name; choose a category to isolate it. Filled points have been checked against a published worked example, a closed-form identity or an independent library. Outlined points have not yet, and the workspace says so.

Categories

Select a category, or hover a point.

The count beside each category is methods checked against a reference over methods in the category.

Separately, the ML Models page offers 43 machine learning estimators: 14 classifiers, 16 regressors, 6 clustering methods, 4 dimensionality reducers and 3 anomaly detectors. The catalogue and the model registry are different things, and the site never adds them together.

01cEvery name, searchable

Two registries, kept apart on purpose.

Filter the research catalogue by category and validation status, or the ML registry by family. Click a name to copy it. The filtered view is in the address bar, so it can be shared.

119 of 119 methods

  • unverified

    Optimal trade scheduling under linear temporary and permanent impact. Trades faster when risk aversion is high, paying impact to avoid price risk; at zero risk aversion the schedule is exactly TWAP.

    Simulation, costs and market impact

  • validated

    P&L of the spread position accounted through both legs: one unit of signal is long 1 y and short β x, returns are Δspread over the gross capital |y| + |β||x|, and costs are charged on the notional actually traded at each position change. Publishes the gross series and turnover so the cost-sensitivity sweep can re-price the same trades.

    Simulation, costs and market impact

  • validated

    Processes each bar in order with an order queue and a cash ledger. Orders are queued on the bar that decides them and filled on the next, compete for that bar's volume, and are paid for out of cash — so an order can fill partially or not at all. Slower than the vectorised engine and the only one that models any of that.

    Simulation, costs and market impact

  • unverified

    Impact proportional to the square root of participation. The standard practitioner approximation. The order is described by the parameters below: this workspace records no orders, and the entry used to declare that it consumed one, receive none, and quietly report the library's own default.

    Simulation, costs and market impact

  • validated

    Re-runs across cost multiples to find the level at which the edge disappears.

    Simulation, costs and market impact

  • validated

    Signal-to-equity simulation over a return series. Fast; assumes fills at the modelled price.

    Simulation, costs and market impact

  • unverified

    Flag price jumps consistent with an unadjusted split or capital event. Detection only — a jump matching 1:2 is also what a genuine 50% fall looks like, and adjusting on that evidence would rewrite real history on a guess.

    Data acquisition, alignment and point-in-time handling

  • unverified

    Bring prices, returns, factor returns, benchmark weights, fundamentals, execution records or macro series into a run, recording which provider supplied them and a hash of exactly what arrived.

    Data acquisition, alignment and point-in-time handling

  • unverified

    Stamp every record with the date it was actually knowable: the later of its stated availability date and its period end plus a declared lag.

    Data acquisition, alignment and point-in-time handling

  • unverified

    Convert a series between frequencies with an explicit aggregation rule. Refuses to resample a return series with an averaging rule: returns compound. Every later step in the workflow reads the resampled series; the original rows stay available as data_prices_original.

    Data acquisition, alignment and point-in-time handling

  • unverified

    Refuse to proceed while blocking data problems remain. Reads the report an earlier quality.assess step produced and fails the step when anything at or above the chosen severity is still open, which blocks every step that depends on it and leaves the rest of the workflow to run.

    Integrity checks, bias detection and gating

  • validated

    Missing values, duplicate and out-of-order timestamps, timezone mixing, calendar gaps, stale prices, extreme moves, unadjusted actions, survivorship and look-ahead risk.

    Integrity checks, bias detection and gating

  • validated

    Delta, gamma, vega, theta and rho in closed form, with the units stated per Greek and the practitioner scalings (per vol point, per calendar day, per percentage point) carried beside the raw derivatives — a Greek whose units are unstated is a units error waiting to be booked. Refused at expiry or zero volatility, where delta is a step function and any finite number would misrepresent a discontinuity.

    Option pricing, Greeks, implied volatility and short-rate models — Black, F., Scholes, M., Merton, R. C. (1973)

  • validated

    European option price in closed form, with the continuous dividend yield of Merton (1973). Degenerate cases return the exact limit — intrinsic value at expiry, the discounted certain payoff at zero volatility — never NaN.

    Option pricing, Greeks, implied volatility and short-rate models — Black, F., Scholes, M., Merton, R. C. (1973)

  • validated

    Zero-coupon bond price under Cox-Ingersoll-Ross dynamics, face 1, in the affine closed form with log-space A. Refused at sigma = 0, where the closed form's exponent is undefined — the deterministic limit is stated in the refusal instead of silently substituted.

    Option pricing, Greeks, implied volatility and short-rate models — Cox, J. C., Ingersoll, J. E., Ross, S. A. (1985)

  • validated

    Cox-Ross-Rubinstein binomial pricing, European or American. American exercise compares continuation with intrinsic value at every node, and the output separates the early-exercise premium from discretisation error. Refuses a lattice too coarse to mean anything and a discretisation whose risk-neutral probability leaves (0, 1).

    Option pricing, Greeks, implied volatility and short-rate models — Cox, J. C., Ross, S. A., Rubinstein, M. (1979)

  • validated

    Estimates dr = kappa (theta - r) dt + sigma sqrt(r) dW by OLS on the variance-stabilised Euler discretisation. An approximation, consistent as dt -> 0, and the result says so; refused outright for a series touching zero, where the square-root diffusion is undefined.

    Option pricing, Greeks, implied volatility and short-rate models — Cox, J. C., Ingersoll, J. E., Ross, S. A. (1985)

  • validated

    The volatility that makes Black-Scholes-Merton match a quoted price, by Brent root-find on a function that is strictly increasing in volatility. The quote is typed in: this workspace ingests no option chains, so there is no market feed to read it from, and a whole smile or surface is out of reach until one exists. A price outside the no-arbitrage bounds is refused with the violated bound named, never mapped to a number.

    Option pricing, Greeks, implied volatility and short-rate models — Brent, R. P. (1973)

  • validated

    American options by least-squares Monte Carlo: seeded risk-neutral paths, continuation value regressed on (1, S/K, (S/K)^2) over in-the-money paths, exercise where intrinsic beats the fit. The in-sample estimator is biased low from policy suboptimality and the output says so beside its Monte Carlo standard error.

    Option pricing, Greeks, implied volatility and short-rate models — Longstaff, F. A., Schwartz, E. S. (2001)

  • validated

    European option under geometric Brownian motion plus lognormal Poisson jumps — the Poisson-weighted sum of Black-Scholes-Merton prices. Relaxes exactly the pure-lognormal assumption the volatility smile contradicts. With no jumps it reduces to Black-Scholes-Merton exactly, and the suite asserts it.

    Option pricing, Greeks, implied volatility and short-rate models — Merton, R. C. (1976)

  • validated

    Estimates dr = kappa (theta - r) dt + sigma dW from an observed short-rate series by OLS on the exact AR(1) discretisation, which is the exact conditional maximum-likelihood estimator. A sample showing no mean reversion is refused rather than reported with an imaginary half-life.

    Option pricing, Greeks, implied volatility and short-rate models — Vasicek, O. (1977)

  • validated

    Zero-coupon bond price P = A(T) exp(-B(T) r0) under Vasicek dynamics, face 1, with the continuously compounded yield beside it. Prices off stated parameters or off a fit from earlier in the run — not off a market curve, because the workspace ingests none.

    Option pricing, Greeks, implied volatility and short-rate models — Vasicek, O. (1977)

  • unverified

    Total cost against the decision price, decomposed into delay, impact and opportunity cost on the unfilled remainder.

    Order scheduling and transaction-cost analysis

  • unverified

    Splits an order evenly across time. Ignores the volume profile entirely, so it over-participates when the market is quiet — which is exactly when impact is highest.

    Order scheduling and transaction-cost analysis

  • unverified

    Splits an order in proportion to expected volume, which holds participation — quantity over volume — constant in every period. Refuses without a volume profile: VWAP with a flat profile assumed is TWAP under a misleading name.

    Order scheduling and transaction-cost analysis

  • validated

    Splits active return into allocation, selection and interaction. The two variants differ per group and agree in total when both weight sets sum to one.

    Factor models and attribution

  • validated

    Fama-French three plus momentum.

    Factor models and attribution

  • validated

    Build SMB, HML, RMW, CMA and the market factor by independent double sorts on the project's own universe: size at the median, the characteristic at the 30th/70th percentiles, value-weighted portfolios, sort variables strictly as-of the formation date. Every deviation the data forces — no NYSE breakpoints, no size dimension without market capitalisation — is recorded on the result, and missing fundamentals are refused rather than proxied silently.

    Factor models and attribution

  • validated

    Frazzini-Pedersen BAB on the project's own universe: trailing betas shrunk toward one, rank weights w = k(z − z̄)^±, the low-beta side levered and the high-beta side delevered to a beta of one, so the factor is beta-neutral ex ante by construction.

    Factor models and attribution

  • validated

    Winners minus losers on each security's own prior return from t−window to t−skip — 12-1 momentum at the daily defaults. With market capitalisation and value weighting this is the published 2x3 size/prior-return UMD; without, it is a univariate equal-weighted sort and the result says so.

    Factor models and attribution

  • validated

    Explains returns by market, size and value, optionally with profitability and investment. Reports Newey-West standard errors alongside the ordinary ones, because autocorrelated residuals make an ordinary alpha t-statistic too large.

    Factor models and attribution

  • validated

    Factor **return series** extracted from the universe's return panel rather than specified in advance, with the loadings that produced them. This entry used to point at a route that runs PCA over four summary statistics per ticker — annual return, volatility, Sharpe, drawdown — which has no time dimension and so cannot produce a factor return series at all.

    Factor models and attribution

  • unverified

    Where a security stands against its peers on the same date: rank, percentile, z-score within the cross-section, momentum relative to the cross-section and volatility against its median. Nothing else in this workspace computes a value that depends on how a security compares with anything but its own history, so a model could learn that a stock rose 3% and never that it was the worst in the universe that day.

    Feature construction and transformation

  • unverified

    Difference a series enough to be stationary while keeping memory.

    Feature construction and transformation

  • unverified

    Valuation, profitability and leverage ratios from reported statements, built only from a point-in-time aligned panel.

    Feature construction and transformation

  • validated

    Given a side a primary model has already decided, was the bet worth taking net of cost? Meta-labelling does not choose direction; it learns when to act on a direction already chosen, which is a different and usually easier problem than predicting the sign, and it turns a signal's precision into something that can be raised without changing the signal.

    Feature construction and transformation — López de Prado, M. (2018)

  • unverified

    Amihud illiquidity, Roll's effective spread and Kyle's lambda, estimated from daily prices and volume. These recover the price of liquidity without a quote book, which is what a research workspace usually lacks.

    Feature construction and transformation

  • unverified

    Simple and log returns, lagged and compounded returns, momentum with a skip, rate of change, price against its moving average, and the Donchian channel with its breakout flags. Every value uses only information available at or before its own timestamp.

    Feature construction and transformation

  • validated

    Band positions on a strictly trailing z-score of the spread, with hysteresis: enter beyond the entry band, exit once z falls back inside the exit band. The z-score never uses the full-sample mean — that would let every early signal see the end of the sample.

    Feature construction and transformation

  • unverified

    Rolling mean, standard deviation, z-score, bias-corrected skewness and excess kurtosis, autocorrelation at a lag, the rescaled-range Hurst exponent and the Shannon entropy of the window's distribution.

    Feature construction and transformation

  • unverified

    Moving averages, Wilder's RSI, MACD, Bollinger bands, the stochastic oscillator and the average directional index — each computed from trailing data only, and each returning every component rather than one headline line.

    Feature construction and transformation

  • validated

    Which of three things happened first: a profit-taking barrier, a stop-loss barrier or the holding period running out. Both price barriers are sized off the security's own trailing volatility, so the same label means the same thing in a calm period and a violent one. A fixed-horizon label says what the return was after ten days whatever happened in between; a position does not experience that.

    Feature construction and transformation — López de Prado, M. (2018)

  • unverified

    Rolling and exponentially weighted volatility, average true range, realised volatility, downside volatility about a threshold, and the ratio of short-window to long-window volatility.

    Feature construction and transformation

  • unverified

    Sequentially fitted trees. Usually the strongest tabular baseline.

    Supervised learning

  • unverified

    The baseline every other model has to beat. Coefficients are interpretable.

    Supervised learning

  • unverified

    Multi-layer perceptron. Needs more data than most financial samples contain.

    Supervised learning

  • unverified

    Bagged decision trees. Robust to scaling and mixed feature types.

    Supervised learning

  • unverified

    Margin-based classifier or regressor. Sensitive to scaling.

    Supervised learning

  • validated

    Autoregressive integrated moving average, optionally seasonal.

    Time-series and volatility models — Box, G. E. P., Jenkins, G. M. (1970)

  • validated

    Exponentially weighted volatility. Simple, fast, and hard to beat short-horizon.

    Time-series and volatility models

  • unverified

    Error-trend-seasonal smoothing, including Holt-Winters.

    Time-series and volatility models

  • validated

    Conditional volatility, including asymmetric variants that treat falls and rises differently. The order is fixed at (1,1) and the innovations are Gaussian: this estimator implements one lag of each under a Gaussian quasi-likelihood, and the p, q and error-distribution controls that used to appear here fitted a GARCH(1,1) under whatever name was chosen.

    Time-series and volatility models — Bollerslev, T. (1986)

  • validated

    A local-level or local-linear-trend state space, filtered forward and smoothed backward, with the state variances estimated by maximum likelihood. Both paths are returned and only the filtered one is tradeable: the smoothed level at any date conditions on the whole sample.

    Time-series and volatility models — Kalman, R. E. (1960)

  • validated

    Fit ds = θ(μ − s)dt + σ dW to the spread by its exact AR(1) discretisation: θ = −ln(φ)/Δt, half-life = ln 2/θ, closed form. The half-life is the natural entry/exit calibration for a mean-reverting spread — a holding period much shorter than it pays costs the reversion has not yet earned back.

    Time-series and volatility models

  • unverified

    Joint dynamics of several series, with orthogonalised impulse responses and information-criterion lag selection. The forecast now covers every series; the first series alone remains at detail.forecast_first_series.

    Time-series and volatility models

  • unverified

    Density-based clustering of securities that leaves outliers unassigned.

    Dimensionality reduction, clustering and latent structure

  • unverified

    Soft clustering with per-component covariance. Returns the responsibilities — the probability each security belongs to each component — and not only the most likely label: a security at 55% is not in a component the way one at 99% is, and discarding that is the difference between a mixture model and k-means with more arithmetic.

    Dimensionality reduction, clustering and latent structure

  • unverified

    Nested clusters of securities from a linkage tree, cut by distance rather than by a count. No k chosen in advance — and where a k was hardcoded at half the universe and shown to nobody, the tree is now cut at the largest gap between merge heights and the number of clusters that produces is reported.

    Dimensionality reduction, clustering and latent structure

  • unverified

    Partitions the universe's securities into k groups by distance between their return histories. Each row of the input is one security, not one observation: the question is which securities behave alike.

    Dimensionality reduction, clustering and latent structure

  • unverified

    Orthogonal components of the universe's return panel, ordered by variance explained.

    Dimensionality reduction, clustering and latent structure

  • validated

    The Sharpe ratio adjusted for how many configurations were tried, and for non-normal returns.

    Multiple-testing and selection-bias correction

  • validated

    How long a track record must be before a Sharpe ratio is statistically distinguishable from the benchmark.

    Multiple-testing and selection-bias correction

  • validated

    Adjusts a t-statistic or p-value for the number of tests performed.

    Multiple-testing and selection-bias correction

  • validated

    The probability that the true Sharpe ratio exceeds a benchmark, given the sample's skewness, kurtosis and length. It corrects for the shape of the return distribution and the length of the record — not for how many configurations were tried, which is the Deflated Sharpe Ratio.

    Multiple-testing and selection-bias correction

  • validated

    The chance the selected configuration underperforms the median out of sample, estimated by combinatorially symmetric cross-validation.

    Multiple-testing and selection-bias correction

  • validated

    A more powerful successor to the Reality Check. Studentised, and recentred so that adding hopeless strategies to the set does not make the test easier to pass.

    Multiple-testing and selection-bias correction

  • validated

    Tests whether the best of many strategies beats a benchmark once data snooping is accounted for. Takes the whole set that was tried, not the winner.

    Multiple-testing and selection-bias correction

  • unverified

    Annualised return over the absolute maximum drawdown. Null when the series never drew down.

    Return and risk-adjusted performance measurement

  • validated

    Annualised active return over annualised tracking error, measured on the observations the two series share.

    Return and risk-adjusted performance measurement

  • validated

    Annualised return above what beta exposure to the benchmark explains.

    Return and risk-adjusted performance measurement

  • validated

    Probability-weighted gains over losses about a threshold. Above one the gains outweigh the losses. Null when no period fell below the threshold.

    Return and risk-adjusted performance measurement

  • validated

    Annualised excess return per unit of annualised total volatility. Null, not zero, on a series with no volatility.

    Return and risk-adjusted performance measurement

  • validated

    Excess return over downside deviation, where downside deviation is the root mean square of the shortfall below the minimum acceptable return taken over **all** periods — not the standard deviation of the losing subset about its own mean, and not an average over the losing periods only. Null when nothing falls below the MAR: the denominator does not exist then, and zero is the worst value the ratio can take rather than an absent one.

    Return and risk-adjusted performance measurement

  • validated

    Annualised excess return per unit of systematic risk — excess return over beta. Rewards a concentrated book that a Sharpe ratio would penalise, because it counts only the risk the benchmark explains.

    Return and risk-adjusted performance measurement

  • validated

    Participation in rising and falling benchmark periods, separately. Down capture above 100% is the case worth looking at.

    Return and risk-adjusted performance measurement

  • validated

    Blends equilibrium returns reverse-optimised from a starting portfolio with explicit views and their confidence. Those equilibrium returns are market-implied only when the starting portfolio is the market: supply capitalisations and it is, and without them equal weights stand in and the output says so. Reverse-optimising equal weights gives the equilibrium of a universe in which every security is the same size, which is not a market anybody trades and must not be described as one.

    Allocation and optimisation

  • validated

    Minimises expected shortfall rather than variance. Linear-programmable.

    Allocation and optimisation

  • validated

    Herfindahl index and the effective number of positions — how many equally-weighted holdings would be this concentrated.

    Allocation and optimisation

  • validated

    How many independent bets a set of holdings actually represents, from the participation ratio of the correlation eigenvalues. Uncorrelated holdings give exactly N and perfectly correlated holdings give exactly 1. This is the number the Fundamental Law needs; substituting the holding count is how twenty correlated names come to promise 4.5x the information ratio of one.

    Allocation and optimisation

  • validated

    The baseline that optimisers frequently fail to beat out of sample.

    Allocation and optimisation

  • validated

    Allocates down a clustering tree, avoiding covariance inversion entirely.

    Allocation and optimisation

  • validated

    Growth-optimal position size. Full Kelly is too aggressive for most mandates.

    Allocation and optimisation

  • validated

    The efficient frontier. Highly sensitive to estimated expected returns.

    Allocation and optimisation

  • validated

    Runs a rebalancing schedule across a universe and returns the portfolio's return series. Weights drift with relative performance between rebalances, and turnover is measured from the drifted weights to the new target — measuring it from the previous target charges a book that was left alone for a full round-trip every period.

    Allocation and optimisation

  • validated

    Weights so that each asset contributes equally to portfolio risk. The solution is long-only and fully invested by construction, so the minimum and maximum weight controls that used to appear here had nothing to constrain and were never passed to the solver.

    Allocation and optimisation

  • unverified

    Counts the trials that choosing the holdings represented. A single-asset validation counts parameter settings and cannot see the securities that were examined and dropped, so the deflated Sharpe is computed against a trial count that omits the largest search actually performed.

    Allocation and optimisation

  • unverified

    Latent states with their own means and variances and transition probabilities between them, fitted by Expectation-Maximisation. Returns the per-state parameters, the transition matrix, the filtered and smoothed state probabilities and the most likely path. What this entry pointed at until now was a rolling standard deviation split at its own sample median: no likelihood, no transition matrix, no state probability, and boundaries taken from the whole sample so every label looked ahead.

    Regime identification and structural change

  • unverified

    Regime labels from trailing realised volatility. Each label uses only the trailing window, so the series can condition other work without leaking.

    Regime identification and structural change

  • unverified

    The full report: verdict, methodology, statistical evidence, data and features, strategy, assumptions, out-of-sample results, critique and next steps, reproducibility and limitations. Verdict first, so a reader who stops after the first section already has the conclusion and the reason for it. A workflow's report step used to emit three loose blocks under a summary claiming seven sections, while the real generator was reachable only over HTTP.

    Evidence assembly and disclosure

  • unverified

    How many configurations were evaluated, by which search, and whether their return series were kept — which is what deflates everything else in the report. Reads the run's ledger; it shared a handler with the evidence report and never read one.

    Evidence assembly and disclosure

  • validated

    Sensitivity to a benchmark and the volatility of the difference, measured over the overlapping observations the two series share.

    Risk measurement and exposure

  • validated

    The average loss in the tail beyond VaR. Coherent, unlike VaR.

    Risk measurement and exposure

  • validated

    Maximum, average and duration of peak-to-trough declines.

    Risk measurement and exposure

  • validated

    Fits the tail directly, by a generalised Pareto distribution over the peaks beyond a threshold, rather than assuming a distribution for the whole return series.

    Risk measurement and exposure

  • validated

    The loss threshold exceeded with a given probability over a horizon.

    Risk measurement and exposure

  • validated

    Tests for conditional heteroskedasticity — volatility clustering.

    Hypothesis tests and time-series diagnostics

  • validated

    Tests for a unit root. The null is non-stationarity.

    Hypothesis tests and time-series diagnostics

  • unverified

    Finds an unknown number of breaks at unknown dates by dynamic programming, which is globally optimal for each number of breaks — the best two breaks are generally not the best one plus the best of the remainder, so a greedy search gets this wrong.

    Hypothesis tests and time-series diagnostics

  • unverified

    Detects parameter instability from cumulative residuals.

    Hypothesis tests and time-series diagnostics

  • unverified

    Tests for a coefficient break at a known date.

    Hypothesis tests and time-series diagnostics

  • validated

    Build the actual spread series y − a − βx from the hedge ratio an upstream cointegration step estimated. The ratio is consumed, never re-estimated: the spread must be the same residual whose stationarity the test certified.

    Hypothesis tests and time-series diagnostics

  • validated

    Two-step test for a cointegrating relationship between two series. Publishes the first-stage hedge ratio and the exact level series it was estimated on, so spread.construct can build the spread the test was actually about rather than re-deriving a slightly different one.

    Hypothesis tests and time-series diagnostics

  • unverified

    Tests whether one series improves the forecast of another. Predictive precedence, not causation.

    Hypothesis tests and time-series diagnostics

  • unverified

    Estimates long memory. Above 0.5 suggests trending, below 0.5 mean reversion.

    Hypothesis tests and time-series diagnostics

  • validated

    Tests normality through skewness and kurtosis. Financial returns usually fail it.

    Hypothesis tests and time-series diagnostics

  • unverified

    Tests for cointegrating rank among several series at once, by the sequential trace test. Reports the whole ladder, not just where it stopped, so a marginal stopping decision looks marginal.

    Hypothesis tests and time-series diagnostics

  • validated

    Tests for stationarity with the opposite null to ADF. Run both: they disagree informatively.

    Hypothesis tests and time-series diagnostics

  • validated

    Tests whether autocorrelations up to a lag are jointly zero.

    Hypothesis tests and time-series diagnostics

  • validated

    Tests the random-walk hypothesis across horizons.

    Hypothesis tests and time-series diagnostics

  • unverified

    Replays the returns the securities in the book **actually printed** between the dates of a named episode. The dates are facts and are shipped with the workspace; the returns are read out of the loaded price history and are never modelled. When that history does not span the window the method refuses and says what it covers — because a scenario named after a real period whose returns were invented is worse than no scenario. Until now the six 'episodes' were hard-coded shock, volatility and correlation triples in the front end, fed to the hypothetical path.

    Scenario, stress and sensitivity analysis

  • unverified

    A market move you specify, propagated through each asset's beta to the benchmark, with the covariance rescaled by a volatility multiple and correlations pushed toward one. Runs through the same risk engine as the Scenario page rather than a second calculation that could disagree with it. The inputs are yours: this is not, and does not claim to be, what any period did.

    Scenario, stress and sensitivity analysis

  • unverified

    Starts from an unacceptable loss and finds what would cause it.

    Scenario, stress and sensitivity analysis

  • validated

    Many train/test arrangements rather than one, each purged and embargoed. Produces a distribution of out-of-sample paths.

    Sample splitting and cross-validation — López de Prado, M. (2018)

  • unverified

    How many independent observations a set of overlapping labels is actually worth, and the sample weights that correct for it. Purging stops the training set overlapping the test set; it does nothing about the training set overlapping itself. Two hundred and fifty ten-day labels in a year are built from 250 overlapping windows and are worth roughly 25 independent observations, while every standard error computed from them assumes 250.

    Sample splitting and cross-validation

  • validated

    Simulates many forward return paths under a stated process and reports the distribution of terminal wealth, worst drawdown and realised Sharpe ratio. This is path simulation. It is not sampling portfolio weights — the endpoint this used to name is a portfolio-weight sampler, which answers a question about allocation — and it is not reshuffling the order of historical trades, which destroys the serial structure of the series.

    Sample splitting and cross-validation

  • unverified

    Every robustness statistic that can be computed from what this run holds, assembled with the verdict that follows from the set. The verdict is a property of the whole panel — 'nothing failed but two checks are marginal' cannot be read off any single statistic — which is why it is assembled here rather than by whichever overfitting step happened to run first.

    Sample splitting and cross-validation

  • validated

    One train and one test period. One out-of-sample number, which is one draw from a distribution — and it is that number this runs. It used to run combinatorial purged cross-validation instead and ignore its own training fraction, because the split mode came from a parameter none of these three declared.

    Sample splitting and cross-validation

  • validated

    Resamples blocks so serial dependence survives resampling, and reports confidence intervals for the Sharpe ratio and the maximum drawdown. The valid alternative to reshuffling trades, which destroys the serial structure and answers a different question.

    Sample splitting and cross-validation

  • validated

    A sequence of out-of-sample periods, refitting at each origin. Rolling keeps the training length fixed; expanding grows it. It produces splits and not paths: a fold covers part of the sample, a path covers all of it, and only a combinatorial design has enough arrangements to stitch one.

    Sample splitting and cross-validation

02How it works

The method, stated for the specialist.

Validation status and model configuration are both derived, not asserted. Neither a method’s "validated" badge nor a model’s hyperparameters are something a page just states — both trace to a rule in the code.

What "validated" actually means
A method is validated only if at least one reference case of a validating kind exists for it — textbook, paper, closed-form identity, hand-worked example, third-party library or regulator source. A self-referential regression-pinning case earns no badge, because it cannot catch a formula that is wrong and internally consistent with itself.
How a model is actually built
A model’s configuration is assembled in a fixed merge order: the registry’s own sensible defaults first, then the model’s seed if it has one, then whatever hyperparameters the caller supplied. Later entries in that order win, so a supplied hyperparameter always overrides the default it replaces.
Calibration is recommended, not silent
Where a model’s raw output is a score rather than a calibrated probability, the workspace surfaces a calibration recommendation rather than presenting the score as one.
Unseeded models are named, not hidden
Ten of the fourteen classifiers and eleven of the sixteen regressors carry a fixed seed; the rest — KNN, Gaussian NB, LDA, QDA on the classification side; linear regression, SVR, KNN, Bayesian ridge, Huber on the regression side — are listed as unseeded so a reproducibility audit knows exactly where run-to-run variation can come from.
Unsupervised is a separate path
Clustering, dimensionality reduction and anomaly detection sit on their own tab of the ML Models page with their own 13-model registry — six clustering, four dimensionality reduction, three anomaly detection — distinct from the 30 supervised models and evaluated by different diagnostics.
Forecasting is a separate path
Model Forecasting runs on its own code path with its own four methods — a linear lag model, a naive last-value baseline, Random Forest lags, XGBoost lags — measured against the naive baseline by a skill score, not against the 43-model registry.

03What you get out

Outputs, and what they let you defend.

Every model run produces the same shape of record, whatever estimator was chosen, so a classifier and a regressor can be compared on the same terms as the pipeline that trained them.

  • Per-fold metrics: accuracy, F1, ROC AUC and balanced accuracy for classification; R², RMSE and directional accuracy for regression
  • Aggregate mean, standard deviation, minimum and maximum across folds for every numeric column
  • A stability score — mean of the primary metric over its standard deviation across folds
  • Feature importances from permutation testing and partial dependence, computed out of sample
  • The Model section of the exportable evidence pack, populated only when a model was actually trained
Evidence pack (PDF) Page 2: model, out-of-sample validation with fold count, mean, standard deviation and worst fold, and the strategy backtest against buy-and-hold.

04What this does not do

Stated plainly, because it matters as much as what it does.

No SHAP, no LIME

Explainability is permutation importance and partial dependence, both model-agnostic. Neither SHAP nor LIME is implemented in the codebase.

No deep learning beyond an MLP

The neural-network entries in the registry are multi-layer perceptrons — an MLP classifier and an MLP regressor. There is no convolutional, recurrent or transformer architecture in the registry.

47 methods are still unverified

The catalogue shows every method’s status honestly. 47 of the 119 have not yet been checked against a reference case and are labelled unverified rather than silently presented as equivalent to the 72 that have.

Models train fresh every run

Nothing is served from a stale cached fit. A model trains on the data and parameters of the run that requested it, every time.

Train a model on a pipeline that will not let it cheat.

Beta researchers pick a task, choose an estimator, and read the fold-by-fold record it actually produced.