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

3775112149 · Jun 202019922001200920172026
48 results for modern accelerators

Principal component analysis (PCA) is one of the most powerful tools in machine learning. The simplest method for PCA, the power iteration, requires O(1/Δ)\mathcal O(1/Δ) full-data passes to recover the principal component of a matrix with eigen-gap ΔΔ. Lanczos, a significantly more complex method, achieves an accelerated…

2017-07-10abs ↗pdf ↗

Study accelerates gradient methods in machine learning, revealing risk and stability connections.

problem Understanding the statistical risk of accelerated gradient methods in machine learning.
method Continuous-time analysis of Nesterov's accelerated gradient method and Polyak's heavy ball method for least squares regression.
result Connections between early stopping, stability, and curvature of loss function are revealed.

Modern datasets and models are notoriously difficult to explore and analyze due to their inherent high dimensionality and massive numbers of samples. Existing visualization methods which employ dimensionality reduction to two or three dimensions are often inefficient and/or ineffective for these datasets. This paper in…

2018-07-31abs ↗pdf ↗

New method accelerates CNNs for mobile devices by approximating tensors and quantizing weights.

problem Efficiently compress and accelerate CNNs for mobile devices.
method Low-rank tensor approximation in Tucker format combined with quantization of weights and activations.
result Our method significantly improves CNN performance on various classification tasks.

Review of modern computational optimal transport methods for biomedical applications.

problem Efficient computation of optimal transport for big data.
method Regularization-based and projection-based computational methods.
result Advancements in computational optimal transport methods for biomedical research.

New methods accelerate NCGP inference by trading computation for uncertainty.

problem Prohibitively expensive exact inference in NCGPs for large datasets.
method Iterative methods explicitly modeling approximation error, leveraging parallel computing.
result Significant acceleration of posterior inference compared to baselines.

Nesterov SGD is widely used for training modern neural networks and other machine learning models. Yet, its advantages over SGD have not been theoretically clarified. Indeed, as we show in our paper, both theoretically and empirically, Nesterov SGD with any parameter selection does not in general provide acceleration o…

2018-10-31abs ↗pdf ↗

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.

The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the architecture community, the lion share of effort has targeted CNN inference for image recognition. The closely related problem of video recognition…

2018-10-16abs ↗pdf ↗

Pyro is a probabilistic programming language built on Python as a platform for developing advanced probabilistic models in AI research. To scale to large datasets and high-dimensional models, Pyro uses stochastic variational inference algorithms and probability distributions built on top of PyTorch, a modern GPU-accele…

2018-10-18abs ↗pdf ↗

This paper optimizes how deep learning models are distributed across different devices.

problem Optimizing how large, complex neural networks are split across multiple devices.
method Identified and solved an optimization problem for device placement of DNN operators.
result Automated algorithms that solve the device placement problem for modern pipelined settings.

KaoKore dataset extracts faces from pre-modern Japanese art for machine learning.

problem Lack of relevant datasets for historical Japanese artworks in machine learning.
method Extracted faces from pre-modern Japanese artwork to create a new dataset.
result Demonstrated the dataset's value for image classification and creative applications.

Learning rate decay (lrDecay) is a \emph{de facto} technique for training modern neural networks. It starts with a large learning rate and then decays it multiple times. It is empirically observed to help both optimization and generalization. Common beliefs in how lrDecay works come from the optimization analysis of (S…

2019-08-05abs ↗pdf ↗

This paper evaluates ASR models on various co-processors, showing hardware acceleration benefits.

problem Lack of detailed training efficiency analysis for modern ASR systems.
method Developed a deep neural network ASR model and evaluated it on three co-processor platforms.
result Hardware acceleration yields good results even with less expensive equipment.

Neural networks have proven to be extremely powerful tools for modern artificial intelligence applications, but computational and storage complexity remain limiting factors. This paper presents two compatible contributions towards reducing the time, energy, computational, and storage complexities associated with multil…

2018-12-04abs ↗pdf ↗

We introduce vine computational graphs for efficient ML integration of vine copulas.

problem Integrating vine copulas into modern machine learning pipelines.
method Developed vine computational graphs and algorithms for conditional sampling, scheduling, and structure construction.
result Gradient flow through vine copulas improves performance in machine learning models.

ADSGD method speeds up model identification in sparse optimization.

problem Implicit model identification in sparse optimization problems.
method Accelerated Doubly Stochastic Gradient Method (ADSGD) for faster explicit model identification.
result ADSGD achieves faster explicit model identification and improved algorithm efficiency.

While recent developments in autonomous vehicle (AV) technology highlight substantial progress, we lack tools for rigorous and scalable testing. Real-world testing, the de facto\textit{de facto} evaluation environment, places the public in danger, and, due to the rare nature of accidents, will require billions of miles in or…

2018-10-31abs ↗pdf ↗

New PDMP samplers improve BNN inference with accelerated computation.

problem Inference on Bayesian Neural Networks violates independence and posterior assumptions.
method Piecewise Deterministic Markov Process (PDMP) with adaptive thinning for inhomogenous Poisson Process (IPPs) sampling.
result PDMP samplers accelerate inference in BNNs, improving accuracy and mixing performance.

BoTorch optimizes Bayesian optimization with MC methods and auto-differentiation.

problem Efficient global optimization for various applications.
method Monte-Carlo acquisition functions, sample average approximation, auto-differentiation, variance reduction.
result Improved sample efficiency compared to other libraries.

New insights show NAG and FISTA converge linearly without knowing strong convexity modulus.

problem Understanding linear convergence of NAG and FISTA without strong convexity modulus knowledge.
method High-resolution ODE framework, dynamically adapting kinetic energy coefficient.
result NAG and FISTA demonstrate linear convergence without requiring strong convexity modulus knowledge.

Deep neural networks have yielded superior performance in many applications; however, the gradient computation in a deep model with millions of instances lead to a lengthy training process even with modern GPU/TPU hardware acceleration. In this paper, we propose AutoAssist, a simple framework to accelerate training of …

2019-05-08abs ↗pdf ↗

The paper analyzes contraction rates for GP regression approximations.

problem Computational infeasibility of exact GP posterior in large-scale applications.
method Lanczos and conjugate gradient approximations of the posterior mean.
result Minimax contraction rates for these approximations in large-scale applications.

Data augmentation, a technique in which a training set is expanded with class-preserving transformations, is ubiquitous in modern machine learning pipelines. In this paper, we seek to establish a theoretical framework for understanding data augmentation. We approach this from two directions: First, we provide a general…

2018-03-16abs ↗pdf ↗

New method speeds up diffusion models inference to sub-linear time.

problem Efficient inference of diffusion models for high-dimensional data.
method Parallel sampling with Picard iterations within blocks.
result Achieves sub-linear time complexity of O~(polylogd)\widetilde{\mathcal{O}}(\mathrm{poly} \log d).

OverQ increases model accuracy by handling outliers in neural networks with minimal hardware changes.

problem Handling outliers in neural network weights and activations for low-precision quantization.
method Overwrite quantization (OverQ) that opportunistically increases bitwidth for activation outliers.
result OverQ can handle over 90% of outliers and achieve +5% ImageNet Top-1 accuracy on a quantized ResNet-50 at 4 bits.

IMPACT improves RL training speed without sacrificing sample efficiency.

problem Limited sample efficiency in scalable RL architectures.
method Proposes IMPACT, extending IMPALA with target networks, circular buffers, and truncated importance sampling.
result IMPACT achieves higher rewards and significantly reduces training time compared to IMPALA.