AI NEWS.ccAI is happening. The future is updating.
♡ Saved tools 0
AI NEWS · Model intelligenceExplore capabilities. Make informed choices. ↗Profiles indexed first · Details continuously enriched
THE AI MODEL DIRECTORY Start exploring models here

Find your ideal AI model.

From language to images, open weights to APIs. Understand capabilities and compare real costs.
Find the right engine for your next idea.

Popular searches
84,991 model profiles13202 providers / publishers45 capability categories465 with comparable prices · 30 benchmarked
TText generation▧Image generation▷Video generation⌘Code generation◖Speech synthesis♫Music generation⬡3D modeling▤Document analysis
DISCOVER & COMPARE

Explore AI models 2043

Discover models worth your attention

This is the code for MOSS-Audio-Tokenizer presented in MOSS-Audio-Tokenizer: Scaling Audio Tokenizers for Future Audio Foundation Models. **MOSSAudioTokenizer** is a unified discrete audio tokenizer based on the **Cat** (**C**ausal **A**udio **T**okenizer with **T**ransformer) architecture. Scaling to 1.6 billion parameters, it functions as a unified discrete interface, delivering both lossless-quality reconstruction and high-level semantic alignment. * **Extreme Compression & Variable Bitrate**: It compresses 24kHz raw audio into a remarkably low frame rate of 12.5Hz. Utilizing a 32-layer Residual Vector Quantizer (RVQ), it supports high-fidelity reconstruction across a wide range of bitrates, from 0.125kbps to 4kbps. * **Pure Transformer Architecture**: The model features a "CNN-free" homogeneous architecture built entirely from Causal Transformer blocks. With 1.6B combined parameters (Encoder + Decoder), it ensures exceptional scalability and supports low-latency streaming inference. * **Large-Scale General Audio Training**: Trained on 3 million hours of diverse audio data, the model excels at encoding and reconstructing all audio domains, including speech, sound effects, and music. * **Unified Semantic-Acoustic Representation**: While achieving state-of-the-art reconstruction quality, Cat produces discrete tokens that are "semantic-rich," making them ideal for downstream tasks like speech understanding (ASR) and generation (TTS). * **Fully Trained From Scratch**: Cat does not rely on any pretrained encoders (such as HuBERT or Whisper) or distillation from teacher models. All representations are learned autonomously from raw data. * **End-to-End Joint Optimization**: All components—including the encoder, quantizer, decoder, discriminator, and a decoder-only LLM for semantic alignment—are optimized jointly in a single unified training pipeline.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

This repository contains the Hugging Face remote-code implementation and weights for **MOSS-Audio-Tokenizer-Nano**, the lightweight audio tokenizer used by **MOSS-TTS-Nano**. MOSS-Audio-Tokenizer-Nano is a compact discrete audio tokenizer based on the **Cat** (**C**ausal **A**udio **T**okenizer with **T**ransformer) architecture from MOSS-Audio-Tokenizer: Scaling Audio Tokenizers for Future Audio Foundation Models. The checkpoint in this repository has **21,969,664 parameters** (approximately **22M**), making it much smaller than the full-size MOSS-Audio-Tokenizer while preserving the 48 kHz stereo tokenizer interface used by the MOSS-TTS family. - **Small model size**: approximately **22M parameters**, including about 10.45M encoder parameters, 10.45M decoder parameters, and 1.07M quantizer parameters. - **Native high-resolution audio**: supports **48 kHz** input and output with **2-channel stereo** audio, helping reduce compression loss and improve listening quality. - **Low-frame-rate discrete codes**: compresses 48 kHz stereo audio into a **12.5 Hz** token stream with a downsample rate of 7,680 samples. - **Variable bitrate reconstruction**: uses a residual quantizer stack with **16 codebooks** and 1,024 entries per codebook. Each codebook contributes about **0.125 kbps**, for an inference range from **0.125 kbps to 2 kbps**. - **Transformer-based tokenizer**: uses causal Transformer blocks and supports low-latency streaming encode/decode. - **MOSS-TTS family interface**: designed as the audio tokenizer backbone for MOSS-TTS-Nano and compatible MOSS-TTS-family workflows.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

