arXiv Machine Learning
Jul 31
It's All Just Vectorization: einx, a Universal Notation for Tensor Operations
arXiv:2607. 27987v1 Announce Type: new Abstract: Tensor operations represent a cornerstone of modern scientific computing.
Vectorizer: Vectorizing NumPy Programs with Shape-Guided Rewrite
Vectorizer is a source‑to‑source tool that transforms NumPy programs containing explicit loops into vectorized array operations by rewriting loop bodies from the inside out. It uses array shapes and dataflow analysis to guide a set of rewrite rules that are correct by construction, achieving fast transformations—averaging 0.53 seconds per benchmark. In tests on 150 benchmarks, Vectorizer successfully vectorized 142 directly and 2 with minor edits, producing code that runs on average 74.83× faster than the original loop‑based implementations.
Related stories
arXiv Computer Vision
Aug 26
TorchMorph: CUDA-accelerated Morphological Transforms
arXiv:2608.24738v1 Announce Type: new Abstract: Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e....
Hugging Face Trending Papers
Aug 25
TorchMorph: CUDA-accelerated Morphological Transforms
Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e. scipy.ndimage, is CPU-only, single-array, and th...
arXiv AI
Aug 10
A Fortran General-Purpose Transpiler: Proof of Concept
arXiv:2608. 00130v2 Announce Type: replace-cross Abstract: Fortran has been the cornerstone of high-performance computing for decades and remains unmatched in many domains.
arXiv Machine Learning
Jul 9
VTC: DNN Compilation with Virtual Tensors for Data Movement Elimination
arXiv:2604. 09558v2 Announce Type: replace-cross Abstract: With the widening gap between compute and memory operation latencies, data movement optimizations have become increasingly important for DNN compilation.
arXiv AI
Jun 9
Attention at the Theoretical Minimum: A Mathematics of Arrays Framework for Memory-Optimal Transformer Kernels
arXiv:2606. 07713v1 Announce Type: cross Abstract: The attention mechanism is the dominant computational bottleneck in modern transformer-based AI.
arXiv AI
Jun 16
FasterPy: An LLM-based Code Execution Efficiency Optimization Framework
arXiv:2512. 22827v2 Announce Type: replace-cross Abstract: Code often suffers from performance bugs.
arXiv AI
Jul 7
Differentiate the Evaluator, Not the Program: An Efficient Runtime Representation for Neuro-Symbolic Learning
arXiv:2607. 03574v1 Announce Type: cross Abstract: AI systems increasingly propose executable scientific models whose value depends on both their symbolic structure and their fitted continuous parameters.
arXiv Machine Learning
Aug 4
Nova: An End-to-End MLIR Compiler for Deep Learning
arXiv:2608. 00029v1 Announce Type: cross Abstract: The performance of deep learning models at scale relies heavily on how effectively high-level mathematical operations are mapped to underlying physical hardware.
arXiv AI
Jul 29
At-the-Roofline Sparse Tensor Contractions on Vector Processors for Transformer Inference
arXiv:2607. 25504v1 Announce Type: cross Abstract: Fine-grained weight pruning and activation sparsification have emerged as effective approaches for reducing the compute and memory cost of inference for Transformer models.
arXiv AI
Jun 4
CodegenBench: Can LLMs Write Efficient Code Across Architectures?
arXiv:2606. 04023v1 Announce Type: cross Abstract: While large language models (LLMs) have been extensively evaluated on code generation tasks for general-purpose programming and GPU-accelerated environments (e.
arXiv AI
Jun 8
E2Former-V2: On-the-Fly Equivariant Attention with Linear Activation Memory
arXiv:2601. 16622v2 Announce Type: replace-cross Abstract: Equivariant Graph Neural Networks (EGNNs) have become a widely used approach for modeling 3D atomistic systems.