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

Trend · papers per month

61122182243 · Jun 202019922001200920172026
48 results for vanilla regularization

The paper explores how regularization can improve multi-objective learning with high-dimensional data.

problem Improving multi-objective learning with high-dimensional and costly data.
method A two-stage MOL framework that leverages low-dimensional structure.
result Vanilla regularization approaches often fail in multi-objective learning, and a two-stage framework can successfully exploit low-dimensional structure.

It is well known that any sufficiently regular one-dimensional payoff function has an explicit static hedge by bonds, forward contracts and lots of vanilla options. We show that the natural extension of the corresponding representation leads to a static hedge based on the same instruments along with traffic light optio…

2010-11-22abs ↗pdf ↗

Study optimizes option pricing with robust strategies, ensuring consistency with vanilla option prices.

problem Optimizing exotic option pricing with robust strategies.
method Introduces semistatic strategies and robust convex integral functionals on bounded continuous functions.
result Consistent indifference prices with observed vanilla option prices.

Noise injection before gradient steps helps in regularization for neural networks.

problem Improving generalization in overparametrized neural networks.
method Injecting small noise perturbations before computing gradient steps, especially in layer-wise fashion.
result Small noise perturbations can explicitly regularize neural networks without variance explosion.

New algorithm improves convergence of gradient boosting trees.

problem Global convergence of Newton boosting in tabular machine learning.
method Introduces Gradient Regularized Newton Descent for GBDTs, proving linear convergence for smooth, strongly convex losses and O(1k2)\mathcal{O}(\frac{1}{k^2}) rate for general convex losses.
result Achieves globally convergent second-order GBDT algorithm with rate matching first-order boosting.

In this paper, we propose a new Recurrent Neural Network (RNN) architecture. The novelty is simple: We use diagonal recurrent matrices instead of full. This results in better test likelihood and faster convergence compared to regular full RNNs in most of our experiments. We show the benefits of using diagonal recurrent…

2017-04-18abs ↗pdf ↗

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.

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.

Neural networks learn the support of the target function through SGD's implicit regularization effect.

problem Learning the support of the target function in neural networks.
method Investigation of mini-batch SGD's ability to learn the support in the first layer of a neural network.
result Mini-batch SGD effectively learns the support in the first layer by shrinking irrelevant weights, while vanilla GD requires an explicit regularization term.

The main goal of this work is equipping convex and nonconvex problems with Barzilai-Borwein (BB) step size. With the adaptivity of BB step sizes granted, they can fail when the objective function is not strongly convex. To overcome this challenge, the key idea here is to bridge (non)convex problems and strongly convex …

2019-10-15abs ↗pdf ↗

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.

Improves GAN-based semi-supervised learning with consistency regularization.

problem Lack of consistency in class probability predictions under local perturbations.
method Introduces consistency regularization to GANs, leveraging both local and interpolation consistency.
result Significantly improves performance and achieves new state-of-the-art results.

Stochastic dual coordinate ascent (SDCA) is an effective technique for solving regularized loss minimization problems in machine learning. This paper considers an extension of SDCA under the mini-batch setting that is often used in practice. Our main contribution is to introduce an accelerated mini-batch version of SDC…

2013-05-12abs ↗pdf ↗

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.

New algorithms estimate Q-functions under partial coverage and realizability, improving offline RL guarantees.

problem Offline RL with limited exploration and assumptions about data coverage and Q-function realizability.
method Proposes minimax learning algorithms to estimate soft or vanilla Q-functions with L2L^2-convergence guarantees.
result PAC guarantees for offline RL under partial coverage and realizability conditions.

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.

We consider the problem of demixing a sequence of source signals from the sum of noisy bilinear measurements. It is a generalized mathematical model for blind demixing with blind deconvolution, which is prevalent across the areas of dictionary learning, image processing, and communications. However, state-of- the-art c…

2018-09-18abs ↗pdf ↗

SAIL-RevKL improves SAIL's convergence by regularizing the objective function.

problem Convergence of self-improving online LLM alignment algorithms.
method Proposed SAIL-RevKL, a regularized objective function to improve optimization landscape.
result Proved SAIL-RevKL satisfies the Polyak-Lojasiewicz (PL) condition with near-linear sample complexity.

New bounds on IDS for RL show how to balance computation and learning efficiency.

problem Understanding and optimizing information-directed sampling (IDS) for reinforcement learning.
method Developed novel information-theoretic tools to bound information ratio and cumulative information gain.
result Derived prior-free Bayesian regret bounds for IDS in tabular finite-horizon MDPs and improved computational efficiency.

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.

Gradient descent recovers principal components of overparametrized asymmetric matrices without explicit regularization.

problem Asymmetric matrix factorization under overparametrization with minimal rank assumptions.
method Vanilla gradient descent with small random initialization and proper early stopping.
result Gradient descent produces the best low-rank approximation without explicit regularization.

This work explores Target Networks and Functional Regularization in deep Reinforcement Learning.

problem Stability and performance issues in deep Reinforcement Learning due to target value instability.
method Proposes and studies an explicit Functional Regularization approach as a replacement for Target Networks.
result Functional Regularization improves performance and stability compared to Target Networks.

Method interpolates option prices and volatilities without arbitrage.

problem Interpolating option prices and volatilities without arbitrage.
method Sparse modeling approach based on integral equations and SVD.
result Flexible and efficient framework for arbitrage-free interpolation.

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.

New geometric regularizers improve deep learning generalization.

problem Improving deep learning models' ability to generalize to unseen data.
method Using Bregman divergence loss and bounded spectral products, we propose a novel geometric regularizer to enhance model generalization.
result Good generalization can be achieved by designing deep models with specific structural regularizers.

XGBoost is often presented as the algorithm that wins every ML competition. Surprisingly, this is true even though predictions are piecewise constant. This might be justified in high dimensional input spaces, but when the number of features is low, a piecewise linear model is likely to perform better. XGBoost was exten…

2017-10-10abs ↗pdf ↗

We introduce a local volatility model for the valuation of options on commodity futures by using European vanilla option prices. The corresponding calibration problem is addressed within an online framework, allowing the use of multiple price surfaces. Since uncertainty in the observation of the underlying future price…

2016-02-13abs ↗pdf ↗

RAD improves robustness to domain annotation noise without explicit domain annotations.

problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.

Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, state-of-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order…

2017-11-28abs ↗pdf ↗

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.

SNN architecture shows gradient descent converges to regularized solution in matrix sensing problems.

problem Understanding implicit regularization in neural networks for matrix sensing.
method Developed Spectral Neural Networks (SNN) for matrix learning problems, rigorously demonstrating implicit regularization.
result Gradient descent converges to the solution of a regularized learning problem in matrix sensing problems.