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

235471706941 · Jun 202019922001200920172026
48 results for Training loss

Flooding prevents deep networks from achieving zero training loss, improving test performance.

problem Deep networks can achieve zero training error but often have zero training loss, leading to overconfidence and poor test performance.
method Flooding prevents training loss from reaching zero by applying gradient ascent when loss is below a preset flood level.
result Flooding improves test performance and induces a double descent curve of the test loss.

Adversarial training makes logistic regression weight loss landscapes sharper.

problem Understanding why adversarial training sharpens the weight loss landscape in logistic regression.
method Theoretical analysis of linear logistic regression model with L2 norm constraints, and experiments on ResNet18.
result Adversarial training sharpens the weight loss landscape in linear logistic regression models.

The study finds a trade-off between model size, test loss, and training loss for linear predictors.

problem Finding the optimal balance between model size, test loss, and training loss for linear predictors.
method Established an algorithm and distribution-independent trade-off using non-asymptotic analysis.
result Models with low test loss are either classical (close to noise level training loss) or modern (large number of parameters).

Paper discovers simplicial complexes connecting trained models for improved ensembling.

problem Improving robustness and accuracy of deep learning ensembles.
method Identifies mode-connecting simplicial complexes on loss surfaces.
result Efficiently builds simplicial complexes for ensembling, outperforming independent ensembles.

Large learning rates improve neural network generalization, study shows.

problem Understanding why large learning rates lead to better neural network generalization.
method Visual analysis of training and testing loss landscapes, introduction of a nonlinear model.
result Extended phase with large learning rates leads to near-optimal generalization.

AWP improves robustness by flattening weight loss landscape.

problem Improving robustness of deep neural networks against adversarial examples.
method Explicitly regularizes the flatness of weight loss landscape through adversarial weight perturbation.
result AWP forms a double-perturbation mechanism in adversarial training, leading to flatter weight loss landscape.

SIFT reduces training time by selecting samples with approximate losses.

problem Reducing training time by selecting samples with large approximate losses.
method Developed SIFT which uses early exiting to obtain approximate losses with intermediate layer representations for sample selection.
result SIFT achieves significant gains in training time and number of backpropagation steps without optimized implementation.

This work improves diffusion models by estimating the optimal loss value for better training diagnostics.

problem The optimal loss value of diffusion models is unknown and not indicative of absolute data-fitting quality.
method Derive the optimal loss in closed form and develop effective estimators, including a stochastic variant.
result Unlocking the optimal loss as a metric for diagnosing training quality of diffusion models.

We consider the problem of training probabilistic conditional random fields (CRFs) in the context of a task where performance is measured using a specific loss function. While maximum likelihood is the most common approach to training CRFs, it ignores the inherent structure of the task's loss function. We describe alte…

2011-07-09abs ↗pdf ↗

Neural network training relies on our ability to find "good" minimizers of highly non-convex loss functions. It is well-known that certain network architecture designs (e.g., skip connections) produce loss functions that train easier, and well-chosen training parameters (batch size, learning rate, optimizer) produce mi…

2017-12-28abs ↗pdf ↗

MTAdam optimizes multiple loss terms in neural models, balancing gradients dynamically.

problem Balancing multiple loss terms in neural model training is challenging and computationally demanding.
method Generalized Adam algorithm that computes separate derivatives and balances gradients across layers dynamically.
result Training with MTAdam leads to faster recovery from suboptimal initial loss weighting and matches conventional training outcomes.

Recent work on discriminative segmental models has shown that they can achieve competitive speech recognition performance, using features based on deep neural frame classifiers. However, segmental models can be more challenging to train than standard frame-based approaches. While some segmental models have been success…

2016-10-21abs ↗pdf ↗

Typically, loss functions, regularization mechanisms and other important aspects of training parametric models are chosen heuristically from a limited set of options. In this paper, we take the first step towards automating this process, with the view of producing models which train faster and more robustly. Concretely…

2019-06-12abs ↗pdf ↗

Mixed precision training (MPT) is becoming a practical technique to improve the speed and energy efficiency of training deep neural networks by leveraging the fast hardware support for IEEE half-precision floating point that is available in existing GPUs. MPT is typically used in combination with a technique called los…

2019-10-28abs ↗pdf ↗

Analyzes adversarial training's impact on loss landscape, proposing PAS to improve model performance.

problem Challenges in optimizing models under adversarial training due to loss landscape properties.
method Analytical studies of adversarial loss functions, numerical analyses, PAS strategy.
result Adversarial training impairs optimization, but PAS strategy improves model performance.

Fewer degrees of freedom can train deep networks, showing a sharp phase transition.

problem Training deep networks with fewer degrees of freedom than parameters.
method Examined success probability of hitting training loss sub-level sets within random subspaces.
result Threshold training dimension increases as desired final loss decreases.

