ExamFinch.com My Study

Study guide

3.4 Machine Learning, Deep Learning & Big Data Projects

Practice this exam

CFA Level 2 Chartered Financial Analyst

Track your progress as you read

Finished sections get a check mark.

1 Introduction & CFA Level II Exam Strategy

1.1 CFA Level II Exam Overview & Item-Set Vignette Strategy 1.2 2026 Curriculum Structure & 10 Topic Weight Bands 1.3 300-Hour Study Plan, Calculator Mastery & Practical Skills Modules (PSM)

2 Ethical and Professional Standards

2.1 Code of Ethics & The Seven Standards of Professional Conduct 2.2 Vignette Analysis: Conflicts of Interest & Disclosure (Standard VI) 2.3 Duties to Clients (Standard III) & Duties to Employers (Standard IV) 2.4 Standard V: Investment Analysis, Recommendations & Actions and Standard VII: Responsibilities as a CFA Member or Candidate 2.5 Application of the Code and Standards: Level II Case Method 2.6 Recommended Procedures: Compliance Programs, Supervisory Systems & Firm Policies

3 Quantitative Methods

3.1 Multiple Linear Regression, ANOVA & Hypothesis Testing 3.2 Regression Diagnostics: Multicollinearity, Heteroskedasticity & Serial Correlation 3.3 Time-Series Analysis: AR Models, Nonstationarity & Cointegration 3.4 Machine Learning, Deep Learning & Big Data Projects 3.5 Extensions of Multiple Regression: Influence Analysis, Qualitative Variables & Logistic Regression 3.6 Big Data Projects: Wrangling, Exploration, Feature Engineering & Model Training

4 Economics for Valuation

4.1 Foreign Exchange Parity Relations & Equilibrium Exchange Rates 4.2 Economic Growth Theories & Production Function Analysis 4.3 Forward Points, the Carry Trade & Policy Effects on Exchange Rates 4.4 Growth Determinants: Natural Resources, Demographics, Convergence & Trade Openness

5 Financial Statement Analysis

5.1 Intercorporate Investments: Equity Method & Business Combinations 5.2 Employee Compensation: Defined Benefit Pension Plans & Share-Based Payments 5.3 Multinational Operations: Current Rate vs Temporal Translation 5.4 Analysis of Financial Institutions & The CAMELS Framework 5.5 Evaluating the Quality of Financial Reports & Accounting Adjustments 5.6 Integration of Financial Statement Analysis Techniques

6 Corporate Issuers

6.1 Analysis of Dividends: Policy Theories, Signaling & Taxation Systems 6.2 Share Repurchases: Methods, EPS and Book Value Effects & Payout Sustainability 6.3 Cost of Capital: Advanced Topics 6.4 Corporate Governance, Board Oversight & ESG Integration 6.5 Corporate Restructuring: Types, Motivations, Evaluation & Valuation 6.6 Restructuring Financial Effects: EPS, Net Debt to EBITDA, WACC & Divestitures

7 Equity Valuation

7.1 Equity Valuation Framework & Required Rate of Return Estimation 7.2 Discounted Dividend Valuation: Gordon Growth, Multistage & The H-Model 7.3 Free Cash Flow Valuation: FCFF and FCFE Modeling 7.4 Market-Based Valuation: Price and Enterprise Value Multiples 7.5 Residual Income Valuation 7.6 Private Company Valuation: Income, Market & Asset-Based Approaches 7.7 Choosing and Combining Models: Definitions of Value, Sum-of-the-Parts & Cross-Border Comparability

8 Fixed Income Analysis

8.1 The Term Structure and Interest Rate Dynamics: Spot, Forward & Swap Curves 8.2 The Arbitrage-Free Valuation Framework & Binomial Interest Rate Trees 8.3 Valuation and Analysis of Bonds with Embedded Options: OAS & Duration 8.4 Credit Analysis Models: Structural vs Reduced-Form Approaches 8.5 Credit Default Swaps (CDS): Mechanics, Pricing & Trading Strategies 8.6 Managing Yield-Curve Risk: Key Rate Durations, One-Sided Durations & Yield Volatility Structure

