Search FoxAI
AI Models 84768
- Bonsai-27b-MLX-UltraFastUnStable↗
VertexAIco
- FLUX-3-Image-Klein-MLX-8bit↗
VisualInference
- c66-h39↗
wandb04
- Gemma4-26B-A4B-QAT-Uncensored-HauhauCS-Balanced-MTP-NInfer-v3↗
WaveCut
- miner1↗
Xpression
- Qwen3.6-27B-MTPLX-Optimized-Speed↗
Youssofal
**MTPLX** is an MLX-native runtime for native Multi-Token-Prediction speculative decoding on Apple Silicon. Up to **2.24× faster decode** at real coding temperatures (`temp=0.6 / top_p=0.95 / top_k=20`) using the model's own built-in MTP heads — no external drafter, no greedy hack. This is the speed checkpoint for MTPLX v0.1.0-preview. It combines the and embeds `mtplx_runtime.json` so MTPLX can run it as the optimized speed variant. MTPLX v0.1.0-preview supports Qwen3-Next-MTP only. This model is verified for the `qwen3-next-mtp` backend.
- Yi-Coder-9B-Chat↗
01-ai
Yi-Coder is a series of open-source code language models that delivers state-of-the-art coding performance with fewer than 10 billion parameters. Key features: - Excelling in long-context understanding with a maximum context length of 128K tokens. - Supporting 52 major programming languages: As illustrated in the figure below, Yi-Coder-9B-Chat achieved an impressive 23% pass rate in LiveCodeBench, making it the only model with under 10B parameters to surpass 20%. It also outperforms DeepSeekCoder-33B-Ins at 22.3%, CodeGeex4-9B-all at 17.8%, CodeLLama-34B-Ins at 13.3%, and CodeQwen1.5-7B-Chat at 12%.
- Smaug-Mixtral-v0.1↗
abacusai
This model is part of the Smaug series of finetuned models. This one based on https://huggingface.co/mistralai/Mixtral-8x7B-v0.1 We use a new fine-tuning technique, DPO-Positive (DPOP), and new pairwise preference versions of ARC, HellaSwag, and MetaMath (as well as other existing datasets). We introduce the technique and the full training details in our new paper: https://arxiv.org/abs/2402.13228. We show that on datasets in which the edit distance between pairs of completions is low (such as in math-based datasets), standard DPO loss can lead to a reduction of the model's likelihood of the preferred examples, as long as the relative probability between the preferred and dispreferred classes increases. Using these insights, we design DPOP, a new loss function and training procedure which avoids this failure mode. Surprisingly, we also find that DPOP outperforms DPO across a wide variety of datasets and downstream tasks, including datasets with high edit distances between completions.
- kappa-3-phi-abliterated-GGUF↗
afrideva
- camembert-base-squadFR-fquad-piaf↗
AgentPublic
