156×
shorter context
Vector Graphics Representation Learning
Learning compact, invertible path embeddings for vector graphics.
University of Modena and Reggio Emilia
Motivation
Raster images benefit from continuous latent spaces such as VAEs and CLIP-style embeddings, but SVGs still do not have a compact, continuous, and invertible representation. That gap matters because SVGs are symbolic, editable, and resolution-independent, which makes them attractive for graphics, design, and multimodal modeling.
Existing SVG methods typically depend on long token sequences or rasterization-heavy pipelines. SLS instead maps each SVG path to a single dense vector, giving vector graphics a representation that is compact enough for foundation-model pipelines while remaining faithful to the underlying geometry and style.
Method
SLS encodes each SVG path into one dense latent token through a unified tokenization scheme that captures both geometry and style. The resulting embedding lies on the unit hypersphere, giving a normalized latent space that works cleanly for similarity, interpolation, retrieval, and generation.
SVG path → BPE tokenizer → Transformer encoder → dense latent vector → Transformer decoder → SVG path
Key Results
156×
shorter context
167×
fewer training TFLOPs
Invertible
path embeddings
SLS reduces SVG captioning context length from 2432 XML tokens to 15.56 latent tokens while improving downstream quality. The result is a representation that is dramatically cheaper to model without sacrificing vector fidelity.
Reconstruction
Latent Space Robustness
SLS remains robust under Gaussian noise and angular perturbations in latent space. This indicates that the learned representation is not only compact, but also locally well-behaved for manipulation, search, and generative modeling.
Generation
Interpolation
Smooth latent interpolation shows that SLS learns a structured continuous SVG manifold. Traversing between embeddings yields coherent transitions in vector geometry and style rather than brittle token-level jumps.
Applications
Compact path embeddings for similarity search across large vector collections.
Short latent contexts that are much easier for language models to consume.
Continuous morphing across geometry and appearance in vector space.
A compact representation layer for multimodal and large-scale vector understanding.
Citation
@inproceedings{yourpaper2026,
title={Project Title},
author={Author One and Author Two and Author Three},
booktitle={ECCV},
year={2026}
}