Search: “SIFT1M”

30 stories

DomainAll Cyber AIWindow24h 3d 7d 30d AllIn the wild Important only Show duplicates

SeverityAll critical 0 high 0 medium 0 low 0 info 1

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

[AINews] DeepSeek v4.1-Flash: 763B-P8B-D16B novel causal Encoder–Decoder architecture with vision marks the Return of the Whale

DeepSeek released V4.1-Flash, an open-weight 763B-parameter model with a novel causal encoder-decoder architecture, 1M context, vision input, and MIT license.

DeepSeek launched V4.1-Flash, an open-weight MIT-licensed model using a novel causal encoder-decoder architecture with 763B total parameters and asymmetric active parameters: 8B for prefill and 16B for decode. It supports 1M-token context and text+image input, priced at $0.30 per 1M input and $1.20 per 1M output tokens with a 50% off-peak discount. Artificial Analysis scored it 40 on its Intelligence Index, above DeepSeek V4 Pro 0813, and Vals ranked it the #1 open-weight model ahead of Kimi K3. Baseten shipped day-0 support and Ollama began rolling it out to paid subscribers.

Latent SpaceSep 12, 05:56 UTC · 4d agoModel release 7 sources1

Atlas: Efficient Verifiable Semantic Search

Atlas delivers zero-knowledge proofs for HNSW semantic search, verifying RAG retrieval in under a second on SIFT1M and 2.0 seconds at 100M vectors.

Atlas lets a search provider prove that a query was answered correctly against a committed HNSW index without revealing the index, addressing provider deviations like truncation or bias. It combines offline preprocessing, a fixed-size-state restructuring of HNSW with a correctness proof, and timestep-tagged batching of per-step arguments. The system proves queries in under a second on SIFT1M and 2.0 seconds at 100 million vectors while preserving plaintext HNSW recall, and proven retrieval maintains end-to-end RAG answer quality at lower cost than prior verifiable retrieval systems.

arXiv cs.CRSep 10, 17:30 UTC · 5d agoResearch1

ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search

ZGCM-1 is a fully open 7B foundation model with 256K context that stays competitive with frontier models on math reasoning and agentic search.

ZGCM-1 is a fully open 7B dense foundation model trained from scratch using an efficiency-focused recipe: interleaved gated sliding-window and full attention, a stable FP8 Muon optimizer, and MDP-based mid-training with context scaling across 16K, 64K, and 256K. On mathematical reasoning and agentic search suites it remains competitive with much larger frontier models such as Qwen3-235B-A22B and GLM-5.1. The recipe yields a ~4.2x improvement in 16K pre-training time-to-loss, and all weights, checkpoints, training code, data recipes, and W&B logs are open-sourced.

Hugging Face daily papersSep 10, 20:00 UTC · 5d agoModel release

Speculative Decoding in vLLM on AMD GPUs

vLLM benchmarks speculative decoding on AMD Instinct MI300X and MI355X GPUs across five drafting methods including EAGLE-3 and native MTP.

The vLLM project documents draft-and-verify speculative decoding support for AMD GPUs via ROCm, comparing native MTP, Gemma 4 MTP, EAGLE-3, DFlash, and DSpark drafting approaches. Output-token throughput effects varied with drafting method, proposal length, model family, draft checkpoint, workload, and acceptance behavior. The post also covers how to enable each method plus practical tuning and observability considerations.

Hacker News · AISep 7, 09:26 UTC · 9d agoAI tools & infra HN 141↑ · 52 comments1

Decomposition-Guided Diffusion Language Models for Inertial Confinement Fusion Prediction

ICF-DLM, the first language-model-based inertial confinement fusion predictor, cuts peak-timing error from 11.6 to 9.2 steps versus LLaMA-3-8B.

Each National Ignition Facility shot costs roughly one million dollars, motivating accurate AI surrogates for predicting 512-step neutron-rate waveforms from laser pulses and target parameters. ICF-DLM combines physics-typed decomposition into yield, peak timing, and local waveform; bidirectional denoising that defers commitment to peak location; and a physics-driven PPO reward. On ICFBench (50,000 simulations plus 232 experimental shots) it outperforms a matched autoregressive LLaMA-3-8B, classical sequence models, and LLM-based time-series predictors.

arXiv cs.AI / cs.LG / cs.CLSep 7, 17:00 UTC · 8d agoAI research

MicroHasTEE: Bare-Metal Haskell for Type-Level Peripheral Ownership on Armv8-M

