Tag

Ornith-1.0-35B-GGUF

A self-improving, agentic coding LLM tailored for terminal-style coding agents and tool-calling, provided as 35B MoE GGUF weights with very large context support. Trained with reinforcement learning to jointly generate task scaffolds and solutions; designed for local inference and OpenAI-compatible tool endpoints.

Ornith-1.0-9B-GGUF

Provides a GGUF-quantized local build of Ornith-1.0's 9B dense model for offline inference and terminal-focused coding agents. Supports OpenAI-compatible tool-calling, a 256K context window, and runs via llama.cpp or Ollama on a single high-memory GPU.

DeepSeek-V4-Pro-DSpark

Mixture-of-Experts LLM designed for million-token contexts, combining hybrid compressed attention, FP4/FP8 quantization-aware training for MoE experts, and multi-mode 'thinking' (Non-think/Think High/Think Max); includes a speculative-decoding extension for faster inference.

DeepSeek-V4-Flash-DSpark

A Hugging Face model checkpoint that attaches a speculative decoding module to DeepSeek-V4-Flash, enabling million-token context handling with MoE architecture, FP4/FP8 mixed precision, and long-context inference optimizations.

The Mirage of Optimizing Training Policies: Monotonic Inference Policies as the Real Objective for LLM Reinforcement Learning

Proposes Monotonic Inference Policy Improvement (MIPI) and a two-step Monotonic Inference Policy Update (MIPU) to address training–inference probability mismatch in LLM reinforcement learning by constructing sampler-referenced candidate updates and accepting synchronized updates using an inference-gap proxy; shows improved reasoning accuracy and stability under FP8-quantized rollouts.

Huihui-GLM-5.2-abliterated-GGUF

An uncensored GGUF build of GLM-5.2 that applies weight “abliteration” to remove refusal filters and produce a locally runnable text-generation model; includes quantization conversions and shard-merge instructions, intended for experimental research rather than production use.

Metacognition-Bench

Provides 300 adversarial "metacognitive-trap" problems to measure whether LLMs notice and recover from their own reasoning errors. Combines multiple-choice vulnerability tests with free-form adapter-gain evaluation and ships per-model metacognition adapters for frozen-base probing.

Morphing into Hybrid Attention Models

Treats hybrid layer selection as a budget-constrained subset optimization and introduces FlashMorph: a pipeline that equips each transformer layer with a linear-attention branch, jointly optimizes layerwise gates on synthetic long-context retrieval data, then discretizes, distills, and finetunes—achieving strong long-context recall using only 20M selection tokens.

Qwopus-3.6-35B-A3B-Coder-MTP-GGUF

Thinking-off fine-tune for coding-agent workflows that prioritizes fast next-step decisions, lower token usage and stable multi-turn tool calling. Highlights: MoE 35B base, MTP speculative decoding, SWE-bench 62.4% (300 cases). Best for local agent loops and automated debug cycles; requires disciplined harnessing and schema consistency.

LongCat-2.0

A large-scale MoE language model for agentic coding and long-context tasks, natively supporting 1M-token context and dynamically activating tens of billions of parameters per token. Uses sparse attention and zero-computation experts to allocate compute per-token; model weights planned for release.

Securing the AI Agent: A Unified Framework for Multi-Layer Agent Red Teaming

Matches detection paradigms to four stratified attack-surface layers of AI agents — infrastructure, protocol/tool, agent behavior, and model — and presents AI-Infra-Guard: an open-source red-teaming framework with rule-based infra scanning, LLM-driven audits of MCP servers and skill packages, and a jailbreak/attack-operator harness.

AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation

Trains a transformer-based graph encoder with RL-guided adaptive masking so retrieved subgraphs embed relationships that better align with frozen LLM text encoders, improving GraphRAG performance with non-parametric retrievers on GraphQA benchmarks.