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

229459688917 · Jun 202019922001200920172026
48 results for training steps

IMM generates high-quality samples in few steps with stable training.

problem Slow inference and instability in generating high-quality samples using diffusion models and Flow Matching.
method Inductive Moment Matching (IMM) is a new generative model for one- or few-step sampling with a single-stage training procedure.
result IMM achieves state-of-the-art 2-step FID of 1.98 on CIFAR-10 for a model trained from scratch.

New method defends against both single-step and iterative adversarial examples.

problem Defending against adversarial examples, especially iterative ones, is computationally expensive.
method Single-Step Adversarial Training (SST) with modifications.
result Our method outperforms state-of-the-art methods in both accuracy and training time.

Proposes QDF to improve multi-step time-series forecasting.

problem Ignoring label autocorrelation and unequal task weights in training objectives.
method Quadratic-form weighted training objective and QDF learning algorithm.
result Improves performance of various forecast models, achieving state-of-the-art results.

Efficient regularization mitigates catastrophic overfitting in single-step adversarial training.

problem Catastrophic overfitting in single-step adversarial training.
method ELLE regularization term to enforce local linearity of the loss function.
result Our regularization term effectively mitigates catastrophic overfitting without the drawbacks of previous methods.

NCT simplifies one-step generator adaptation to new controls.

problem Adapting one-step generators to new control conditions.
method Noise Consistency Training (NCT) integrates new controls without retraining.
result NCT achieves state-of-the-art controllable generation in a single pass.

Proposes a neural network for learning step-size policies for L-BFGS optimization.

problem Optimizing step sizes for L-BFGS in large-scale problems.
method Neural network architecture using local iterate information, trained via stochastic optimization.
result Outperforms existing step size selection methods in training classifiers.

A new scaling law predicts optimal batch size for training models.

problem Finding the optimal batch size for training models efficiently.
method Proposed a three-term scaling law that considers model size, training data, training steps, and batch size.
result The three-term law accurately recovers the optimal batch size and can be robustly fit with fewer training runs.

This paper establishes a theoretical foundation for consistency training in diffusion models.

problem Lack of a comprehensive theoretical understanding of consistency training in diffusion models.
method Demonstrates the necessity of a number of steps in consistency learning exceeding d5/2/εd^{5/2}/\varepsilon for generating samples within ε\varepsilon proximity to the target distribution.
result Establishes rigorous insights into the validity and efficacy of consistency models, offering theoretical underpinnings for their utility.

The performance of deep (reinforcement) learning systems crucially depends on the choice of hyperparameters. Their tuning is notoriously expensive, typically requiring an iterative training process to run for numerous steps to convergence. Traditional tuning algorithms only consider the final performance of hyperparame…

2019-09-20abs ↗pdf ↗

SMT trains generative models by estimating mixture scores, outperforming existing methods.

problem Training one-step generative models efficiently and effectively.
method Score-of-Mixture Training (SMT) estimates the score of mixture distributions between real and fake samples.
result SMT/SMD outperform existing methods on CIFAR-10 and ImageNet 64x64 datasets.

In recent years, deep neural networks have demonstrated outstanding performance in many machine learning tasks. However, researchers have discovered that these state-of-the-art models are vulnerable to adversarial examples: legitimate examples added by small perturbations which are unnoticeable to human eyes. Adversari…

2018-10-08abs ↗pdf ↗

Adversarial examples are malicious inputs designed to fool machine learning models. They often transfer from one model to another, allowing attackers to mount black box attacks without knowledge of the target model's parameters. Adversarial training is the process of explicitly training a model on adversarial examples,…

2016-11-04abs ↗pdf ↗

The Teacher Forcing algorithm trains recurrent networks by supplying observed sequence values as inputs during training and using the network's own one-step-ahead predictions to do multi-step sampling. We introduce the Professor Forcing algorithm, which uses adversarial domain adaptation to encourage the dynamics of th…

2016-10-27abs ↗pdf ↗

Step decay schedules improve convergence in non-convex optimization.

problem Improving convergence in non-convex optimization problems.
method Analyzing convergence rates of step decay schedules in non-convex, convex, and strongly convex problems.
result Step decay schedules achieve O(lnT/T)\mathcal{O}(\ln T/\sqrt{T}) convergence rates in various optimization scenarios.

Certified training improves robustness against adversarial attacks.

problem Certified training's gap with empirical robustness limits its practical utility.
method Combining adversarial attacks with network over-approximations.
result Certified training can prevent catastrophic overfitting and bridge the gap to multi-step baselines.

Downscaled models outperform larger ones on GLUE tasks.

problem Difficulty in attributing performance changes to specific factors in large language models.
method Pre-trained down-scaled versions of Transformer-based architectures on a common corpus, benchmarked on GLUE tasks.
result MLM + NSP (BERT-style) consistently outperforms other objectives.

