AllyshipContent Radar

News 2905

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

Crawl live-1795130100000 · 06:15 20 thg 11, 2026 · Xuất bản 06:31 20 thg 11, 2026

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

181

Show HN: An API for word timestamps from speech, 75% within 20ms

57

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

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

Hey HN, we're Yarn (W24) and we make a video editing app for startups, and we built Quebec ( https://quebec.yarn.so ), an API that gives you accurate word timestamps from speech. We needed it because cutting a word even 50ms off from its true timing can ruin talking head footage (examples in the write up). Accurate word timestamps usually come from a forced aligner, which takes the speech audio and a transcript and works out exactly when each word starts and ends. We weren't satisfied with the accuracy of Montreal Forced Aligner (MFA) or new models like ElevenLabs Cue ( https://elevenlabs.io/blog/cue-aligner ). Giving LLMs access to a waveform/spectrogram didn't help much either. So we built our own. There are two particularly interesting parts: - We wrote our own decoder around MFA's acoustic model that only lets each word land within 200ms of the rough timings. That made search small enough to solve exactly, so we don't need to use MFA's beam search. - We added a small CNN, built on the first two layers of Whisper Tiny, that nudges each word boundary by up to 50ms. We couldn't find enough hand-labelled speech that allowed for commercial use, so we had Gemini label our own (17k word boundaries). It took a couple of hours and cost under $200. A net trained on Gemini's labels scored the same as one trained on human labels (73.9% vs. 74%). One way to measure accuracy is % of word boundaries within 20ms of hand labels. Here are the results on Buckeye (hand-labelled American speech that we didn't train on): - Quebec 75% - MFA 61% - ElevenLabs Cue 30% If you want to try it, it's free until tomorrow night. You can point your agent at our docs at https://quebec.yarn.so , and send audio on its own or with your own transcript. After that, it costs $0.32 per hour with no signup (minimum $10 top-up). We serve it at cost. Caveats: only tested in English and slower than ElevenLabs. Let us know if Quebec works well for you, and send us any samples that work badly (you can email support at yarn dot so). Also let us know if you've built or found a better aligner. In theory we would just switch to a better aligner, although we would probably just push a bit harder to make ours better. Thanks! Jasper

185

The Resolution Hypothesis: Agent Evolution's Key Is Identifying Improvements

68

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

Yuanhao Zeng, Shaocheng Lan và 9 nguồn khác 1 bài viết · Hugging Face Papers
Biên tập tiếng Việt
Chi tiết nguồn

Bài báo mô tả vòng lặp tiến hóa tác nhân: proposer tạo các ứng viên (prompts, skills, memories) và selection chọn những ứng viên có điểm cao hơn. Tuy vậy, họ nói rằng evolution có thể thất bại khi khởi động trên một số tác vụ vì đánh giá nhiễu không thể phân biệt đáng tin cậy giữa ứng viên tốt và xấu.

Agent evolution follows a simple loop: a proposer writes candidate artifacts (prompts, skills, memories) and selection accepts those that score higher. This loop has shown promise, yet practitioners face a puzzle: methods trade wins across papers, and evolution often fails to bootstrap on certain tasks. We trace this puzzle to the Resolution Hypothesis: agent evolution stalls not because methods fail to propose better artifacts, but because noisy evaluations cannot reliably identify them. Across seven evolution methods and six models (over 10M LLM calls), we find support for the hypothesis at both levels where evaluation scores are used. At the candidate level (choosing artifacts), helpful candidate artifacts exist, but selection is no better than random at telling them from harmful ones, so errors accumulate across rounds. At the method level (ranking methods), typical margins of a few percentage points are smaller than the difference between two independent runs of the same method, so published rankings often rest on luck. Together, these findings indicate that agent evolution is often bottlenecked by reliably identifying improvements. This calls for a shift in how we develop and evaluate self-improving agents, from designing ever more candidate improvement systems to making true improvements detectable and accumulable.

  • We trace this puzzle to the Resolution Hypothesis: agent evolution stalls not because methods fail to propose better artifacts, but because noisy evaluations cannot reliably identify them.
  • We trace this puzzle to the Resolution Hypothesis: agent evolution stalls not because methods fail to propose better artifacts, but because noisy evaluations cannot reliably identify them.
  • Across seven evolution methods and six models (over 10M LLM calls), we find support for the hypothesis at both levels where evaluation scores are used.
  • Together, these findings indicate that agent evolution is often bottlenecked by reliably identifying improvements. This calls for a shift in how we develop and evaluate self-improving agents, from designing ever more candidate improvement systems to making true improvements detectable and accumulable.
186

Decoding Without a Decoder: Direct Pixel Prediction from Diffusion Transformers

66

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

Hansheng Chen, Shengqu Cai và 5 nguồn khác 1 bài viết · Hugging Face Papers
Nguyên văn nguồn
Chi tiết nguồn

Latent diffusion models rely on a decoder to map denoised latents to pixels, adding complexity and inference cost. We introduce Decoding Without a Decoder (DWD), which lets a finetuned diffusion transformer produce final pixels directly through a linear head. Unlike previous methods, where the denoising output leads to final pixels, DWD separates the two roles: the original denoising head continues to drive sampling, then the new DWD head predicts the pixels at the final step. We extend pretrained latent models with DWD efficiently by finetuning only the last few transformer blocks, training the DWD head with pixel quality losses while anchoring the denoising head to the pretrained model to preserve the sample trajectory. Across latent image and video generators, DWD removes the decoder and reduces inference cost while maintaining or even improving pixel quality. On Wan video generation, it visibly reduces detail distortion and flickering, lowering warping error by 23%. Remarkably, the same separation also improves pixel diffusion models that do not even use a decoder: a final-step DWD head produces substantially better texture detail in text-to-image generation, and improves ImageNet FID from 1.55 to 1.43, a new state of the art among pixel flow models.

187

Let Samples Sing in Chorus: Mitigating Spurious Correlations via Cross-view Consensus

64

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

Weiwei Li, Junzhuo Liu và 4 nguồn khác 1 bài viết · Hugging Face Papers
Nguyên văn nguồn
Chi tiết nguồn

Deep models often rely on spurious correlations that fail on underrepresented groups. Existing methods either correct human-specified bias attributes or infer unknown biases from the learned representation space. However, annotated attributes may differ from the shortcuts actually used by a model, while a single representation provides incomplete and potentially noisy evidence. Our key insight is that a bias obscured in one feature space may be clearer in another. In this work, we propose CHORD (Cross-view Harmonic Outlier Reversal for Debiasing), a multi-view framework that allows samples to "sing in chorus" across diverse representation spaces to achieve robust cross-view consensus. CHORD aggregates aggregates within-class partitions in each view, which is a proxy for specifying candidate biases, to debias the target representation and classifier without bias supervision. Experiments on seven benchmarks across vision, language, speech, and medical imaging show consistent improvements in worst-group accuracy. Code and checkpoints are available at https://github.com/davelee-uestc/chord_debiasing_public .

188

Out of Sight, Still in Mind: Token Compression for Omni-LLMs

63

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

Suho Yoo, Youngjoon Jang 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

The goal of this paper is to reduce the input token cost of Omni-modal large language models (Omni-LLMs) at inference time. Omni-LLMs reason jointly over audio, video and text, but the cost of the three streams is highly unbalanced: visual tokens account for the vast majority of the input, and are highly redundant. In this paper, we propose ReMo, a training-free framework that compresses visual tokens by redistributing their information across modalities: a visual token is kept only if its information appears nowhere else. ReMo achieves this in two ways: (i) it aligns audio and video in a shared space via closed-form calibration, and removes visual tokens already explained by the audio or by other visual tokens; and (ii) it replaces object-level visual tokens, identified by a lightweight object detector, with compact text proxies, short descriptions of each object and its location, conveying the same content in far fewer tokens. On Qwen2.5-Omni at two model scales, ReMo removes 54% of the input tokens with comparable accuracy. It performs comparably to the full-token model, reaching 101.2% and 101.4% of its average accuracy over five audio-visual benchmarks.

189

NexSight: Verifiable Tasks for Fine-Grained Agentic Long-Video Understanding

63

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

Tianci Xie, Li Chen và 2 nguồn khác 1 bài viết · Hugging Face Papers
Biên tập tiếng Việt
Chi tiết nguồn

Bài báo nói rằng các câu hỏi chi tiết theo thời gian trong video dài có thể yêu cầu tìm các khoảnh khắc ngắn rải rác trong nhiều giờ. Việc đánh giá và học cho các mô hình tác nhân quyết định khi nào và nơi nào cần quan sát là khó vì bằng chứng thưa thớt có thể không đảm bảo đếm đúng hoặc không đủ để kiểm chứng toàn bộ dòng thời gian. Nhóm giới thiệu NexSight để xây dựng các tác vụ có thể kiểm chứng nhằm vừa đánh giá vừa huấn luyện hiểu video dài theo dạng tác nhân.

Fine-grained questions about long videos ask how many times an action occurs, in what order events unfold, or exactly when a state changes. Answering them can require finding brief moments scattered across hours of footage. Agentic models that decide when and where to look promise to find these moments, yet this ability is hard both to measure and to learn. Sparse supporting evidence may establish that an action occurred without establishing its total count; verifying timeline-wide claims requires checking for missed occurrences and double counting. Answer-only supervision, in turn, does not explicitly supervise the search for evidence. We present NexSight, which builds verifiable tasks to both evaluate and train agentic long-video understanding. Its agentic pipeline, SightForge, accepts a task only if a verifier blind to the draft answer can reconstruct it from evidence densely reacquired from the raw video and counterexample checks fail to refute it. This yields SightLine, 310 evidence-traceable tasks from 108 long videos, evaluated through SightLoop, a shared multiscale harness supporting temporal exploration, local inspection, evidence integration, and revisiting while recording returned observations. On disjoint videos, solver trajectories on verified tasks become step-level supervision for observation decisions. The strongest model reaches only 54.52% on SightLine, yet 79.35% when given the annotated evidence. With under 6K examples, Sight-35B nearly doubles its base model's interactive accuracy (21.29% to 42.26%), outperforms the 397B model of its family, begins using explicit spatial inspection after post-training, which its base model never uses, and gains over 8 points on two external long-video benchmarks.

  • This yields SightLine, 310 evidence-traceable tasks from 108 long videos, evaluated through SightLoop, a shared multiscale harness supporting temporal exploration, local inspection, evidence integration, and revisiting while recording returned observations.
  • This yields SightLine, 310 evidence-traceable tasks from 108 long videos, evaluated through SightLoop, a shared multiscale harness supporting temporal exploration, local inspection, evidence integration, and revisiting while recording returned observations.
  • The strongest model reaches only 54.52% on SightLine, yet 79.35% when given the annotated evidence.
  • With under 6K examples, Sight-35B nearly doubles its base model's interactive accuracy (21.29% to 42.26%), outperforms the 397B model of its family, begins using explicit spatial inspection after post-training, which its base model never uses, and gains over 8 points on two external long-video benchmarks.
190

When One GPU Isn’t Enough: Serving GLM-5.3 Across Two NVIDIA DGX Stations with vLLM

59

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

Fatima Fall, vLLM 1 bài viết · NVIDIA Developer Blog, X
Nguyên văn nguồn
Chi tiết nguồn

Running a frontier-scale model locally means keeping all its weights in GPU memory; the largest models no longer fit on one machine. Two NVIDIA DGX Stations... Running a frontier-scale model locally means keeping all its weights in GPU memory; the largest models no longer fit on one machine. Two NVIDIA DGX Stations connected over ConnectX-8 RDMA serve one model through a single endpoint, with tensor parallelism splitting the model weights and computation across both GPUs. The NVIDIA GLM-5.3 NVFP4 model, a quantized version of Z.ai’s mixture-of… Source

191

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

63

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
192

ALIVE: Making Streaming Video Models Interactive

63

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.

193

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

59

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.

181–193 / 193
Trang 10 / 10