Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

201402603804 · Jun 202019922001200920172026
48 results for Neural GPU

Paper proposes a GPU-based system for training massive deep learning models in ads systems.

problem Training massive deep learning models with terabyte-scale parameters in ads systems.
method Hierarchical GPU parameter server with 3-layer storage (GPU High-Bandwidth Memory, CPU main memory, SSD).
result 4-node hierarchical GPU parameter server trains a model 2X faster than a 150-node in-memory system.

New GPU kernels boost deep learning speed and memory efficiency.

problem Sparse deep learning matrices are not well-suited for existing sparse kernels.
method Identified favorable properties of sparse matrices from deep learning, developed high-performance GPU kernels for sparse matrix operations.
result 27% of single-precision peak performance on Nvidia V100 GPUs achieved with new kernels.

GPU-accelerated particle methods outperform neural samplers in LFT benchmarks.

problem High-dimensional multimodal sampling problems in lattice field theory.
method GPU-accelerated particle Monte Carlo methods (Sequential Monte Carlo and nested sampling).
result These methods match or outperform neural samplers in sample quality and wall-clock time.

SSH-Net: A Deep Neural Network for Predicting Failure Time Distribution Functions under Competing Risks with GPU Data

problem Predicting failure time distribution functions under competing risks
method Structured Segmented Hazard Deep Neural Network (SSH-Net)
result Prediction accuracy validated through simulation studies and GPU data

Performance-aware channel pruning improves CNN on embedded GPUs.

problem Inefficient channel pruning on embedded GPUs leads to performance slowdowns.
method Evaluate higher-level libraries that analyze input characteristics for optimized code generation.
result Performance-aware pruning can achieve significant performance speedups, up to 10x.

HotNAS reduces AI search time from hundreds of GPU hours to less than 3 GPU hours.

problem High time required for AI solution generation from scratch.
method HotNAS starts from a 'hot' state using pre-trained models and integrates compression during co-search.
result Reduces search time from 200 GPU hours to less than 3 GPU hours.

This paper optimizes neural network training by packing multiple models on a single GPU.

problem Efficiently sharing limited training resources among multiple neural network models.
method Proposes a primitive called 'pack' to jointly train multiple models on a single GPU.
result Significant performance improvements for hyperparameter tuning, up to 40% for two models.

SparseRT accelerates sparse computations on GPUs for deep learning inference.

problem Efficiently handling unstructured sparsity patterns on GPUs for deep learning.
method SparseRT, a code generator that leverages unstructured sparsity for accelerating sparse linear algebra operations.
result Geometric mean speedups of 3.4x at 90% sparsity and 5.4x at 95% sparsity for 1x1 convolutions and fully connected layers.

Investigates the impact of batch size on GPU and TPU performance.

problem Optimizing performance of GPUs and TPUs during training and inference phases.
method Investigated the impact of batch size on performance of GPUs and TPUs using standard MNIST and Fashion-MNIST datasets.
result Significant speedup was achieved even with low-scale usage of TPUv2 units, up to 10x for training and 2x for prediction.

Neural architecture search (NAS) has been proposed to automatically tune deep neural networks, but existing search algorithms, e.g., NASNet, PNAS, usually suffer from expensive computational cost. Network morphism, which keeps the functionality of a neural network while changing its neural architecture, could be helpfu…

2018-06-27abs ↗pdf ↗

Proposes RBGP framework for efficient block sparse neural networks.

problem Efficiently exploit structured sparsity patterns for sparse neural networks on GPU.
method Uses Ramanujan Bipartite Graph Product to generate structured multi-level block sparse neural networks.
result Achieves 5-9x and 2-5x runtime gains over unstructured and block sparsity patterns respectively, while maintaining accuracy.

The design of neural network architectures for a new data set is a laborious task which requires human deep learning expertise. In order to make deep learning available for a broader audience, automated methods for finding a neural network architecture are vital. Recently proposed methods can already achieve human expe…

2017-12-20abs ↗pdf ↗

Massively parallel architectures such as the GPU are becoming increasingly important due to the recent proliferation of data. In this paper, we propose a key class of hybrid parallel graphlet algorithms that leverages multiple CPUs and GPUs simultaneously for computing k-vertex induced subgraph statistics (called graph…

2016-08-18abs ↗pdf ↗

End-to-end speech recognition system trained on GPUs and CPUs.

problem Building state-of-the-art speech recognition systems.
method Utilizes CPUs and GPUs for training, data augmentation, and neural network updates. Uses vocal tract length perturbation and acoustic simulator for data augmentation. Employed Horovod allreduce for training.
result Achieved 7.92% WER on proprietary English Bixby open domain test set using a Bidirectional Full Attention (BFA) model.

Study feasibility of deep neural networks for Euro banknote classification.

problem Meeting special requirements for banknote classification by central banks.
method Training and testing deep neural networks on state-of-the-art GPU hardware for few classes and 0-class rejection.
result Deep neural networks can meet central bank requirements for banknote classification.

A GPU framework speeds up BnB for discrete optimization problems.

problem Optimizing large-scale discrete problems with GPU limitations.
method Parallel BnB nodes in GPU batches, using padding and custom kernels.
result One to two orders of magnitude speedup and zero optimality gap.