This is the code for the 48khz stereo version of MOSS-Audio-Tokenizer presented in MOSS-Audio-Tokenizer: Scaling Audio Tokenizers for Future Audio Foundation Models. **MOSS-Audio-Tokenizer-v2** is a unified discrete audio tokenizer based on the **Cat** (**C**ausal **A**udio **T**okenizer with **T**ransformer) architecture. Scaling to 2 billion parameters, it functions as a unified discrete interface, delivering both lossless-quality reconstruction and high-level semantic alignment. * **Extreme Compression & Variable Bitrate**: It compresses 48kHz stereo audio into a remarkably low frame rate of 12.5Hz. Utilizing a 32-layer Residual Vector Quantization stack, it supports high-fidelity reconstruction across a wide range of bitrates. * **Pure Transformer Architecture**: The model features a "CNN-free" homogeneous architecture built entirely from Causal Transformer blocks. With 2B combined parameters (Encoder + Decoder), it ensures exceptional scalability and supports low-latency streaming inference. * **Large-Scale General Audio Training**: Trained on 3 million hours of diverse audio data, the model excels at encoding and reconstructing all audio domains, including speech, sound effects, and music. * **Unified Semantic-Acoustic Representation**: While achieving state-of-the-art reconstruction quality, Cat produces discrete tokens that are "semantic-rich," making them ideal for downstream tasks like speech understanding (ASR) and generation (TTS). * **Fully Trained From Scratch**: Cat does not rely on any pretrained encoders (such as HuBERT or Whisper) or distillation from teacher models. All representations are learned autonomously from raw data. * **End-to-End Joint Optimization**: All components—including the encoder, quantizer, decoder, discriminator, and a decoder-only LLM for semantic alignment—are optimized jointly in a single unified training pipeline.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' **zero-shot performance** on a subset of BEIR benchmark: TrecCovid,NFCorpus,NQ,HotpotQA,FiQA,ArguAna,Touche,DBPedia,SCIDOCS,FEVER,Climate FEVER,SciFact,Quora. Overall, the v2 series of models have better search relevance, efficiency and inference speed than the v1 series. The specific advantages and disadvantages may vary across different datasets. - **Paper**: Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrievers - **Fine-tuning sample**: opensearch-sparse-model-tuning-sample

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' **zero-shot performance** on a subset of BEIR benchmark: TrecCovid,NFCorpus,NQ,HotpotQA,FiQA,ArguAna,Touche,DBPedia,SCIDOCS,FEVER,Climate FEVER,SciFact,Quora. Overall, the v2 series of models have better search relevance, efficiency and inference speed than the v1 series. The specific advantages and disadvantages may vary across different datasets. - **Paper**: Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrievers - **Fine-tuning sample**: opensearch-sparse-model-tuning-sample

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' performance on a subset of BEIR benchmark: TrecCovid,NFCorpus,NQ,HotpotQA,FiQA,ArguAna,Touche,DBPedia,SCIDOCS,FEVER,Climate FEVER,SciFact,Quora. Overall, the v3 series of models have better search relevance, efficiency and inference speed than the v1 and v2 series. The specific advantages and disadvantages may vary across different datasets. - **Paper**: Exploring $\ell_0$ Sparsification for Inference-free Sparse Retrievers - **Codes**: opensearch-sparse-model-tuning-sample

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' performance on a subset of BEIR benchmark: TrecCovid,NFCorpus,NQ,HotpotQA,FiQA,ArguAna,Touche,DBPedia,SCIDOCS,FEVER,Climate FEVER,SciFact,Quora. Overall, the v3 series of models have better search relevance, efficiency and inference speed than the v1 and v2 series. The specific advantages and disadvantages may vary across different datasets. This is a learned sparse retrieval model. It encodes the documents to 30522 dimensional **sparse vectors**. For queries, it just use a tokenizer and a weight look-up table to generate sparse vectors. The non-zero dimension index means the corresponding token in the vocabulary, and the weight means the importance of the token. And the similarity score is the inner product of query/document sparse vectors.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' performance on **MIRACL** benchmark (we exclude th since the uncased backbone can not encode it). **We recommend to use it with max_ratio pruning.** - **Paper**: Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrievers - **Fine-tuning sample**: opensearch-sparse-model-tuning-sample This is a learned sparse retrieval model. It encodes the documents to 105879 dimensional **sparse vectors**. For queries, it just use a tokenizer and a weight look-up table to generate sparse vectors. The non-zero dimension index means the corresponding token in the vocabulary, and the weight means the importance of the token. And the similarity score is the inner product of query/document sparse vectors.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

The model should be selected considering search relevance, model inference and retrieval efficiency(FLOPS). We benchmark models' **zero-shot performance** on a subset of BEIR benchmark: TrecCovid,NFCorpus,NQ,HotpotQA,FiQA,ArguAna,Touche,DBPedia,SCIDOCS,FEVER,Climate FEVER,SciFact,Quora. Overall, the v2 series of models have better search relevance, efficiency and inference speed than the v1 series. The specific advantages and disadvantages may vary across different datasets. This is a learned sparse retrieval model. It encodes the queries and documents to 30522 dimensional **sparse vectors**. The non-zero dimension index means the corresponding token in the vocabulary, and the weight means the importance of the token.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗

PolDense is a family of Polish embedding models optimized for dense retrieval. The models are built on top of the ettin-encoders, which use the ModernBERT architecture, and are designed to provide high-quality text representations for Polish search, retrieval, and RAG applications. The family consists of six models, ranging from 17M to 1B parameters. This makes it possible to choose between lightweight, low-latency deployments and larger models aimed at maximum retrieval quality. PolDense models were trained in a three-stage pipeline with two knowledge distillation stages and one fine-tuning stage. The main teacher embedding model was BGE-Multilingual-Gemma2, while the final retrieval fine-tuning stage used relevance scores produced by BGE-Reranker-v2.5-Gemma2-Lightweight. 1. The first stage adapted the original English ettin-encoder models to Polish using multilingual knowledge distillation. This stage follows the approach introduced in Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillation. The core idea is to use a strong teacher model to define a shared semantic embedding space. For each parallel sentence pair, the teacher encodes the source-language sentence, and the student is trained to produce a similar embedding for the translated sentence. In practice, this teaches the student to map Polish and English texts with the same meaning to nearby locations in the vector space, while preserving the retrieval-oriented structure learned by the teacher. In this stage, BGE-Multilingual-Gemma2 was used as the teacher model. Training was performed on a Polish-English parallel corpus containing approximately 20 million text pairs. Each model was trained for 5 epochs with a batch size of 64.

Embeddings & similarity
Input Text→ Output Embedding
Price not verifiedCheck multimodal and channel pricing separately
View details ↗
Source / docs ↗
COST EXPLORER

Great models. Clear costs.

Cost analysis

Adjust monthly token usage to compare estimated API costs.

1 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.

AI NEWS · From information to decisions

Follow trends. Find tools. Explore models.

Explore AI news ↗Discover AI tools ↗