Configure, Certify, and Operate Kubernetes GPU Clusters with NVIDIA DSX OS
One underperforming GPU can slow an entire distributed training job. The node may pass basic health checks and show normal utilization, leaving operators to...
Today's news
Research & methods / 01Augmentation with Reinforcement Transformation for Low-textured Scientific Sketch Image RetrievalarXiv cs.CV
01 / IN FOCUS
Augmentation with Reinforcement Transformation for Low-textured Scientific Sketch Image Retrieval
arXiv cs.CVData & engineering / 02MicrosoftClickHouse expands collaboration with Microsoft, bringing Fabric integration, deeper OneLake interoperability, and enterprise deployment flexibility
02 / IN FOCUS
ClickHouse expands collaboration with Microsoft, bringing Fabric integration, deeper OneLake interoperability, and enterprise deployment flexibility
ClickHouseData & engineering / 03MicrosoftClickHouse Workload for Microsoft Fabric: sub-second analytics on OneLake, now in public preview
03 / IN FOCUS
ClickHouse Workload for Microsoft Fabric: sub-second analytics on OneLake, now in public preview
ClickHouseAI NEWS × FOXAIFind your next step
Explore AI tools From the latest news to tools that work for you.
Discover AI tools
Swipe to explore →E
EvoMapAgents & automation
MemoAIMusic & audio
JAXModels & infrastructure
Open DesignDesign & 3D
KiroCoding & development
AI ShortWriting & content
妙播Marketing & commerce
RowsData & analytics
Meta AI助手Assistants & search
FinBusiness & support
EvoMapAgents & automationEvoMap is an infrastructure designed for the reuse of AI agent experiences. It organizes reusable strategies and repair assets with validation records via the GEP protocol, offering market- and quality-based ranking to help different agents discover, evaluate, and inherit existing capabilities.
分类推荐榜首MMemoAIMusic & audioMemoAI is an AI-powered audio-to-text tool that supports localized processing, eliminating the need to upload data and ensuring privacy and security. It can efficiently transcribe YouTube videos, podcasts, and local audio/video files (such as MP4, MP3, AAC, M4A, etc.) into text, while offering core features like multilingual translation, speaker diarization, real-time subtitles, and floating notes—making it ideal for meeting minutes, interview transcription, content learning, and more.
分类推荐榜首JJAXModels & infrastructureJAX is a Python numerical computing library designed for accelerators, specifically tailored for high-performance array computations and large-scale machine learning. It efficiently executes the same code across multiple hardware backends, including CPUs, GPUs, and TPUs.
分类推荐榜首OOpen DesignDesign & 3DOpenDesign is an open-source design workspace that can connect to local programming agents, use built-in model keys, or leverage cloud-based models, enabling the creation and editing of prototypes, web pages, presentations, and graphics within a design system; local software is free, while model services incur fees.
分类推荐榜首KKiroCoding & developmentKiro is an AI engineering tool for developers that organizes requirements into specifications, architectures, and tasks, generates code via agents, and supports the entire workflow—from planning to code review—through property-based testing, execution memory, and integration with development tools.
分类推荐榜首AAI ShortWriting & contentAIS ALERT MANAGEMENT AND SHARED PLATFORM, QUICK COMMAND FOR MULTIPLE SCENARIOS
分类推荐榜首妙妙播Marketing & commerceTHE AI LIVE TELECOM SOLUTION FROM THE AD
待评分 · 分类列表推荐RRowsData & analyticsRows is a spreadsheet tool that combines AI analytics, data integration, and interactive reporting, enabling you to organize documents and business data using natural language, merge datasets, generate reports, and build computational models. The official website currently indicates that it has been integrated with Superhuman and provides a corresponding link to continue using the service.
待评分 · 分类列表推荐MMeta AI助手Assistants & searchMeta's free AI chat assistant
待评分 · 分类列表推荐FFinBusiness & supportCLIENT-ORIENTED AI SMART BODY。
待评分 · 分类列表推荐AI, as it happens
1283 published storiesCompute & infrastructure · 171 storiesClear filters ×
2026-11-06
Follow the timelineFrom Tokens to Trajectories: Parameter-Efficient Continuous Adaptation of Unified Multimodal Models
arXiv:2611.05451v1 Announce Type: new Abstract: While discrete tokenization in Unified Multimodal Models (UMMs) establishes strong semantic reasoning, it introduces a strict quantization bottleneck that degrades fine-grained visual details, often resulting in structurally accurate but artifact-heavy images. We introduce FlowShift, a parameter-efficient post-training framework that bypasses this bottleneck by converting pre-trained discrete UMMs into continuous rectified-flow generators. Instead of discarding the backbone's semantic priors, FlowShift replaces discrete visual interfaces with continuous latent projections and applies LoRA to the attention layers. To efficiently boost visual quality without semantic drift, we propose Dual-Objective Velocity Vector Distillation (DOVD), which aligns the model with a high-fidelity continuous teacher and ground-truth continuous trajectories. This approach drastically improves perceptual quality while preserving prompt adherence and reasoning. When applied to leading discrete UMMs, FlowShift significantly improves COCO-30K FID and aesthetic scores, while retaining over 99.5% of multimodal understanding capabilities. Ablations confirm DOVD drives generation quality. Ultimately, FlowShift achieves high-fidelity continuous generation without sacrificing pre-trained semantic grounding.
Performance Portability of Out-of-Kernel Optimizations on GPUs: A Molecular Docking Case Study
arXiv:2611.06207v1 Announce Type: new Abstract: Achieving performance portability is challenging for irregular scientific applications built as repeated multi-kernel GPU pipelines, because throughput depends on out-of-kernel decisions as much as on kernel efficiency. Using molecular docking as a representative case study, we propose an out-of-kernel tuning methodology that treats batching policy, worker concurrency, and per-worker memory allocation as explicit optimization parameters, replacing backend-dependent occupancy-driven choices with a more portable execution strategy based on explicit resource bounds. We implement this methodology in the muDock mini-app under a manager/worker execution model where multiple host workers share a GPU through independent streams. We then evaluate the methodology on NVIDIA, AMD, and Intel GPUs across CUDA, HIP, and SYCL implementations. Across all evaluated platform/backend pairs, the memory-bounded formulation exceeds the peak throughput of the occupancy-guided baseline. The fully tuned methodology improves the end-to-end throughput on all tested configurations, achieving an average speedup of 1.53x over the baseline.
The Wizard of Open Weights: Chris Alexiuk Makes AI Easy With Open Models
Chris Alexiuk has a simple rule about open source AI: If you believe in it, be loud about it. “We should be shouting about this technology from the rooftops,” said Alexiuk, a Toronto-based senior product research engineer in deep learning at NVIDIA who specializes in making open large language models (LLMs) practical for working developers. […]
2026-11-05
Follow the timelineAb Initio Accuracy Beyond the Cutoff: Distributed Message-Passing Equivariant Attention at Tens-of-Millions-of-Atom Scale
arXiv:2611.06122v1 Announce Type: new Abstract: Molecular dynamics predicts molecular motion from atomic forces and trajectory integration. Density functional theory (DFT) provides first-principles forces, but its $O(N^3)$ cost limits simulations to thousands of atoms; empirical force fields scale to millions but miss bond breaking and charge transfer. Equivariant message-passing Transformers learn the ab initio potential at linear cost. Stacked layers propagate information beyond a single cutoff, giving four layers a receptive field up to 23{\AA}. At this frontier, scale is limited by communication: layers exchange boundary features across devices, force backpropagation repeats the exchange, and moving atoms change neighbor graphs and tensor shapes. We present Tessera, a distributed runtime that fixes workload shapes between rebuilds. It sorts atoms along a space-filling curve into equal-count shards, ensuring identical atom counts and tensor shapes per rank. Peer sets scale as $K^{0.5}$, not $K$. A conservative neighbor skin preserves topology across updates, enabling each rebuild interval to replay as one CUDA Graph. Fused kernels, three-level neighbor search, and overlapped All-to-All complete it. On 512 GPUs, Tessera sustains 30.7M atoms at 89.7% weak-scaling efficiency (77--90% across three per-GPU loads); per-step time rises 1.11--1.29x as machine and problem grow 16x. Graph reuse cuts full-step time $1.87\times$. Across an $8\times$ device increase, neighbor-search cost grows $1.7\times$, versus $3.0\times$ for Morton order. In a live $10.24$M-atom salt solution, NVE energy drift is $0.42\,\mu$eV/atom/ps over $10$ ps, and structure matches a serial reference. A 10.06M-atom Norovirus capsid sustains 100 ps of NVT at $\approx 8$ ps/day on 256 A100 GPUs. Over 200,000 steps, it has no broken bonds or anomalously close pairs and uses three compiled variants, with no graph breaks or eager fallbacks.
b12114
Fixed get_max_size to return maxBufferSize and improved the memset shader to handle buffer sizes exceeding the maximum binding size, preventing issues with whole-buffer bindings in memset and clear operations.
b12116
The llama.cpp release b12116 introduces support for the drama-3 text-to-speech model, includes cleanup improvements, and ensures the drama3 helper stops at the codebook tower limit. This update provides binaries for multiple platforms including macOS, Linux, Windows, Android, and iOS, with support for various backends such as CUDA, Vulkan, ROCm, OpenVINO, and SYCL. Some builds remain disabled or require additional setup.
b12118
The update enhances OpenCL performance for decode operations by optimizing workgroup usage for q4_K gate up and GLU, and adds support for Flash Attention (FA) in various configurations including GQA 2, 6, and 16 with different head sizes, improving efficiency on specific hardware setups.
b12121
A fix was implemented in llama.cpp to correct the calculation of on-device sequence state copy sizes for quantized key-value (KV) caches, ensuring accurate copying of data blocks and preventing crashes or incorrect state restoration. The update adjusts the element count computation using proper block size handling and removes redundant code elements.
b12122
The update introduces optimizations for CUDA by fusing NVFP4 gate/up operations and GLU within MMQ, honoring requested precision in fused gate/up MMQ, sharing scale checks for NVFP4, skipping unused FP4 kernels, testing with W4A8 configurations without scales and with batching, and adding checks for gate_scale before loading fused NVFP4 gate scale.
b12123
The update introduces DSV4_HC_PRE and DSV4_HC_POST support for OpenCL, along with improvements to dsv4_hc_post functionality, enhancing performance and compatibility across various platforms including macOS, Linux, Windows, Android, and embedded systems.
b12124
The release includes support for non-contiguous sigmoid operations in OpenCL, enhancing compatibility and performance across various hardware platforms. This update is part of a broader set of improvements and new binary distributions for multiple operating systems and backends, including macOS, Linux, Windows, Android, and openEuler, with support for CUDA, Vulkan, ROCm, OpenVINO, SYCL, and other accelerators.
b12125
The update enables f32 and q5_k multi-column GEMV by default for Adreno X2 on X2E devices, improving performance for specific computational tasks in the llama.cpp framework.
b12128
The fix addresses intermittent CI failures in TOPK_MOE tests caused by near ties in logits, particularly with uniform random inputs and narrow-range gating functions like sqrt_softplus. The solution involves redrawing logits until group selection and top-k decisions have a relative margin of 1e-4 in double precision, and constructing logits by inverting the gating function using a grid-based approach to ensure consistent expert selection across backends.
FenixWalk: Adaptive Sampling for Large-Scale Dynamic Graphs on Heterogeneous Architectures
arXiv:2611.04683v1 Announce Type: new Abstract: Random walks are fundamental to graph analytics, yet executing them efficiently on large, evolving graphs remains challenging. Existing approaches must balance sampling efficiency, update overhead, and memory consumption. Sampling structures optimized for throughput often incur substantial memory overhead and costly maintenance, whereas lightweight alternatives can suffer from high sampling latency on high-degree vertices or skewed weight distributions. These challenges become more pronounced on heterogeneous CPU--GPU platforms, where host memory provides capacity but GPU memory limits the amount of graph data that can benefit from parallel acceleration. We present FenixWalk, a memory-efficient random-walk system that combines unified in-place sampling with selective GPU acceleration for large-scale dynamic graphs. At its core, FenixWalk employs an in-place Fenwick representation that supports both rejection sampling and inverse-transform sampling without duplicating edge-level weight storage. This representation enables expected O(1) weight lookup for rejection sampling, together with O(log d) prefix sampling and updates. To exploit heterogeneous hardware efficiently, FenixWalk maintains the complete graph and its sampling structures in host memory while selectively placing frequently reused vertex-local samplers on the GPU. By transferring compact walker states instead of repeatedly migrating graph partitions, the system reduces cross-device communication and makes effective use of limited GPU memory. Experiments on large real-world graphs and representative random-walk workloads demonstrate that FenixWalk achieves average speedups ranging from 2.06x to 400.57x over existing random-walk systems.
How NVIDIA Uses AI Agents to Streamline AI Factory Operations
As GPU clusters scale, operations span compute, network, hardware, and scheduling. Site reliability engineers (SREs) often have to examine multiple dashboards...
Kyndryl shares surge 30% on hyperscaler-related revenue growth
Shares of Kyndryl Holdings Inc. jumped 30% today after it reported better-than-expected earnings for the second quarter of its 2027 fiscal year. Kyndryl generated $3.9 billion in sales during the three months ended Sept. 30. That represents a 1.9% decrease from a year earlier, but the company still managed to top the consensus estimate by […] The post Kyndryl shares surge 30% on hyperscaler-related revenue growth appeared first on SiliconANGLE.
LiquidCP: Decoupling Attention Tasks from Communication and Kernel Boundaries in Context Parallelism
arXiv:2611.04401v1 Announce Type: new Abstract: Context parallelism (CP) partitions long sequences across GPUs for LLM training and inference. For variable-length training and full prefill, attention-balanced placement can leave token loads uneven, while ring execution repeats overhead at each computation and communication step. In stage-serialized decode CP (DCP), long-running tasks delay dependent work and leave substantial GPU hardware idle. We propose LiquidCP, which unifies training and inference through a common model of Transfer, Compute, and Reduction tasks with tile-level dependencies, decoupling attention tasks from communication and kernel boundaries. For training and full prefill, MegaRing incorporates BuddyRing placement to balance attention and token loads, and coalesces ready KV regions during forward attention to amortize overhead. For decoding and mixed batches, MegaDCP selects history-KV splits by jointly modeling the completion of attention and its dependent reductions. A shared persistent GPU-resident engine executes both designs. Compared with the fastest baseline per configuration on eight H100 GPUs, MegaRing achieves geometric-mean core-attention speedups of $1.23\times$ forward and $1.18\times$ backward, and accelerates a Transformer layer by $1.08$--$1.16\times$. MegaDCP achieves geometric-mean core-attention speedups of $1.20\times$ for decode-only and $1.35\times$ for mixed batches. In vLLM serving with KV prefix cache, it achieves an average time-to-first-token speedup of $1.22\times$.
NVIDIA CUDA 13.5 Brings NVIDIA Vera Rubin GA Support
As artificial intelligence and accelerated computing continue to push the boundaries of what's possible, the latest NVIDIA CUDA release arrives to unlock...
The Sequence Opinion - Issue #966: The Forward Curve of Intelligence
How GPU derivatives could reshape the economics of AI
Every update links back to its source.