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

202404606808 · Jun 202019922001200920172026
48 results for vanilla training

Deep vanilla transformers trained without shortcuts achieve similar performance to standard models.

problem Training deep vanilla transformers without shortcuts and normalizations.
method Parameter initializations, bias matrices, and location-dependent rescaling.
result Deep vanilla transformers can train at similar speeds and performance to standard models.

Deep RL policies are vulnerable to adversarial perturbations, but vanilla training yields more robust policies.

problem Vulnerability of deep reinforcement learning policies to adversarial perturbations.
method Analysis of deep reinforcement learning policy landscape and comparison of vanilla vs. adversarial training.
result Vanilla training yields more robust policies compared to adversarial training.

Vanilla SGD learns SIM from anisotropic data without explicit covariance estimation.

problem Learning SIM from anisotropic Gaussian inputs.
method Vanilla Stochastic Gradient Descent (SGD) trained on SIM with anisotropic input.
result Vanilla SGD adapts to anisotropic data's covariance structure.

Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.

problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.

CutMix enhances feature learning in neural networks, improving test accuracy.

problem Understanding and improving feature learning in neural networks using patch-level augmentation.
method Three distinct methods: vanilla training, Cutout training, and CutMix training were studied.
result CutMix training yields the highest test accuracy and learns all features and noise vectors evenly.

We introduce Negative Sampling in Semi-Supervised Learning (NS3L), a simple, fast, easy to tune algorithm for semi-supervised learning (SSL). NS3L is motivated by the success of negative sampling/contrastive estimation. We demonstrate that adding the NS3L loss to state-of-the-art SSL algorithms, such as the Virtual Adv…

2019-11-12abs ↗pdf ↗

Vanilla CNNs, as uncalibrated classifiers, suffer from classifying out-of-distribution (OOD) samples nearly as confidently as in-distribution samples. To tackle this challenge, some recent works have demonstrated the gains of leveraging available OOD sets for training end-to-end calibrated CNNs. However, a critical que…

2019-10-18abs ↗pdf ↗

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 paper uses basket option formulas to price vanilla options with discrete dividends.

problem Pricing vanilla options on stocks with discrete cash dividends.
method Uses existing basket option formulas for European options on a single asset with cash dividends in the piecewise lognormal model.
result Explains the use of basket option formulas for a specific problem in the piecewise lognormal model.

Stagewise training strategy is widely used for learning neural networks, which runs a stochastic algorithm (e.g., SGD) starting with a relatively large step size (aka learning rate) and geometrically decreasing the step size after a number of iterations. It has been observed that the stagewise SGD has much faster conve…

2018-12-10abs ↗pdf ↗

Study on adversarial training's impact on deep neural reinforcement learning policies.

problem Vulnerability of deep neural reinforcement learning policies to imperceptible adversarial perturbations.
method Two parallel approaches: Fourier spectrum analysis and feature sensitivity measurement.
result Adversarially trained policies are more sensitive to low frequency perturbations.

DDSME outperforms SME in estimating multimodal distributions.

problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.

AdamL optimizes deep learning models by incorporating loss function information.

problem Adaptive optimizers can suffer from poor generalization due to nonuniform gradient scaling.
method AdamL is a novel adaptive optimizer that considers loss function information for better generalization.
result AdamL achieves faster convergence or lower objective function values compared to other optimizers.

Geometric interpretation improves VAE performance and robustness.

problem Improving Variational Autoencoder performance and robustness.
method Introducing a geometric perspective on VAEs, sampling from the Riemannian latent space.
result Improved generation and interpolations with competitive or better performance on benchmark datasets.

Vanilla Bayesian optimization performs well in high dimensions.

problem Bayesian optimization's poor performance in high-dimensional problems.
method Identified and addressed degeneracies, proposed scaling of Gaussian process lengthscale prior.
result Vanilla Bayesian optimization outperforms existing algorithms in high-dimensional tasks.

Algorithm improves vanilla option pricing accuracy during and before COVID-19.

problem Improving vanilla option pricing accuracy during and before the pandemic.
method Combinational Mutation Strategy of Differential Evolution (CmDE) algorithm for bi-objective optimization.
result Algorithm approximates real market vanilla option prices more accurately than Black-Scholes.

The Bass model is calibrated to vanilla options using a fixed-point equation.

problem Calibration of the Bass local volatility model to vanilla options.
method Solving a fixed-point equation to achieve calibration.
result Existence and uniqueness of the solution to the fixed-point equation, and linear convergence of the fixed-point iteration scheme.

TorchGAN is a PyTorch based framework for writing succinct and comprehensible code for training and evaluation of Generative Adversarial Networks. The framework's modular design allows effortless customization of the model architecture, loss functions, training paradigms, and evaluation metrics. The key features of Tor…

2019-09-08abs ↗pdf ↗

Initializing the weights and the biases is a key part of the training process of a neural network. Unlike the subsequent optimization phase, however, the initialization phase has gained only limited attention in the literature. In this paper we discuss some consequences of commonly used initialization strategies for va…

2019-03-27abs ↗pdf ↗

ARM improves multivariate time series forecasting by better capturing series-wise relationships.

problem Challenges in handling complex temporal-contextual relationships in multivariate time series forecasting.
method ARM is an enhanced multivariate LTSF architecture that employs Adaptive Univariate Effect Learning, Random Dropping, and Multi-kernel Local Smoothing.
result ARM outperforms vanilla Transformers on multiple benchmarks without significantly increasing computational costs.

In this paper, we argue that, once the costs of maintaining the hedging portfolio are properly taken into account, semi-static portfolios should more properly be thought of as separate classes of derivatives, with non-trivial, model-dependent payoff structures. We derive new integral representations for payoffs of exot…

2019-02-07abs ↗pdf ↗

This paper examines Bachelier implied volatility at extreme strikes.

problem Investigates appropriate implied volatility extrapolation at extreme strikes.
method Compares Bachelier and Black-Scholes models, focusing on normal distribution and vanilla options.
result Bachelier implied variance grows at most linearly in log-moneyness, similar to Black-Scholes.

PAGE is a simple gradient estimator for nonconvex optimization problems.

problem Nonconvex optimization problems in machine learning.
method PAGE is a probabilistic gradient estimator that uses vanilla SGD with probability and a small adjustment with probability 1-p.
result PAGE achieves optimal convergence rates for nonconvex finite-sum and online problems.

This paper describes an improvement in Deep Q-learning called Reverse Experience Replay (also RER) that solves the problem of sparse rewards and helps to deal with reward maximizing tasks by sampling transitions successively in reverse order. On tasks with enough experience for training and enough Experience Replay mem…

2019-10-19abs ↗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.