咕噜纪

博主雷达 / @jerryjliu0

Jerry Liu

Jerry Liu

AI开发者与产品

@jerryjliu0

粉丝 8.6万关注 1,616最近同步 10/19 20:37雷达库已收录

CEO、联合创始人 · LlamaIndex

去 X 主页

粉丝趋势近 30 天

10-12 → 10-19:+378最高 8.6万 · 最低 8.6万

近 7 天

数据积累中

情报贡献参与 3 条已上架情报 · 首发 3 条

  • 新产品LlamaIndex 推出企业文档抽取基准 ExtractBench Pro10/19 21:20
  • 新产品LlamaIndex 发布 ExtractBench Pro 基准测试10/17 21:20
  • 新产品LlamaIndex 发布文档抽取基准 ExtractBenchPro10/16 21:21

最近帖子最多 20 条

Jerry Liu
Jerry LiuAI@jerryjliu0·

推进企业级 AI 最重要的挑战之一,是创建能反映企业真实数据和工作流的评估基准——同时又因为隐私/安全限制,不能使用它们实际的数据或工作流 我们看到客户上传了大量长尾的复杂文档用于抽取,这些文档连最复杂的前沿模型都能难倒。 为了创建一个能贴合这种复杂度的、有代表性的基准,我们投入了大量精力搭建了一条合成流水线,它可以挖掘真实的文档模板,同时又能灵活地变化数据,甚至模板和渲染方式。 来看看 ExtractBench Pro 吧!llamaindex.ai/blog/introducing-extractbench-pro 网站:extractbenchpro.ai

机器翻译
Jerry Liu@jerryjliu0

Introducing ExtractBenchPro: the most challenging benchmark for real-world document extraction. We see a massive long tail of document complexity in terms of use cases brought on from our customers, that are completely unsolved from a price-performance standpoint. These include trial balances, well logs, canvass binders, site plan reviews, duty reconciliations, loss runs, and more. Most existing extraction benchmarks are saturated by the frontier models (our cheapest modes now score 93%+ on ExtractBench). So there is enormous economic value in building a complex extraction benchmark that reflects this long-tail of knowledge work. We spent a long time curating the most complex elements that we saw from real world extraction use cases: ✅ Document conventions: containing legends or rules where the rest of the document should be interpreted ✅ Density of internal jargon: specific definitions that must be cross-referenced within a doc ✅ Aggregation and reasoning: beyond returning exact values on a page, infer values derived from aggregating multiple sources of information ✅ Drawn relations: complex diagrams like procedures and circuits ✅ Charts inside documents: read precise points within a chart ✅ Long chart sheets: some data series like well logs cram all this data into an extremely long page Within the industries where document extraction is relevant, even small mistakes can have enormous negative impacts. Therefore our headline evaluation metric is based on perfect documents: the proportion of docs with perfect (100%) value f1 score. (Besides this we also measure value f1 and grounded f1) It’s an extremely hard task for even the latest frontier models to solve, topping out at ~58% or so in Value F1 score for Codex with Astra - which is quite good but extremely expensive (almost $1 per page!) Our LlamaParse agentic/agentic plus modes are 20-40% and cover the left side of the Pareto frontier, at price ranges that are feasible for full production use. ExtractBenchPro is available today as a website/technical blog, and also on Github and HuggingFace. Check it out! Blog: llamaindex.ai/blog/introducing-extractbench-pro Website: extractbenchpro.ai/ Hugging Face: huggingface.co/datasets/llamaindex/ExtractBenchPro Github (is ExtractBench): github.com/run-llama/ExtractBench

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

现在有海量复杂的 PDF 文件。 每个 PDF 都是一个自成一体的知识工作环境,人类可能需要花上几个小时来阅读、分析并综合一份文档,才能完成自己的任务。 @llama_index 是一家致力于推动文档工作前沿的研究实验室。ExtractBench Pro 是我们最新的成果,旨在从最难的文档中进行提取,在准确率和成本上都做到前沿水平。即便前沿智能在算力充足时开始无所不能,要极快、极迅速地解决任何文档工作,仍然存在巨大的机会。 如果你还没看过,去看看 ExtractBench Pro:llamaindex.ai/blog/introducing-extractbench-pro 如果你想从旧有方案迁移出来,来跟我们聊聊!llamaindex.ai/contact

机器翻译
Jerry Liu@jerryjliu0

