审片室：能预览、能改词、能重生成单镜的人机协作后台

面试题库

• 一条自动化流水线要插入人工审核，你会把卡点放在哪几步？为什么？Where would you place human review checkpoints in an automated pipeline, and why there?

  国内高频海外高频基础#human-in-the-loop#pipeline-design#cost

  分析过程 · 先想清楚再作答

  1. 这题在考你有没有成本意识。答「每一步都让人看一眼」是没做过工程的回答——人是最贵的资源，卡点多了流水线就退化成手工作坊。
  2. 给一条可复用的判据：**卡点放在「下游最贵的那一步」之前**。判断某个位置该不该设卡，只问一句「如果这里错了，往后要白花多少钱」。
  3. 按这条判据落到生成式流水线上，会得到三个位置：剧本定稿之后（此时零成本，却决定了后面所有素材的方向）、首帧出来之后视频生成之前（首帧是最便宜的一档，视频是最贵的一档，同一个镜头差出一到两个数量级）、成片合成之后发布之前（这一道拦的不是质量而是合规风险）。
  4. 补一条生产视角：卡点不等于阻塞。第一和第二道可以做成「默认放行、超时自动继续」，只有第三道必须硬卡——合规问题不能靠超时放行。
  5. 结论里要点出一个反直觉的事实：最容易被跳过的恰恰是第一道，因为这时候还没有画面，看起来没什么可审的；但它是唯一一道改起来零成本的闸门。
  6. 可预期的追问是「人来不及审怎么办」。答案是分级：机器先打分，只把低分的推给人，人的时间花在机器拿不准的那部分上。

  How to reason about it · think before answering

  1. This one tests cost awareness. Saying a human should look at every step marks someone who has not run this in production: humans are the expensive resource, and too many gates turn a pipeline back into handwork.
  2. Offer a reusable rule: put the gate immediately before the most expensive downstream step. To decide whether a position deserves a gate, ask how much money is wasted if something is wrong here.
  3. Applied to a generative pipeline that yields three positions: after the script is locked (free to change, yet it steers every asset that follows), after the first frame but before video generation (the frame is the cheapest step and the clip is the most expensive, one to two orders of magnitude apart), and after the final cut but before publishing (this one gates risk, not quality).
  4. Add the production view: a checkpoint is not necessarily blocking. The first two can auto-continue on timeout; only the compliance gate must hard-block, because you cannot let a legal check pass by timing out.
  5. State the counterintuitive part: the first gate is the one people skip, because there are no visuals yet and it looks like there is nothing to review, while it is the only gate where changes cost nothing.
  6. Expected follow-up: what if reviewers cannot keep up. Tier it. Machines score everything, humans only see the low scores, and human attention goes where the machine is unsure.

  答题要点

  • 判据是「卡点放在下游最贵的那一步之前」，问的是这里错了往后白花多少钱。
  • 三个位置：剧本定稿后、首帧出来后视频生成前、成片合成后发布前。
  • 首帧那一道性价比最高：首帧是最便宜的一档，视频是最贵的一档，同一个镜头差出一到两个数量级。
  • 前两道可以默认放行加超时继续，只有合规那一道必须硬卡。
  • 人力不够就分级：机器先打分，人只看低分的那些。

  Key points

  • Rule: place the gate right before the most expensive downstream step, judged by wasted spend if this step is wrong.
  • Three positions: after script lock, after first frame and before video, after final cut and before publish.
  • The first-frame gate pays best: the frame is the cheapest step and the clip the most expensive, one to two orders of magnitude apart.
  • The first two gates can auto-continue on timeout; only the compliance gate hard-blocks.
  • When reviewers are the bottleneck, tier it: machines score everything, humans only see low scores.
