AllyshipContent Radar

News 2803

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

Crawl live-1795079700000 · 16:15 19 thg 11, 2026 · Xuất bản 16:30 19 thg 11, 2026

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

181

Show HN: One cloud computer for all your agents

68

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

taro666, omarsar0 1 bài viết · HN: Claude, X
Nguyên văn nguồn
Chi tiết nguồn

Hi HN, my team just released box by Simular, a cloud computer for all your agents, with fast computer use built-in. box gives your agents one remote Ubuntu desktop with Chrome and a shell, which your AI can then drive over MCP while your own computer stays unoccupied. That means you can turn your basic ChatGPT plan into a personal agent by giving it a box computer; let your Claude Code pick up what Codex has left off on the same box to maximize usage; actually close your laptop and let tasks run in one persistent, 24/7 environment with all your logins and setup. Some box demos: https://x.com/SimularAI/status/2121329778896871665?a=U4U1yYT... We started on this because we believe computers shouldn't need human operation in the future. When agents arrived, people started running them on mini computers and you see colleagues walk around the office with their laptop lid open. We think there's a better solution - cloud computers engineered for agents. Simular started three years ago to build out the full stack of an autonomous computer. box is our attempt to give agents a body to live in. Our computer use outperformed Opus and GPT on OSWorld, costing fewer tokens. https://thenewstack.io/sai-agent-osworld-benchmark/ Copy/paste one command into your agent to start: "Set up box from https://box.simular.ai/install " You can watch box's live action from a dashboard https://box.simular.ai/box We'd love for you to try it and share your feedback. I'll be in comments here to answer any question.

182

Hugging Face and OpenRouter join forces to make open-weight models easy to run

65

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

acossta, Hugging Face 1 bài viết · HN: open weights, Hugging Face Blog, X
Nguyên văn nguồn
Chi tiết nguồn
183

Show HN: Fakemetrics.com – "build in public" like a superstar

57

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

tigranbs 1 bài viết · HN: Claude
Nguyên văn nguồn
Chi tiết nguồn

Hi HN, I am Tigran (github.com/tigranbs) I made Fakemetrics.com as a fun experiment while testing how well Claude Opus can build pixel-identical UIs. It turned out it wasn't as easy as just prompting it, but I spent time building the system so it works almost every time. And I am pretty sure you are seeing a bunch of people posting weekend vibe-coded apps and saying "$50K/month after quitting my McDonnalds job...". Well, even my friend tried to fake it a few months back. So, I kinda did this fakemetrics.com as an experiment to see how well I can have the system that clones UIs, and packaged that as a very simple (I think) usable product for the people that want to be a superstar "build in public" type of a person with no revenue, but a perfect Stripe user growth screenshot. Useful? - Probably not that much Fun? - YES!! The best part is that Claude, ChatGPT, or Grok models aren't that good at UI clones by default, but with fakemetrics.com I kinda made a system that produces near-identical results from screenshots fairly fast. That was worth learning! Let me know what you think? Should I move on with the UI cloning as an open-source product?

184

ALIVE: Making Streaming Video Models Interactive

65

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

Jinzhao Li, Yuan Xu và 14 nguồn khác 1 bài viết · Hugging Face Papers
Nguyên văn nguồn
Chi tiết nguồn

Streaming video LLMs can continuously observe the world, yet often handle user requests in isolation. We introduce ALIVE, an interactive streaming video model supporting proactive monitoring, streaming task coordination, and feedback-seeking interaction. We construct ALIVE-SFT-288K and ALIVE-RL-3K for two-stage training. Contrastive supervised fine-tuning teaches when and how to respond, while reinforcement learning with Behavior-Aligned Credit Assignment (BACA) combines trajectory-level and local advantages to refine decisions, responses, and silence across multi-turn interactions. We also introduce FSI-Bench to evaluate feedback seeking and subsequent task completion. ALIVE achieves the highest overall scores among the compared models on four public benchmarks and FSI-Bench, demonstrating strong streaming understanding and interactive capabilities.

185

VAE Rhythm: Temporal Decoding Traces for AI-Generated Video Detection

61

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

Ke Sun, Shuwei Li và 2 nguồn khác 1 bài viết · Hugging Face Papers
Nguyên văn nguồn
Chi tiết nguồn

Visible artifacts are an unreliable cue for detecting generated videos, because newer generators learn to remove them. We instead detect a trace left by the generation pipeline itself. Most video generators decode latents with a 3D causal VAE that groups consecutive frames in time, so the fidelity of generated frames rises and falls periodically with their position in a group. We call this periodic trace VAE Rhythm. Real videos are captured frame by frame and do not have it. To reveal it without training, we propose a phase scan. The scan reconstructs a clip with an off-the-shelf VAE from successive start offsets and measures the periodicity of the reconstruction error across these offsets. We find VAE Rhythm in most of the 39 variants of 31 generators we test, including the closed-source Sora, Kling 3.0 and Seedance 2.0. We use the rhythm as a zero-shot score, as a plug-in for existing detectors and as a data engine that pairs real videos with their VAE reconstructions to train our detector CaDet. On DF26, the training-free rhythm score outperforms all 15 retrained baselines, and as a plug-in it improves all 19 tested detectors by 6.7% to 23.7% AUROC. CaDet achieves the best AUROC on AIGVDBench, DF26 and three 2026 closed-source models, and its variant trained without any generated video still exceeds 90% on AIGVDBench.

