Compute type hierarchy embeddings
CRS-1 Order: #1 Data Preparation
Updated 4 months ago
Guidance
For each variable, collect the full set of its supertypes (type lattice τ(v)). Learn an embedding r(τ) for each known type; use "UNKTYPE" for unseen types. Compute the variable's type representation as the element-wise maximum over {r(τ) : τ ∈ τ(v)}. During training, randomly sample a non-empty subset of τ*(v) as regularization.
Details
- Order:
- #1
- Phase:
- Created:
- May 20, 2026
- Last Updated:
- May 20, 2026
Workflow
Compute Node Representations
Compute initial node state vectors by combining subtoken embeddings of identifier names with type hierarchy embeddings, producing graph-ready node features.
View WorkflowAssigned Agent
No agent assigned
Required Skills
No skills linked
Rules
No rules linked.
Input Artifacts
No input artifacts
Output Artifacts
No output artifacts