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

210420629839 · Jun 202019922001200920172026
48 results for Neural Acceleration

DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.

problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.

Improved NiNo networks accelerate Adam training by up to 50%.

problem Accelerating neural network training with stable and efficient methods.
method Proposed NiNo networks that leverage neuron connectivity and graph neural networks to nowcast parameters periodically during Adam training.
result Accelerates Adam training by up to 50% in vision and language tasks.

Optimized neural networks for Edge TPU achieve high accuracy in real-time image classification.

problem Designing neural networks for hardware accelerators to achieve optimal performance.
method Hardware-aware neural architecture search and model customization for Edge TPU.
result Improved accuracy-latency tradeoff on Pixel 4's Edge TPU compared to existing models.

Graph neural networks speed up nonnegative matrix factorization.

problem Efficiently factorize nonnegative matrices for various applications.
method Developed a graph neural network that combines bipartite self-attention with ADMM updates.
result Significant acceleration achieved in nonnegative matrix factorization.

Improved SDE-BNN model reduces NFEs and accelerates convergence.

problem High computational cost and convergence instability in SDE-BNNs.
method Nesterov's Accelerated Gradient (NAG) method integrated into SDE-BNN framework.
result Significantly reduced number of function evaluations (NFEs) and improved predictive accuracy.

Smartfluidnet accelerates Eulerian fluid simulation with neural networks.

problem Current neural network methods for Eulerian fluid simulation lack flexibility and generalization.
method Smartfluidnet automates model generation and dynamic switching to meet user requirements.
result Smartfluidnet achieves 1.46x and 590x speedup compared to state-of-the-art models, with better simulation quality.

Paper proposes NASAIC framework for co-designing neural architectures and heterogeneous ASICs.

problem Designing efficient neural architectures and ASICs for multiple tasks.
method Build ASIC templates and propose NASAIC framework for simultaneous design of architectures and ASICs.
result NASAIC ensures design specifications and maximizes accuracy with minimal performance loss.

DeepLight accelerates CTR predictions in ad serving by 46X.

problem Significantly increased serving delay and high memory usage for ad serving.
method Explicitly searching feature interactions, pruning layers, promoting sparsity.
result Accelerates model inference by 46X on Criteo dataset.

Survey of Graph Neural Networks for efficient computation.

problem Efficient processing of Graph Neural Networks (GNNs) is challenging.
method Review of GNN algorithms, software and hardware acceleration analysis.
result Distilled hardware-software, graph-aware, and communication-centric vision for GNN accelerators.

Paper proposes a new binary quantization method for faster DNN inference.

problem Accelerating deep neural network inference on resource-limited devices.
method Quantized Compressed Sensing (QCS) for binary quantization.
result The proposed method preserves benefits of standard methods while reducing quantization error.

Fast emulators built with neural search accelerate expensive scientific simulations.

problem Slow execution of accurate simulations limits scientific discovery.
method Neural architecture search to build accurate emulators with limited data.
result Simulations accelerated by up to 2 billion times in various scientific fields.

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.

Polyak's momentum accelerates training of neural networks.

problem Understanding and explaining the acceleration effect of Polyak's momentum in neural network training.
method Modular analysis of Polyak's momentum for training wide ReLU networks and deep linear networks.
result Polyak's momentum achieves an accelerated linear rate of (1Θ(1κ))t(1-Θ(\frac{1}{\sqrt{κ'}}))^t for training wide ReLU networks and deep linear networks.

We consider efficiency in the implementation of deep neural networks. Hardware accelerators are gaining interest as machine learning becomes one of the drivers of high-performance computing. In these accelerators, the directed graph describing a neural network can be implemented as a directed graph describing a Boolean…

2019-05-07abs ↗pdf ↗

Paper develops MMOT framework for financial applications with neural acceleration.

problem Financial optimization and calibration under multi-period martingale constraints.
method Theoretical analysis, incremental updates, adaptive sparse grids, hybrid neural-projection solver.
result Neural solver achieves 1597x speedup for real-time applications.

GRU models with Adam optimizer outperform other combinations in stock market forecasting.

problem Comparing optimization techniques for time series forecasting in LSTM and GRU networks.
method Examined Adam and Nesterov Accelerated Gradient (NAG) on LSTM and GRU models for stock market forecasting.
result GRU models with Adam optimizer produced the lowest RMSE and outperformed other combinations.

Two new algorithms improve neural architecture search efficiency.

problem Optimizing neural architecture search for faster and more accurate models.
method Introduces NASGD and NASAGD using accelerated gradient descent on a semi-discrete space.
result Achieves comparable accuracy with 40x fewer architectures in 12 hours.

Super-acceleration of gradient descent with momentum improves loss function minimization.

problem Minimizing loss functions in machine learning.
method Extending Nesterov acceleration by using gradients at multiple steps ahead.
result Super-acceleration of the momentum algorithm is beneficial for various loss landscapes and tasks.

GD and NAG accelerate matrix factorization and neural networks.

problem Optimizing rectangular matrix factorization and linear neural networks.
method Gradient descent and Nesterov's accelerated gradient with specific initialization.
result NAG achieves the best-known iteration complexity for these problems.

New insights into GNN optimization reveal skip connections and depth accelerate training.

problem Understanding and optimizing the training of Graph Neural Networks (GNNs).
method Analysis of gradient dynamics in linearized GNNs and empirical validation.
result GNNs are implicitly accelerated by skip connections, more depth, and good label distribution during training.

In recent years, convolutional neural networks (CNNs) have shown great performance in various fields such as image classification, pattern recognition, and multi-media compression. Two of the feature properties, local connectivity and weight sharing, can reduce the number of parameters and increase processing speed dur…

2018-07-23abs ↗pdf ↗

Paper tackles NAS problem by modeling it as a sparse supernet.

problem Neural Architecture Search (NAS) problem, particularly Mixed-Path Search.
method Model NAS as a sparse supernet with sparsity constraints. Use hierarchical accelerated proximal gradient algorithm for optimization.
result Proposed method finds compact, general, and powerful neural architectures.

The Regularized Nonlinear Acceleration (RNA) algorithm is an acceleration method capable of improving the rate of convergence of many optimization schemes such as gradient descend, SAGA or SVRG. Until now, its analysis is limited to convex problems, but empirical observations shows that RNA may be extended to wider set…

2018-06-01abs ↗pdf ↗

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 ↗

This paper speeds up simulations of hypersonic reentry by combining traditional and neural methods.

problem Accurately simulating hypersonic reentry with chemical reactions is computationally expensive.
method A hybrid simulation code combining a traditional fluid dynamics solver with a neural network approximating chemical reactions.
result Achieved significant acceleration factors (imes10 imes 10 to imes18.6 imes 18.6) while maintaining accuracy.

Interneurons improve learning in neural networks by accelerating convergence.

problem Rapid adaptation to changing input statistics in neural networks.
method Two mathematically tractable recurrent linear neural networks were compared: one with direct recurrent connections and the other with interneurons that mediate recurrent communication.
result The network with interneurons converges more quickly than the network with direct recurrent connections, scaling logarithmically with initialization spectrum.

Paper proposes a faster method for fuzzy neural networks by removing unsuitable hyperboxes.

problem Reducing training time for fuzzy neural networks.
method A novel hyperbox selection rule based on mathematical formulas to remove unsuitable hyperboxes.
result Significant decrease in training time for both online and agglomerative learning algorithms.

Paper tackles noisy neural networks and proposes a method to enhance their robustness.

problem Noisy neural networks struggle with random continuous noise in weights.
method Knowledge distillation combined with noise injection during training.
result Models achieve up to twice greater noise tolerance.