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…
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “CPU/GPU optimization”
Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.
problem Institutional rebalancing with deadline constraints
method Asymmetry PRISM
result Asymmetry PRISM-CPU is 4.5x to 24.1x faster than the fastest completed reference row in the same lane.
Framework optimizes cloud container sizing for ML tasks.
problem Challenges in cloud container configuration for ML services.
method Autonomous scaling using nested-loop Monte Carlo simulation.
result Reduces compute cost and accelerates ML algorithms.
We introduce CuLE (CUDA Learning Environment), a CUDA port of the Atari Learning Environment (ALE) which is used for the development of deep reinforcement algorithms. CuLE overcomes many limitations of existing CPU-based emulators and scales naturally to multiple GPUs. It leverages GPU parallelization to run thousands …
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.
LoRA fine-tuning on CPUs without GPUs achieves comparable performance to GPU-based methods.
problem Limited computational resources for fine-tuning LLMs.
method Developed a CPU-efficient method to learn meta-operators for LoRA weights.
result LoRA adapters trained on CPUs outperform base models on downstream tasks.
Learning continuous representations of nodes is attracting growing interest in both academia and industry recently, due to their simplicity and effectiveness in a variety of applications. Most of existing node embedding algorithms and systems are capable of processing networks with hundreds of thousands or a few millio…
RFX accelerates and compresses Random Forests for large datasets.
problem Memory bottleneck in proximity matrices limits Random Forest analysis.
method QLORA compression, CPU TriBlock storage, GPU batch sizing, 3D MDS visualization.
result Proximity-based Random Forest analysis on larger datasets is feasible.
The graphics processing unit (GPU) has emerged as a powerful and cost effective processor for general performance computing. GPUs are capable of an order of magnitude more floating-point operations per second as compared to modern central processing units (CPUs), and thus provide a great deal of promise for computation…
The realized stochastic volatility (RSV) model that utilizes the realized volatility as additional information has been proposed to infer volatility of financial time series. We consider the Bayesian inference of the RSV model by the Hybrid Monte Carlo (HMC) algorithm. The HMC algorithm can be parallelized and thus per…
pySigLib speeds up signature-based computations on CPUs and GPUs.
problem Efficient signature-based computations on large datasets and long sequences.
method Optimised Python library for CPU and GPU, novel differentiation scheme.
result Accurate gradients at a fraction of the runtime of existing libraries.
Signatory is a library for calculating and performing functionality related to the signature and logsignature transforms. The focus is on machine learning, and as such includes features such as CPU parallelism, GPU support, and backpropagation. To our knowledge it is the first GPU-capable library for these operations. …
KineticSim accelerates financial market simulations 3406x over CPU.
problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.
We present Caffe con Troll (CcT), a fully compatible end-to-end version of the popular framework Caffe with rebuilt internals. We built CcT to examine the performance characteristics of training and deploying general-purpose convolutional neural networks across different hardware architectures. We find that, by employi…
New hybrid model reduces MILP solver time by up to 26%.
problem Improving CPU-based MILP solver efficiency.
method Combines GNN and MLP for efficient CPU-based branching.
result Up to 26% reduction in solver running time compared to state-of-the-art methods.
Stochastic simulation techniques employed for the analysis of portfolios of insurance/reinsurance risk, often referred to as `Aggregate Risk Analysis', can benefit from exploiting state-of-the-art high-performance computing platforms. In this paper, parallel methods to speed-up aggregate risk analysis for supporting re…
Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Setcs.LG
AI methods often fail to outperform classical CPU-based solvers on Maximum Independent Set problems.
problem Comparing AI methods with classical CPU-based solvers on Maximum Independent Set problems.
method Comparison of AI methods (e.g., generative models, reinforcement learning) with classical CPU-based solvers (e.g., KaMIS) on Maximum Independent Set problem.
result AI-inspired methods are often outperformed by classical CPU-based solvers, even with post-processing techniques.
aweSOM accelerates SOM clustering for large datasets.
problem Scalability issues in existing SOM implementations for large, multidimensional data.
method CPU/GPU-accelerated Self-organizing Maps (SOM) with ensemble stacking.
result 10-100x speed up and improved memory efficiency for large datasets.
A Reduction of the Elastic Net to Support Vector Machines with an Application to GPU Computingstat.ML
The past years have witnessed many dedicated open-source projects that built and maintain implementations of Support Vector Machines (SVM), parallelized for GPU, multi-core CPUs and distributed systems. Up to this point, no comparable effort has been made to parallelize the Elastic Net, despite its popularity in many h…
cuRegOT accelerates GPU-based entropic OT solving.
problem Slow convergence and high computational cost of optimal transport on GPUs.
method High-performance GPU solver with algorithmic and architectural optimizations.
result Significant speedups over state-of-the-art solvers.
Polylab is a MATLAB toolbox for multivariate polynomial modeling.
problem Efficiently modeling and manipulating multivariate polynomials across CPU and GPU.
method Unified symbolic-numeric interface, three aligned classes (MPOLY, MPOLY_GPU, MPOLY_HP), polynomial operations, differentiation, matrix computations.
result Advantages of MPOLY-HP for reduction-heavy simplification and large-scale computations, and the stochastic log-determinant variant for sparse regimes.
Matrix Factorization (MF) on large scale matrices is computationally as well as memory intensive task. Alternative convergence techniques are needed when the size of the input matrix is higher than the available memory on a Central Processing Unit (CPU) and Graphical Processing Unit (GPU). While alternating least squar…
KineticSim: A lightweight, high-performance execution engine for real-time market simulators
problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))
The rising use of deep learning and other big-data algorithms has led to an increasing demand for hardware platforms that are computationally powerful, yet energy-efficient. Due to the amount of data parallelism in these algorithms, high-performance 3D manycore platforms that incorporate both CPUs and GPUs present a pr…
Training deep learning models is compute-intensive and there is an industry-wide trend towards hardware specialization to improve performance. To systematically benchmark deep learning platforms, we introduce ParaDnn, a parameterized benchmark suite for deep learning that generates end-to-end models for fully connected…
We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution, are key enablers of effective deep learning systems. However, existing systems rely on manually optimized librar…
New software package for scalable DPMM inference on large datasets.
problem Scalability and practical adoption of Dirichlet Process Mixture Models.
method Efficient distributed sampling-based inference on CPUs and GPUs.
result Significant speedups and fitting of larger datasets.
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.
The evolution of MobileNets has laid a solid foundation for neural network applications on mobile end. With the latest MobileNetV3, neural architecture search again claimed its supremacy in network design. Unfortunately, till today all mobile methods mainly focus on CPU latencies instead of GPU, the latter, however, is…
MLPerf, an emerging machine learning benchmark suite strives to cover a broad range of applications of machine learning. We present a study on its characteristics and how the MLPerf benchmarks differ from some of the previous deep learning benchmarks like DAWNBench and DeepBench. We find that application benchmarks suc…
We demonstrate the use of tensor networks for image classification with the TensorNetwork open source library. We explain in detail the encoding of image data into a matrix product state form, and describe how to contract the network in a way that is parallelizable and well-suited to automatic gradients for optimizatio…
Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…
Poseidon: An Efficient Communication Architecture for Distributed Deep Learning on GPU Clusterscs.LG
Deep learning models can take weeks to train on a single GPU-equipped machine, necessitating scaling out DL training to a GPU-cluster. However, current distributed DL implementations can scale poorly due to substantial parameter synchronization over the network, because the high throughput of GPUs allows more data batc…
GPU speeds up derivatives sensitivity computation for Heston model options.
problem Efficient computation of option Greeks under the Heston model.
method Implemented exact simulation and novel Milstein discretisation methods on GPU.
result GPU speeds up Greeks computation up to 200x compared to CPU methods.
GPU computing has become popular in computational finance and many financial institutions are moving their CPU based applications to the GPU platform. Since most Monte Carlo algorithms are embarrassingly parallel, they benefit greatly from parallel implementations, and consequently Monte Carlo has become a focal point …
Neural network training entails heavy computation with obvious bottlenecks. The Compute Unified Device Architecture (CUDA) programming model allows us to accelerate computation by passing the processing workload from the CPU to the graphics processing unit (GPU). In this paper, we leveraged the power of Nvidia GPUs to …
JAXFit speeds up curve fitting on GPUs.
problem Nonlinear least squares curve fitting problems.
method Trust region method on GPU with automatic differentiation.
result Significantly faster than CPU and other GPU libraries.
CSM-NN uses neural networks to speed up and improve the accuracy of logic circuit simulations.
problem Inaccurate and slow simulation of complex circuits with billions of transistors.
method Current Source Model (CSM) combined with optimized neural network structures and parallel processing.
result Reduces simulation time by up to 6x on CPUs and 15x on GPUs with less than 2% error.
High performance computing (HPC) is a very attractive and relatively new area of research, which gives promising results in many applications. In this paper HPC is used for pricing of American options. Although the American options are very significant in computational finance; their valuation is very challenging, espe…
Principal component analysis (PCA) is a statistical technique commonly used in multivariate data analysis. However, PCA can be difficult to interpret and explain since the principal components (PCs) are linear combinations of the original variables. Sparse PCA (SPCA) aims to balance statistical fidelity and interpretab…
The wavelet scattering transform is an invariant signal representation suitable for many signal processing and machine learning applications. We present the Kymatio software package, an easy-to-use, high-performance Python implementation of the scattering transform in 1D, 2D, and 3D that is compatible with modern deep …
Recent technological advances have proliferated the available computing power, memory, and speed of modern Central Processing Units (CPUs), Graphics Processing Units (GPUs), and Field Programmable Gate Arrays (FPGAs). Consequently, the performance and complexity of Artificial Neural Networks (ANNs) is burgeoning. While…
GPU-accelerated BART speeds up Bayesian regression.
problem Long running time of BART makes it impractical for large datasets.
method GPU-enabled implementation of BART.
result BART is now 200x faster on GPUs.
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…
In this paper, we present a novel massively parallel algorithm for accelerating the decision tree building procedure on GPUs (Graphics Processing Units), which is a crucial step in Gradient Boosted Decision Tree (GBDT) and random forests training. Previous GPU based tree building algorithms are based on parallel multi-…
Quasi-Monte Carlo speeds up option Greeks calculation on GPUs.
problem Efficiently calculating option Greeks for risk management.
method Quasi-Monte Carlo (QMC) combined with GPU acceleration for pathwise sensitivity calculation.
result Increased computational speed and efficiency in estimating option Greeks.
RFX-Fuse combines Breiman and Cutler's Random Forest with modern ML capabilities.
problem Lack of a unified ML engine with diverse capabilities.
method Unified ML engine with native GPU/CPU support, delivering 5+ functionalities in one model.
result Native explainable similarity and imputation validation.
On-device inference of machine learning models for mobile phones is desirable due to its lower latency and increased privacy. Running such a compute-intensive task solely on the mobile CPU, however, can be difficult due to limited computing power, thermal constraints, and energy consumption. App developers and research…