← Back to Directory

Tubi

Mid-sized

Screna has 2 Tubi interview write-ups. The most reported round is the technical phone screen (2).

2 interview notes · updated Jun 2026

Tubi·Machine Learning Engineer·Technical Phone Screen

May 2026
ML breadth interview at Tubitv covering a pretty wide range of fundamentals, from overfitting remedies to transformer internals, plus a deep dive into a real recommender system I'd built. Felt like a mix of theory check and applied engineering, which I wasn't fully expecting.
  • What causes overfitting, how do you detect it, and what are the main ways to fix it?
  • Walk me through bagging versus boosting and when you'd choose one over the other in terms of bias and variance.
  • Explain the assumptions behind linear regression and compare the closed-form solution to gradient descent. How do Ridge, Lasso, and Elastic Net differ?
  • How does logistic regression work, including the link function, the loss, how you extend it to multiclass, and how calibration fits in?
  • Describe how transformers work: self-attention, multi-head attention, positional encoding, and the difference between encoder and decoder architectures.
  • Compare SGD and Adam as optimizers. What are the trade-offs and when does each tend to work better?
  • How do you approach hyperparameter tuning in practice? Compare grid search, random search, and Bayesian optimization, and how do learning rate schedules factor in?
  • Walk through a recommender system you've built end to end: candidate generation, ranking, features used, how you handled training-serving skew, and how you evaluated it both offline and online.

“Pretty standard opener but I over-explained the detection part and ran long before getting to remedies.”

View Post

Tubi·Machine Learning Engineer·Technical Phone Screen

Apr 2026
Tubitv ML engineer interview was pretty deep on the unsupervised learning side. The main coding problem was K-Means from scratch, then they pushed into GMM territory which I was not fully prepared for.
  • Implement K-Means clustering from scratch given an N x D matrix of points and an integer k. Include centroid initialization, the assignment and update loop, a stopping condition, and tests that verify convergence behavior.
  • Extend your K-Means implementation to a Gaussian Mixture Model using the EM algorithm. Walk through the E-step and M-step, and explain how GMM fundamentally differs from K-Means.

“I started with random initialization and got it working, but spent too long on the convergence check.”

View Post