AllyshipContent Radar

News 2694

Chủ đề cộng đồng đang thảo luận

Crawl live-1795076100000 · 15:15 19 thg 11, 2026 · Xuất bản 15:31 19 thg 11, 2026

191 / 2694 chủ đề đạt ngưỡng 55 trong khoảng này.

1

If you enjoyed this, sign up for free to my newsletter to get my best AI and product guides.

56

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

petergyang 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

If you enjoyed this, sign up for free to my newsletter to get my best AI and product guides. Join 110,000+ subscribers here: https://creatoreconomy.so/

2

9 new free Colab notebooks this week, all tested on a free T4 GPU 🧪

56

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

melvindvivas 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

9 new free Colab notebooks this week, all tested on a free T4 GPU 🧪 • Granite 4.1 LLMON: prompt-injection guard • ZONOS3-Mini: voice-cloning TTS • Fluid Speech Pro: multilingual speech-to-text • Mirage: 22 MB vision model for structured extraction • Haru-4B: full-duplex speech • Nemotron Sigma 3B: speculative decoding, 2.5x faster • ARC-1.0: model router • CBX healthcare speech-to-text • tiny-voca: 4.5M-param TTS, 185x real time Open one and hit Run all 👇 https://github.com/donvito/notebooks

3

Here is a small benchmark with no iteration of Astra 6 vs 6.2 on 3D modelling a house. What's amazing is that I can now get closer to the result I had for my article for the launch of Astra with less

56

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

dimillian 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

Here is a small benchmark with no iteration of Astra 6 vs 6.2 on 3D modelling a house. What's amazing is that I can now get closer to the result I had for my article for the launch of Astra with less prompting! https://developers.openai.com/blog/architectural-visualization-with-astra Media

6

I also tried "Make a three js animation where yonkers stands up as a big mech (cool stand up motion) and stomps around manhattan and queens and Brooklyn, use openstreetmap mapping data" against Gemini

56

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

Simon Willison 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

I also tried "Make a three js animation where yonkers stands up as a big mech (cool stand up motion) and stomps around manhattan and queens and Brooklyn, use openstreetmap mapping data" against Gemini 4 Neon and got this https://static.simonwillison.net/static/2026/gemini-4-neon-yonkers/index.html Media

7

Orca - chạy một đội các coding agents bằng subscription của bạn

71

2 tiếng nói · chưa gắn nhãn trưởng lab · 2 nền tảng · chưa có số tương tác · Nguồn crawl

stablyai, orca_build 0 bài viết · GitHub discovery: AI agents, X
Biên tập tiếng Việt
Chi tiết nguồn

Orca được mô tả là cho phép chạy một “fleet of coding agents” (ví dụ Claude Code, Codex) với subscription của riêng bạn. Nền tảng có sẵn trên desktop, mobile và remote runtime.

Orca lets you run a fleet of coding agents (e.g. Claude Code, Codex) with your own subscription. Available on desktop, mobile and remote runtime.

  • Orca lets you run a fleet of coding agents (e.g. Claude Code, Codex) with your own subscription.
  • Orca lets you run a fleet of coding agents (e.g. Claude Code, Codex) with your own subscription.
  • Available on desktop, mobile and remote runtime.
8

Archify - biến ý tưởng/plan/codebase thành sơ đồ tương tác

71

2 tiếng nói · chưa gắn nhãn trưởng lab · 2 nền tảng · chưa có số tương tác · Nguồn crawl

tt-a1i, tom_doerr 0 bài viết · GitHub discovery: LLM, X
Biên tập tiếng Việt
Chi tiết nguồn

Archify được mô tả là chuyển mọi ý tưởng, kế hoạch hoặc codebase thành một sơ đồ tương tác “đẹp”. Nó là một agent skill cho Claude Code, Codex và nhiều nền tảng khác.

Turn any idea, plan, or codebase into a beautiful interactive diagram. An agent skill for Claude Code, Codex, and more.

  • Turn any idea, plan, or codebase into a beautiful interactive diagram.
  • Turn any idea, plan, or codebase into a beautiful interactive diagram.
  • An agent skill for Claude Code, Codex, and more.
9

Nov 1997 vs Nov 2026

56

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

rauchg 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

Nov 1997 vs Nov 2026 Media

11

langgraph==1.2.23

55

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

github-actions[bot] 1 bài viết · langchain-ai/langgraph releases
Nguyên văn nguồn
Chi tiết nguồn

