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,695 papers · 148 categories

Trend · papers per month

210420630840 · Jun 202019922001200920172026
48 results for Training Acceleration

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.

Unified framework for understanding and optimizing training acceleration.

problem Challenges in optimizing training with regularization and acceleration techniques.
method Explains how AdaGrad, RMSProp, and Adam accelerate training, and derives a generalization for L1L_1-regularization.
result Derives a unified mathematical framework for understanding and optimizing training acceleration.

Stochastic gradient decent~(SGD) and its variants, including some accelerated variants, have become popular for training in machine learning. However, in all existing SGD and its variants, the sample size in each iteration~(epoch) of training is the same as the size of the full training set. In this paper, we propose a…

2019-06-11abs ↗pdf ↗

Hardware-accelerated RBM solves large combinatorial problems and integer factorization.

problem Solving large combinatorial optimization and integer factorization problems.
method Logically synthesized RBM architecture, hardware acceleration, and efficient training methods.
result Hardware-accelerated RBM factorizes 16-bit numbers with 10000x speed and 32x power improvements.

Training generative adversarial networks (GANs) often suffers from cyclic behaviors of iterates. Based on a simple intuition that the direction of centripetal acceleration of an object moving in uniform circular motion is toward the center of the circle, we present the Simultaneous Centripetal Acceleration (SCA) method…

2019-02-24abs ↗pdf ↗

SuNCEt accelerates contrastive learning with minimal labeled data.

problem Efficiently learning visual representations with limited labeled data.
method Noise-contrastive estimation and neighbourhood component analysis-based semi-supervised loss.
result SuNCEt achieves semi-supervised learning accuracy with less than half the labeled data.

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.

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.

Paper finds sharpness differences in transformer blocks accelerating LLM training.

problem Understanding and accelerating large language model pre-training.
method Uncovering sharpness disparity across transformer blocks and proposing Blockwise Learning Rate.
result Blockwise Learning Rate strategy accelerates LLM pre-training with lower loss and speedup.

This paper introduces Selective-Backprop, a technique that accelerates the training of deep neural networks (DNNs) by prioritizing examples with high loss at each iteration. Selective-Backprop uses the output of a training example's forward pass to decide whether to use that example to compute gradients and update para…

2019-10-02abs ↗pdf ↗

Paper improves DNN accelerator robustness against bit errors with energy savings.

problem Bit errors in quantized DNN weights reduce energy efficiency.
method Combines robust fixed-point quantization, weight clipping, and random bit error training.
result Significantly improves robustness against random bit errors with high energy savings.

Sparsification is an efficient approach to accelerate CNN inference, but it is challenging to take advantage of sparsity in training procedure because the involved gradients are dynamically changed. Actually, an important observation shows that most of the activation gradients in back-propagation are very close to zero…

2019-08-01abs ↗pdf ↗

We present a selective sampling method designed to accelerate the training of deep neural networks. To this end, we introduce a novel measurement, the minimal margin score (MMS), which measures the minimal amount of displacement an input should take until its predicted classification is switched. For multi-class linear…

2019-11-16abs ↗pdf ↗

FedNAG improves federated learning accuracy and reduces training time.

problem Efficiency of federated learning with gradient descent.
method Nesterov Accelerated Gradient (NAG) applied to federated learning (FL) with additional momentum and model aggregation.
result FedNAG increases learning accuracy by 3-24% and reduces training time by 11-70%.

Seesaw optimizes training by balancing learning rate and batch size, accelerating model pretraining.

problem Optimizing training efficiency for large language models with adaptive optimizers.
method Develops a principled framework for batch-size scheduling, introducing Seesaw which multiplies learning rate by 1/√2 and doubles batch size.
result Empirically, Seesaw reduces wall-clock time by approximately 36% compared to cosine decay, matching theoretical limits.

The paper accelerates LLM inference by adding early exit heads trained in a self-supervised manner.

problem Inference speed in large language models (LLMs) is slow and resource-intensive.
method Adding self-supervised early exit heads at intermediate transformer layers to stop computation early based on confidence thresholds.
result Entropy provides the most reliable confidence metric for stopping computation early.

GradSkip reduces local training steps for better communication efficiency.

problem High communication costs in distributed optimization.
method GradSkip redesigns ProxSkip to allow clients with less important data to take fewer local training steps.
result GradSkip converges linearly with reduced local training steps and same accelerated communication complexity.

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 ↗

Poor (even random) starting points for learning/training/optimization are common in machine learning. In many settings, the method of Robbins and Monro (online stochastic gradient descent) is known to be optimal for good starting points, but may not be optimal for poor starting points -- indeed, for poor starting point…

2016-02-09abs ↗pdf ↗

HAL accelerates the generation of training sets for accurate interatomic potentials.

problem Generating accurate and transferable interatomic potentials is time-consuming and requires expert input.
method HAL framework using a physically motivated sampler with a biasing term to drive high uncertainty configurations.
result HAL-generated training databases for alloys and polymers predict macroscopic properties with high accuracy.

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 ↗

Deep unfolding accelerates MCMC-based COP solvers.

problem Optimizing combinatorial problems with MCMC and gradient descent.
method Combines MCMC and gradient descent, trains step sizes, uses variance estimation for non-differentiable MCMC.
result Significantly accelerates convergence speed for COPs.

New algorithm PRACTISE accelerates networks with tiny sets, reducing latency by 22%.

problem Accelerating networks with tiny training sets to improve performance and privacy.
method Proposes a new algorithm PRACTISE based on finetune convexity hypothesis and feature mimicking.
result PRACTISE outperforms previous methods by reducing latency by 22% on ImageNet-1k.

Proposes EDM algorithm to accelerate model training in distributed networks.

problem Hindered effectiveness of distributed stochastic optimization algorithms due to data heterogeneity and network sparsity.
method Introduces Exact-Diffusion with Momentum (EDM) algorithm, incorporating momentum techniques to mitigate bias and enhance convergence rate.
result EDM algorithm converges sub-linearly to the optimal solution, radius independent of data heterogeneity, for non-convex objective functions.

Gradient Boosting Machine (GBM) is an extremely powerful supervised learning algorithm that is widely used in practice. GBM routinely features as a leading algorithm in machine learning competitions such as Kaggle and the KDDCup. In this work, we propose Accelerated Gradient Boosting Machine (AGBM) by incorporating Nes…

2019-03-20abs ↗pdf ↗