Search: “algorithmic-feeds”

NeoHorse-1: Towards Recursive Self-Improvement via Agentic Post-Training with Routing Harness

NeoHorse-1 introduces agentic post-training with intelligent routing that lifts agent benchmark scores at 4B and 9B scales, prototyping recursive self-improvement.

NeoHorse-1 is a family of agent-native models trained through agentic post-training: routing-harness logs (predicted capability demand, service tier, interaction) become structurally validated training data organized into a three-stage SFT curriculum plus routing-guided on-policy distillation. Capability-guided allocation converts evaluation feedback into the next training mixture, closing an evaluation-selection-update loop. Post-training raises the macro-average from 58.94 to 64.87 at 4B and from 65.60 to 69.04 at 9B across eleven agent, tool-use, coding, and instruction-following benchmarks. The authors position it as a prototype of harness-mediated recursive self-improvement.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI research1

Explainability Assistant: A Conversational XAI Interface for Interpreting Energy Consumption Models

Researchers release Explainability Assistant, an open-source conversational XAI tool using LLM function calling, lifting intent-parsing accuracy from 76.8% to 94%.

The paper introduces the Explainability Assistant, an open-source conversational XAI system for interpreting energy consumption forecasting models such as genetic-programming symbolic regressors. It uses LLM function calling instead of rigid custom grammars, achieving 94% intent-parsing accuracy versus 76.8% for prior work TalkToModel, and adapts to different ML problem types without task-specific fine-tuning. Comparative evaluation with energy domain specialists against a traditional XAI dashboard showed improved usability, with all experts preferring the conversational interface.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:40 UTC · 6d agoAI research1

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 papers·Sep 2, 20:00 UTC · 14d agoAI research

Design Docs Are All You Need: An AI-native Machine-Learning Performance Tool

Researchers present SMART, an ML performance-modeling library regenerated by AI coding agents from natural-language design docs instead of code.

The paper describes SMART, a symbolic performance-modeling library whose main branch contains almost no code: the repository is a DAG of self-contained design documents, and coding sub-agents regenerate implementations from only the docs on version updates. Reliability rests on a worked-example doc style used as in-context demonstrations and a minimal operator IR with SymPy cost expressions, offering both fast analytical roll-up and fine-grained modulo-scheduling modes. Regenerated implementations reproduce hand-audited reference models, including DeepSeek-V3 serving on a TPU pod slice, to round-off precision.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:08 UTC · 12d agoAI research1

Opaque recurrence, and other AI terms that you should probably know

TechCrunch updates its plain-English glossary defining common AI terms from AGI and agents to chain-of-thought reasoning.

TechCrunch maintains a regularly updated glossary of AI terminology, defining terms such as AGI, AI agents, API endpoints, chain of thought, coding agents, compute, deep learning, and diffusion. It highlights 'opaque recurrence', the reasoning technique in OpenAI's new Astra model that has drawn attention from AI safety researchers. The piece is an educational living document rather than new research or a product announcement.

TechCrunch · AI·Sep 7, 19:24 UTC · 9d agoAI industry1

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Researchers introduce Procedural Graphs, self-evolving (procedure, relation, procedure) structures guiding LLM agent tool use and planning.

Procedural Graphs organize procedural knowledge into (procedure, relation, procedure) triplets to guide LLM agent actions, addressing drift such as lost objectives, out-of-order tool calls, and repeated unproductive steps. At each decision step the framework localizes the active node and a guidance model translates the surrounding subgraph into step-level situational guidance. An LLM refiner edits graph topology by contrasting failed with successful trajectories, and across datasets, task types and LLMs the approach outperforms memory-based baselines and matches or surpasses hand-designed graphs.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 8d agoAI research1

Distill Globally, Adapt Locally: Reasoning Distillation and Product-Type Test-Time Training for Scalable Trade-Up Recommendation

A distillation framework compresses LLM reasoning into a 15.5M-parameter trade-up recommendation model reaching AUC 0.941 with product-type test-time training.

The paper targets trade-up recommendation, which identifies higher-quality alternatives that preserve customer purchase intent. A retrieval-augmented few-shot LLM teacher generates labels and rationales that supervise a compact embedding-pair classifier; at inference the 15.5M-parameter student uses only two precomputed 768-dimensional embeddings with no LLM calls. On 8,352 annotated pairs, label-only training scored AUC 0.912, reasoning distillation reached 0.924, and product-type test-time training lifted it to 0.941 with average precision 0.940. The distilled student is roughly 5,000x faster and 10,000x cheaper than direct LLM inference on a 100K-pair proxy catalog.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:08 UTC · 12d agoAI research

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Procedural Graph framework stores procedural knowledge as triplets and self-evolves via LLM refinement, beating memory-based baselines across datasets, tasks, and LLMs.