W-Flow generates images in one step, faster and better than multi-step methods.

problem Efficiently generating images from a simple reference distribution to a target data distribution.
method W-Flow uses Wasserstein gradient flows to transform the reference distribution to the target distribution in a single step, trained with Sinkhorn divergence.
result W-Flow achieves state-of-the-art results in ImageNet 256imes imes256 generation with improved mode coverage and faster sampling.

A hybrid training method reduces SNN training time and complexity.

problem Training deep SNNs is computationally expensive and time-consuming.
method Hybrid training technique combining initialization from converted SNNs and incremental spike-timing dependent backpropagation (STDB).
result The method converges in less than 20 epochs, reducing training complexity and time.

One of the main challenges of deep learning methods is the choice of an appropriate training strategy. In particular, additional steps, such as unsupervised pre-training, have been shown to greatly improve the performances of deep structures. In this article, we propose an extra training step, called post-training, whi…

2016-11-14abs ↗pdf ↗

A higher-order Runge-Kutta optimizer performs poorly compared to Adam when evaluated fairly.

problem Evaluating the performance of adaptive Runge-Kutta optimizers under strict conditions.
method Built and evaluated a representative Adam variant using a Bogacki-Shampine 3(2) RK pair, FSAL reuse, and local-error step control.
result The adaptive nature of the RK optimizer is illusory; it behaves like a fixed-step optimizer with gradient averaging.

Neural networks can overfit perfectly to noisy data and then grok near-optimal generalization.

problem Neural networks' ability to overfit perfectly to noisy data and then generalize near-optimally.
method Two-layer ReLU networks trained by gradient descent on XOR cluster data.
result Neural networks can achieve perfect fit to noisy training data and then grok near-optimal generalization.

SPGD improves adversarial training efficiency and accuracy.

problem Improving adversarial training efficiency and accuracy with fewer steps.
method Adversarial-sample generation from a frequency domain perspective, extending PGD to the frequency domain.
result SPGD achieves greater adversarial accuracy compared to PGD with fewer attack steps.

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.

A new training method improves stability and generalization of DeepONets.

problem Training deep operator networks (DeepONets) is challenging due to nonconvex and nonlinear nature.
method Two-step training method: first train trunk network, then branch network. Introduced Gram-Schmidt orthonormalization.
result Generalization error estimate and numerical examples demonstrating effectiveness.

In this paper, we propose a two-step training procedure for source separation via a deep neural network. In the first step we learn a transform (and it's inverse) to a latent space where masking-based separation performance using oracles is optimal. For the second step, we train a separation module that operates on the…

2019-10-22abs ↗pdf ↗

Transformers learn multi-step reasoning through gradient descent.

problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.

Training a neural network with the gradient descent algorithm gives rise to a discrete-time nonlinear dynamical system. Consequently, behaviors that are typically observed in these systems emerge during training, such as convergence to an orbit but not to a fixed point or dependence of convergence on the initialization…

2018-05-22abs ↗pdf ↗

New insights into how large learning rates affect transformer training dynamics.

problem Understanding how large learning rates impact the training of transformer models.
method Analyzing a simplified linear transformer model with a two-factor product map.
result Large learning rates can lead to various training outcomes including cycles, chaos, or divergence.

Neural ODEs' performance varies with numerical method, requiring adaptive step size control.

problem Neural ODEs' performance depends on the numerical method used during training.
method Proposes an adaptive step size control algorithm to ensure a valid ODE without increasing computational cost.
result Valid Neural ODEs require careful numerical method selection and step size adaptation.

Local Gradient Descent with local steps converges to the centralized model in the interpolation regime.

problem Understanding the implicit bias of Local Gradient Descent in the interpolation regime.
method Analyzing the implicit bias of Local Gradient Descent for classification tasks with linearly separable data.
result The aggregated global model from Local-GD converges exactly to the centralized model in the interpolation regime.

This paper presents a simulator-assisted training method (SimVAE) for variational autoencoders (VAE) that leads to a disentangled and interpretable latent space. Training SimVAE is a two-step process in which first a deep generator network(decoder) is trained to approximate the simulator. During this step, the simulato…

2019-11-19abs ↗pdf ↗

Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted using fast single-step methods that maximize a linear approximation of the model'…

2017-05-19abs ↗pdf ↗

New method reduces PDE surrogate model training costs by selectively acquiring time steps.

problem High computational cost of generating training data for PDE surrogate models.
method STAP (Selective Time-Step Acquisition for PDEs) framework that acquires only important time steps.
result Demonstrated effectiveness on several benchmark PDEs, reducing training costs.

Proposes a method to balance tasks in multitask learning with a single gradient step update.

problem Balancing tasks in multitask learning to avoid imbalance.
method Gradient-based meta-learning to balance tasks at the gradient level, training shared and task-specific layers separately.
result Achieves state-of-the-art performance on various multitask computer vision problems.