*We present high quality image synthesis results using diffusion probabilistic models, a class of latent variable models inspired by considerations from nonequilibrium thermodynamics. Our best results are obtained by training on a weighted variational bound designed according to a novel connection between diffusion probabilistic models and denoising score matching with Langevin dynamics, and our models naturally admit a progressive lossy decompression scheme that can be interpreted as a generalization of autoregressive decoding. On the unconditional CIFAR10 dataset, we obtain an Inception score of 9.46 and a state-of-the-art FID score of 3.17. On 256x256 LSUN, we obtain sample quality similar to ProgressiveGAN.* for inference. Note that while the *ddpm* scheduler yields the highest quality, it also takes the longest. For a good trade-off between quality and inference speed you might want to consider the *ddim* or *pndm* schedulers instead.

Category pending

Input Not verified→ Output Not verified

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

ddpm-church-256

Google

基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。

Basic profile indexed · More details to follow

Category pending

Input Not verified→ Output Not verified

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

ddpm-cifar10-32

Google

**Paper**: Denoising Diffusion Probabilistic Models *We present high quality image synthesis results using diffusion probabilistic models, a class of latent variable models inspired by considerations from nonequilibrium thermodynamics. Our best results are obtained by training on a weighted variational bound designed according to a novel connection between diffusion probabilistic models and denoising score matching with Langevin dynamics, and our models naturally admit a progressive lossy decompression scheme that can be interpreted as a generalization of autoregressive decoding. On the unconditional CIFAR10 dataset, we obtain an Inception score of 9.46 and a state-of-the-art FID score of 3.17. On 256x256 LSUN, we obtain sample quality similar to ProgressiveGAN.* - scheduling_ddpm - scheduling_ddim - scheduling_pndm

Category pending

Input Not verified→ Output Not verified

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

COST EXPLORER

Great models. Clear costs.

Cost analysis

Adjust monthly token usage to compare estimated API costs.

Monthly input tokens 10 MMonthly output tokens 2 M1 M = 1 million tokens · USD
Compares base text-token rates within the same channel

Uses collected, comparable USD-per-million-token rates. Snapshots exclude cache discounts, tiers, extra reasoning output and taxes. Check current source prices.

MODEL HANDBOOK

Understand before you choose

Selection guide & FAQ

How should API prices be compared?+

Separate input, output and cache rates, then estimate the same workload. Image, audio and video rates may use items, duration or resolution rather than tokens.

Do open weights mean free commercial use?+

Not necessarily. Check each version’s license, commercial restrictions and policies. Self-hosting also incurs compute and maintenance costs.

Is the top-ranked model the best for me?+

Rankings depend on tasks, versions and methods. Compare accuracy, latency, reliability and costs on your own workload.

Find your ideal AI model.

Explore AI models 84999

codegemma-1.1-7b-it

codegemma-1.1-7b-it-GGUF

codegemma-1.1-7b-it-keras

codegemma-1.1-7b-it-pytorch

codegemma-2b

codegemma-2b-GGUF

codegemma-2b-keras

codegemma-2b-pytorch

codegemma-7b

codegemma-7b-GGUF

codegemma-7b-it

codegemma-7b-it-GGUF

codegemma-7b-it-keras

codegemma-7b-it-pytorch

codegemma-7b-keras

codegemma-7b-pytorch

cxr-foundation

datagemma-rag-27b-it

datagemma-rig-27b-it

ddpm-bedroom-256

ddpm-cat-256

ddpm-celebahq-256

ddpm-church-256

ddpm-cifar10-32

No matching models

Great models. Clear costs.

Understand before you choose

Follow trends. Find tools. Explore models.