9 Derivatives & Risk Management

9.1 Pricing and Valuation of Forward Commitments: Equity, Fixed Income & FX 9.2 Swap Pricing and Valuation: Interest Rate, Currency & Equity Swaps 9.3 Contingent Claims: Binomial Option Pricing Model & Arbitrage Replication 9.4 The Black-Scholes-Merton (BSM) Model, Option Greeks & Dynamic Hedging 9.5 Interest Rate Options, Swaptions & the Black Model

10 Alternative Investments

10.1 Commodities and Commodity Derivatives: Sectors, Participants, Futures Returns & Indexes 10.2 Private Real Estate Investments: Direct Capitalization, DCF & Cost Approach 10.3 Public Real Estate Investments: REIT Structures, NAV, FFO & AFFO 10.4 Hedge Fund Strategies: Classification, Implementation & Portfolio Role 10.5 Real Estate Investment Features, Due Diligence & Index Construction Biases

11 Portfolio Management

11.1 Using Multifactor Models: Macroeconomic, Fundamental & Statistical Risk 11.2 Measuring and Managing Market Risk: VaR, CVaR & Stress Testing 11.3 Economics & Investment Markets: Business Cycles, Term Structure & Asset Allocation 11.4 Analysis of Active Portfolio Management & The Fundamental Law 11.5 Exchange-Traded Funds (ETFs): Creation, Arbitrage, Tracking & Applications 11.6 Backtesting and Simulation: Procedures, Metrics, Biases & Scenario Analysis

3.4 Machine Learning, Deep Learning & Big Data Projects

Key Takeaways Explain This Topic AI

Supervised learning models continuous targets via regression and discrete classes via classification, while unsupervised learning uncovers latent structures (PCA for dimension reduction, K-Means for clustering).

Penalized regression controls overfitting: Lasso (L1 penalty) drives non-essential coefficients to exactly zero for feature selection, while Ridge (L2 penalty) shrinks coefficients asymptotically toward zero to mitigate multicollinearity.

Classification algorithms include Support Vector Machines (maximizing separation margins), Decision Trees, Bagging/Random Forests (reducing variance), and Boosting (reducing bias and variance).

Deep learning neural networks process unstructured data (CNNs for spatial images, RNNs/LSTMs for sequential text and time series), evaluated via confusion matrix metrics (Precision, Recall, F1-Score, ROC-AUC) alongside Big Data NLP pipelines (Tokenization, TF-IDF).

Last updated: August 2026

Machine Learning in Investment Management

Machine learning (ML) provides data-driven algorithms that learn patterns directly from large, complex, and high-dimensional financial datasets without relying on rigid parametric assumptions. ┌──────────────────────────────────────────────────────────┐

  • │ Machine Learning Taxonomy │
  • └────────────────────────────┬─────────────────────────────┘
  • │
  • ┌────────────────────────────────────────────────┼────────────────────────────────────────────────┐
  • ▼ ▼ ▼
  • ┌────────────────────────┐ ┌────────────────────────┐ ┌────────────────────────┐
  • │ Supervised Learning │ │ Unsupervised Learning │ │ Deep Learning │
  • │ - Target: Labeled Y │ │ - Target: None │ │ - Multi-layer ANNs │
  • │ - Ridge (L2) & Lasso │ │ - PCA (Dimension Red.) │ │ - CNN (Images/Spatial) │
  • │ - SVM, Trees, Ensembles│ │ - K-Means & Hierarch. │ │ - RNN / LSTM (Sequence)│
  • └────────────────────────┘ └────────────────────────┘ └────────────────────────┘
  • 1. Machine Learning Taxonomy

Category Target Variable ( Y Y Y ) Primary Objective Key Algorithms Investment Applications

Supervised Learning: Regression Continuous real values Predict continuous numerical targets Penalized Linear Regression (Lasso, Ridge), Random Forest Regressor, SVR Stock return forecasting, asset yield curve fitting, macro growth projection

