ZeroHour

Search: “kernels”

8 stories in the last 3d

A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings

Proposes the Sparse Landmark Embedding kernel, guaranteeing PSD kernels for arbitrary distances like geodesic and Wasserstein without CND requirements.

The paper introduces the Sparse Landmark Embedding (SLE) kernel, which embeds inputs via compactly supported bump functions at all |D| training points so any standard PSD kernel applies, removing the Hilbertian (CND) distance requirement that fails on manifolds and distribution spaces. Compact support controls sparsity, keeping kernel matrices well-conditioned despite high dimensionality. The authors prove PSD, sparsity, stability, and universal approximation guarantees, and show SLE matches or exceeds domain-specific baselines using geodesic and Wasserstein distances on accuracy and uncertainty quantification.

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

Nunchux AI Introduces VC-Attention: A Training-Free Low-Bit Attention Kernel That Speeds Up Video Diffusion Transformers

Nunchux AI introduces VC-Attention, a training-free low-bit attention kernel that speeds up video diffusion transformers up to 3.58x.

Nunchux AI unveiled VC-Attention, a training-free attention kernel for video Diffusion Transformers combining V-Smooth (k-means value-token grouping with block-mean residual quantization) and ExpCast-FP8 (single multiply-add softmax exponentiation). Benchmarks on Wan2.2-T2V-A14B, LongCat-Video, HunyuanVideo-1.5, and MiniMax-H3 show 1.59x attention speedup on B200 at 8-bit and 3.58x on RTX 5090 at 4-bit, with end-to-end gains up to 1.70x. It beats SageAttention2 by 2.3 dB PSNR on Wan2.2 at 8-bit and SageAttention3 by up to 3.6 dB at 4-bit. No public kernel release yet; a proprietary extension runs in Nunchux's stack.

MarkTechPost · 11h agoAI research 2 sources1

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

FlashVector: Agent for Hierarchical Model Serving Stack Optimization

FlashVector agent optimizes all layers of Unity's ad-serving stack, delivering up to 2x model-server throughput and 1.98x latency speedup in production.

FlashVector is an agentic system that optimizes performance across GPU kernels, ML framework computation graphs, model servers, and on-demand feature processing. Deployed in Unity's Vector advertising platform, it achieved up to 2x model-server throughput increase, 1.98x latency speedup, and 1.6x feature-store throughput gain. Optimizations spanned NVIDIA Triton's C++ codebase and the Python feature transformation service, demonstrating extensibility beyond single-kernel tuning.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

Det-LIME: Detector-Aware, Multi-Instance Local Interpretable Model-Agnostic Explanations for Automated Marine Mammal Detection

Det-LIME extends LIME to multi-instance object detection explanations, improving attribution for harbor seal aerial surveys.

Det-LIME adapts LIME to object detection by combining per-detection weighting, a proximity kernel emphasizing box-adjacent regions, and IoU-based matching to track instances across perturbations. It was evaluated on aerial drone imagery for harbor seal detection plus a seabird case study, and compared against vanilla LIME, Stabilized LIME, Deterministic LIME, and gradient-based attribution. Using Attribution Ratio and Max Saliency Hit Rate metrics, it consistently improved multi-instance attribution and produced box-aligned explanations useful for debugging and data augmentation.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

OPEN-1B: A Fully Auditable Training Run

Open-1B releases a 1B-parameter model with bitwise-reproducible training, letting independent auditors verify every step of the run on commodity hardware.

The paper introduces a 'fully auditable' tier of model transparency: every training operation is reproducible with bitwise certainty on heterogeneous commodity hardware by imposing definite ordering on GPU kernel reductions, data batch ordering, and collective communication. Because replaying a full run on one machine is infeasible, a collective verification scheme lets many independent auditors certify individual steps covering the whole run. The authors release Open-1B with its full pretraining dataset, every intermediate checkpoint, the training codebase, and an audit harness. This rules out undisclosed data, injected biases, or backdoors that proof-of-learning or proof-of-training-data techniques cannot exclude.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

How much of F-Droid is LLM generated?

A FOSS maintainer manually graded 102 F-Droid apps from the September 12, 2026 update batch, finding many show signs of LLM-generated code.

A student and FOSS app maintainer reviewed 102 apps pushed to F-Droid on September 12, 2026, assigning each a three-tier rating for likelihood of LLM-authored code (mostly AI >50%, hard to say/mostly human, no signs of AI). The heuristic relies on commit aesthetics, README and branding style, and the presence of agentic infrastructure like Claude Code or Codex, which automatically places an app in the 'mostly AI' tier. Example ratings include Amber (Nostr event signer) as mostly AI, and Aria for Misskey as showing no AI signs. The author stresses reliable detection of LLM-generated code from text alone is impossible, so ratings are approximate.

Quenched Ensemble Sampling

Quenched Ensemble Sampling generalizes nested sampling's hard energy constraint to repulsive potentials, traversing first-order phase transitions where tempering fails.

Quenched Ensemble Sampling generalizes nested sampling's hard energy constraint into a family of repulsive potentials at the energy boundary, preserving monotone energy descent while making the constrained target amenable to scalable gradient-based kernels. On synthetic phase-transition models it estimates marginal likelihood and draws posterior samples across first-order transitions where popular alternatives such as tempering fail. Applications include marginal likelihood estimation for Bayesian neural network architecture comparison and partition function estimation in a high-dimensional continuous lattice field theory.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research1