<p>Changes since 1.2.22</p> <ul> <li>release(langgraph): 1.2.23 (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6482730562" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9742" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9742/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9742">#9742</a>)</li> <li>release(prebuilt): 1.1.3 (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6482729770" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9741" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9741/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9741">#9741</a>)</li> <li>fix(langgraph,prebuilt): give Send-dispatched tool calls the same state as an edge (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6472223558" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9728" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9728/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9728">#9728</a>)</li> <li>chore(deps): bump opentelemetry-api from 1.45.1 to 1.45.2 in /libs/langgraph (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6377648315" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9696" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9696/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9696">#9696</a>)</li> <li>fix(langgraph): avoid warning races in dynamic schemas (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6408559559" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9716" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9716/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9716">#9716</a>)</li> </ul>

12

langgraph-prebuilt==1.1.3

55

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

github-actions[bot] 1 bài viết · langchain-ai/langgraph releases
Nguyên văn nguồn
Chi tiết nguồn

<p>Changes since prebuilt==1.1.2</p> <ul> <li>release(prebuilt): 1.1.3 (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6482729770" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9741" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9741/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9741">#9741</a>)</li> <li>fix(langgraph,prebuilt): give Send-dispatched tool calls the same state as an edge (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6472223558" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9728" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9728/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9728">#9728</a>)</li> <li>fix(prebuilt): make wrap_tool_call state overrides reach the tool (<a class="issue-link js-issue-link" data-error-text="Failed to load title" data-id="6473031915" data-permission-text="Title is private" data-url="https://github.com/langchain-ai/langgraph/issues/9730" data-hovercard-type="pull_request" data-hovercard-url="/langchain-ai/langgraph/pull/9730/hovercard" href="https://github.com/langchain-ai/langgraph/pull/9730">#9730</a>)</li> </ul>

17

Evidence-Based Credit Assignment for Search-Augmented Language Models

83

8 tiếng nói · chưa gắn nhãn trưởng lab · 2 nền tảng · 3 tương tác đã đo · Nguồn crawl

Wen Wang, Jindong Wang và 6 nguồn khác 1 bài viết · Hugging Face Papers, arXiv cs.AI
Biên tập tiếng Việt
Chi tiết nguồn

Bài báo nói rằng reinforcement learning từ phần thưởng cuối cùng cho phép search-augmented language models xen kẽ suy luận và truy xuất mà không cần nhãn từng bước, nhưng giám sát theo kết quả gán credit giống nhau cho mọi lần tìm kiếm trong một trajectory, dù có truy xuất hữu ích hay không. Họ giới thiệu Evidence-based Credit Assignment (ECA) để bổ sung tín hiệu phụ (training-only) đo việc các tài liệu đã truy xuất cải thiện xác suất của câu trả lời tham chiếu. ECA dùng evidence-only prompt với chỉ câu hỏi và các tài liệu đã quan sát (đã loại trùng), để tách tiện ích của đoạn truy xuất khỏi biến thiên do câu chữ suy nghĩ/ truy vấn sinh ra.

Reinforcement learning from terminal answer rewards enables search-augmented language models to interleave reasoning and retrieval without step-level annotations, yet outcome supervision assigns identical credit to every search in a trajectory regardless of whether it retrieved useful information. This limitation is especially severe when all sampled rollouts for a question fail, collapsing group-centered outcome advantages to zero even when trajectories gather markedly different evidence. We present Evidence-based Credit Assignment (ECA), which augments terminal outcome rewards with a training-only auxiliary signal measuring how retrieved documents improve the likelihood of a reference answer. Rather than scoring the full dialogue prefix, ECA queries a frozen snapshot of the current policy under an evidence-only prompt containing solely the question and the deduplicated documents observed so far, isolating the utility of retrieved passages from surface variations in generated thoughts or search queries. Within this framework, we compare two return formulations, ECA-Step (which accumulates step-clipped potential increments) and ECA-Horizon (which preserves the telescoping horizon gain in potential), paired with cross-fold group normalization, novelty gating, and search-local token assignment. Across seven Search QA benchmarks, ECA-Horizon improves strict macro exact match over an outcome-only GRPO baseline by 1.03 and 4.80 percentage points on Qwen2.5-3B- and 7B-Instruct, respectively, outperforming both RLOO and GiGPO. Zero-shot evaluation on MultiHop-RAG further demonstrates strong transfer to multi-hop inference queries.

  • ECA-Horizon improves strict macro exact match over an outcome-only GRPO baseline by 1.03 and 4.80 percentage points on Qwen2.5-3B- and 7B-Instruct, respectively, outperforming both RLOO and GiGPO.
  • ECA-Horizon improves strict macro exact match over an outcome-only GRPO baseline by 1.03 and 4.80 percentage points on Qwen2.5-3B- and 7B-Instruct, respectively, outperforming both RLOO and GiGPO.
  • Zero-shot evaluation on MultiHop-RAG further demonstrates strong transfer to multi-hop inference queries.
  • Within this framework, we compare two return formulations, ECA-Step (which accumulates step-clipped potential increments) and ECA-Horizon (which preserves the telescoping horizon gain in potential), paired with cross-fold group normalization, novelty gating, and search-local token assignment.
18

Human-AI Mutualism Is Unstable under Capability Asymmetry

55

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

Aydin Mohseni 1 bài viết · arXiv cs.AI
Nguyên văn nguồn
Chi tiết nguồn

arXiv:2611.23322v1 Announce Type: new Abstract: One hope for a good human future alongside advanced AI rests on enduring mutualism: humans and AI will need each other, so the relationship will stay good for both. We argue that this hope fails as AI capability grows. Bargaining guarantees each side only what it would get if bargaining failed. For humans, this can be less than they had before AI. In a simple game-theoretic model, humans stay as well off as before AI without alignment only while they have leverage over the AI: either the AI depends on what they supply, or they can impose costs on the AI that are large relative to what the AI can produce. Once humans have neither kind of leverage, they stay as well off as before AI only if the AI is aligned with them. If the AI's goals are insatiable, the alignment required approaches perfect alignment as AI capability grows. Thus, mutualism is not a substitute for alignment. And when AI variants that keep more resources spread faster, alignment lasts only while misaligned variants are reliably sanctioned. In these two senses, human-AI mutualism is unstable.

19

Training Language Models for Introspective Oversight

55

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

Alex Lin Wang, Linus Yifeng Tang, Dami Choi, Neil Chowdhury 1 bài viết · arXiv cs.AI
Nguyên văn nguồn
Chi tiết nguồn

arXiv:2611.23365v1 Announce Type: new Abstract: Language models increasingly exhibit behaviors that are difficult to detect in transcripts, such as reward hacking, deception, and sycophancy. Asking the assistant follow-up questions about its actions is unreliable, since models are generally not trained to report their own misbehavior. As a result, approaches to oversight typically involve querying external models. These face limitations: external transcript monitoring operates only on visible model outputs, and activation decoders lack full context and are prone to confabulation. We introduce introspective oversight, which trains a new role in the model to answer arbitrary questions about the assistant, rewarding answers that are verified against the assistant's actual behavior. We implement this by adding a separate, third-person observer role that answers these queries, which we can train solely for accuracy and separately from the assistant. On five held-out oversight evaluations, an observer trained on Qwen3.6-27B obtains a mean AUROC of 0.907, outperforming honesty training (0.864), transcript monitoring (0.828), and activation oracles (0.796). We further find that training an observer makes the assistant itself easier to monitor, with every baseline method improving on average when applied to the fine-tuned assistant. These results suggest that training models to answer verifiable questions about themselves is a tractable approach to overseeing unintended behavior.

20

Where the Tokens Go: Heat, Entropy and Error in Agentic Coding

55

1 tiếng nói · chưa gắn nhãn trưởng lab · 1 nền tảng · chưa có số tương tác · Nguồn crawl

Al\'an Aspuru-Guzik, Varinia Bernales 1 bài viết · arXiv cs.AI
Nguyên văn nguồn
Chi tiết nguồn

arXiv:2611.23375v1 Announce Type: new Abstract: Coding agents are billed by the token, yet software engineering says nothing about what a token actually buys. Here we introduce a theory of software thermodynamics. The theory draws analogues from classical and stochastic thermodynamics, extends them, and applies them to modern agentic coding. We count the tokens an agent generates as its cost and divide that cost into work and heat. The test suite acts as a software Maxwell's daemon that judges every coding change. We test the theory with an analogue of the experiments in which a single molecule is pulled open and let fold again: an agent makes a change to a repository (coding) and then undoes it (uncoding), many times over, and we count the tokens of every model call. The cycle returns the requested edits to where they began, with each direction started from a stored reference tree, and the spread of its cost over repeated cycles defines a software temperature, which rose with the sampling temperature of the model. About 80 per cent of the tokens of a successful run are generated in model calls that leave the requested change where it was, and we call these tokens heat. The free energy of a change, which we estimate by analogy with the equality of Jarzynski, is 14 to 22 per cent of the mean cost of a successful coding run. Coding costs 1.1 to 1.5 times as much as uncoding. The daemon is imperfect: the verdict of a test suite varies with its environment, and a suite that accepts a broken change has a cost in tokens. The practical implication of the proposed theory could be new tools for analysing and optimising coding agents through the lens of thermodynamics.

1–20 / 191
Trang 1 / 10