1,000+ quant interview questions for Jane Street, Citadel, Two Sigma, DE Shaw, and other top quantitative finance firms.
Statistical analysis and quantitative modeling problems
Trading MCQs, probability brainteasers, and market scenarios
Practice quant interview questions on MyntBit - the all-in-one quant learning platform. Free questions available for C++ coding, Python problems, probability brainteasers, and trading MCQs.
Difficulty: Hard
Category: Linear Algebra & Machine Learning
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: linear-algebra, singular-value-decomposition, low-rank-approximation, frobenius-norm, factor-model
You are building a factor model to predict stock returns. You have a large matrix $A$ representing the historical returns of $n$ stocks over $m$ days. You want to reduce the dimensionality of this data by finding a rank-$k$ approximation $A_k$ of $A$ that minimizes the Frobenius norm of the difference between $A$ and $A_k$. Which of the following methods guarantees finding the optimal $A_k$?
Practice this hard trader interview question on Myntbit - the all-in-one quant learning platform with 1000+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.