MicroHasTEE expresses TrustZone secure and non-secure firmware as one typed Haskell program, catching peripheral-ownership inconsistencies at compile time.

MicroHasTEE is a multiparty Haskell framework that models both TrustZone firmware images as participants in a single typed program, using type-level capability ledgers to track peripheral acquisition, configuration, transfer, and finalization. MicroHs compiles the shared program twice to produce separate bare-metal Secure and Non-secure firmware images. The framework rejects inconsistent resource use, post-configuration attribution changes, wrong-domain callbacks, and calls to unregistered Secure services. A door-lock case study on an STM32U5 Nucleo board produced images of 232.7 KiB and 228.4 KiB of flash with roughly 220 KiB of SRAM per domain.

arXiv cs.CRSep 11, 08:34 UTC · 5d agoResearch1

Nearly 1 in 10 Exposed LiteLLM Gateways Accepted the Example "sk-1234" Admin Key

Wiz found 294 of 3,074 internet-facing LiteLLM gateways accepted the documented default admin key sk-1234, exposing provider API keys and cloud IAM credentials.

Wiz Research's February Shodan scan found 3,074 LiteLLM gateways, 294 of which accepted the setup guide's sk-1234 admin key; 191 had no master key set and would accept any credential. The master key doubles as the authentication switch, and before 1.82.0-stable a gateway started without one granted every request full admin rights, exposing stored provider API keys, prompts, and MCP-connected tools. A documented pass-through endpoint lacks checks against private and cloud metadata addresses, letting an admin-key holder retrieve cloud IAM credentials, though no real-world abuse is reported. Related LiteLLM flaws include CVE-2026-59821 (disputed guardrail code execution), CVE-2026-59822 (CVSS 8.8, added to CISA KEV on September 2 and observed against Wiz honeypots), and CVE-2026-42271, used to install a cryptominer.

The Hacker Newsupdated Sep 10, 12:56 UTC · 6d agofirst Sep 10, 07:12 UTC · 6d agoVulnerability in the wild 4 sources CVE-2026-59821 CVE-2026-59822 CVE-2026-42271+2 CVEs

Fly Language Model (FLM) Wires the Full Fruit Fly Connectome Into a Frozen 1.2B LLM, and Its Own Controls Show the Wiring Does Not Help

Researchers wire the full fruit fly connectome (166,700 nodes) into a frozen LiquidAI LFM2.5-1.2B LLM, but controls show no fly-specific benefit.

The Fly Language Model (FLM) couples the complete MaleCNS v1.0 fruit fly connectome (166,700 nodes, 25,582,938 edges) to a frozen LiquidAI LFM2.5-1.2B-Instruct backbone, training only a 278,528-parameter readout (~0.0238% of backbone parameters). The fly readout improved NLL by 0.0222 nats/token (perplexity 3.98 to 3.90) on 32 SmolTalk dialogues, but a direct-input control without the graph beat it in all three seeds. Relabeling node identities removes the gain and the recurrence contracts state differences by 0.6 per token, so the connectome adds no long-range memory. The MIT-licensed code runs locally on Python 3.12, but study artifacts remain private, limiting independent reproducibility.

MarkTechPostSep 12, 18:51 UTC · 3d agoAI research1

Implementing a White-Box Undetectable Backdoor for Random Fourier Features

Researchers implement Goldwasser's CLWE-based undetectable backdoor for Random Fourier Features models in numpy/scipy, confirming practical realizability with no detectable differences from clean models.

The paper provides an end-to-end implementation of the Goldwasser et al. white-box undetectable backdoor for models trained with the Random Fourier Features algorithm, using only numpy and scipy. It derives two samplers for the core GP_d(b_k) distribution: a rejection-sampling proxy and an exact closed-form sampler verified against its analytic form. Statistical indistinguishability tests covering weight-space and functional black-box comparisons found no detectable difference between backdoored and clean models across sparsity ratios. The underlying lattice hardness reduction was not reproduced, and the work demonstrates the threat is realizable with commodity scientific-computing tools rather than specialized cryptographic infrastructure.

arXiv cs.CRSep 14, 22:18 UTC · 1d agoResearch

Adaptive Gated Deepfake Detection for Low-Resolution and Resource-Constrained Environments

AdaGate-DF routes deepfake detection by image quality through dual multi-exit gates, hitting 0.9370 AUC on Celeb-DF with low inference latency.