• 用户改了中间一步的输入，怎么算出哪些下游需要重做？A user edits an intermediate input. How do you compute which downstream steps must rerun?

  国内高频海外高频进阶#dag#incremental-recompute#cost

  分析过程 · 先想清楚再作答

  1. 这题的区分度在方向和收尾两处，很多人只答出中间那段「沿依赖图传播」，前后都丢了。
  2. 方向：从被改的节点**沿着「谁依赖我」正向传播**，不是往上游找依赖。写反的后果很隐蔽——上游会被一起重跑，结果是对的，钱多花了一倍，测试也发现不了。
  3. 落到实现：把种子节点放进集合，反复扫一遍图，只要某个节点的依赖里有一个已经在集合里就把它也加进来，跑到不动点为止；最后按拓扑序返回，调用方顺着数组跑就不会先跑下游后跑上游。
  4. 收尾这一步最容易漏：**没受影响的节点，产物要从上一版复制过来，不是重新生成**。半径算得再准，少了复制这一步就一分钱没省。
  5. 然后是怎么验证。不要比文件哈希——同样的输入很可能生成逐字节相同的结果，哈希相同证明不了没重跑。要数**接口调用次数**，这才是硬证据，而且在离线与真实两种模式下都成立。
  6. 可预期的追问是「输入没变但你想重跑怎么办」。留一个强制重跑的开关，并且把它和自动判定分开记账，否则你会分不清一次重跑是系统判的还是人手动点的。

  How to reason about it · think before answering

  1. The signal lives at the two ends. Most candidates produce the middle part, propagation over a dependency graph, and drop both the direction and the finish.
  2. Direction: propagate forward along who-depends-on-me from the edited node, not backward to its dependencies. Getting it backward is insidious, because upstream nodes rerun, the output is still correct, the bill doubles, and no test catches it.
  3. Implementation: seed a set, sweep the graph repeatedly adding any node with a dependency already in the set until it stops growing, then return in topological order so the caller can just walk the array.
  4. The finish is what people forget: unaffected nodes must have their artifacts copied from the previous version, not regenerated. A perfect radius saves nothing without that copy.
  5. Then verification. Do not compare file hashes, because identical inputs often produce byte-identical output and a matching hash proves nothing. Count API calls instead; that evidence holds both offline and against a real vendor.
  6. Expected follow-up: what about forcing a rerun when nothing changed. Keep an explicit force flag and account for it separately, or you lose the ability to tell system-decided reruns from human-triggered ones.

  答题要点

  • 从被改的节点沿着「谁依赖我」正向传播，不是反向找依赖。
  • 扫图到不动点，结果按拓扑序返回，保证执行顺序不会颠倒。
  • 没受影响的节点要从上一版复制产物，否则半径算得再准也没省钱。
  • 验证要数接口调用次数，不要比文件哈希——同样的输入可能产出逐字节相同的结果。
  • 另留一个强制重跑开关，并与自动判定分开记账。

  Key points

  • Propagate forward along who-depends-on-me from the edited node, never backward.
  • Sweep to a fixed point and return in topological order so execution never runs downstream first.
  • Copy artifacts for unaffected nodes from the previous version, or the computed radius saves nothing.
  • Verify by counting API calls, not by comparing file hashes, since identical inputs can produce byte-identical output.
  • Keep a separate force-rerun switch and account for it apart from automatic decisions.
• 版本回滚要存什么？只存最终产物够不够？What must a version record hold for rollback? Are the final artifacts enough?

  国内高频海外高频进阶#versioning#rollback#data-modeling

  分析过程 · 先想清楚再作答

  1. 题眼在「够不够」三个字，它在提示答案是否定的。先把问题重述成一句判断：**版本不是备份**，这句话说出来这题就答对了一半。
  2. 两者的语义不一样。备份是「出事了拿回来」，只需要保留最近一份好状态；版本是「两个都在」，要能并排对比、来回切换，最终选哪个由人定。审核场景要的是后者。
  3. 所以每个版本要存三类东西：产物本身（按版本分目录，一个文件都不删）、产生它的输入（那一版的台词与画面描述，否则三天后没人说得清两版差在哪）、以及这一版重跑了哪些节点与原因。
  4. 当前版本要设计成一个指针，不是一份拷贝。回滚就是把指针挪回去，不搬文件，因此是瞬时且可逆的；这也让「再切回新版本」变成理所当然的操作。
  5. 有一个连带影响必须提到，提了就说明你真做过：**回滚一镜会改变整集的时间轴**。新版配音比旧版长一秒，切回去之后后面所有镜头的起止时间都要重排。所以回滚之后要重算一次时间轴，好在这是纯本地计算，很便宜。
  6. 可预期的追问是「版本存多久」。按产物体积和业务价值定：小文本无限存，视频这种大件设一个保留期，过期只留元数据和输入，需要时可以按同样的输入重跑出来。

  How to reason about it · think before answering

  1. The hinge is are they enough, which signals the answer is no. Restate it as a claim: a version is not a backup. Saying that sentence gets you half the credit.
  2. The semantics differ. A backup means restore after an incident and only needs the latest good state. A version means both exist, side by side, switchable, with a human choosing. Review workflows need the latter.
  3. So each version stores three things: the artifacts themselves, kept in per-version directories with nothing deleted; the inputs that produced them, the line and the visual description, or nobody can explain the difference three days later; and which nodes reran plus why.
  4. The current version should be a pointer, not a copy. Rollback moves the pointer without touching files, which makes it instant and reversible, and makes switching forward again equally natural.
  5. Mention the knock-on effect, because it shows you have actually shipped this: rolling back one shot changes the whole episode timeline. If the new take of the voice is a second longer, every later shot shifts, so rollback must recompute the timeline. That part is cheap local computation.
  6. Expected follow-up: how long to keep versions. Scale it by artifact size and business value: keep small text forever, put a retention window on video, and after expiry keep only metadata and inputs so the artifact can be regenerated on demand.

  答题要点

  • 版本不是备份：备份只要最近一份好状态，版本要求新旧同时存在、能并排对比。
  • 每版要存三类：产物（按版本分目录、不删）、产生它的输入、重跑的节点与原因。
  • 当前版本是指针不是拷贝，回滚只挪指针，瞬时且可逆。
  • 回滚一镜会改变整集时间轴，回滚后要重算一次——这是纯本地计算，很便宜。
  • 保留策略按体积分级：文本长期留，大视频设保留期，过期只留元数据与输入以便按需重跑。

  Key points

  • A version is not a backup: backups keep the latest good state, versions keep old and new side by side.
  • Store three things per version: artifacts in per-version directories, the inputs that produced them, and which nodes reran and why.
  • Make the current version a pointer, not a copy, so rollback is instant and reversible.
  • Rolling back one shot shifts the episode timeline, so recompute it after rollback; it is cheap local work.
  • Set retention by size: keep text forever, expire large video and retain metadata plus inputs for regeneration.

评论

登录后即可参与讨论

还没有评论，来说第一句。