Gemini 2.0 Flash Thinking

Gemini 2.0 Flash Thinking is an advanced reasoning model designed to enhance performance and explainability by making its thought process visible. It excels in complex problem-solving, coding challenges, and mathematical reasoning, demonstrating step-by-step solutions. Optimized for tasks that demand detailed explanations and logical analysis, the model also features native tool integration, including code execution and Google Search capabilities.

Llama 3.3 70B Instruct

Llama 3.3 70B Instruct, created by Meta, is a multilingual large language model specifically fine-tuned for instruction-based tasks and optimized for conversational applications. It is capable of processing and generating text in multiple languages, with a context window supporting up to 128,000 tokens. Launched on December 6, 2024, the model surpasses numerous open-source and proprietary chat models in various industry benchmarks. It utilizes Grouped-Query Attention (GQA) to improve scalability and has been trained on a diverse dataset comprising over 15 trillion tokens from publicly available sources. The model's knowledge is current up to December 2023.

Gemini 2.0 Flash ThinkingLlama 3.3 70B Instruct
Provider
Web Site
Release Date
Dec 19, 2024
4 months ago
Dec 06, 2024
4 months ago
Modalities
text ?
images ?
text ?
API Providers
Google AI Studio, Vertex AI, Gemini API
Fireworks, Together, DeepInfra, Hyperbolic
Knowledge Cut-off Date
04.2024
12.2024
Open Source
No
Yes
Pricing Input
Not available
$0.23 per million tokens
Pricing Output
Not available
$0.40 per million tokens
MMLU
Not available
86%
0-shot, CoT
Source
MMLU Pro
Not available
68.9%
5-shot, CoT
Source
MMMU
75.4%
Source
Not available
HellaSwag
Not available
Not available
HumanEval
Not available
88.4%
pass@1
Source
MATH
Not available
77%
0-shot, CoT
Source
GPQA
74.2%
Diamond Science
Source
50.5%
0-shot, CoT
Source
IFEval
Not available
92.1%
Source
Mobile Application
-

Compare LLMs

Add a Comment


10%
Our site uses cookies.

Privacy and Cookie Policy: This site uses cookies. By continuing to use the site, you agree to their use.