The Procedural Graph organizes procedural knowledge into (procedure, relation, procedure) triplets; at each decision step the framework localizes the agent's active node and a guidance model translates the surrounding subgraph into step-level guidance that biases the solver's next action. An LLM refiner contrasts failed with successful trajectories and edits the graph's topology and attributes, retaining rejected edits to discourage repetition. Starting from a minimal skeleton, the loop builds graphs that match or surpass hand-designed ones and can repair flawed expert priors, delivering consistent gains over memory-based baselines across multiple datasets, task types, and LLMs.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI research1

From Concept to Context Engine: How Wiz Built AI-Powered Data Discovery

Wiz details the multi-agent pipeline and feedback loops that evolved its bucket scanner into AI-powered data discovery.

Wiz published an engineering write-up on building its AI-powered data discovery capability, tracing the evolution from a bucket scanner to a context engine. The post explains the multi-agent pipeline and feedback loops behind the system. The article is a vendor engineering deep-dive with no disclosed vulnerabilities, incidents, or exploitation activity.

Wiz Blog·Aug 27, 15:52 UTC · 20d agoTools1

PARSER: Read in Parallel, Reason in Depth for Long-Context LLM Agents

PARSER uses parallel reader subagents and an RL-trained lead agent for long-context QA, beating baselines and cutting latency up to 11x.

The PARSER paper decouples reading from reasoning: frozen subagents each read one document chunk in parallel while an RL-optimized lead agent iteratively broadcasts queries and aggregates evidence in scatter-gather rounds. On multi-hop QA with 7K to 896K token contexts, a 4B-backbone PARSER beats the strongest sequential memory baseline by 5.7 points on average and 12.0 points at 896K tokens, and a 9B version surpasses DeepSeek-V4-Pro by 6.3 points. Controlled experiments show robustness to evidence position, order, and distance perturbations, with inference latency reduced by up to 11x.

Hugging Face daily papers·Sep 5, 20:00 UTC · 11d agoAI research1

Dream-RSI: Recursive Self-Improvement through Evolving Worlds

Dream-RSI refines exploration policies by dreaming in replay simulators built from discovery history, cutting discovery costs across coding tasks.

Dream-RSI is a framework for scalable recursive self-improvement in autonomous coding agents, where a lightweight orchestration layer makes exploration explicit and programmable while leaving the underlying agent unchanged. Its core insight is that accumulated discovery history can serve as a replay simulator over the realized search space, providing immediate, low-cost off-policy feedback to evaluate and refine exploration policies without expensive online evaluations. Across algorithm engineering, mathematical optimization, and GPU kernel engineering, Dream-RSI achieves competitive or improved discovery quality at substantially reduced cost.

Hugging Face daily papers·Sep 13, 20:00 UTC · 3d agoAI research

Coupled Calibration and Learning: Mitigating Teacher Bias in LLM Distillation without Target-Domain Reward Feedback

CCL couples teacher calibration with student updates via token-level branching, provably removing teacher bias in LLM distillation.

The paper proposes Coupled Calibration and Learning (CCL), an LLM distillation algorithm that alternates teacher calibration using source-question reward feedback with student training on target questions under covariate shift. Each iteration calibrates the teacher on source feedback, trains the student on target questions, and lets the updated student inform subsequent calibration. The authors prove the student's expected KL divergence to the oracle student converges to zero at a polynomial rate, and show regularized direct matching error can remain bounded away from zero.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:15 UTC · 1d agoAI research

FST Pay: Deterministic Safety-Gated Architecture for Youth Digital Payments

FST Pay proposes a deterministic safety-gated architecture for teen digital payments, pairing invariant authorization checks with decoupled post-settlement AI explanations.

Researchers propose FST Pay, a formal architecture for adolescent digital payments on rails like UPI that applies six deterministic invariant checks (spending limits, guardian co-sign policies, amount thresholds, merchant category codes, temporal intervals, hardware integrity) to classify transactions as ALLOW, REVIEW, or BLOCK. High-risk transactions trigger an asynchronous guardian co-sign workflow. Generative AI is restricted to post-settlement natural-language insights and holds no mutation privileges over the ledger, avoiding non-determinism on the real-time authorization path.

arXiv cs.CR·Sep 10, 08:03 UTC · 6d agoResearch

