skills/equivariant-architecture-designer/SKILL.md
Designs neural network architectures that respect validated symmetry groups, recommending architecture families (G-CNN, steerable CNN, e3nn), layer patterns, and implementation libraries. Use when you have validated symmetry groups and need equivariant architecture design, or when user mentions equivariant layers, G-CNN, e3nn, steerable networks, or building symmetry into a model.
npx skillsauth add lyndonkl/claude equivariant-architecture-designerInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
Copy this checklist and track your progress:
Architecture Design Progress:
- [ ] Step 1: Review group specification and requirements
- [ ] Step 2: Select architecture family
- [ ] Step 3: Choose specific layers and components
- [ ] Step 4: Design network topology
- [ ] Step 5: Select implementation library
- [ ] Step 6: Create architecture specification
Step 1: Review group specification and requirements
Gather the validated group specification. Confirm: which group(s) are involved, whether invariance or equivariance is needed, the data domain (images, point clouds, graphs, etc.), task type (classification, regression, generation), and any computational constraints. If group isn't specified, work with user to identify it first.
Step 2: Select architecture family
Match the symmetry group to an architecture family using Architecture Selection Guide. Key families: G-CNNs for discrete groups on grids, Steerable CNNs for continuous 2D groups, e3nn/NequIP for E(3) on point data, GNNs for permutation on graphs, DeepSets for permutation on sets. Consider trade-offs between expressiveness and efficiency.
Step 3: Choose specific layers and components
Select layer types based on Layer Patterns. For each layer decide: convolution type (regular, group, steerable), nonlinearity (must preserve equivariance - use gated, norm-based, or tensor product), normalization (batch norm breaks equivariance - use layer norm or equivariant batch norm), pooling (for invariant outputs: use invariant pooling; for equivariant: preserve structure). For detailed design methodology, see Methodology Details.
Step 4: Design network topology
Design the overall network structure: encoder architecture (how features are extracted), feature representations at each stage (irreps for Lie groups), pooling/aggregation strategy, output head matching task requirements. Use Topology Patterns for common designs. Balance depth vs. width for your group size.
Step 5: Select implementation library
Choose library based on Library Reference. Match to your group, framework preference (PyTorch/JAX), and performance needs. Popular choices: e3nn (E(3)/O(3), PyTorch), escnn (discrete groups, PyTorch), pytorch_geometric (permutation, PyTorch). Ensure library supports your specific group.
Step 6: Create architecture specification
Document the design using Output Template. Include: layer-by-layer specification, representation types, library dependencies, expected parameter count, and pseudo-code or actual code skeleton. This specification guides implementation and subsequent equivariance verification. For ready-to-use implementation templates, see Code Templates. Quality criteria for this output are defined in Quality Rubric.
| Group | Domain | Recommended Architecture | Library | |-------|--------|-------------------------|---------| | Cₙ, Dₙ | 2D Images | G-CNN, Group Equivariant CNN | escnn, e2cnn | | SO(2), O(2) | 2D Images | Steerable CNN, Harmonic Networks | escnn | | SO(3) | Spherical | Spherical CNN | e3nn, s2cnn | | SE(3), E(3) | Point clouds | Equivariant GNN, Tensor Field Networks | e3nn, NequIP | | Sₙ | Sets | DeepSets | pytorch, jax | | Sₙ | Graphs | Message Passing GNN | pytorch_geometric | | E(3) × Sₙ | Molecules | E(3) Equivariant GNN | e3nn, SchNet |
| Task | Output Type | Key Consideration | |------|-------------|-------------------| | Classification | Invariant scalar | Use invariant pooling | | Regression (scalar) | Invariant scalar | Same as classification | | Segmentation | Equivariant per-point | Preserve equivariance to output | | Force prediction | Equivariant vector | Output as l=1 irrep | | Pose estimation | Equivariant transform | Output rotation + translation | | Generation | Equivariant structure | Equivariant decoder |
Standard G-Convolution:
(f ⋆ ψ)(g) = ∫_G f(h) ψ(g⁻¹h) dh
Steerable Convolution:
e3nn Tensor Product Layer:
# Combine features with different angular momenta
tp = o3.FullyConnectedTensorProduct(
irreps_in1, irreps_in2, irreps_out
)
output = tp(input1, input2)
Problem: Standard nonlinearities (ReLU, etc.) break equivariance.
Solutions:
| Type | How It Works | When to Use | |------|--------------|-------------| | Norm-based | Apply nonlinearity to ||x|| | Scalars, invariant features | | Gated | Use invariant to gate equivariant | General purpose | | Tensor product | Nonlinearity via Clebsch-Gordan | e3nn, high-quality | | Invariant features | Only apply to l=0 components | Simple, fast |
Batch Norm: Breaks equivariance (different stats per orientation) Solutions:
To get invariant output from equivariant features:
| Method | Formula | When to Use | |--------|---------|-------------| | Mean pooling | mean over group | Continuous groups | | Sum pooling | sum over elements | Sets, graphs | | Max pooling | max ||x|| | Discrete groups | | Attention pooling | weighted sum | When importance varies |
Input → [Equiv. Encoder] → Latent (equiv.) → [Equiv. Decoder] → Output
Input → [Equiv. Encoder] → Features (equiv.) → [Invariant Pool] → [MLP] → Class
Nodes → [MP Layer 1] → [MP Layer 2] → ... → [Aggregation] → Output
Groups: E(3), O(3), SO(3) Strengths: Full irrep support, tensor products, spherical harmonics Use for: Molecular modeling, 3D point clouds, physics
from e3nn import o3
irreps = o3.Irreps("2x0e + 2x1o + 1x2e") # 2 scalars, 2 vectors, 1 tensor
Groups: Discrete groups (Cₙ, Dₙ), continuous 2D (SO(2), O(2)) Strengths: Image processing, well-documented Use for: 2D images with rotation/reflection symmetry
from escnn import gspaces, nn
gspace = gspaces.rot2dOnR2(N=4) # C4 rotation group
Groups: Permutation (Sₙ) Strengths: Graphs, batching, many GNN layers Use for: Graph classification/regression, node prediction
from torch_geometric.nn import GCNConv, global_mean_pool
| Library | Groups | Framework | Notes | |---------|--------|-----------|-------| | NequIP | E(3) | PyTorch | Molecular dynamics | | MACE | E(3) | PyTorch | Molecular potentials | | jraph | Sₙ | JAX | Graph networks | | geomstats | Lie groups | NumPy/PyTorch | Manifold learning |
ARCHITECTURE SPECIFICATION
==========================
Target Symmetry: [Group name and notation]
Symmetry Type: [Invariant/Equivariant]
Task: [Classification/Regression/etc.]
Domain: [Images/Point clouds/Graphs/etc.]
Architecture Family: [e.g., E(3) Equivariant GNN]
Library: [e.g., e3nn]
Layer Specification:
1. Input Layer
- Input type: [e.g., 3D coordinates + features]
- Representation: [e.g., positions (l=1) + scalars (l=0)]
2. [Layer Name]
- Type: [Convolution/Tensor Product/Message Passing]
- Input irreps: [specification]
- Output irreps: [specification]
- Nonlinearity: [Gated/Norm/None]
3. [Continue for each layer...]
N. Output Layer
- Aggregation: [Mean/Sum/Attention]
- Output: [Invariant scalar / Equivariant vector / etc.]
Estimated Parameters: [count]
Key Dependencies: [library versions]
Code Skeleton:
[Provide implementation outline or pseudo-code]
NEXT STEPS:
- Implement the architecture using the specified library
- Verify equivariance through numerical testing after implementation
testing
Cluster a conference's event records into a small set of coarse themes with finer sub-clusters, an explicit outlier bucket, and soft (multi-membership) affinities — using the hybrid embed-then-label pipeline (embed abstracts, reduce, density-cluster, then LLM-label the clusters) when embedding libraries are available, and an LLM-reasoned hierarchical fallback when they are not. Embeddings do the grouping; the LLM only names the groups. Conference-agnostic. Use when turning structured event records into a navigable theme map for preference elicitation and scheduling, when you need 6-8 reasonable themes rather than 20 muddy ones, or when overlapping talks must belong to more than one theme. Trigger keywords - theme clustering, cluster talks, embed then label, soft membership, outlier talks, conference themes, topic map.
development
Build a personal conference schedule as a constraint-optimization problem — hard constraints (no time overlap, room-to-room travel time, capacity/registration, the attendee's own must-attends and blackouts) plus a user-owned weighted objective trading interest against breadth, pacing (maximize contiguous free time), and serendipity. Surfaces unbreakable conflicts (two high-value overlapping talks the model cannot rank) as decisions for the human rather than silently picking, and reports what each choice traded away. Conference-agnostic. Use to turn a preference profile plus a theme map into a day-by-day plan, to resolve overlapping sessions, or to balance a packed vs paced schedule. Trigger keywords - schedule optimization, conference schedule, constraint optimization, overlapping talks, contiguous free time, conflict surfacing, packed vs paced.
development
Parse a heterogeneous conference program (markdown, HTML, PDF-derived text, or JSON) into normalized event records with per-field confidence scores and independent classification axes (topic, depth, format, prerequisites, recorded, capacity). Detects the program's format before extracting, treats every inferred field as uncertain (present vs inferred vs missing), and flags thin or missing abstracts so downstream enrichment can target them. Conference-agnostic. Use when ingesting a conference or event schedule into a structured store, normalizing a talk/session list, or extracting per-session metadata with calibrated confidence. Trigger keywords - program ingestion, parse schedule, session extraction, event records, conference program, talk metadata, per-field confidence.
development
Build a personalized preference profile from a small number of well-chosen, cluster-grounded questions instead of a long survey. Represents the person's interests as an uncertainty region over the theme map, picks the single highest-information-gain choice-based question (contrasting real talks from different clusters), balances exploiting known interests against exploring uncertain ones, deliberately injects outlier probes to fight selection bias, and stops as soon as the schedule would be stable. Also elicits the user-owned objective weights and hard constraints. Interactive — runs where it can actually ask the person. Conference-agnostic. Use to turn a theme map into a preference profile, to decide what to ask a conference attendee, or to elicit scheduling priorities. Trigger keywords - preference elicitation, ask few questions, information gain, choice-based questions, selection bias probe, objective weights, attendee preferences.