AdaGate-DF is an adaptive gated deepfake detection framework that uses image-quality cues to send high-quality images through earlier exits, saving compute in resource-constrained settings. On Celeb-DF it achieves an AUC of 0.9370, outperforming MaD-CoRN and DefakeHop++, and reaches 0.9708 at 384x384 resolution. On FaceForensics++ it remains effective under class imbalance while balancing uncertainty-aware prediction and computational efficiency.

arXiv cs.AI / cs.LG / cs.CLSep 4, 16:14 UTC · 11d agoAI research

Litelm: LiteLLM Without the Bloat

New open-source project Litelm launched on GitHub as a leaner alternative to the LiteLLM multi-provider LLM gateway.

Litelm is a community-published GitHub project positioned as a stripped-down alternative to LiteLLM, a widely used gateway/SDK for routing requests to multiple LLM providers. The post drew modest attention on Hacker News with 45 points and 17 comments. The listing provides no further technical details, benchmarks, or feature specifics.

Hacker News · AISep 11, 18:10 UTC · 4d agoAI tools & infra HN 45↑ · 17 comments2

Foundation Models for Generalizable Semantic and Goal-Oriented Communication

FMSGOC uses vision-language foundation model priors plus diffusion reconstruction to enable generalizable semantic communication at 0.039 bits per pixel for 6G.

FMSGOC targets generalization failures in semantic and goal-oriented communication for 6G by leveraging broad visual-linguistic foundation model priors. A vision-language model selects sparse, goal-aligned semantic anchors while a fine-tuned diffusion model performs masked completion to reconstruct images at the receiver, decoupling what to send from how to reconstruct. On CIFAR-10 it reaches 0.039 bits per pixel with cosine similarity 0.87-0.90 and 0.83-0.86 on unseen ImageNet inputs, outperforming end-to-end baselines at lower bit rates.

arXiv cs.AI / cs.LG / cs.CLSep 7, 18:12 UTC · 8d agoAI research

Model-Aware Schedules Improve Generation via Fiberwise Optimal Transport

Researchers introduce model-aware diffusion schedules via fiberwise optimal transport, cutting flow-matching FID on CIFAR-10 by 38.6% at 16 function evaluations.

The paper proposes constructing diffusion and flow-matching sampling schedules from a fiberwise prediction risk defined via optimal transport, combined with coefficient-path kinetic action, yielding a closed-form time allocation. Across DDPM and flow-matching experiments spanning targets, datasets, and architectures, the schedules beat model-agnostic baselines, including a 38.6% relative FID reduction for flow matching on CIFAR-10 at 16 function evaluations. Normalized fiberwise-risk profiles from independently trained models align closely, suggesting empirical universality, and a frozen analytic allocation template retains most of the gains.

arXiv cs.AI / cs.LG / cs.CLSep 10, 17:30 UTC · 5d agoAI research

No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation

Prototype binary lifter brute-force lifts every byte offset of x86-64 binaries to LLVM IR, enabling fully static cross-ISA recompilation without runtime support.

The paper presents a fully static, whole-program binary lifting system that treats every byte offset as a potential branch target, constructing a superset control flow graph that conservatively contains all feasible control flows. Statically unresolvable computed branches are reduced to lookups in a dispatch table pointing to translated control flow paths, eliminating runtime translation machinery on the target machine. A prototype recompiles x86-64 binaries to LLVM IR with no code/data heuristics and achieves fully static cross-compilation to AArch64 using unmodified LLVM backends.

arXiv cs.CRSep 14, 23:00 UTC · 1d agoResearch

The Coding-Agent Trap: When a "Free" LLM Endpoint Is the Adversary, (Mon, Aug 31st)

A SANS honeypot caught a real coding-agent session routed to a rogue "free" LLM endpoint, exposing a Windows user's transcript and tool outputs.

A SANS analyst describes how an internet-exposed inference honeypot was discovered, relabeled with sought-after model names like DeepSeek, and enrolled in infrastructure serving "free" LLM backends. On 2026-08-30 an opencode terminal coding agent sent an 88-message, 224 KB transcript 210 times in 91 seconds via a China Unicom relay, exposing directory listings, tool outputs and read file portions. The analyst frames tool-enabled agents treating model endpoints as trusted control planes as a novel risk — a "rogue model endpoint" that could request tool executions on the user's machine.

SANS Internet Storm CenterAug 31, 20:00 UTC · 15d agoAI safety & security1

Unlocking Lossless Speedups in LLMs via Discrete Diffusion

Uno pairs autoregressive LLMs with lightweight diffusion weights to draw multiple tokens in parallel, delivering up to 3x lossless speedup without a draft model.

