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 = 5486, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.

28
Large Language Models for AI Infrastructure
📄 Paper arXiv cs.AI 1 ngày trước

arXiv:2611.19061v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used to design, optimize, and operate the infrastructure behind AI training and serving, yet the literature remains fragmented across hardware design, machine learning systems, electron…

🅲 hạng C
28
Staged Semantic Distillation: Preserving Free-Form Semantics in a Low-Compute Non-LLM Surrogate of a Staged LLM Agent
📄 Paper arXiv cs.AI 1 ngày trước

arXiv:2611.19299v1 Announce Type: new Abstract: Staged LLM agents make market and social simulators realistic, but one 102-day run of a 200-agent, ten-index market simulator issues 203,100 language-model calls and returns one realization. Conventional low-compute distillation dr…

🅲 hạng C
28
LuthorSQL: A One-Pass Text-to-SQL Model as System 1 for a Slower LLM Agent
📄 Paper HF Daily Papers 6 ngày trước

Frontier LLM agents that query databases with tools are among the most accurate text-to-SQL systems, but per-query calls to a hosted model are slow, costly, and expose sensitive organizational queries to external APIs. For example, a Claude Opus 5.5 agent serving 10,000 queries a…

🅲 hạng C
26
From Sorry to QED: Refining LLM Math Proofs via Angelic Execution
📄 Paper arXiv cs.AI 16 giờ trước

arXiv:2611.22103v1 Announce Type: new Abstract: Large language models (LLMs) can now generate Lean proof scripts that capture the high-level structure of many mathematical arguments. However, these scripts frequently fail on complex theorems: a single missing side condition or m…

🅲 hạng C
26
From Token Changes to Task Failures: Bit Flips in a Shared KV-Cache Block
📄 Paper arXiv cs.CR 16 giờ trước

arXiv:2611.22243v1 Announce Type: new Abstract: In LLM serving systems with prefix caching, each KV block of a shared system prompt is held in GPU memory as a single physical copy, which every request with that prompt reads. Our earlier work measured change and showed that one b…

🅲 hạng C
25
Privacy-Preserving Clustering Algorithm and Parameter Selection for Collaborative Population Stratification Using Distributed PCA
📄 Paper arXiv cs.CR 1 ngày trước

arXiv:2611.18925v1 Announce Type: new Abstract: We propose a privacy-preserving selection layer for collaborative population stratification workflows, enabling an honest-but-curious server to recommend a strong clustering algorithm-hyperparameter configuration from privacy prote…

🅲 hạng C
24
Envisioning Agentic Robotics: A New Era of Robotic Systems
📄 Paper HF Daily Papers 6 ngày trước

The release of GPT-6 Astra marks the emergence of a new paradigm in robotics: agentic robotics. Within weeks, frontier models with agentic harnesses matched or exceeded task-specific policies on many embodied benchmarks. Instead of training a dedicated policy for each family of t…

🅲 hạng C
24
NEBench R1: a Reasoning Benchmark for Evaluating Nuclear Domain Competence in Large Language Models
📄 Paper arXiv cs.AI 16 giờ trước

arXiv:2611.21682v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly being explored for knowledge-intensive and safety-critical applications in nuclear engineering. However, existing nuclear-domain benchmarks provide limited content coverage or focus pri…

🅲 hạng C
23
VoxMel TTS Technical Report
📄 Paper HF Daily Papers 4 ngày trước

Continuous autoregressive TTS relies on an acoustic target that enables stable next-latent modeling while preserving fine-grained acoustic details. While existing approaches employ learned compressed representations (e.g., continuous VAE latents) to render prediction tractable, t…

🅲 hạng C
22
Accelerate Bench: Evaluating Agents for Application-Level Program Optimization
📄 Paper HF Daily Papers 3 ngày trước

Application optimization requires coding agents to discover useful changes and coordinate them across a complete program while preserving the required computation. We introduce Accelerate Bench, a benchmark of 32 CPU optimization tasks adapted from scientific applications and sup…

🅲 hạng C
21
Online Allocation with Differential Privacy
📄 Paper arXiv cs.CR 2 ngày trước

arXiv:2611.17554v1 Announce Type: new Abstract: We study private online allocation problems, where allocation decisions must satisfy differential privacy (DP) to protect sensitive user information while optimizing performance under limited resources. We first formalize different…

🅲 hạng C