Introducing ExtractBenchPro: the most challenging benchmark for real-world document extraction. We see a massive long tail of document complexity in terms of use cases brought on from our customers, that are completely unsolved from a price-performance standpoint. These include trial balances, well logs, canvass binders, site plan reviews, duty reconciliations, loss runs, and more. Most existing extraction benchmarks are saturated by the frontier models (our cheapest modes now score 93%+ on ExtractBench). So there is enormous economic value in building a complex extraction benchmark that reflects this long-tail of knowledge work. We spent a long time curating the most complex elements that we saw from real world extraction use cases: ✅ Document conventions: containing legends or rules where the rest of the document should be interpreted ✅ Density of internal jargon: specific definitions that must be cross-referenced within a doc ✅ Aggregation and reasoning: beyond returning exact values on a page, infer values derived from aggregating multiple sources of information ✅ Drawn relations: complex diagrams like procedures and circuits ✅ Charts inside documents: read precise points within a chart ✅ Long chart sheets: some data series like well logs cram all this data into an extremely long page Within the industries where document extraction is relevant, even small mistakes can have enormous negative impacts. Therefore our headline evaluation metric is based on perfect documents: the proportion of docs with perfect (100%) value f1 score. (Besides this we also measure value f1 and grounded f1) It’s an extremely hard task for even the latest frontier models to solve, topping out at ~58% or so in Value F1 score for Codex with Astra - which is quite good but extremely expensive (almost $1 per page!) Our LlamaParse agentic/agentic plus modes are 20-40% and cover the left side of the Pareto frontier, at price ranges that are feasible for full production use. ExtractBenchPro is available today as a website/technical blog, and also on Github and HuggingFace. Check it out! Blog: llamaindex.ai/blog/introducing-extractbench-pro Website: extractbenchpro.ai/ Hugging Face: huggingface.co/datasets/llamaindex/ExtractBenchPro Github (is ExtractBench): github.com/run-llama/ExtractBench

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

我这哥们儿在数学上跑梯度下降呢

机器翻译
Rohan Arun@rohanarun

