Skip to content
tezvyn:
Menu

🤖AI & ML

Artificial intelligence, machine learning, and data science

1167 bites

Test yourself: Top 30 AI & ML interview questions →Multiple choice, with the correct answer and why it is correct on every question. Free, no sign-in.

Everything in AI & ML, page 13

advanced2 min read

Pure ViT vs hybrid CNN-Transformer for medical segmentation

Pure ViT captures global context but is data hungry and weak on local detail; hybrid CNN-Transformer gets local features cheaply plus global attention, ideal for scarce…

advanced2 min read

Core principles of a Neural Radiance Field

An MLP maps a 3D point plus view direction to color and density; novel views render by casting rays, sampling points, querying the MLP, and volume-integrating along each ray.

intermediate2 min read

Why ViTs need positional embeddings

Self-attention is permutation invariant so patch order is lost; positional embeddings restore spatial location. CNNs encode position implicitly via the fixed convolution grid.

intermediate1 min read

Cross-attention for visual question answering

In cross-attention queries come from one modality and keys/values from the other, e.g. text queries attend over image features so the question selects relevant regions.

intermediate2 min read

How Swin Transformer achieves linear attention

Swin computes attention within local non-overlapping windows of fixed size, making cost linear in patches, then shifts windows between layers so information crosses boundaries.

intermediate1 min read

Inductive biases of ViT versus CNN

CNNs bake in locality and translation equivariance; a plain ViT has almost none beyond patch structure, so it must learn spatial relations from data, needing large datasets or strong pretraining.

easy1 min read

Self-attention over image patches explained

Each patch projects to query, key, value; a patch's query is scored against all keys, softmax-normalized into weights, used to combine all values.

easy2 min read

How ViT and CNN process an image differently

A CNN slides local filters over the raw pixel grid; a ViT splits the image into patches, flattens and linearly embeds each into a token, adds positional embeddings, and feeds the sequence to…

advanced2 min read

Scene flow versus optical flow

Optical flow is 2D pixel motion in the image plane; scene flow is the 3D motion field of points in space, needing depth via stereo, RGB-D, or LiDAR.

advanced2 min read

Self-supervised pretraining for video understanding

Define a label-free task like temporal order prediction or contrastive clip matching that forces temporal reasoning, then fine-tune on labeled action data.

intermediate1 min read

Re-identification in multi-object tracking

Re-ID matches an object to its prior id using appearance embeddings, not just position; store track features and match re-entering detections by embedding similarity.

intermediate1 min read

3D CNNs vs two-stream action recognition

3D CNNs learn spatiotemporal filters end to end but are heavy; two-stream splits RGB appearance and precomputed optical flow, strong but costly to compute flow.

intermediate1 min read

Kalman filter for bounding-box tracking

State, transition, measurement models, and process plus measurement noise; predict then correct each frame. State holds box position and velocity; measurement is the detected box.

intermediate1 min read

Brightness constancy and small-motion assumptions

Brightness constancy says a point's intensity is invariant under motion; small motion lets you linearize via Taylor expansion.

easy1 min read

Design a tracking-by-detection tracker

Detect per frame, then associate boxes across frames by IoU or appearance using Hungarian matching, maintaining track ids.

easy1 min read

Sparse vs dense optical flow and Lucas-Kanade

Sparse flow tracks selected feature points, dense flow computes a vector per pixel; Lucas-Kanade solves brightness constancy in a local window assuming constant motion.

advanced1 min read

Adapting ViT for dense semantic segmentation

Reassemble patch tokens into a 2D feature map, add a decoder, and handle low resolution plus quadratic attention cost.

advanced1 min read

Explain panoptic segmentation and Panoptic Quality

Panoptic assigns every pixel a class and instance id over things and stuff; PQ factors into SQ, average IoU of matches, times RQ, an F1 over matched segments.

intermediate1 min read

How to improve coarse segmentation boundaries?

Skip connections and higher-resolution features, boundary-aware losses, and point-based or CRF refinement.

intermediate1 min read

How does Mask R-CNN do instance segmentation?

Faster R-CNN backbone plus RPN, then RoIAlign and a parallel mask head predicting per-class binary masks.

We are hiring for this. Every open role lists the topics its interview covers, so you can prepare for the real thing rather than guessing.

See open roles