The paper introduces diffusion-augmented LLMs: autoregressive weights trained with the standard next-token objective plus lightweight diffusion weights trained via a Diffusion Distillation phase to emit multiple tokens in parallel. Psi-Spec samplers enable lossless acceleration without the separate draft model required by speculative decoding. The 8B Uno model outperforms the 26B open DiffusionGemma and proprietary Mercury 2 on agentic tool use, coding, and long-context reasoning benchmarks, with up to 3x throughput gains over the base model at all evaluated batch sizes. Code and checkpoints are released publicly.

Hugging Face daily papersSep 2, 20:00 UTC · 13d agoAI research

Prior Labs Releases TabPFN-3.5: A Tabular Foundation Model That Beats the Winning Otto Kaggle Solution With Default Settings

Prior Labs releases TabPFN-3.5, a 220M-parameter open-weights tabular foundation model that beats the 2015 Otto Kaggle winning score with default settings.

Prior Labs released TabPFN-3.5, a tabular foundation model that predicts in a single forward pass without per-dataset training or tuning. The base model grew from 53M to 220M parameters with a single multitask checkpoint, learned Fourier features, and in-context ECDF rank encodings. It scores 0.375 on the 2015 Otto Kaggle private leaderboard versus the winning 0.382 and claims first place on seven tabular benchmarks including TabArena and BeyondArena. Open weights cover the base, Fast (84M), and Thinking variants, but production use requires the Prior Labs API or a commercial license.

MarkTechPost06:52 UTC · 7h agoModel release

CodeTD: Topology of Attention Detects Hallucinations in Code LLMs

CodeTD detects hallucinations in code LLMs before execution by analyzing topological patterns of attention maps, outperforming recent baselines.

CodeTD applies topological data analysis (TDA) to code LLM attention maps to quantify prompt-generation mismatch as a pre-execution correctness signal. Experiments cover HumanEval, MBPP, BigCodeBench, and MultiPL-E across 5 programming languages and 10 code LLMs up to 34B parameters. The method outperforms recent baselines and transfers between coding benchmarks, helping catch code that fails the task or embeds security vulnerabilities.

arXiv cs.AI / cs.LG / cs.CLSep 7, 17:26 UTC · 8d agoAI research1

AlphaGenome Atlas: A predictive map of every possible DNA letter change in the human genome

Google DeepMind released AlphaGenome Atlas, a free 1-petabyte platform predicting the molecular effects of all ~9 billion possible single-letter DNA variants.

Google DeepMind introduced AlphaGenome Atlas, containing precomputed predictions for the effects of roughly 9 billion single-nucleotide variants across the human genome, spanning hundreds of human and mouse cell types. The 1-petabyte dataset is more than 30 times larger than the AlphaFold Database and includes an AlphaGenome Variant Impact (AVI) score combining AlphaGenome and AlphaMissense predictions for both coding and non-coding regions. External collaborators have already used it to identify and experimentally verify variants in unsolved rare disease research. It is available via a free web portal, the AlphaGenome API, and as a skill in Google Antigravity.

Google DeepMindSep 8, 14:00 UTC · 8d agoAI research 2 sources

Nums AI Releases Causilo: A Tabular Foundation Model That Tops TabArena Among Single Models

Nums AI released Causilo, an Apache-2.0 tabular foundation model achieving the highest single-model Elo (1794) on TabArena for classification and regression.

Nums AI released Causilo 1.0.1, a pretrained in-context learning tabular foundation model for classification (up to 10 classes) and regression, with Apache-2.0 code and research-only weights on Hugging Face. It achieved the highest single-model TabArena Elo of 1792.9 overall, beating TabFM (1764.4) and EXAONE Tabular (1758.8), and a maintainer re-run placed it 3rd of 88 including system entries. It also ranked first by CRPS, R² and RMSE on ScoringBench across 101 datasets, and was fastest on fit and predict versus TabICLv2 and TabPFN-3 on an H100 GPU at 8.15 GiB memory. The model was pretrained only on synthetic data, uses cross-attention to keep cost linear in feature count, and version 1.0.1 adds quantile outputs via 999 native quantiles.

MarkTechPost04:59 UTC · 9h agoModel release

Discovery Foundation Models: Toward Open-Ended Discovery Intelligence

Paper defines Discovery Foundation Models with seven coupled capabilities for open-ended discovery, demonstrated via Zetema and GALILEO systems.

