ddpm-bedroom-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗DISCOVER & COMPARE
Explore AI models 1289
ddpm-cat-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-celebahq-256
Google*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.
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-church-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗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
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-ema-bedroom-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-ema-cat-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-ema-celebahq-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗ddpm-ema-church-256
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Image→ Output Image
Price not verifiedCheck multimodal and channel pricing separately
View details ↗deplot
Google0. TL;DR 1. Using the model 2. Contribution 3. Citation > Visual language such as charts and plots is ubiquitous in the human world. Comprehending plots and charts requires strong reasoning skills. Prior state-of-the-art (SOTA) models require at least tens of thousands of training examples and their reasoning capabilities are still much limited, especially on complex human-written queries. This paper presents the first one-shot solution to visual language reasoning. We decompose the challenge of visual language reasoning into two steps: (1) plot-to-text translation, and (2) reasoning over the translated text. The key in this method is a modality conversion module, named as DePlot, which translates the image of a plot or chart to a linearized table. The output of DePlot can then be directly used to prompt a pretrained large language model (LLM), exploiting the few-shot reasoning capabilities of LLMs. To obtain DePlot, we standardize the plot-to-table task by establishing unified task formats and metrics, and train DePlot end-to-end on this task. DePlot can then be used off-the-shelf together with LLMs in a plug-and-play fashion. Compared with a SOTA model finetuned on more than >28k data points, DePlot+LLM with just one-shot prompting achieves a 24.0% improvement over finetuned SOTA on human-written queries from the task of chart QA. You can run a prediction by querying an input image together with a question as follows:
Input Text · Image→ Output Text
Price not verifiedCheck multimodal and channel pricing separately
View details ↗derm-foundation
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Text→ Output Text
Price not verifiedCheck multimodal and channel pricing separately
View details ↗基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Text→ Output Text
Price not verifiedCheck multimodal and channel pricing separately
View details ↗基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗DiffusionGemma 26B A4B
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Not verified→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗DiffusionGemma is a generative model built by Google DeepMind. Based on the 26B A4B Mixture-of-Experts (MoE) Gemma 4 architecture, DiffusionGemma generates tokens using discrete diffusion. This open-weights model is multimodal, handling text, image, and video inputs to generate text output. Built on a MoE foundation, DiffusionGemma is designed to improve generation speed (tokens per second) while remaining deployable across various hardware environments. DiffusionGemma builds upon the architectural and capability advancements of Gemma 4, introducing several core features: * **Discrete Text Diffusion** – Shifts from token-by-token autoregression to block-autoregressive multi-canvas sampling. It generates text by iteratively denoising blocks of tokens (a 'canvas') in parallel, significantly increasing decoding speed. * **Multimodal Input Processing** – Processes interleaved text, image (with variable aspect ratio and resolution support), and video inputs to generate text outputs. * **Encoder-Decoder Architecture** – Utilizes an autoregressive encoder to process and cache the prompt context, paired with a decoder that applies bidirectional attention over the generation canvas. * **Mixture-of-Experts (MoE) Efficiency** – Leverages a sparse MoE design (8 active experts out of 128 total) to provide strong reasoning capabilities while maintaining a low memory footprint suitable for local execution. * **Thinking Mode (Reasoning)** – Designed as a highly capable reasoner, with configurable thinking modes. * **Optimized for Small Batch Size Inference –** Specifically engineered for low-latency, high-speed generation on a single capable accelerator. * **Native System Prompt Support** – As with Gemma 4, it supports updating the `system` role, enabling more structured and controllable conversations.
Input Text · Image→ Output Text
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b0
GoogleEfficientNet model trained on ImageNet-1k at resolution 224x224. It was introduced in the paper EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks by Mingxing Tan and Quoc V. Le, and first released in this repository. Disclaimer: The team releasing EfficientNet did not write a model card for this model so this model card has been written by the Hugging Face team. EfficientNet is a mobile friendly pure convolutional model (ConvNet) that proposes a new scaling method that uniformly scales all dimensions of depth/width/resolution using a simple yet highly effective compound coefficient.
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b1
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b2
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b3
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b4
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b5
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗efficientnet-b6
Google基础档案已收录，详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Input Image→ Output Not verified
Price not verifiedCheck multimodal and channel pricing separately
View details ↗No matching models
Adjust provider, category or input/output filters. New models are added continuously.
COST EXPLORER
Great models. Clear costs.
Adjust monthly token usage to compare estimated API costs.
1 M = 1 million tokens · USD
Compares base text-token rates within the same channel
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
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.