MODEL PROFILE

deformable-detr-DocLayNet

Aryn · deformable-detr-DocLayNet

Deformable DEtection TRansformer (DETR), trained on DocLayNet (including 80k annotated pages in 11 classes). The DETR model is an encoder-decoder transformer with a convolutional backbone. Two heads are added on top of the decoder outputs in order to perform object detection: a linear layer for the class labels and a MLP (multi-layer perceptron) for the bounding boxes. The model uses so-called object queries to detect objects in an image. Each object query looks for a particular object in the image. For COCO, the number of object queries is set to 100. The model is trained using a "bipartite matching loss": one compares the predicted classes + bounding boxes of each of the N = 100 object queries to the ground truth annotations, padded up to the same length N (so if an image only contains 4 objects, 96 annotations will just have a "no object" as class and "no bounding box" as bounding box). The Hungarian matching algorithm is used to create an optimal one-to-one mapping between each of the N queries and each of the N annotations. Next, standard cross-entropy (for the classes) and a linear combination of the L1 and generalized IoU loss (for the bounding boxes) are used to optimize the parameters of the model.

Object detectionlicense:apache-2.0
Context windowNot disclosed
Input → Output图像 → 待核验
Model weightsNot verified
Profile updated2026/11/2 19:17:13
OVERVIEW

Model overview

Deformable DEtection TRansformer (DETR), trained on DocLayNet (including 80k annotated pages in 11 classes). The DETR model is an encoder-decoder transformer with a convolutional backbone. Two heads are added on top of the decoder outputs in order to perform object detection: a linear layer for the class labels and a MLP (multi-layer perceptron) for the bounding boxes. The model uses so-called object queries to detect objects in an image. Each object query looks for a particular object in the image. For COCO, the number of object queries is set to 100. The model is trained using a "bipartite matching loss": one compares the predicted classes + bounding boxes of each of the N = 100 object queries to the ground truth annotations, padded up to the same length N (so if an image only contains 4 objects, 96 annotations will just have a "no object" as class and "no bounding box" as bounding box). The Hungarian matching algorithm is used to create an optimal one-to-one mapping between each of the N queries and each of the N annotations. Next, standard cross-entropy (for the classes) and a linear combination of the L1 and generalized IoU loss (for the bounding boxes) are used to optimize the parameters of the model.

Key features

特点摘要待依据来源补齐,不凭模型名称推断能力。

Limitations & considerations

Sources are insufficient to establish specific limitations. Verify task performance, latency, data policies, licensing and version lifecycle.

PRICING & COST

Source prices & cost analysis

Prices vary by channel, region and configuration. Channel quotes are listed independently and are not treated as a single official provider price.

Source / channelInputOutputBilling unitCollected at
No verified prices yet. Check the source channel.

Estimate monthly base token costs

—

Estimates exclude cache discounts, tiered pricing, multimodal surcharges, web search, taxes and additional reasoning output.

INDEPENDENT BENCHMARKS

Public benchmarks & run configuration

暂无已采集的可核验公开评分。模型未上榜不代表能力较低。

View full indexed rankings →

Frequently asked questions

Do open weights permit free commercial use?

Not necessarily. Check the version license, commercial conditions and usage policies. Self-hosting incurs compute and maintenance costs.

Are these real-time billing prices?

These are timestamped source snapshots, not live billing prices. Check the channel for current versions, regions, discounts and billing methods.

Sources & traceability

许可证:apache-2.0。模型介绍与第三方评测均以原来源的具体版本和方法为准。