AI models' written reasoning steps correspond to distinct internal patterns, a new study finds

KAIST and Naver AI Lab researchers show LLM reasoning steps like extraction and computation map to distinct activation patterns, strongest in middle layers.

Researchers at KAIST and Naver AI Lab defined eight recurring reasoning operations, including extraction, decomposition, formula recall, deduction, and computation, and showed they correspond to separable activation patterns in Qwen2.5-7B, Qwen3-8B, and Gemma4-31B on math tasks, with GPT-5 labeling solution segments. The separation peaks in middle layers, holds even when a computation step produces a wrong answer, and goes beyond surface-level token choice. Findings replicated on Llama-3-8B, and classifiers trained on Qwen3-8B transferred to GPQA-Diamond and MATH-500. The authors note that using internal states for error detection or mid-generation steering remains future work.

The Decoder·Sep 12, 13:39 UTC · 4d agoAI research2

ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents

ScienceBuddy couples harness evolution with model reinforcement learning so scientific agents continually self-improve from researcher feedback in an interactive workspace.

The authors release ScienceBuddy, an interactive scientific research workspace that transforms researcher requests, feedback, and execution evidence into tasks and evaluation rubrics for continual learning. Its recursive-in-recursive self-improvement paradigm couples harness evolution (inner recursion, model fixed) with model reinforcement learning under the improved harness (outer recursion). Case studies span four scientific task families, and the system is released to the scientific community as a research product.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:55 UTC · 1d agoAI research 2 sources

Why you should work on AI for AI Research — Richard Socher of Recursive

Richard Socher's new lab Recursive, backed by $4.65B seed, targets AI systems that automate AI research itself.

Latent Space interviews Richard Socher, founder of You.com and AIX Ventures, about his new venture Recursive, which raised a $4.65 billion seed round to build the 'Eureka Machine' — a superintelligence for automating invention and AI research. Early claimed results include an AI research system outperforming humans and their agents on optimization tasks within two days, and NVIDIA GPU kernel improvements discovered without CUDA experts. Discussion spans reward hacking, constitutional AI critique, AI regulation, open-source models as geopolitical soft power, and hard-takeoff constraints.

Latent Space·Sep 14, 16:04 UTC · 2d agoAI industry

Benchmark Radar: A Living Database and Search Engine for AI Benchmarks and Evaluation

Benchmark Radar provides a living searchable database of 1,283 AI benchmark records and 12,916 score observations drawn from 37 daily discovery sources.

Benchmark Radar combines daily discovery of benchmark papers, repositories, datasets, and releases from 13 direct connectors and 24 first-party feeds into a searchable catalog with model card mentions and score histories. The catalog contains 1,283 source records drawn from 4 benchmark catalogs plus 12,916 numeric observations on 790 records. The release includes a web dashboard with leaderboard, Pareto frontier of score versus usage, saturation and trend views, daily feeds, a CLI, and reproducible analysis. The paper audits the full catalog and examines benchmark saturation and limits of score comparisons.

Hugging Face daily papers·Sep 9, 20:00 UTC · 7d agoAI research

The Last AI Built by Humans: Toward Genuine Recursive Self-Improvement

Position paper defines recursive self-improvement for AI, introduces the Headroom-Closed Index and an autonomy roadmap toward genuine recursive meta-improvement.

The paper uses the Headroom-Closed Index to diagnose limitations of existing LLMs and frames recursive self-improvement (RSI) as a staged roadmap: improvement-execution, improvement-strategy, experience-acquisition, and environment-adaptation autonomy, culminating in recursive meta-improvement. It examines RSI across scientific discovery, embodied intelligence, and software engineering, highlighting differing requirements and development speeds. Drawing on industry practices and preliminary empirical evidence, it connects RSI research with practical systems and identifies key challenges to achieving genuine RSI.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:44 UTC · 6d agoAI research1

Sakana AI Researchers Introduce PC-ALM, a Layer-Local Alternative to Backpropagation That Trains 1000-Layer Networks

Sakana AI's PC-ALM adds per-layer Lagrange multipliers to predictive coding, matching backprop on networks up to 1000 layers with layer-local updates.

Sakana AI researchers propose Augmented Lagrangian Predictive Coding (PC-ALM), a training method that keeps every update layer-local while recovering backprop-aligned credit signals. The team proves multipliers converge to exact backprop adjoints in linear networks and trains 1000-layer residual MLPs on MNIST within about 2 points of backprop accuracy. PC-ALM matched backprop across a width/depth grid from 8 to 128 on MNIST and Fashion-MNIST where standard predictive coding failed in deep, narrow networks, and improved over PC on ResNet-18 with CIFAR-10 and Tiny ImageNet. An MIT-licensed JAX reference implementation reproduces the results on CPU.

