hiera_large_224.mae_in1k
facebook基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
From language to images, open weights to APIs. Understand capabilities and compare real costs.
Find the right engine for your next idea.
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
**Hiera** is a _hierarchical_ vision transformer that is fast, powerful, and, above all, _simple_. It was introduced in the paper Hiera: A Hierarchical Vision Transformer without the Bells-and-Whistles and outperforms the state-of-the-art across a wide array of image and video tasks _while being much faster_. Vision transformers like ViT use the same spatial resolution and number of features throughout the whole network. But this is inefficient: the early layers don't need that many features, and the later layers don't need that much spatial resolution. Prior hierarchical models like ResNet accounted for this by using fewer features at the start and less spatial resolution at the end. Several domain specific vision transformers have been introduced that employ this hierarchical design, such as Swin or MViT. But in the pursuit of state-of-the-art results using fully supervised training on ImageNet-1K, these models have become more and more complicated as they add specialized modules to make up for spatial biases that ViTs lack. While these changes produce effective models with attractive FLOP counts, under the hood the added complexity makes these models _slower_ overall.
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
The base model pretrained on 16kHz sampled speech audio. When using the model make sure that your speech input is also sampled at 16Khz. **Note**: This model does not have a tokenizer as it was pretrained on audio alone. In order to use this model **speech recognition**, a tokenizer should be created and the model should be fine-tuned on labeled text data. Check out this blog for more in-detail explanation of how to fine-tune the model. Authors: Wei-Ning Hsu, Benjamin Bolte, Yao-Hung Hubert Tsai, Kushal Lakhotia, Ruslan Salakhutdinov, Abdelrahman Mohamed
The large model pretrained on 16kHz sampled speech audio. When using the model make sure that your speech input is also sampled at 16Khz. **Note**: This model does not have a tokenizer as it was pretrained on audio alone. In order to use this model **speech recognition**, a tokenizer should be created and the model should be fine-tuned on labeled text data. Check out this blog for more in-detail explanation of how to fine-tune the model. The model was pretrained on Libri-Light.
The large model fine-tuned on 960h of Librispeech on 16kHz sampled speech audio. When using the model make sure that your speech input is also sampled at 16Khz. The model is a fine-tuned version of hubert-large-ll60k. Authors: Wei-Ning Hsu, Benjamin Bolte, Yao-Hung Hubert Tsai, Kushal Lakhotia, Ruslan Salakhutdinov, Abdelrahman Mohamed
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
The extra large model fine-tuned on 960h of Librispeech on 16kHz sampled speech audio. When using the model make sure that your speech input is also sampled at 16Khz. Authors: Wei-Ning Hsu, Benjamin Bolte, Yao-Hung Hubert Tsai, Kushal Lakhotia, Ruslan Salakhutdinov, Abdelrahman Mohamed **Abstract** Self-supervised approaches for speech representation learning are challenged by three unique problems: (1) there are multiple sound units in each input utterance, (2) there is no lexicon of input sound units during the pre-training phase, and (3) sound units have variable lengths with no explicit segmentation. To deal with these three problems, we propose the Hidden-Unit BERT (HuBERT) approach for self-supervised speech representation learning, which utilizes an offline clustering step to provide aligned target labels for a BERT-like prediction loss. A key ingredient of our approach is applying the prediction loss over the masked regions only, which forces the model to learn a combined acoustic and language model over the continuous inputs. HuBERT relies primarily on the consistency of the unsupervised clustering step rather than the intrinsic quality of the assigned cluster labels. Starting with a simple k-means teacher of 100 clusters, and using two iterations of clustering, the HuBERT model either matches or improves upon the state-of-the-art wav2vec 2.0 performance on the Librispeech (960h) and Libri-light (60,000h) benchmarks with 10min, 1h, 10h, 100h, and 960h fine-tuning subsets. Using a 1B parameter model, HuBERT shows up to 19% and 13% relative WER reduction on the more challenging dev-other and test-other evaluation subsets.
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
基础档案已收录,详细介绍后续补充。可先查看厂商、分类与来源。
Basic profile indexed · More details to follow
Adjust provider, category or input/output filters. New models are added continuously.
Adjust monthly token usage to compare estimated API costs.
Uses collected, comparable USD-per-million-token rates. Snapshots exclude cache discounts, tiers, extra reasoning output and taxes. Check current source prices.
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.
Not necessarily. Check each version’s license, commercial restrictions and policies. Self-hosting also incurs compute and maintenance costs.
Rankings depend on tasks, versions and methods. Compare accuracy, latency, reliability and costs on your own workload.