cập nhật 1 giờ trước

⏱ Độ trễ thật của tab này: trung bình 6.8 giờ sau khi CVE được công bố (n = 5122, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.

25
FastFrames: Video Generation at Interactive Latency
📄 Paper HF Daily Papers 3 ngày trước

Autoregressive video diffusion models generate frames based on new observations and inputs, making them a promising medium for interactive visual experiences. However, existing models are orders of magnitude too slow for fluid interaction. This paper introduces FastFrames, a fami…

🅲 hạng C
24
A Reinforcement Learning Method to Navigate SMEFT Operator Space
📄 Paper HF Daily Papers 4 ngày trước

In particle physics, discrepancies between experimental measurements and Standard Model (SM) predictions are commonly interpreted within new theoretical models. In this context, the Standard Model Effective Field Theory (SMEFT) provides a general framework encompassing a broad cl…

🅲 hạng C
21
Late Entry in Looped Language Models
📄 Paper HF Daily Papers 2 ngày trước

Looped language models deepen reasoning at a compact parameter count by iterating a shared layer stack T times per token, turning recurrence depth directly into sequential decoding latency. Conventional early-exit decoding halts after initial passes without cache completion, trun…

🅲 hạng C
21
Can Verifiable PIR Match the Online Efficiency of SimplePIR?
📄 Paper arXiv cs.CR 2 ngày trước

arXiv:2611.22911v1 Announce Type: new Abstract: Verifiable Private Information Retrieval (vPIR) ensures that a malicious server cannot return tampered database records, but it traditionally incurs significant overhead compared to classical PIR.Recent advancements, notably VeriSi…

🅲 hạng C
21
VSpark: Speculative Decoding for Autoregressive Vision-Language-Action Models
📄 Paper HF Daily Papers 3 ngày trước

Our aim is to accelerate autoregressive vision-language-action models (VLAs), which generate robot actions one token at a time. Speculative decoding makes this possible: a lightweight draft model proposes several tokens at once, and the VLA verifies them in a single pass, accepti…

🅲 hạng C
20
Out of Sight, Still in Mind: Token Compression for Omni-LLMs
📄 Paper HF Daily Papers 3 ngày trước

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 …

🅲 hạng C
20
Binarization as an Attack Surface in Weightless Neural Networks
📄 Paper arXiv cs.CR 4 ngày trước

arXiv:2611.17646v1 Announce Type: new Abstract: Weightless Neural Networks (WNNs) are lightweight classifiers that binarize their inputs and learn by storing binary patterns in lookup memories, which makes them attractive for resource-constrained tasks such as intrusion detectio…

🅲 hạng C