MarkTechPost·Sep 14, 20:46 UTC · 2d agoAI research1

AI-Assisted HTTP Terminator Finds Novel HTTP Desync Techniques and Apache Zero

The Hacker News·Aug 7, 11:25 UTC · Aug 7, 2026Exploit / PoCCVE-2026-63078

OmniHarness: Harnessing Generalizable Visual Generation via Symbolic Policy Learning

OmniHarness learns symbolic policies for visual generation agents, reaching a 95.0% resolve rate on ComfyBench Creative tasks, 27.5 points above the strongest baseline.

OmniHarness abstracts verified executions into symbolic policies for visual generation task families, which are instantiated, adapted, and composed for new tasks while model parameters remain fixed. Intermediate verification guides refinement and failure recovery during execution, and self-directed inquiry generates practice tasks near capability limits before downstream objectives are specified. Experiments across six benchmarks, three MLLM backbones, and three visual agent frameworks show strong performance; on ComfyBench Creative tasks it achieves a 95.0% resolve rate, exceeding the strongest baseline by 27.5 percentage points. Frozen policy snapshots improve existing visual agent systems through plug-and-play reuse.

Hugging Face daily papers·Sep 12, 20:00 UTC · 4d agoAI research

Context Engineering Inside the Harness: 4 Mechanisms That Beat Context Overflow and Goal Loss on Long-Horizon Tasks

Survey of four harness mechanisms—context budgeting, compaction, todo-state, and memory—that keep long-horizon LLM agents on task across 200+ tool calls.

The article details how agent harnesses, not larger context windows, solve context overflow and goal loss on long-horizon tasks, citing Chroma's Context Rot report showing 18 LLMs (GPT-4.1, Claude 4, Gemini 2.5, Qwen3) degrade on long inputs. Concrete implementations include LangChain Deep Agents offloading tool responses over 20,000 tokens to the filesystem and truncating old tool calls at 85% window usage, and Claude Code capping auto memory at 25KB while re-reading the 5 most recently modified files after compaction. OpenAI's Responses API now offers server-side compaction via context_management with a standalone /responses/compact endpoint, which Codex uses for long-running coding tasks. Manus reports a roughly 100:1 input-to-output token ratio per ~50-tool-call task, motivating todo.md state recitation to prevent goal drift.

MarkTechPost·Sep 13, 05:56 UTC · 3d agoAI research1

AdamX: Cosine similarity meets gradient descent

Researchers propose AdamX, a cosine-similarity-based first-order optimizer with variance rectification that matches Adam-class convergence across benchmark datasets and architectures.

The paper introduces AdamX, a first-order optimizer that uses cosine similarity as an adaptive mechanism for controlling update magnitudes, plus a variance rectification scheme for smoother optimization early in training. The method is described as scalable, model-agnostic, and straightforward to integrate into existing pipelines. Empirically, AdamX shows competitive convergence rates measured by epochs to reach performance thresholds under a fixed hyperparameter budget, with code and experiments released on GitHub.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:42 UTC · 6d agoAI research

From assistance to execution: How enterprises put AI to work

OpenAI reports enterprise adoption patterns of agentic AI through ChatGPT and Codex, with frontier firms pulling ahead in deployment.

OpenAI published a report on how enterprises are moving from AI assistance to autonomous execution, focusing on agentic AI deployments. It highlights the use of ChatGPT and Codex in enterprise workflows and argues that frontier firms are pulling ahead of peers in AI adoption. The piece is adoption research and marketing rather than a security disclosure.

OpenAI News·Aug 12, 06:00 UTC · Aug 12, 2026AI industry1

Generalized Agent Iteration: One Formal Framework for Iterative Policy Improvement and Recursive Self-Improvement

Generalized Agent Iteration formally unifies iterative policy improvement and recursive self-improvement, defining axes that distinguish anchored, goal-drifting, and self-referential agents.

The paper proposes Generalized Agent Iteration (GAI), a formal framework that models learning as a cycle of agent evaluation and agent improvement, defining the agent as a configuration of modifiable components. Two dials—whether the improving mechanism is part of the agent and whether the evaluation standard is grounded outside it—separate generalized policy iteration (GPI) from recursive self-improvement (RSI) and classify systems as anchored, goal drift, or fully self-referential. The framework places existing systems on shared axes and makes defects of recursive self-improvement statable one condition at a time.