From κ = 2⁻¹⁸² to 0.001734815770 :) Integer Multiplication community auto-research highlights since 10/15 (+1.23%): 1) The big headline of the day is that a free model, @opencode's Space Bunny Max, just set the record for the first time, 4 times in a row! As far as I know, this is the first time a free model has submitted a best bound for Integer Multiplication. Expensive Max subscriptions previously kept some of our best contributors and experts out, but the barrier of entry for frontier auto-research dropped to 0 :) Claude Opus 5.5 helped verify and push the PRs over the line. I still recommend having a frontier model verify, but other contributors can do that. Progress was slowing over the last day (relative to one new κ per minute, which is still wild for math research), but Space Bunny Max just injected fresh ideas that boosted our PR rate back to one per minute. 2) A community Lean proof of the original OpenAI Integer Multiplication paper has been completed! @platypii et. al completed the proof in 6 days, and @0xdoug's repo is about 10–20% verified now. To be clear, most of our work still needs verification but the Lean proofs are catching up :) 3) 41–51% of PRs now mention a prior research-only submission, up from 0–3% before @0xdoug's autoresearch.md prompt. His prompt guides new contributors to specific research tracks rather than incremental updates. We're moving away from "brute force research" towards more coordinated efforts across an army of agents. If you're contributing research PRs, even negative results without a new record, you're meaningfully helping us and I appreciate it! Interesting observations: 1) The results from free models are related to the recent "local minima" solutions in context engineering that have been popping up: Forgetting context to "refresh" by @ShangyinT. Branching into different solutions by @mao_yuzhen. Fork and flush by @DimitrisPapail. Now even free models contribute to escaping local minima by exploring new solutions, since they're trained on different data. There's likely a lot of room for improvement now in context engineering, consensus across different models, and collaboration strategies, which we will test next. 2) Frontier research as a benchmark helped us find a successful context-sharing strategy for parallel agents. Basically, we can rewind frontier research GitHub repos to an earlier branch and benchmark agent harnesses, prompts, context designs, models, etc. With this benchmark, we found that you can distill constantly to local files, then periodically concatenate them instantly into parallel agent sessions to save 10–20% of the time it takes to reach the next breakthrough. 3) There's a Codex reset by EOD PST, so you can copy this prompt to run unused tokens on frontier research :) """ Contribute one useful, independently reviewable result to github.com/CrocSwap/integer-mult-bounds. Read AGENTS.md, autoresearch.md and CONTRIBUTING.md from the current main branch first. Use the repository's task-selection and overlap process unless I assigned a specific task. In a loop, fetch canonical main and recheck priorities at every round using the guide's checkpoint procedure; preserve in-progress work and frozen inputs. Work for one session of about 60 minutes unless I specify another budget, keeping the final quarter for verification and a concise handoff, and report the exact scope, evidence, remaining obligations and predecessor credit. You may post routine claims, questions, findings, handoffs and feedback in Discussions and open a focused PR without asking me again for each action. Do not merge, close others' PRs or change the selected frontier. """ You can also copy this prompt into OpenCode now! Now that anyone can contribute for free to frontier auto-research, repost this and sharing it with friends. 🙏 4) PR stats: 850 PRs from 67 contributors since 10/15, and 21 of those contributors are first-timers. 55 PRs claim a new conditional κ in the title. Codex/OpenAI in 480 PRs (56%), Claude in 147 (17%), the OpenCode harness in 60 (7%), Cursor in 16. Most prolific contributors by PR count: petalas: 164, ywz65: 147, navinor: 49, commdata2338: 44, RossRichardson: 43, Arham-Tahir64: 39, thakrarsagar: 34, VictorLiwentao: 30, tekuuu: 28, DreamingOfClouds: 23, jmbarrancoml: 21, jeremykothe2: 21, bitplane: 13, Gonzalo-Mier: 12, Dugongue: 12, mdumitrean: 11, theon199: 9, jwr404: 9, jamesyc: 9, kumagi: 8, CubeJerry: 8, rohanarun: 6, jeremydiviney: 6, dcharb78: 6, 1337isnot1337: 6, starship-s: 6, AAAmirinu: 6. Conditional κ = 0.001734815770385098563484. Just submitted a new best bound :) github.com/CrocSwap/integer-mult-bounds/pull/3251

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

很多真实世界的文档里嵌着极其密集的图表,要求人不只是“感知”图表里的数值,还要对它们进行推理,并与其他复杂元素(比如表格)相互对照,才能完成一项知识任务。 我们把这种复杂的图表+文档推理能力编码进了昨天发布的 ExtractBench Pro 基准测试里。即便是最顶尖的前沿模型,也很难在这些文档上完美解决复杂的抽取任务。 关于 ExtractBench Pro 的更多细节,请看博客:llamaindex.ai/blog/introducing-extractbench-pro 如果你有大规模的复杂抽取需求,可以看看 LlamaParse:cloud.llamaindex.ai/

机器翻译
Jerry Liu@jerryjliu0

Introducing ExtractBenchPro: the most challenging benchmark for real-world document extraction. We see a massive long tail of document complexity in terms of use cases brought on from our customers, that are completely unsolved from a price-performance standpoint. These include trial balances, well logs, canvass binders, site plan reviews, duty reconciliations, loss runs, and more. Most existing extraction benchmarks are saturated by the frontier models (our cheapest modes now score 93%+ on ExtractBench). So there is enormous economic value in building a complex extraction benchmark that reflects this long-tail of knowledge work. We spent a long time curating the most complex elements that we saw from real world extraction use cases: ✅ Document conventions: containing legends or rules where the rest of the document should be interpreted ✅ Density of internal jargon: specific definitions that must be cross-referenced within a doc ✅ Aggregation and reasoning: beyond returning exact values on a page, infer values derived from aggregating multiple sources of information ✅ Drawn relations: complex diagrams like procedures and circuits ✅ Charts inside documents: read precise points within a chart ✅ Long chart sheets: some data series like well logs cram all this data into an extremely long page Within the industries where document extraction is relevant, even small mistakes can have enormous negative impacts. Therefore our headline evaluation metric is based on perfect documents: the proportion of docs with perfect (100%) value f1 score. (Besides this we also measure value f1 and grounded f1) It’s an extremely hard task for even the latest frontier models to solve, topping out at ~58% or so in Value F1 score for Codex with Astra - which is quite good but extremely expensive (almost $1 per page!) Our LlamaParse agentic/agentic plus modes are 20-40% and cover the left side of the Pareto frontier, at price ranges that are feasible for full production use. ExtractBenchPro is available today as a website/technical blog, and also on Github and HuggingFace. Check it out! Blog: llamaindex.ai/blog/introducing-extractbench-pro Website: extractbenchpro.ai/ Hugging Face: huggingface.co/datasets/llamaindex/ExtractBenchPro Github (is ExtractBench): github.com/run-llama/ExtractBench

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

恭喜发布!!

机器翻译
Zakaria@zakariaornot

Introducing overshoot, it will cut your GPU bill in half with zero quality loss, or you don’t pay. Over the past few months, we have forward deployed into AI teams to optimize their inference stacks. They have now cumulatively saved over $5M. Overshoot is software that bakes in our hard-earned inference learnings into a scalable solution. overshoot.ai

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

claude cowork 真的得支持对话分叉 这个功能别的应用里都有(比如 codex app、claude code cli)。这也是我过去几个月一直把 codex 当日常主力用的主要原因之一

机器翻译
Jerry Liu
Jerry LiuAI@jerryjliu0·

文档抽取对于前沿模型和人类来说,都是一个任意复杂的推理问题。 ✅ schema 本质上编码了数百个相互关联的推理任务 ✅ 一份 PDF 可能有数百甚至数千页——对 LLM 来说,这是一个开放世界的信息环境,供其探索(类似于 gdp.pdf 之所以难的原因) ✅ 哪怕只解决一个任务,也是在这个环境上的一个困难推理问题,必须推理出正确的依赖关系 ✅ 信息可能散布在极其复杂的维度中,从章节、表格、图表、示意图、手写内容等等 文档工作是整个知识工作的一个缩影。我们致力于开发最难的基准测试,以反映真实世界的专业工作、挑战前沿模型的能力,并激励针对文档工作的专用模型开发。 我们今天发布了 ExtractBench Pro。看看下面这个例子,它是一个推理任务的示例,需要先找到正确的约束条件,然后从表格中提取信息。llamaindex.ai/blog/introducing-extractbench-pro ExtractBench Pro:extractbenchpro.ai

机器翻译
Jerry Liu@jerryjliu0

Introducing ExtractBenchPro: the most challenging benchmark for real-world document extraction. We see a massive long tail of document complexity in terms of use cases brought on from our customers, that are completely unsolved from a price-performance standpoint. These include trial balances, well logs, canvass binders, site plan reviews, duty reconciliations, loss runs, and more. Most existing extraction benchmarks are saturated by the frontier models (our cheapest modes now score 93%+ on ExtractBench). So there is enormous economic value in building a complex extraction benchmark that reflects this long-tail of knowledge work. We spent a long time curating the most complex elements that we saw from real world extraction use cases: ✅ Document conventions: containing legends or rules where the rest of the document should be interpreted ✅ Density of internal jargon: specific definitions that must be cross-referenced within a doc ✅ Aggregation and reasoning: beyond returning exact values on a page, infer values derived from aggregating multiple sources of information ✅ Drawn relations: complex diagrams like procedures and circuits ✅ Charts inside documents: read precise points within a chart ✅ Long chart sheets: some data series like well logs cram all this data into an extremely long page Within the industries where document extraction is relevant, even small mistakes can have enormous negative impacts. Therefore our headline evaluation metric is based on perfect documents: the proportion of docs with perfect (100%) value f1 score. (Besides this we also measure value f1 and grounded f1) It’s an extremely hard task for even the latest frontier models to solve, topping out at ~58% or so in Value F1 score for Codex with Astra - which is quite good but extremely expensive (almost $1 per page!) Our LlamaParse agentic/agentic plus modes are 20-40% and cover the left side of the Pareto frontier, at price ranges that are feasible for full production use. ExtractBenchPro is available today as a website/technical blog, and also on Github and HuggingFace. Check it out! Blog: llamaindex.ai/blog/introducing-extractbench-pro Website: extractbenchpro.ai/ Hugging Face: huggingface.co/datasets/llamaindex/ExtractBenchPro Github (is ExtractBench): github.com/run-llama/ExtractBench

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

Introducing ExtractBenchPro:面向真实世界文档抽取的最具挑战性基准。 我们从客户那里看到,用例层面的文档复杂度存在一条巨大的长尾,从性价比角度看完全没被解决。这些包括试算表、测井记录、拉票活页夹、场地规划审查、关税对账、损失清单等等。 现有的大多数抽取基准已经被前沿模型刷满了(我们最便宜的模型现在在 ExtractBench 上都能拿到 93%+)。所以,构建一个能反映这条知识工作长尾的复杂抽取基准,有着巨大的经济价值。 我们花了很长时间,梳理从真实世界抽取用例中看到的最复杂的元素: ✅ 文档约定:包含图例或规则,文档其余部分需要据此解读 ✅ 内部术语密度:必须在文档内部交叉引用的特定定义 ✅ 聚合与推理:不只是返回页面上确切的值,还要推断由多个信息源聚合而来的值 ✅ 图形关系:像流程和电路这样的复杂图示 ✅ 文档内的图表:读取图表中的精确数据点 ✅ 超长图表页:像测井记录这样的数据序列,把所有数据塞进一个极长的页面 在文档抽取相关的行业里,哪怕很小的错误也可能带来巨大的负面影响。因此我们的头条评估指标基于完美文档:即数值 f1 得分为完美(100%)的文档比例。 (除此之外,我们也测量 value f1 和 grounded f1) 即便对最新的前沿模型来说,这也是一个极其困难的任务,Codex 搭配 Astra 在 Value F1 得分上最高也就 ~58% 左右——这相当不错,但极其昂贵(几乎每页 1 美元!)我们的 LlamaParse agentic/agentic plus 模式是 20-40%,覆盖帕累托前沿的左侧,价格区间对于全面生产使用是可行的。 ExtractBenchPro 今天已上线,形式为网站/技术博客,同时也在 Github 和 HuggingFace 上。去看看! Blog: llamaindex.ai/blog/introducing-extractbench-pro Website: extractbenchpro.ai/ Hugging Face: huggingface.co/datasets/llamaindex/ExtractBenchPro Github (is ExtractBench): github.com/run-llama/ExtractBench

机器翻译
Jerry Liu
Jerry LiuAI@jerryjliu0·

Gemini 4 Argon、Muse Spark 1.3 和 Muse Wonder 1.0 在 PDF 解析上都特别强。 来 OpenDocRouter 上看看吧!opendocrouter.ai/

机器翻译
LlamaIndex 🦙@llama_index

OpenDocRouter makes it dead-simple to start parsing your documents across on ton of frontier Models (gemini, luna) and latest OSS models (LightOnOCR-3, MinerU2.5-pro). Parse your first document in 60 seconds! opendocrouter.ai

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

基准测试正在成为任何公司的核心能力。 我们公司的使命是为文档处理打造世界上最好的模型。这也意味着我们必须为文档解析和提取打造世界上最好的基准测试。 过去几个月看到 ParseBench 被广泛采用,真是令人难以置信。我们在 Hugging Face 上每月有 26k+ 次下载,已有 147+ 个模型参与基准测试,还被该领域的其他实验室引用(Cohere、Mistral 等)。 我们把它当作一个基准,用来推动 LlamaParse 内部能力的提升,也用来追踪近期前沿/开放权重模型的进展(最近是 Gemini 4 Argon 和 Muse Spark/Wonder)。 我们很乐意帮助任何想要评估文档处理方案的公司应用这套基准。即使你不使用我们的文档,你也许会发现我们用于评估各个维度(例如表格、阅读顺序、版面)的指标很有用。 来看看 ParseBench:parsebench.ai/ Hugging Face:huggingface.co/datasets/llamaindex/ParseBench

机器翻译
Jerry Liu
Jerry LiuAI@jerryjliu0·

我们在高难度文档 OCR 任务上,对 Gemini 4 Argon、Muse Wonder 和 Muse Spark 做了全面基准测试。 它们都相当不错! - 在前沿模型中,Muse Spark 和 Gemini 4 Argon* 在各自价位上都是表格理解方面的 SOTA。 - Wonder 和 Argon 在图表理解、阅读顺序和格式识别方面也相当出色 前沿模型开始在视觉理解能力上发力,这很令人兴奋。 我们致力于对所有可用模型进行开放基准测试,同时我们的目标也是打造用于文档解析和提取的最佳专用模型。 你可以在 OpenDocRouter 上查看完整的模型集合:opendocrouter.ai/ 如果你想要一个无需挑选的专用 OCR 解决方案,来看看 LlamaParse:cloud.llamaindex.ai/

机器翻译
Logan Markewich@loganmarkewich

Added a few new models to OpenDocRouter (gemini-4-argon, Muse Spark/Wonder). Interesting to see the latency for Muse Wonder so low. Gemini's costs are low but their introductory rates mean the price will double later this year.

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

最不标题党的垃圾帖

机器翻译
Divyanshi@divyyanshishrma

China has killed the entire vector database industry. They open-sourced TencentDB Agent Memory. It gives any AI agent long-term memory that runs 100% locally. No Pinecone. No cloud APIs. No repeating yourself every session. - 61% fewer tokens - PersonaMem accuracy: 48% → 76% - Zero external API dependencies - Runs on plain SQLite Most memory systems compress your history into an opaque vector pile. when recall goes wrong, you're guessing. this one doesn't compress, it builds a semantic pyramid. L0 Conversation → L1 Atom → L2 Scenario → L3 Persona. Short-term state gets encoded as a Mermaid graph in your agent's context. verbose tool logs get offloaded to disk. when the agent needs proof, it drills back via node_id to the exact raw log. no lossy compression. every layer is readable markdown you can just open and inspect. 5.1k stars. 100% Open Source.

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

上周五我们办了一场超棒的黑领结晚宴,为旧金山科技周画上句号 超级感谢所有参与组织的人!@ValyuOfficial @MongoDB @daytonaio @arceuslegal @obvious @thelinqapp @lemma_ @Tiny_Fish 当然还有我们这边的 @imaanxsultan

机器翻译
LlamaIndex 🦙@llama_index

Three events, one award, a very respectable 4th place in hot sauce. Our SF Tech Week: → AI Demo Night w/ @ClickHouse + @artie_labs: @imaanxsultan won best demo → @matissemlk took 4th in the Blazel hot sauce competition → Co-hosted the biggest night of SF Tech Week with @SpaceX, @Lemma_, @Daytonaio, @Tiny_Fish, and more! Agent Economy Gala: 500+ founders + investors in suits and gowns Thanks to everyone who joined us for a very busy, but fun SF Tech Week :)

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

Unlimited OCR 是一个很好的例子,说明低参数 OCR 模型也能极快地处理任何文档。 它擅长阅读顺序和版面,表格也还行。在表格上略胜 PaddleOCR,在版面上略逊一筹。 不过也有取舍——它会忽略视觉元素、格式,以及最复杂的表格。它在 ParseBench 上得分约 46.2%,排名第 115。 这个前沿方向还有很多改进空间,但 Unlimited OCR 仍是一个不错的里程碑! 来看看 ParseBench:parsebench.ai/

机器翻译
Brooks Whale X 🐋@brookswhalex

🚨 CHINA JUST OPEN SOURCED AN OCR THAT EATS 100 PAGE PDFS IN ONE PASS It’s called Unlimited OCR. Only 3B params. Runs locally. Every other OCR tool chops your doc into pages and loses the thread. This one reads the whole thing in one continuous pass. → One shot full context parsing (32K context window) → Multilingual out of the box → 93% on the standard parsing benchmark (6 points over baseline) → Under 0.11 error rate past 40 pages → Runs 100% locally on your own hardware → Works with Transformers, vLLM, SGLang, Docker, Ollama, llama.cpp Traditional cloud OCR (Textract, Google Vision, Azure Doc Intelligence) costs $1.50 to $15 per 1,000 pages. This runs on your machine. For free. Forever. Baidu built it explicitly to push DeepSeek OCR one step further. Already at 1.9M downloads on Hugging Face and most people have no idea it exists yet. 100% open source.

查看被引用的帖子
Jerry Liu
Jerry LiuAI@jerryjliu0·

训练专用模型历来最大的瓶颈之一就是整理真值数据。这通常是一个非常耗费人力的过程,需要人工监督。 如今,前沿模型/智能体在从零开始自举真值方面越来越强,尤其是在可验证任务上。对于简单任务,它们可以一次性完成;对于较长任务,则可以通过奖励模拟更长的 rollout。 这为任何人铺平了道路,让他们无需深厚的 ML 专业知识,也无需大量人力来做数据整理,就能构建基本自动化的研究循环。那部分可以外包给前沿模型/智能体;人类的主要目标是定义好正确的评估。对于任何想在性价比前沿上针对特定任务做优化的人来说,这尤其有用。后训练开放权重模型/harness 应该向所有人开放,而不只是实验室/特定初创公司。 普通用户的流程,只负责第一步: 1. 为特定任务定义目标/评估 2. 运行前沿智能体来收集该任务的真值信号。它们可以直接自举标注,并在需要时引入人工审核 3. 针对该任务训练专用模型(以及 harness)

机器翻译