Supervised Learning: Classification Discrete categorical classes Classify observations into predefined classes Logistic Regression, SVM, KNN, Decision Trees, Gradient Boosting Corporate bankruptcy prediction, loan default screening, earnings surprise classification

Unsupervised Learning: Dimension Reduction None (Unlabeled) Compress high-dimensional feature spaces into orthogonal factors Principal Component Analysis (PCA) Factor risk modeling, yield curve decomposition (level, slope, curvature)

Unsupervised Learning: Clustering None (Unlabeled) Group observations by feature similarity K-Means Clustering, Hierarchical Clustering Regrouping mutual funds by holdings, regime classification, client profiling

Reinforcement Learning Dynamic reward function Optimize sequence of actions through trial and error Q-Learning, Deep Q-Networks (DQN) Algorithmic execution, dynamic asset allocation, market making

  • 2. Supervised Learning: Penalized Regression & Classification
  • Penalized Linear Regression (Regularization)

Standard OLS minimizes ∑ ( Y i − Y ^ i ) 2 \sum (Y_i - \hat{Y}_i)^2 ∑ ( Y i ​ − Y ^ i ​ ) 2 . When the feature count k k k is large relative to n n n , OLS overfits the training data. Regularization introduces a penalty term scaled by hyperparameter λ ≥ 0 \lambda \ge 0 λ ≥ 0 :

Ridge Regression ( L 2 L_2 L 2 ​ Regularization) : min ⁡ β [ ∑ i = 1 n ( Y i − X i β ) 2 + λ ∑ j = 1 k b j 2 ] \min_{\beta} \left[ \sum_{i=1}^n (Y_i - X_i \beta)^2 + \lambda \sum_{j=1}^k b_j^2 \right] β min ​ [ i = 1 ∑ n ​ ( Y i ​ − X i ​ β ) 2 + λ j = 1 ∑ k ​ b j 2 ​ ]

Shrinks coefficients asymptotically toward zero but never sets them exactly to zero .

Highly effective when features suffer from severe multicollinearity.

Lasso Regression ( L 1 L_1 L 1 ​ Regularization) : min ⁡ β [ ∑ i = 1 n ( Y i − X i β ) 2 + λ ∑ j = 1 k ∣ b j ∣ ] \min_{\beta} \left[ \sum_{i=1}^n (Y_i - X_i \beta)^2 + \lambda \sum_{j=1}^k |b_j| \right] β min ​ [ i = 1 ∑ n ​ ( Y i ​ − X i ​ β ) 2 + λ j = 1 ∑ k ​ ∣ b j ​ ∣ ]

Shrinks coefficients and sets non-essential coefficients exactly to zero as λ \lambda λ increases.

Acts as an automatic feature selection tool, generating sparse and interpretable models.

Elastic Net : Combines both L 1 L_1 L 1 ​ and L 2 L_2 L 2 ​ penalties to handle groups of highly correlated features.

Classification Algorithms

Support Vector Machines (SVM) : Identifies an optimal decision boundary (hyperplane) that maximizes the margin between discrete classes. For non-linearly separable data, SVM maps features into higher-dimensional space via kernel functions (e.g., radial basis function - RBF).

K-Nearest Neighbors (KNN) : Non-parametric instance-based algorithm that classifies an observation based on the majority vote of its k k k closest neighbors in feature space (using Euclidean or Manhattan distance). Requires feature normalization/standardization.

Decision Trees : Partition feature space recursively into homogeneous rectangular regions using purity criteria (e.g., Gini Impurity or Entropy ). Trees are non-parametric and intuitive but prone to overfitting unless pruned.

Ensemble Methods :

Bagging (Bootstrap Aggregating) : Fits multiple trees in parallel on randomly bootstrapped subsets of data and averages their predictions (e.g., Random Forests , which also randomly select a subset of features at each split). Primarily reduces variance without increasing bias.