Hugging Face daily papers·Sep 10, 20:00 UTC · 6d agoAI research

Beyond Solver Verdicts: Generative Reward Models for Autoformalization

Researchers introduce Generative Verification (GenV), a generative reward model achieving 0.961 AUROC in detecting unfaithful autoformalization that preserves solver verdicts.

The paper formalizes Verdict-Preserving-Unfaithfulness (VPU), a failure mode in neurosymbolic autoformalization where an incorrect encoding executes successfully and matches the expected solver verdict, and proves verdict-only verification is bounded to chance-level detection. The proposed Generative Verification (GenV) distills an offline Z3-equivalence oracle into a reference-free, continuous reference-equivalence score within the language model's vocabulary space. The oracle-mined verifier (GenV+HN) achieves 0.961 AUROC, generalizes zero-shot across unseen translators and formal styles, and yields an 11.3-point downstream accuracy gain in agentic test-time compute allocation. Mechanistic analysis with decision-projected logit lenses and sparse autoencoders shows the generative readout extracts precise spatial error coordinates without explicit localization training.

Hugging Face daily papers·Sep 9, 20:00 UTC · 7d agoAI research1

RegionFed: Federated Learning for Personalized Query Understanding in Heterogeneous Retail Environments

RegionFed is a gradient-level federated learning framework enabling personalized retail query understanding while matching centralized accuracy with differential privacy.

RegionFed is an architecture-robust federated learning framework for personalized query understanding that operates at the gradient level, using the l2 conflict between regional and global gradients to diagnose heterogeneity and control personalization. Existing parameter-level personalized FL methods collapse on transformers, falling below 10% accuracy on T5, while RegionFed deploys unchanged on T5-Small, T5-3B, RoBERTa, and CNNs. RegionFed-Meta achieves 92.27% across Amazon ESCI, Amazon Reviews, and LEAF-FEMNIST, within 0.23 percentage points of the centralized upper bound, with epsilon-approx-0.60 differential privacy.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:50 UTC · 12d agoAI research1

Wazuh and AI For Enhanced SOC Workflows

Wazuh details AI-powered SOC workflows via its AI Analyst, self-hosted Llama 3 via Ollama, and Claude 3.5 Haiku integrations.

Wazuh outlines how AI can augment SOC analysts handling high alert volumes. The Wazuh AI Analyst on Wazuh Cloud uses Amazon Bedrock and Anthropic Claude to generate scheduled security posture reports. Self-hosted options include Llama 3 with Ollama, FAISS, and LangChain for privacy-sensitive threat hunting, plus an OpenSearch Assistant integration with Claude 3.5 Haiku. This is a vendor-contributed piece describing product capabilities rather than an incident or vulnerability.

The Hacker News·Aug 21, 11:21 UTC · 26d agoTools

Zscaler Agentic SOC combines AI agents with zero trust telemetry

Zscaler launched Agentic SOC, an AI-agent-driven security operations platform combining zero trust telemetry with frontier models from Anthropic and OpenAI.

Zscaler announced Agentic SOC, a security operations platform built around specialized AI agents for triage, root-cause investigation, verdict assignment, and automated threat containment. The platform pairs Zscaler's zero trust telemetry, drawn from roughly 750 billion daily transactions and a large decoy mesh network, with frontier models from Anthropic and OpenAI plus proprietary threat intelligence. It features closed-loop inline remediation that can isolate compromised users, block command-and-control traffic, and cut off lateral movement, alongside a context graph that correlates third-party data. Continuous threat hunting combines AI automation with human experts from Zscaler and Red Canary, and customer Maire Tecnimont is cited as an early adopter.

Help Net Security·Sep 9, 10:09 UTC · 7d agoTools

ConvMem: Convolutional Memory for Long-Context Reasoning

Researchers propose ConvMem, a training-free framework treating LLMs as convolutional kernels for parallelizable long-context reasoning beyond fixed context windows.

ConvMem reformulates long-context reasoning as a hierarchical convolution in which the LLM summarizes text segments hierarchically, shortening the reasoning path from a linear chain to a logarithmic tree. It uses configurable strides, skip connections, and multi-kernel convolution to capture evidence, decompose queries, and enable massive parallelization across segments and reasoning threads. On RULER-HotpotQA and RULER-2WikiMultiHopQA it outperforms training-free baselines and avoids the out-of-distribution overfitting seen in RL-trained approaches like MemAgent.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:53 UTC · 7d agoAI research