The paper formulates Discovery Foundation Models (DFMs) as general-purpose model systems for open-ended discovery, supporting seven coupled capabilities spanning problem discovery, formulation, representation construction, hypothesis formation, intervention, evidence-grounded revision, and continual improvement. It instantiates the framework with Zetema, which couples explicit research-state dynamics, verification and experimental gating, and cross-task Discovery Skill evolution. The framework is grounded with GALILEO, a real therapeutic-discovery system combining dry-lab reasoning with robotic wet-lab experimentation in a closed physical discovery loop; code is released on GitHub.

Hugging Face daily papersupdated Sep 14, 17:56 UTC · 1d agofirst Sep 13, 20:00 UTC · 2d agoAI research 2 sources

Reference-Based Bias Detection in LLMs via Relative Representations of Hidden States

Researchers propose auditing LLM bias via relative hidden-state representations, detecting bias increases with 3-50x less compute than output-level benchmarks.

The paper introduces a reference-based bias auditing method that compares hidden-state representations across model variants, such as before and after fine-tuning, by encoding sentences relative to a fixed anchor set. The resulting Representational Bias Shift (Delta-B) correlates with output-level bias change in 15 of 18 tested settings, reaching |r| = 0.84 under full fine-tuning across WildGuardMix, DecodingTrust, and ToxiGen benchmarks. Thresholding Delta-B detects checkpoints whose bias increased with ROC AUC between 0.65 and 0.99 and beats a SEAT-based baseline, while auditing a model in about three minutes with 3-50x less compute.

Hugging Face daily papersSep 8, 20:00 UTC · 7d agoAI research

Rethinking Heterogeneous System Disaggregation for Subquadratic Attention

SQD disaggregates LLM inference by quadratic versus subquadratic attention layers, improving energy efficiency up to 56% on heterogeneous systems versus GPU-only baselines.

SQD (SubQuadratic Disaggregation) splits decode not by operator type but by quadratic versus subquadratic attention, matching their distinct arithmetic intensity and memory footprints. For sparse attention LLMs it separates top-k selection (requiring full KV indexing) from top-k attention plus FFN; for linear and sliding-window models it separates dense attention layers from subquadratic layers plus FFN. On an adjusted 8xB200 heterogeneous proxy, tokens-per-joule improves 53% on GLM 5.2, 31% on Nemotron 3 Ultra, and 56% on Gemma 4 31B. A Rubin plus LPX analytical model shows 1.2x-1.5x tighter achievable latencies and up to 3.6x higher throughput versus attention-FFN disaggregation.

arXiv cs.AI / cs.LG / cs.CLSep 11, 17:55 UTC · 4d agoAI research

To keep the AI hacking genie bottled up, try one-way networks

Intuition Machines CEO proposes data diodes and one-way networks to physically prevent frontier AI models from escaping training sandboxes, citing the OpenAI Hugging Face incident.

Eli-Shaoul Khedouri, CEO of Intuition Machines, argues that sandboxes, permissions, and VMs are insufficient to contain frontier models, pointing to OpenAI's hack of Hugging Face as evidence. He proposes high assurance architectures modeled on classified SCIF environments: one-way optical data diodes for training inputs and telemetry, a sel4-verified receiver, immutable snapshots of registries like PyPI, GitHub, and npm, and mocked web services. He estimates under five percent overhead per gigawatt for such clusters, but notes frontier labs have not adopted them, largely because of competitive speed rather than cost.

The Register · SecuritySep 3, 06:33 UTC · 13d agoAI safety & security

OPEN-1B: A Fully Auditable Training Run

Open-1B releases a 1B-parameter model with bitwise-reproducible training, letting independent auditors verify every step of the run on commodity hardware.

The paper introduces a 'fully auditable' tier of model transparency: every training operation is reproducible with bitwise certainty on heterogeneous commodity hardware by imposing definite ordering on GPU kernel reductions, data batch ordering, and collective communication. Because replaying a full run on one machine is infeasible, a collective verification scheme lets many independent auditors certify individual steps covering the whole run. The authors release Open-1B with its full pretraining dataset, every intermediate checkpoint, the training codebase, and an audit harness. This rules out undisclosed data, injected biases, or backdoors that proof-of-learning or proof-of-training-data techniques cannot exclude.

arXiv cs.AI / cs.LG / cs.CLSep 15, 16:23 UTC · 21h agoAI research

OpenBMB Releases MiniCPM5-2B: A 2.52B Dense Model Averaging 53.9 Across 34 Benchmarks and Built to Run On Device

OpenBMB released MiniCPM5-2B, a 2.52B-parameter Apache 2.0 on-device model averaging 53.9 across 34 benchmarks, ahead of Qwen3.5-4B.

