arXiv research

Improved bounds for Black-Scholes volatility lead to faster root-finding.

Develops computational methods for simulating rigid body dynamics on SO(3).

A deep learning model speeds up computation of numerous implied volatilities.

Private minimum Hellinger distance estimators maintain robustness and efficiency while ensuring privacy.

We introduce a new method of delta hedging. In many cases, this method results in a lower cost than the Black-Scholes method. To calculate the cost of hedging, we develop a Mathematica program that include the two-dimensional Newton-Raphson method.

A new multivariate stochastic volatility estimation procedure for financial time series is proposed. A Wishart autoregressive process is considered for the volatility precision covariance matrix, for the estimation of which a two step procedure is adopted. The first step is the conditional inference on the autoregressi…

We present a scalable and robust Bayesian inference method for linear state space models. The method is applied to demand forecasting in the context of a large e-commerce platform, paying special attention to intermittent and bursty target statistics. Inference is approximated by the Newton-Raphson algorithm, reduced t…

Paper develops MMOT framework for financial applications with neural acceleration.

New method improves accuracy in computing implied volatility.

A new method for robust product Markovian quantization overcomes numerical instabilities.

Usually, in the Black-Scholes pricing theory the volatility is a positive real parameter. Here we explore what happens if it is allowed to be a complex number. The function for pricing a European option with a complex volatility has essential singularities at zero and infinity. The singularity at zero reflects the put-…

Consider a process, stochastic or deterministic, obtained by using a numerical integration scheme, or from Monte-Carlo methods involving an approximation to an integral, or a Newton-Raphson iteration to approximate the root of an equation. We will assume that we can sample from the distribution of the process from time…

Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward Markov Decision Process (MDP). Here, a contraction operator is constructed and applied repeatedly to arrive at the optimal solution. Value iteration is a first order method and therefore …

Efficient oblique RSF method improves prediction and interpretability.

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed …

Paper solves convertible bond valuation using finite elements with penalty method.

In Neri and Schneider (2012) we presented a method to recover the Maximum Entropy Density (MED) inferred from prices of call and digital options on a set of n strikes. To find the MED we need to numerically invert a one-dimensional function for n values and a Newton-Raphson method is suggested. In this note we revisit …

Estimates change points in Weibull time series with copulas.

Enhanced options trading strategies using advanced portfolio optimization.

New method predicts neural network performance using free probability theory.

Transformer improves parameter estimation without needing closed-form solutions.

Efficiently models categorical data with low to medium class overlap, improving accuracy over standard distributions.

Local laGPR speeds up multiscale mechanics simulations without neural networks.

NMC improves MCMC convergence by analyzing gradients to determine optimal proposal densities.

Examines algorithmic modeling across three cultures.

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.

Proposes CLRS benchmark to evaluate algorithmic reasoning.

Combines multiple bandit algorithms to create a nearly optimal single algorithm.

We propose accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known rando…

The exchange algorithm is studied for its convergence and asymptotic variance.

Bayesian networks (BN) are used in a big range of applications but they have one issue concerning parameter learning. In real application, training data are always incomplete or some nodes are hidden. To deal with this problem many learning parameter algorithms are suggested foreground EM, Gibbs sampling and RBE algori…

No algorithm outperforms uniform sampling in A/B testing.

Improves algorithm selection for thousands of candidates using dyadic features.

New ELM algorithms reduce computation time and complexity.

This review article surveys data augmentation MCMC algorithms.

Bayesian learning rule unifies and generalizes various machine learning algorithms.

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

This review summarizes five Lasso optimization algorithms.

Neural networks mimic algorithms to solve complex problems.

Paper proposes a reinforcement learning framework for efficient hyper-parameter tuning of stochastic optimization algorithms.

Approximate probabilistic inference algorithms are central to many fields. Examples include sequential Monte Carlo inference in robotics, variational inference in machine learning, and Markov chain Monte Carlo inference in statistics. A key problem faced by practitioners is measuring the accuracy of an approximate infe…

In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem. On the one hand, it exhibits a faster convergence than subgradient algorithms and block coordinate descent algorithms. On the other hand,…

New algorithms reduce bilevel optimization complexity to ε^(-1.5).

Researchers analyze how algorithmic and implementation choices affect RL performance.

Study on selecting between base algorithms in stochastic bandit problems.

New bounds derived for KG algorithm's performance in finite time.

Paper proves linear convergence of SCMS algorithm for directional data.