arXiv Machine Learning June 30, 2026 By Ho Fung Tsoi, Dylan Rankin, Vladimir Loncar, Philip Harris

SparsePixels: Efficient Convolution for Sparse Data on FPGAs

Read the original on arXiv Machine Learning →

arXiv:2512. 06208v3 Announce Type: replace-cross Abstract: Inference of standard convolutional neural networks (CNNs) on FPGAs often incurs high latency and a long initiation interval due to the deep nested loops required to densely convolve every input pixel regardless of its feature value.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

efficiency

arXiv AI

Jun 2

HASTE: Hardware-Aware Dynamic Sparse Training for Large Output Spaces

arXiv:2606. 01117v1 Announce Type: cross Abstract: Extreme multi-label classification (XMC) involves learning models over large output spaces with millions of labels, making the output layer a memory-compute bottleneck.

By Nasib Ullah, Jinbin Zhang, Jean Lucien Randrianantenaina, Erik Schultheis, Rohit Babbar

efficiency benchmarks safety

arXiv Machine Learning

Sep 17

FAME: An FPGA-Based Platform for Approximate Multipliers Evaluation with Pattern-Guided DNN Retraining

FAME is an FPGA-based platform that evaluates approximate multipliers directly in hardware, eliminating slow CPU/GPU LUT emulation and reducing evaluation time for DNN inference. It also introduces a pattern-guided retraining method that uses multiplier-specific patterns to recover accuracy losses. Experiments on ResNet‑18 and MobileNetV2 over ImageNet show up to 3.47× faster multiplier evaluation and a 65.5% accuracy improvement over prior retraining approaches.

By Rappy Saha, Nima Amirafshar, Jude Haris, Nima Taherinejad, Jos\'e Cano

arXiv Machine Learning

Aug 4

CascadeLUT: Information-Ordered Streaming Inference for Bandwidth-Constrained FPGAs

arXiv:2608. 00720v1 Announce Type: cross Abstract: Mapping neural networks to FPGAs enables low-latency, energy-efficient inference, particularly for lookup table (LUT)-based models that eliminate multipliers and map directly to reconfigurable fabric.

By Oliver Cassidy, Marta Andronic, George A. Constantinides

efficiency

arXiv Machine Learning

Jun 9

Convolutional Sparse Coding via the Locally Competitive Algorithm on Loihi 2

arXiv:2606. 08584v1 Announce Type: new Abstract: Sparse coding provides a principled framework for signal representation by expressing an input as a linear combination of only a small number of basis functions.

By Geoffrey Kasenbacher, Daniel Ruepp, Gerrit A. Ecke

benchmarks

arXiv Computer Vision

Sep 22

C$^{2}$-INR: Customized Convolutional Implicit Neural Representation

arXiv:2609.22807v1 Announce Type: new Abstract: Implicit Neural Representation (INR) leverages neural networks to represent discrete signals such as images as continuous ones, where the network weigh...

By Jinglei Shi, Xinran Chang, Jiaqi Cui, Yingjie Xia, Zhaolin Xiao, Chongyi Li

benchmarks

Hugging Face Trending Papers

Jun 24

Energy-Efficient CNN Acceleration with MSDF Digit-Serial Arithmetic on FPGA

This paper presents an energy-efficient hardware acceleration of the convolutional layers in the U-Net architecture for image segmentation, implemented on FPGA. While digit-serial arithmetic, particularly most-significant-digit-first (MSDF) techniques, offers a compact hardware footprint, it suffers from initial latency before producing the first output digit.

computer-vision efficiency

One email a morning, machine-written

Related stories

HASTE: Hardware-Aware Dynamic Sparse Training for Large Output Spaces

FAME: An FPGA-Based Platform for Approximate Multipliers Evaluation with Pattern-Guided DNN Retraining

CascadeLUT: Information-Ordered Streaming Inference for Bandwidth-Constrained FPGAs

Convolutional Sparse Coding via the Locally Competitive Algorithm on Loihi 2

C$^{2}$-INR: Customized Convolutional Implicit Neural Representation

Energy-Efficient CNN Acceleration with MSDF Digit-Serial Arithmetic on FPGA