OpenBMB released MiniCPM5-2B, a 2,516,756,480-parameter dense LlamaForCausalLM model with grouped-query attention and a 131,072-token context, under Apache 2.0, runnable via vLLM, SGLang, llama.cpp, and Ollama. It averages 53.9 across 34 benchmarks versus 51.1 for Qwen3.5-4B, with strong tool-use (97.1 on tau2-Bench Telecom) and code results (69.1 LiveCodeBench v6, 46.4 SWE-bench Verified). Training combined 400B tokens of deep-thinking SFT, critic-based JustRL II RL teachers, and on-policy distillation merging 16 RL experts; datasets and intermediate checkpoints were published alongside the weights.

MarkTechPostSep 7, 19:18 UTC · 8d agoModel release

Embedded Graph Flows for Categorical Graph Generation

Researchers propose Embedded Graph Flows, a generative model with learned categorical embeddings that beats DiGress and GruM on molecular graph benchmarks.

Embedded Graph Flows (EGF) learns continuous embeddings for node and unordered-edge categories and transports Gaussian noise toward these endpoints using a permutation-equivariant graph transformer. On QM9 it achieves the best result on all four reported metrics, with a Fréchet ChemNet Distance of 0.150 versus 0.717 for DiGress and 0.812 for GruM. On ZINC250k it retains the lowest NSPDK MMD, indicating close agreement with local substructures of reference molecules. Code is released on GitHub.

arXiv cs.AI / cs.LG / cs.CLSep 4, 16:26 UTC · 11d agoAI research1

IFM Releases K2 Horizon: Six Apache 2.0 Models From 0.9B to 375B

MBZUAI's IFM released K2 Horizon, six Apache 2.0 models (0.9B-375B) with open training data, code, and checkpoints, claiming the largest fully open-source launch.

The Institute of Foundation Models (IFM), launched by MBZUAI, released K2 Horizon: six Apache 2.0 models (0.9B, 3.7B, 7B, 32B, 36B-A4B, 375B-A23B) shipping with the ~20-trillion-token pretraining corpus, intermediate checkpoints, training code, and logs, which IFM calls the largest fully open-source launch in AI history. The 375B-A23B scores 70.2 on Terminal-Bench 2.1 and 87.3 on GPQA Diamond; the 7B model posts 70.6 on SWE-bench Verified. New techniques include MoVA, which extends MoE routing into attention (36B total, ~4B active), and Uno, a LoRA adapter giving roughly 3x lossless decoding speedup. IFM's own reward-hacking audit re-scored 375B-A23B from 70.2% to 66.9% after flagging 24 of 712 Terminal-Bench trials.

MarkTechPostSep 7, 05:00 UTC · 9d agoModel release1

A Princeton Researcher Proposes Recurrent Looped Transformer (RLT) that Carries Decoder State across Every Token, Fixing 96 Blocks per Token with Unbounded Temporal Depth

Princeton researcher Yifan Zhang proposes Recurrent Looped Transformer, carrying full decoder state across every token for unbounded temporal depth.

Yifan Zhang's technical report defines the Recurrent Looped Transformer (RLT), pairing a causal encoder with a recurrent decoder whose final output and layerwise sliding-window attention cache carry into every subsequent token with no prompt-response boundary reset. The reference configuration ties 48 encoder and 48 decoder layers, executing 96 logical blocks per token while the state path grows to 48t blocks after t tokens at fixed per-token compute. The report details RL replay contracts that rebuild all states under current parameters and exact prefix snapshots for multi-turn serving, but explicitly reports no measured efficiency, reasoning quality, or scaling results.

MarkTechPostSep 13, 17:02 UTC · 2d agoAI research1

openbmb/MiniCPM5-2B-GGUF — new model trending #30 on Hugging Face

OpenBMB released MiniCPM5-2B, a dense 2B on-device model claiming open-source SOTA among 2B-class models.

OpenBMB released MiniCPM5-2B, the second model in the MiniCPM5 series following MiniCPM5-1B, as a dense 2B Transformer built for on-device and resource-constrained deployment with GGUF weights on Hugging Face. The team claims 2B-class open-source state-of-the-art performance, remaining competitive with 4B-class models in coding, mathematics, long-context understanding, tool use and agentic tasks. The release includes a tech report, GitHub repository and online demo, and is currently trending on Hugging Face.

Hugging Face trending modelsSep 5, 01:44 UTC · 11d agoModel release1