AI NEWS.ccAI正在发生 未来正在更新
♡ 我的收藏 0
AI 模型库/Abiray/Qwen3.8-Flash-Next-Orca-Abliterated-GSQ-RCO-Coder-GGUF
MODEL PROFILE · 模型档案

Qwen3.8-Flash-Next-Orca-Abliterated-GSQ-RCO-Coder-GGUF

Abiray · Qwen3.8-Flash-Next-Orca-Abliterated-GSQ-RCO-Coder-GGUF

A standalone, **weight-baked uncensored & abliterated GGUF** of **`ISTA-DASLab/Qwen3.8-Flash-Next-GSQ-RCO-Coder-GGUF`.** This build is created by precisely transplanting 144 orthogonalized residual-writing tensors from **`orcarouter/Qwen3.8-Flash-Next-Uncensored`** (via `SC117/Qwen3.8-Flash-Next-GSQ-RCO-abliterated-GGUF`) directly into the optimized 256-expert pruned Coder architecture. `ISTA-DASLab/Qwen3.8-Flash-Next-GSQ-RCO-Coder-GGUF` compresses `Qwen3.8-Flash-Next` from 354 GB (BF16, 512 experts per layer) down to **58.4 GB** by combining: 1. **Structured Expert Pruning ($512 \rightarrow 256$ experts per layer):** Selects the 256 experts specialized for software engineering, coding, agentic tool calling, and vision. 2. **GSQ (Gumbel-Softmax Quantization) + RCO (Riemannian Co-design Search):** Assigns optimal mixed-precision GGUF quantization types across individual tensors while storing the retained weights at `~3.5 bits` (`IQ3_S`-equivalent fidelity, labeled `IQ1_M` for its `1.89` effective bits per parameter relative to the unpruned 512-expert model). --- Because this is an ultra-low-bit MoE model (`IQ1_M` effective / `IQ3_S` retained weights), **avoid pure greedy decoding (`--temp 0.0` with no repetition penalty)** on repetitive C/C++ struct definitions. Use standard Qwen sampling parameters with a light repetition/presence penalty:

译文排队中，当前展示来源原文。

视觉问答
上下文窗口来源未披露
输入 → 输出文本、图像 → 文本
模型权重待核验
档案更新时间2026/11/2 19:16:32
OVERVIEW

模型介绍

A standalone, **weight-baked uncensored & abliterated GGUF** of **`ISTA-DASLab/Qwen3.8-Flash-Next-GSQ-RCO-Coder-GGUF`.** This build is created by precisely transplanting 144 orthogonalized residual-writing tensors from **`orcarouter/Qwen3.8-Flash-Next-Uncensored`** (via `SC117/Qwen3.8-Flash-Next-GSQ-RCO-abliterated-GGUF`) directly into the optimized 256-expert pruned Coder architecture. `ISTA-DASLab/Qwen3.8-Flash-Next-GSQ-RCO-Coder-GGUF` compresses `Qwen3.8-Flash-Next` from 354 GB (BF16, 512 experts per layer) down to **58.4 GB** by combining: 1. **Structured Expert Pruning ($512 \rightarrow 256$ experts per layer):** Selects the 256 experts specialized for software engineering, coding, agentic tool calling, and vision. 2. **GSQ (Gumbel-Softmax Quantization) + RCO (Riemannian Co-design Search):** Assigns optimal mixed-precision GGUF quantization types across individual tensors while storing the retained weights at `~3.5 bits` (`IQ3_S`-equivalent fidelity, labeled `IQ1_M` for its `1.89` effective bits per parameter relative to the unpruned 512-expert model). --- Because this is an ultra-low-bit MoE model (`IQ1_M` effective / `IQ3_S` retained weights), **avoid pure greedy decoding (`--temp 0.0` with no repetition penalty)** on repetitive C/C++ struct definitions. Use standard Qwen sampling parameters with a light repetition/presence penalty:

主要特点

特点摘要待依据来源补齐，不凭模型名称推断能力。

局限与注意事项

暂无足够来源支持具体缺点结论。请重点验证实际任务表现、时延、数据政策、许可与版本生命周期。

PRICING & COST

来源报价与费用分析

同一模型在不同渠道、地区和配置下可能采用不同价格。下表独立保留各渠道报价，不将渠道价格视为厂商官方统一价格。

来源 / 渠道输入输出计费单位采集时间
暂未取得可核验报价，请查阅来源渠道。

按月估算基础 Token 费用

—

预估不包含缓存优惠、阶梯定价、多模态附加费用、网络检索、税费及推理额外输出。

INDEPENDENT BENCHMARKS

公开评测与运行配置

暂无已采集的可核验公开评分。模型未上榜不代表能力较低。

查看完整已收录榜单 →

常见问题

开放权重是否代表可以免费商用？

不一定。应核对具体版本许可证、商用门槛和使用政策。自部署还会产生算力和维护成本。

这些价格是实时结算价格吗？

不是实时结算价格，而是带采集时间的来源报价快照。请到对应渠道核对当前版本、区域、折扣和计费方式。

资料来源与可追溯记录

huggingface · Abiray/Qwen3.8-Flash-Next-Orca-Abliterated-GSQ-RCO-Coder-GGUF ↗2026/10/30 13:26:03
huggingface · enrich:41ca82c8-979b-4178-876e-ce181beb6a91 ↗2026/10/31 08:55:03

许可证：来源未披露，须进一步核验。模型介绍与第三方评测均以原来源的具体版本和方法为准。