Boosting : Builds trees sequentially, where each successive tree assigns greater weight to observations misclassified by prior trees (e.g., AdaBoost , Gradient Boosted Decision Trees - XGBoost, LightGBM ). Primarily reduces bias and variance .

  • 3. Unsupervised Learning: PCA & Clustering
  • Principal Component Analysis (PCA)

Transforms p p p correlated features into p p p uncorrelated, orthogonal linear combinations called principal components ( P C 1 , P C 2 , … , P C p PC_1, PC_2, \dots, PC_p P C 1 ​ , P C 2 ​ , … , P C p ​ ).

P C 1 PC_1 P C 1 ​ accounts for the maximum possible variance; each subsequent component explains the maximum remaining variance orthogonal to preceding components.

In fixed income, the first 3 principal components typically capture over 95 % 95\% 95% of yield curve movements: Level ( P C 1 PC_1 P C 1 ​ ), Slope ( P C 2 PC_2 P C 2 ​ ), and Curvature ( P C 3 PC_3 P C 3 ​ ).

Clustering Techniques

K-Means Clustering : Partitions n n n observations into K K K non-overlapping clusters by iteratively assigning points to the nearest cluster centroid and updating centroids. The optimal K K K is selected via the Elbow Method (plotting within-cluster dispersion vs. K K K ).

Hierarchical Clustering : Builds a tree-like hierarchy ( dendrogram ). Can be agglomerative (bottom-up: starts with each point as its own cluster and merges closest pairs) or divisive (top-down).

4. Deep Learning Architectures

2026 currency note: the learning outcome covering neural networks, deep learning nets, and reinforcement learning was removed from the 2026 Level II Machine Learning module — the single curriculum change from 2025. The surviving outcome asks only that you describe supervised learning, unsupervised learning, and deep learning, so the material below is context rather than a testable calculation.

Deep Learning utilizes Artificial Neural Networks (ANNs) with multiple hidden layers between input and output layers:

Multilayer Perceptron (MLP) : Fully connected feedforward network with non-linear activation functions (e.g., ReLU, Sigmoid) trained via backpropagation and gradient descent.

Convolutional Neural Networks (CNNs) : Use convolution filters and pooling layers to extract spatial patterns. In finance, CNNs analyze satellite imagery (e.g., counting cars in retail parking lots, tracking oil tanker shadows) or financial chart patterns.

Recurrent Neural Networks (RNNs) & LSTMs : Incorporate recurrent feedback loops and memory cells to capture sequential and temporal dependencies in financial time series and text narratives (e.g., central bank statements).

  • 5. Model Evaluation & Performance Metrics
  • Bias-Variance Tradeoff & Cross-Validation

Underfitting (High Bias) : The model is overly simplistic, performing poorly on both training and test data.

Overfitting (High Variance) : The model fits training data noise, achieving near-perfect in-sample fit but terrible out-of-sample prediction.

K K K -Fold Cross-Validation : Divides training data into K K K equal subsets. In each iteration, K − 1 K-1 K − 1 folds train the model and the remaining fold validates it; performance is averaged across all K K K folds to select optimal hyperparameters (e.g., λ \lambda λ ).

Confusion Matrix & Classification Metrics

Actual \ Predicted Predicted Positive (1) Predicted Negative (0) Total

Actual Positive (1) True Positive (TP) False Negative (FN) (Type II Error) Actual Positives ( T P + F N TP + FN TP + FN )

Actual Negative (0) False Positive (FP) (Type I Error) True Negative (TN) Actual Negatives ( F P + T N FP + TN FP + TN )

Total Predicted Positives ( T P + F P TP + FP TP + FP ) Predicted Negatives ( F N + T N FN + TN FN + TN ) Total Observations ( N N N )

Key Metrics:

Accuracy : Overall fraction of correct predictions: Accuracy = T P + T N T P + T N + F P + F N \text{Accuracy} = \frac{TP + TN}{TP + TN + FP + FN} Accuracy = TP + TN + FP + FN TP + TN ​

