🌍 Artificial Intelligence · subject
Artificial Intelligence Perception, Communication, and Ethics Syllabus
The Perception, Communication, and Ethics syllabus for Artificial Intelligence in full: 4 chapters and 16 topics, every one listed below, plus 50 Perception, Communication, and Ethics flashcards with answers.
Perception, Communication, and Ethics syllabus: all 4 chapters
Expand any chapter to see its topics and sub-topics.
-
Natural Language Processing
4 topics- Language Models
- Text Classification and Information Retrieval
- Parsing and Syntactic Analysis
- Machine Translation and Large Language Models
-
Computer Vision
4 topics- Image Formation and Preprocessing
- Feature Detection
- Object Recognition and Detection
- Image Segmentation and Scene Understanding
-
Robotics
4 topics- Robot Hardware and Sensors
- Robotic Perception and Localization
- Motion Planning
- Robotic Control and Manipulation
-
Philosophy, Ethics, and Safety of AI
4 topics- Weak and Strong AI
- Ethics of AI
- AI Safety and Alignment
- The Future of AI
Artificial Intelligence Perception, Communication, and Ethics flashcards — 50 questions with answers
In an $n$-gram language model, what does the Markov assumption state about the probability of the next word?
It assumes the probability of a word depends only on the previous $n-1$ words, so $P(w_i \mid w_1,\dots,w_{i-1}) \approx P(w_i \mid w_{i-n+1},\dots,w_{i-1})$.
Define perplexity as an intrinsic evaluation metric for language models.
Perplexity is the inverse probability of a test set normalized by the number of words: $PP(W) = P(w_1,\dots,w_N)^{-\frac{1}{N}} = \sqrt[N]{\frac{1}{\prod_{i=1}^{N} P(w_i \mid w_1,\dots,w_{i-1})}}$. Lower perplexity indicates a better model.
Why is smoothing (e.g., Laplace/add-one) needed in n-gram language models?
To assign non-zero probability to unseen n-grams, avoiding zero probabilities that would make the whole sequence probability zero. Add-one smoothing: $P(w_i \mid w_{i-1}) = \frac{C(w_{i-1}, w_i) + 1}{C(w_{i-1}) + V}$, where $V$ is the vocabulary size.
In text classification, state the Naive Bayes decision rule and its core independence assumption.
Choose the class $\hat{c} = \arg\max_{c} P(c) \prod_{i} P(w_i \mid c)$. It assumes features (words) are conditionally independent given the class.
Define term frequency-inverse document frequency (TF-IDF) and give its formula.
TF-IDF weights a term by how often it appears in a document versus how rare it is across the corpus: $\text{tfidf}(t,d) = \text{tf}(t,d) \times \log\frac{N}{\text{df}(t)}$, where $N$ is the number of documents and $\text{df}(t)$ is the number containing term $t$.
In information retrieval, define precision and recall.
Precision $= \frac{\text{relevant retrieved}}{\text{total retrieved}}$ (fraction of retrieved documents that are relevant); Recall $= \frac{\text{relevant retrieved}}{\text{total relevant}}$ (fraction of all relevant documents that were retrieved).
Give the formula for the F1 score used to evaluate a classifier or IR system.
$F_1 = 2 \cdot \frac{\text{precision} \cdot \text{recall}}{\text{precision} + \text{recall}}$, the harmonic mean of precision and recall.
In the vector space model of IR, how is similarity between a query and a document typically measured?
By cosine similarity: $\cos(\theta) = \frac{\vec{q} \cdot \vec{d}}{\lVert \vec{q} \rVert \, \lVert \vec{d} \rVert}$, the cosine of the angle between the query and document TF-IDF vectors.
Distinguish constituency parsing from dependency parsing.
Constituency (phrase-structure) parsing groups words into nested phrases (NP, VP) via a context-free grammar; dependency parsing represents syntax as directed head-dependent relations between individual words, producing a dependency tree.
What algorithm is classically used for parsing with a context-free grammar in Chomsky Normal Form, and what is its time complexity?
The CYK (Cocke-Younger-Kasami) algorithm, a bottom-up dynamic-programming parser with time complexity $O(n^{3} \cdot |G|)$ for a sentence of length $n$.
What is a Probabilistic Context-Free Grammar (PCFG) and how is the probability of a parse tree computed?
A PCFG assigns each production rule a probability, with rules for the same left-hand side summing to 1. The probability of a parse tree is the product of the probabilities of all rules used to build it.
In dependency grammar, what does it mean for a parse to be 'projective'?
A dependency parse is projective if no dependency edges cross when drawn above the sentence in linear order; equivalently, each head and its descendants form a contiguous span.
In the Transformer architecture, give the scaled dot-product attention formula.
$\text{Attention}(Q,K,V) = \text{softmax}\!\left(\frac{Q K^{\top}}{\sqrt{d_k}}\right) V$, where $Q$, $K$, $V$ are the query, key, and value matrices and $d_k$ is the key dimension.
What is the purpose of the $\sqrt{d_k}$ scaling factor in Transformer attention?
It counteracts the growth of dot-product magnitudes as dimension $d_k$ increases, preventing the softmax from entering regions with extremely small gradients.
What is the BLEU score and what does it measure in machine translation?
BLEU (Bilingual Evaluation Understudy) measures translation quality by modified n-gram precision against reference translations, combined with a brevity penalty; scores range from 0 to 1 (often reported 0-100), higher being better.
Contrast encoder-only, decoder-only, and encoder-decoder Transformer architectures with an example of each.
Encoder-only (e.g., BERT) produces bidirectional representations for understanding tasks; decoder-only (e.g., GPT) does autoregressive generation with causal masking; encoder-decoder (e.g., T5, original Transformer) maps an input sequence to an output sequence, ideal for translation.
What distinguishes 'in-context learning' (few-shot prompting) in large language models from fine-tuning?
In-context learning conditions the model on examples within the prompt at inference time without updating weights; fine-tuning updates the model's parameters through additional training on task data.
State the thin-lens equation used in image formation.
$\frac{1}{f} = \frac{1}{v} + \frac{1}{u}$, where $f$ is the focal length, $u$ the object distance, and $v$ the image distance from the lens.
In the pinhole camera model, how does a 3D point project onto the image plane?
Perspective projection: a 3D point $(X, Y, Z)$ maps to image coordinates $x = f\frac{X}{Z}$, $y = f\frac{Y}{Z}$, where $f$ is the focal length. Objects farther away (larger $Z$) appear smaller.
What is a Gaussian filter used for in image preprocessing, and what does its standard deviation $\sigma$ control?
It smooths/blurs an image to reduce noise by convolving with a Gaussian kernel $G(x,y) = \frac{1}{2\pi\sigma^{2}} e^{-\frac{x^{2}+y^{2}}{2\sigma^{2}}}$. Larger $\sigma$ produces stronger blurring over a wider neighborhood.
Show the other 30 Perception, Communication, and Ethics flashcards
What is histogram equalization and what problem does it address?
An image-enhancement technique that redistributes pixel intensities to produce a more uniform histogram, improving global contrast in images that are too dark, too bright, or low-contrast.
What quantity does the Sobel operator compute, and how is gradient magnitude obtained?
The Sobel operator estimates the image intensity gradient using two $3\times3$ kernels for horizontal ($G_x$) and vertical ($G_y$) derivatives; the edge magnitude is $G = \sqrt{G_x^{2} + G_y^{2}}$ and direction is $\theta = \arctan\!\left(\frac{G_y}{G_x}\right)$.
List the main stages of the Canny edge detector.
1) Gaussian smoothing, 2) gradient computation (magnitude and direction), 3) non-maximum suppression to thin edges, 4) double thresholding, and 5) edge tracking by hysteresis to link edges.
What does the Harris corner detector respond to, and what image property defines a corner?
It detects corners as points where intensity changes significantly in all directions. Using the structure tensor's eigenvalues $\lambda_1, \lambda_2$, a corner has both large; the response is $R = \det(M) - k(\text{trace}\,M)^{2}$.
What key invariance property does the SIFT feature descriptor provide?
SIFT (Scale-Invariant Feature Transform) produces keypoint descriptors that are invariant to scale and rotation and robust to changes in illumination and viewpoint, enabling reliable feature matching.
Distinguish image classification, object detection, and instance segmentation.
Classification assigns one label to the whole image; object detection outputs bounding boxes plus labels for multiple objects; instance segmentation outputs a pixel-level mask for each individual object instance.
What is Intersection over Union (IoU) and how is it used in object detection?
$\text{IoU} = \frac{\text{area of overlap}}{\text{area of union}}$ between a predicted and a ground-truth bounding box. A detection is usually counted as correct if IoU exceeds a threshold (commonly $0.5$).
What problem does Non-Maximum Suppression (NMS) solve in object detectors?
It removes redundant overlapping bounding boxes for the same object by keeping the highest-confidence box and suppressing others whose IoU with it exceeds a threshold.
Contrast two-stage detectors (e.g., Faster R-CNN) with one-stage detectors (e.g., YOLO).
Two-stage detectors first propose candidate regions then classify/refine them, giving high accuracy; one-stage detectors predict boxes and classes directly in a single pass over a grid, giving faster, often real-time, inference.
Distinguish semantic segmentation from instance segmentation.
Semantic segmentation labels every pixel with a class but does not separate individual objects of the same class; instance segmentation additionally distinguishes separate object instances (each car gets its own mask).
What is the role of the encoder-decoder (e.g., U-Net) structure in image segmentation?
The encoder progressively downsamples to capture context/semantic features; the decoder upsamples to recover spatial resolution, with skip connections passing fine-grained details from encoder to decoder for precise pixel-level masks.
What is the Otsu method used for in image segmentation?
Otsu's method automatically selects a global threshold for binarization by choosing the value that maximizes between-class variance (equivalently minimizes intra-class variance) of the pixel intensity histogram.
Distinguish proprioceptive from exteroceptive sensors on a robot, with examples.
Proprioceptive sensors measure the robot's internal state (e.g., encoders, IMU/gyroscope, motor current); exteroceptive sensors measure the external environment (e.g., cameras, LIDAR, sonar, GPS).
How does a LIDAR sensor measure distance?
By time-of-flight: it emits laser pulses and measures the round-trip time $t$; distance $d = \frac{c\,t}{2}$, where $c$ is the speed of light. Scanning yields a point cloud of the environment.
Define a robot's degrees of freedom (DOF).
The number of independent parameters (joint variables) needed to fully specify the configuration of the robot. A manipulator with $n$ independently actuated joints has $n$ degrees of freedom.
What is the difference between forward and inverse kinematics for a robot arm?
Forward kinematics computes the end-effector pose from given joint angles (unique solution); inverse kinematics computes the joint angles required to achieve a desired end-effector pose (may have multiple, one, or no solutions).
What problem does SLAM solve in robotics?
Simultaneous Localization and Mapping: a robot builds a map of an unknown environment while simultaneously estimating its own pose within that map, using sensor and motion data.
State the two-step cycle of a Kalman filter used in robot localization.
Prediction: propagate the state estimate and covariance forward using the motion model; Update (correction): incorporate a new measurement to refine the estimate, weighting by the Kalman gain $K = \frac{P H^{\top}}{H P H^{\top} + R}$.
How does a particle filter (Monte Carlo Localization) represent the robot's belief?
As a set of weighted samples (particles), each a hypothesis of the robot's pose. Particles are propagated by the motion model, reweighted by sensor likelihood, and resampled in proportion to their weights.
Compare grid-based (A*) motion planning with sampling-based (RRT) planning.
A* searches a discretized grid/graph for an optimal path using cost-plus-heuristic $f(n)=g(n)+h(n)$, complete and optimal but scales poorly in high dimensions; RRT randomly samples the continuous configuration space to grow a tree, efficient in high-DOF spaces but only probabilistically complete and not optimal (RRT* is asymptotically optimal).
What is the configuration space (C-space) in motion planning?
The space of all possible robot configurations. Planning finds a collision-free path in the free portion $C_{free}$; obstacles in the workspace are expanded into C-space obstacles, and the robot is treated as a point in C-space.
In A* search, what condition must the heuristic satisfy to guarantee an optimal path?
The heuristic must be admissible: it never overestimates the true cost to the goal, i.e., $h(n) \leq h^{*}(n)$ for all nodes $n$. (Consistency additionally guarantees efficiency.)
Distinguish open-loop from closed-loop (feedback) control in robotics.
Open-loop control sends commands without using sensor feedback, so it cannot correct disturbances; closed-loop control measures the output and uses the error between desired and actual state to adjust commands.
Write the PID control law and name what each term addresses.
$u(t) = K_p e(t) + K_i \int_{0}^{t} e(\tau)\,d\tau + K_d \frac{de(t)}{dt}$. Proportional reacts to present error, Integral eliminates steady-state error from accumulated past error, Derivative dampens by anticipating future error.
What is compliance (or force/impedance) control and why is it important in manipulation?
It regulates the interaction force between the manipulator and its environment rather than pure position, allowing the robot to comply with contact. This is essential for tasks like grasping, insertion, and assembly to avoid damage and handle uncertainty.
Distinguish weak (narrow) AI from strong (general) AI.
Weak/narrow AI performs specific tasks and only simulates intelligence within a limited domain; strong AI (AGI) would possess genuine, general, human-level understanding and consciousness across arbitrary tasks. Essentially all deployed systems today are narrow AI.
What is Searle's Chinese Room argument meant to demonstrate?
It argues that a system manipulating symbols by rules (as a program does) can produce correct outputs without any genuine understanding, challenging strong AI's claim that the right program constitutes a mind (syntax is not sufficient for semantics).
What does the Turing Test assess, and what is a key criticism of it?
It assesses whether a machine's conversational behavior is indistinguishable from a human's to an interrogator (behavioral test of intelligence). A key criticism is that it measures imitation of behavior, not genuine understanding or consciousness.
Define algorithmic bias in AI and give a common source.
Algorithmic bias is systematic, unfair discrimination in a model's outputs against certain groups. A common source is biased or unrepresentative training data that reflects historical or societal prejudices, which the model then learns and amplifies.
What is the value alignment problem in AI safety?
The challenge of ensuring an AI system's objectives and behavior remain aligned with human values and intentions, so that a capable system pursues what we actually want rather than a misspecified proxy goal.
Artificial Intelligence Perception, Communication, and Ethics FAQ
What is in the Artificial Intelligence Perception, Communication, and Ethics syllabus?
Artificial Intelligence Perception, Communication, and Ethics is split into 4 chapters: Natural Language Processing, Computer Vision, Robotics and Philosophy, Ethics, and Safety of AI. Together they contain 16 topics.
How many chapters are in Artificial Intelligence Perception, Communication, and Ethics?
4 chapters, containing 16 topics. The largest chapter is Natural Language Processing, with 4 topics.
Are there flashcards for Artificial Intelligence Perception, Communication, and Ethics?
Yes — a 50-card Perception, Communication, and Ethics deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.