ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “oracle”

3 stories in the last 24h

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI research 2AI industry 1
SeverityAllcritical 0high 0medium 0low 0info 3

A Zeroth-Order Paradigm for LLM Preference Alignment

Researchers propose ComPO, a zeroth-order comparison-based preference alignment method with convergence guarantees that mitigates likelihood displacement in LLMs.

ComPO extracts directional information from preference pairs via comparison oracles instead of optimizing a differentiable preference loss, addressing likelihood displacement in direct alignment methods. The paper establishes convergence guarantees for the offline scheme and introduces an online variant with reverse-KL control using unlabeled policy generations. Experiments on Mistral, Llama, Gemma-2, Gemma-3, and Qwen3 models show improvements over existing direct alignment methods, including length-controlled win rates.

arXiv cs.AI / cs.LG / cs.CL · 18h agoAI research 2 sources

Fast Learning Rates for Physics-Informed Kernel Methods

Theoretical analysis proves finite-sample learning rates for physics-informed kernel estimators, showing differential observations can improve rates from n^-1/4 to n^-1/2.

The paper analyzes a physics-informed kernel estimator combining n value observations and m differential observations for a linear differential operator D, asking how much differential information improves prediction. The authors prove finite-sample bounds, supported by simulations, revealing a two-regime structure: when m is limited the rate depends jointly on n and m, and when m exceeds a problem-dependent threshold the rate saturates to the oracle rate. Examples in Sobolev spaces, including partial Laplacian constraints on the torus and gradient observations on bounded domains, illustrate improvements from the nonparametric n^-1/4 rate to the parametric n^-1/2 rate, plus physically consistent rates in a stronger norm.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

NVIDIA Vera Rubin NVL72 Delivers Leading Performance in MLPerf Inference v6.1 Debut

NVIDIA's Vera Rubin NVL72 debuts in MLPerf Inference v6.1 with up to 3.7x higher throughput than GB300 NVL72 and 99% scaling efficiency at 288 GPUs.

In its first MLPerf Inference preview submission, NVIDIA's Vera Rubin NVL72 achieved up to 3.7x higher throughput than GB300 NVL72 on Qwen3-VL and 2.5x on DeepSeek-R1. A 288-GPU GB300 NVL72 submission across four racks reached 99% scaling efficiency on the DeepSeek-R1 offline benchmark. Software optimizations delivered up to 1.6x gains over v6.0, leveraging TensorRT-LLM, vLLM, Dynamo, disaggregated serving, and NVFP4 precision.

NVIDIA Blog · 21h agoAI industry 2 sources