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.

168,742 papers · 148 categories

Trend · papers per month

11223344 · Jun 202019922001200920172026
48 results for CPU usage

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 …

2018-12-28abs ↗pdf ↗

This paper analyzes CNNs for malware detection in cloud IaaS.

problem Malware vulnerability in cloud IaaS environments.
method Analysis of Convolutional Neural Networks (CNNs) for online malware detection using process-level performance metrics.
result State-of-the-art DenseNets and ResNets effectively detect malware in online cloud systems.

Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.

problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.

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 ↗

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 …

2019-07-19abs ↗pdf ↗

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.

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…

2015-04-16abs ↗pdf ↗

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.

As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this…

2012-06-27abs ↗pdf ↗

New technique reduces memory usage and boosts neural network training speed.

problem Training large neural networks requires significant memory and computational resources.
method L2L (layer-to-layer) execution technique with eager param-server (EPS) and micro-batching.
result 45% reduction in memory usage and 40% increase in throughput for BERT-Large.

DarkneTZ protects edge devices from DNN model leaks using TEE and model partitioning.

problem Privacy risks of pre-trained DNNs on edge devices through membership inference attacks.
method Model partitioning into sensitive and untrusted parts, leveraging TEE.
result DarkneTZ provides reliable model privacy with minimal performance overhead.

In this paper we analyze, evaluate, and improve the performance of training Random Forest (RF) models on modern CPU architectures. An exact, state-of-the-art binary decision tree building algorithm is used as the basis of this study. Firstly, we investigate the trade-offs between using different tree building algorithm…

2019-10-15abs ↗pdf ↗

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…

2019-03-02abs ↗pdf ↗

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…

2019-01-02abs ↗pdf ↗

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.

This study analyzes how weather impacts bike sharing usage in Washington D.C.

problem Understanding how weather affects bike sharing usage patterns.
method Gathered bike usage and weather data, used k-means clustering algorithm to identify clusters.
result Weather significantly impacts bike usage, with temperature and precipitation being the most influential factors.

Proposes AtCoR for predicting bike station usage, improving station network reconfiguration.

problem Challenges in predicting new bike stations due to lack of historical data.
method AtCoR algorithm that predicts both existing and new bike stations using station-centered heatmaps and historical correlations.
result AtCoR outperforms existing models in predicting bike station usage.

We study two aspects of noisy computations during inference. The first aspect is how to mitigate their side effects for naturally trained deep learning systems. One of the motivations for looking into this problem is to reduce the high power cost of conventional computing of neural networks through the use of analog ne…

2018-11-26abs ↗pdf ↗

Investigations have been performed into using clustering methods in data mining time-series data from smart meters. The problem is to identify patterns and trends in energy usage profiles of commercial and industrial customers over 24-hour periods, and group similar profiles. We tested our method on energy usage data p…

2016-03-24abs ↗pdf ↗

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…

2019-07-24abs ↗pdf ↗

Paper proposes a new loss function for PU learning without negative examples.

problem Traditional machine learning struggles with negative examples, leading to biased predictions.
method Developed a collective loss function (cPU) for positive and unlabeled data.
result The cPU consistently outperforms existing methods in PU learning benchmarks and real-world datasets.

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.

In this paper, we discuss software design issues related to the development of parallel computational intelligence algorithms on multi-core CPUs, using the new Java 8 functional programming features. In particular, we focus on probabilistic graphical models (PGMs) and present the parallelisation of a collection of algo…

2016-04-27abs ↗pdf ↗

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

A new model improves homogeneity in burn patient reimbursement.

problem Incomplete homogeneity checks for burn patients using LOS as a proxy.
method Cost-sensitive decision tree model considering patient-level cost and severity of burn.
result Identified groups with increased homogeneity compared to current HRG groups.

CoNNTrA trains DNNs with low-power, low-memory constraints.

problem Training deep neural networks on edge computing systems with low power and memory usage.
method Coordinate gradient descent-based approach for training DNNs with constrained learning parameters.
result CoNNTrA models use 32x less memory and have comparable errors to Backpropagation models.

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…

2013-08-12abs ↗pdf ↗