Model Detail
Pareto 26.10
—Pareto 26.10 is a multimodal model released by Unbiased. And supports text+image->text inputs.
Pareto 26.10 is priced at $0.8/M input tokens and $3.2/M output tokens. Operationally the model offers a 1049K-token context window, which matters when sizing it for prompt-heavy or latency-sensitive workloads. Pricing in this range is the working middle of the API market — neither the cheapest nor the most expensive option per token, so cost-fit is usually a function of how much output you generate.
Pareto 26.10 is published on Hugging Face but our pipeline has not yet captured architecture, license, or parameter-count metadata for this entry. The data is refreshed daily, so these fields typically populate within 24–48 hours of release.
Pareto 26.10 is best fit for mixed text-and-image reasoning tasks such as document understanding, and long-context tasks such as full-codebase analysis or book-length summarization (1049K tokens). Treat this as a starting matrix rather than a benchmark verdict — the right deployment usually depends on the specific evaluation suite that mirrors your workload.
HarnessPro: Recursive Harness Self-Improvement with Pareto Optimization for Performance-Cost Trade-offs
arXiv:2610.26770v2 Announce Type: replace-cross Abstract: Harness development plays a crucial role in building capable AI agents. Recent approaches improve harnesses through recursive self-improvement (RSI), but their performance gains often come with higher execution costs. We introduce HarnessPro,
Preference-Aware Pareto Steering for Multi-Task Speech LLMs
arXiv:2610.27200v1 Announce Type: new Abstract: Speech large language models (LLMs) perform multiple tasks, including automatic speech recognition (ASR), timestamp prediction (TS), and speech translation (ST). Joint training of speech LLMs creates task trade-offs, yet standard training with fixed lo
Pareto-Optimal RTL Code Generation via Multi-Objective Reinforcement Learning with Large Language Models
arXiv:2610.26904v1 Announce Type: new Abstract: Recent studies have proposed reinforcement learning with verifiable rewards (RLVR) methods that enable LLMs to generate high-quality RTL circuits from natural-language specifications. Existing approaches optimize circuit PPA (Power, Performance, Area)
Beyond Scalar Leaderboards: Adaptive Sampling for Pareto Frontier Identification in Multi-Objective LLM Arenas
arXiv:2610.27447v1 Announce Type: cross Abstract: The evaluation of large language models (LLMs) is inherently multi-objective, as different models may offer different tradeoffs across performance dimensions such as math, code, and writing. Because such evaluations are often based on costly and time
FSPO: Policy-Consistent Risk and Pareto-Feasible Control for Budgeted LLM RL Post-Training
arXiv:2610.02828v2 Announce Type: replace Abstract: Adaptive LLM reinforcement-learning post-training changes multiple training actuators online, including rollout temperature, group size, clipping, KL regularization, verifier allocation, and update budget. Three coupled issues remain unresolved. A
In-Context Preference-Conditioned Pareto Set Learning from Limited Offline Data
arXiv:2610.21736v1 Announce Type: new Abstract: Multi-objective optimization involves diverse preferences over conflicting objectives. Rather than returning a finite set of trade-off solutions, preference-conditioned Pareto set learning seeks to map a specified preference directly to a corresponding