186

Read the Stand with Jensen letter and consider adding your name. #standwithjensen https://standwithjensen.com/

56

4 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

amasad, petergyang và 2 nguồn khác 0 bài viết · X
Nguyên văn nguồn
Chi tiết nguồn

Read the Stand with Jensen letter and consider adding your name. #standwithjensen https://standwithjensen.com/

187

Understanding Positional Embeddings in Modern LLMs

55

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

Sebastian Raschka, PhD, Sebastian Raschka 1 bài viết · Ahead of AI, X
Nguyên văn nguồn
Chi tiết nguồn

This article explains how LLMs encode and process token position information by covering classic and contemporary methods like RoPE. It’s essentially a comprehensive journey where we will work through the mechanisms with visual examples, a little math, and a small PyTorch implementation. And, of course, we will then also look at how modern architectures adapt or omit explicit positional encodings. Below, you can find a preview of which positional embedding choices are used in 2026 open-weight models. We will discuss these choices later after covering the underlying mechanisms. Figure 1: A preview of the gallery’s 2026 architectures, grouped by positional encoding. Architecture figures taken from my LLM gallery . But why spending so much time writing/reading about this rather minor building block? LLMs keep evolving, and as I was preparing a new article on the latest LLM architecture trends this year, I realized that I never covered the positional information methods used in LLMs in any article so far. So, instead of letting the other article get out of hand, I thought it might make sense to publish this as a standalone building block for the upcoming LLM architecture and trends analysis. Also, over the years, many readers have asked me for a tutorial on relative positional embeddings (aka RoPE) to follow up on the learned absolute embeddings used in GPT. It’s been on my TODO list for a long time, so I finally revisited my old draft and put this walkthrough together, which will cover different positional methods in LLMs; (finally) how RoPE works; what methods are used by recent open LLMs. Note that this article assumes some familiarity with basic LLM architectures and works well as a follow-up to Build a Large Language Model (From Scratch) . If the concepts and computation of the attention internals, particularly query, key, and value vectors, are a little fuzzy, I recommend checking my self-attention walkthrough as a refresher: The article is also very technical and likely too detailed for some. However, I really wanted to have this foundation out there for future articles to reference. And no worries, the next one will return to a more comfortable style. PS: I started experimenting with Substack’s new “perks” system. As a thank-you to supporters, I’ve added image exports and metadata from the architecture gallery for you to use in your own analyses. PPS: If you are already familiar with how position embeddings work, feel free to fast-forward to Section 6, Positional choices in modern architectures . Note that this article may be best read in a web browser than an email client. I recommend checking out the web view here , which also has a navigation bar on the left side. 1. Where position information enters an LLM Let’s start with the overall architecture. A tokenizer encodes the input text into token IDs. Next, the input token embedding layer of an LLM maps each of these IDs to a vector of numbers. We usually refer to these entries in that vector as “features” (similar to classic ML). The transformer blocks inside the LLM then modify these vectors using attention and feedforward layers. Lastly, the model’s output layer produces logit scores (converted into probabilities) for the next token. The following shows this path in GPT-2 (a relatively classic LLM) and MiniMax-M3 (a more recent LLM released this year; a placeholder for most other recent LLMs). As we can see, the architectures are not too different from each other, but before we get to the positional information parts, let’s focus on the orange blocks for now (the token embedding layers) and the transformer blocks above them; the other architecture differences aren’t needed for this explanation. Figure 2: Token embedding layers in GPT-2 and MiniMax-M3, highlighted in orange. (Side note: M3’s first three out of 60 feedforward layers are dense not MoEs.) A token embedding layer, shown in the figure above, maps each token ID to a vector. Position information is then added afterward. Concretely, and as we will discuss in more detail later, GPT-2 adds a position vector to each token embedding before the modified embedding enters the first transformer block. On the other hand, MiniMax-M3 adds the positional information in each transformer block using a method called RoPE inside attention. We will talk about these methods in more detail later, but first, let’s start with the big picture information explaining why explicit positional information is added or needed. 1.1 Why add positional information? Consider the following two input sentences as a simple example: “The red fox jumps over the gray fox.” “The gray fox jumps over the red fox.” Changing the word order changes which fox does the jumping, as illustrated in the following figure. Figure 3: Changing the word order changes which fox jumps. For the examples in this article, we will treat each word as one token for simplicity. (As you know, real tokenizers can split words into smaller subword tokens.) The first sentence then has eight token positions, from 0 through 7. Figure 4: Token IDs and positions in the toy sentence. # Assume the following small vocabulary. # Real vocabularies typically have 50k to 200k entries vocab = { "The": 0, "red": 1, "fox": 2, "jumps": 3, "gray": 4, "over": 5, "the": 6, } (If you are interested in how vocabularies are built, check out my tokenizer materials on GitHub .) Note that “fox”, which appears twice in the input sentence, gets the same token ID 2 in both cases. And since they both have the same token ID, irrespective of the position in the input sentence, they would get the same embedding vector from the embedding layer. (For those who are interested in more details on how this selection from the embedding table looks like, check Appendix A .) Now, let’s consider a regular self-attention mechanism with no positional encoding (and no causal mask), where every input token can attend to every other token in the input. In this scenario, swapping any tw

181–187 / 187
Trang 10 / 10