datachain_ai

The Ogita-Aishima iterative refinement algorithm for SVD is based on matrix-matrix multiplication, making it an attractive approach for GPUs. We extend the algorithm to complex arithmetic, and introduce robust cluster handling based on Wedin's perturbatio

Abstract page for arXiv paper 2603.24755: SlopCodeBench: Benchmarking How Coding Agents Degrade Over Long-Horizon Iterative Tasks

Talos was built to help resolve a major bottleneck in genomic medicine: human review time. The open-source system recovered 90% of in-scope diagnoses while surfacing just 1.3 candidate variants per patient for expert review.

In January, OpenAI published how it built an internal data agent that thousands of employees now use to ask questions of company data in plain English. Yesterday, Anthropic published how it built one too. Two frontier labs, ...

Editing is writing is editing; or, how to write smarter than you are

Mirelo SFX 1.6 brings iteration to sound: longer generations, extension, seamless loops, and inpainting-so you can revise audio the way craft demands, without starting from scratch every time.

This cookbook is about closed-loop agent workflows: agents that produce an output, validate it, and use the feedback to improve the next pas

Abstract page for arXiv paper 2603.21331: AutoKernel: Autonomous GPU Kernel Optimization via Iterative Agent-Driven Search

Code agents are real. The current harnesses (Claude Code, Cursor, Codex) are a different product class from a year ago: a recent r/LocalLLaMA experiment moved a 9B Qwen from 19% to 46% on the same benchmark just by switching scaffolds. The harness pulls a