In this paper, we propose a new loss function called generalized end-to-end (GE2E) loss, which makes the training of speaker verification models more efficient than our previous tuple-based end-to-end (TE2E) loss function. Unlike TE2E, the GE2E loss function updates the network in a way that emphasizes examples that ar…

2017-10-28abs ↗pdf ↗

We present the Tamed Cross Entropy (TCE) loss function, a robust derivative of the standard Cross Entropy (CE) loss used in deep learning for classification tasks. However, unlike other robust losses, the TCE loss is designed to exhibit the same training properties than the CE loss in noiseless scenarios. Therefore, th…

2018-10-11abs ↗pdf ↗

In this manuscript we propose two objective terms for neural image compression: a compression objective and a cycle loss. These terms are applied on the encoder output of an autoencoder and are used in combination with reconstruction losses. The compression objective encourages sparsity and low entropy in the activatio…

2019-05-24abs ↗pdf ↗

Neural networks and linear systems linked, revealing training loss and kernel limitations.

problem Exploring the training loss and limitations of neural networks and their kernels.
method Drawing connections between neural networks and under-determined linear systems, providing lower bounds, and analyzing gradient descent.
result Zero training loss achievable for neural networks under certain conditions, but not for ReLU kernels.

A new concordance loss improves model performance and reliability in survival prediction.

problem Inconsistent evaluation of deep survival models using likelihood losses.
method Proposed a value-monotone concordance loss (SCL) to improve reliability and optimization.
result SCL achieves comparable discrimination and is the best or within one standard deviation of the best C-index across multiple datasets.

Paper explores challenges in training PINNs and loss landscape effects.

problem Challenges in training Physics-Informed Neural Networks (PINNs) due to loss landscape issues.
method Examined gradient-based optimizers Adam, L-BFGS, and their combination Adam+L-BFGS, and introduced NysNewton-CG (NNCG).
result Adam+L-BFGS outperforms other optimizers, and NysNewton-CG significantly improves PINN performance.

Improves deep learning models by blending gradients from training loss and auxiliary objective.

problem Minimizing a single training loss while encouraging desirable model properties.
method Solves a bilevel optimization problem by combining training loss gradients and orthogonal projections of auxiliary gradients.
result Bloop method leads to better performance than other gradient surgery methods without EMA.

Square loss performs comparably or better than cross-entropy in neural architectures for various tasks.

problem The superiority of cross-entropy loss over square loss in classification tasks is debated.
method Comparison of several neural architectures on NLP, ASR, and computer vision datasets using both loss functions.
result Square loss often produces better results in the majority of tasks, especially in NLP and ASR.

Proposes squentropy loss for improved classification accuracy and model calibration.

problem Theoretical and empirical evidence for cross-entropy loss is lacking.
method Introduces squentropy loss as the sum of cross-entropy and average square loss over incorrect classes.
result Squentropy loss outperforms cross-entropy and rescaled square losses in classification accuracy and model calibration.

Adversarial training is a training scheme designed to counter adversarial attacks by augmenting the training dataset with adversarial examples. Surprisingly, several studies have observed that loss gradients from adversarially trained DNNs are visually more interpretable than those from standard DNNs. Although this phe…

2019-03-27abs ↗pdf ↗

Gradient descent with logistic loss can make two-layer networks interpolate binary classification data.

problem Training two-layer networks for binary classification.
method Gradient descent with logistic loss applied to two-layer networks.
result Gradient descent can drive training loss to zero under certain conditions.

Neural networks enjoy widespread use, but many aspects of their training, representation, and operation are poorly understood. In particular, our view into the training process is limited, with a single scalar loss being the most common viewport into this high-dimensional, dynamic process. We propose a new window into …

2019-09-03abs ↗pdf ↗

EGFs use ergodicity to simplify generative flows for easier training and imitation learning.

problem Challenges in training generative flows, especially in continuous settings and for imitation learning.
method EGFs leverage ergodicity to build simple flows with universality guarantees and tractable FM loss. They introduce a KL-weakFM loss for IL training without a separate reward model.
result EGFs simplify generative flow training and enable effective imitation learning.

The paper explains spikes in training loss as catapults, improving feature learning and generalization.

problem Understanding and improving the training process of neural networks.
method Analysis of training loss spikes in SGD, empirical evidence of catapults, and demonstration of AGOP alignment.
result Catapults in training loss promote feature learning and better generalization.

A new loss function improves neural networks' out-of-distribution detection without side effects.

problem Neural networks struggle with out-of-distribution detection due to SoftMax loss issues.
method Proposes IsoMax loss replacing SoftMax loss, maintaining high entropy and fast inferences.
result Significantly improves neural networks' out-of-distribution detection performance.

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.