Precision (Positive Predictive Value) : Fraction of positive predictions that are truly positive (crucial when False Positives are costly, e.g., trading signal execution): Precision = T P T P + F P \text{Precision} = \frac{TP}{TP + FP} Precision = TP + FP TP ​

Recall / Sensitivity (True Positive Rate - TPR) : Fraction of actual positives correctly identified (crucial when False Negatives are catastrophic, e.g., corporate default or fraud detection): Recall = T P T P + F N \text{Recall} = \frac{TP}{TP + FN} Recall = TP + FN TP ​

Specificity (True Negative Rate - TNR) : Fraction of actual negatives correctly identified: Specificity = T N T N + F P \text{Specificity} = \frac{TN}{TN + FP} Specificity = TN + FP TN ​

F1-Score : The harmonic mean of Precision and Recall, providing a balanced evaluation under class imbalance: F1-Score = 2 × Precision × Recall Precision + Recall = 2 × T P 2 × T P + F P + F N \text{F1-Score} = 2 \times \frac{\text{Precision} \times \text{Recall}}{\text{Precision} + \text{Recall}} = \frac{2 \times TP}{2 \times TP + FP + FN} F1-Score = 2 × Precision + Recall Precision × Recall ​ = 2 × TP + FP + FN 2 × TP ​

Receiver Operating Characteristic (ROC) & Area Under Curve (AUC) : Plots TPR (Recall) on the y-axis against FPR ( 1 − Specificity 1 - \text{Specificity} 1 − Specificity ) on the x-axis across all classification thresholds. An AUC = 0.50 \text{AUC} = 0.50 AUC = 0.50 represents random guessing, whereas AUC = 1.00 \text{AUC} = 1.00 AUC = 1.00 represents perfect discrimination.

  • 6. Big Data in Investment Analysis & NLP Pipelines
  • The 4 Vs of Big Data

Volume : Immense size of datasets (terabytes/petabytes).

Velocity : High speed of incoming real-time streaming data.

Variety : Heterogeneous formats (unstructured text, audio, images, structured logs).

Veracity : Quality, reliability, and noise level in underlying data.

Alternative Data Sources in Asset Management

Sensors & Satellite Imagery : Tracking supply chains, agricultural crop health, port congestion.

Consumer Data : Aggregated credit card transactions, web traffic, app download statistics.

Social Sentiment & Web Scraping : Real-time sentiment analysis from social media and consumer forums.

Natural Language Processing (NLP) Text Preparation Pipeline Raw Text ──► Cleansing & Normalization ──► Tokenization ──► Stop-Word Removal ──► Lemmatization/Stemming ──► Feature Matrix (BoW / TF-IDF)

Text Cleansing & Normalization : Stripping HTML tags, punctuation, special characters, and converting all text to lowercase.

Tokenization : Splitting continuous text into individual word or phrase tokens.

Stop-Word Removal : Removing ubiquitous non-informative words (e.g., "the", "and", "is", "at").

Stemming vs. Lemmatization :

Stemming : Fast, rule-based truncation of word endings (e.g., "investing", "invested", "investor" → \to → "invest"); may produce non-words.

Lemmatization : Dictionary-based morphological reduction to the true semantic root (e.g., "was", "is", "are" → \to → "be").

N N N -Grams : Grouping contiguous sequences of n n n words (e.g., bigrams "credit default", "cash flow") to preserve semantic context.

Feature Representation :

Bag-of-Words (BoW) : Counts raw term occurrences across documents (Document-Term Matrix).

TF-IDF (Term Frequency-Inverse Document Frequency) : Weights term t t t in document d d d relative to corpus frequency: TF-IDF t , d = TF t , d × ln ⁡ ( N DF t ) \text{TF-IDF}_{t,d} = \text{TF}_{t,d} \times \ln\left(\frac{N}{\text{DF}_t}\right) TF-IDF t , d ​ = TF t , d ​ × ln ( DF t ​ N ​ ) Where N N N is total documents and DF t \text{DF}_t DF t ​ is the number of documents containing term t t t . Terms appearing frequently in a specific document but rarely across the entire corpus receive the highest weights.