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.
Study optimal dividends in dual risk model with stochastic interest rate.
New method speeds up optimization with non-uniform sampling.
New algorithms solve convex-concave problems faster than previous methods.
Quantized Stochastic Primal-Dual Methods for Distributed Optimization
A method for risk valuation using backward stochastic differential equations.
Stochastic Gradient Descent (SGD) has become popular for solving large scale supervised machine learning optimization problems such as SVM, due to their strong theoretical guarantees. While the closely related Dual Coordinate Ascent (DCA) method has been implemented in various software packages, it has so far lacked go…
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…
Dual IHT algorithm solves NP-hard non-convex sparse minimization problems.
Uniform sampling of training data has been commonly used in traditional stochastic optimization algorithms such as Proximal Stochastic Gradient Descent (prox-SGD) and Proximal Stochastic Dual Coordinate Ascent (prox-SDCA). Although uniform sampling can guarantee that the sampled stochastic quantity is an unbiased estim…
We consider a class of discrete time stochastic control problems motivated by some financial applications. We use a pathwise stochastic control approach to provide a dual formulation of the problem. This enables us to develop a numerical technique for obtaining an estimate of the value function which improves on purely…
This paper introduces AdaSDCA: an adaptive variant of stochastic dual coordinate ascent (SDCA) for solving the regularized empirical risk minimization problems. Our modification consists in allowing the method adaptively change the probability distribution over the dual variables throughout the iterative process. AdaSD…
We study a stochastic and distributed algorithm for nonconvex problems whose objective consists of a sum of nonconvex -smooth functions, plus a nonsmooth regularizer. The proposed NonconvEx primal-dual SpliTTing (NESTT) algorithm splits the problem into subproblems, and utilizes an augmented Lagrangian b…
This paper introduces a dual problem to study a continuous-time consumption and investment problem with incomplete markets and stochastic differential utility. For Epstein-Zin utility, duality between the primal and dual problems is established. Consequently the optimal strategy of the consumption and investment proble…
Neural model accelerates SDDP for stochastic optimization.
Improved first-order algorithm for entropy regularized OT with faster convergence.
Accelerates machine learning algorithms for sparse data.
Paper tackles robust model training with a new stochastic algorithm.
We introduce a proximal version of the stochastic dual coordinate ascent method and show how to accelerate the method using an inner-outer iteration procedure. We analyze the runtime of the framework and obtain rates that improve state-of-the-art results for various key machine learning optimization problems including …
New algorithm solves composite optimization problems with unknown expectations.
In this paper we present a framework to analyze the asymptotic behavior of two timescale stochastic approximation algorithms including those with set-valued mean fields. This paper builds on the works of Borkar and Perkins & Leslie. The framework presented herein is more general as compared to the synchronous two times…
We consider a composite convex minimization problem associated with regularized empirical risk minimization, which often arises in machine learning. We propose two new stochastic gradient methods that are based on stochastic dual averaging method with variance reduction. Our methods generate a sparser solution than the…
We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors. The problem structure allows us to reformulate it as a convex-concave saddle point problem. We propose a stochastic primal-dual coordinate (SPDC) method, which alternates between maximizing ov…
The important application of semi-static hedging in financial markets naturally leads to the notion of quasi self-dual processes which is, for continuous semimartingales, related to symmetry properties of both their ordinary as well as their stochastic logarithms. We provide a structure result for continuous quasi self…
New algorithm approximates continuous Wasserstein barycenters efficiently.
We propose a doubly stochastic primal-dual coordinate optimization algorithm for empirical risk minimization, which can be formulated as a bilinear saddle-point problem. In each iteration, our method randomly samples a block of coordinates of the primal and dual solutions to update. The linear convergence of our method…
Optimizes stochastic convex optimization with local minimax theory and adaptive methods.
We extend Kyle's model to include stochastic liquidity and multiple assets.
Dual regularized graph Laplacian improves spectral clustering for community detection.
Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.
Improves SDCA convergence for convex objectives with linear constraints.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
A new method for distributed optimization reduces communication rounds without minibatches.
New SPD methods improve online policy estimation in MDPs with reduced storage and complexity.
Dual risk models are popular for modeling a venture capital or high tech company, for which the running cost is deterministic and the profits arrive stochastically over time. Most of the existing literature on dual risk models concentrated on the optimal dividend strategies. In this paper, we propose to study the optim…
We introduce a proximal version of dual coordinate ascent method. We demonstrate how the derived algorithmic framework can be used for numerous regularized loss minimization problems, including regularization and structured output SVM. The convergence rates we obtain match, and sometimes improve, state-of-the-…
The stochastic dual coordinate-ascent (S-DCA) technique is a useful alternative to the traditional stochastic gradient-descent algorithm for solving large-scale optimization problems due to its scalability to large data sets and strong theoretical guarantees. However, the available S-DCA formulation is limited to finit…
Optimizes distributions robustly with Sinkhorn distance.
A new algorithm reduces the complexity of solving optimal transport problems.
This work tackles resource allocation in asynchronous and stochastic systems.
Drago optimizes DRO problems with faster convergence.
The dual representation of the martingale optimal transport problem in the Skorokhod space of multi dimensional cadlag processes is proved. The dual is a minimization problem with constraints involving stochastic integrals and is similar to the Kantorovich dual of the standard optimal transport problem. The constraints…
The paper develops methods to optimize resource allocation in wireless systems using deep neural networks.
In this paper we study a continuous-time stochastic linear quadratic control problem arising from mathematical finance. We model the asset dynamics with random market coefficients and portfolio strategies with convex constraints. Following the convex duality approach, we show that the necessary and sufficient optimalit…
We study the stochastic control problem of maximizing expected utility from terminal wealth under a non-bankruptcy constraint. The wealth process is subject to shocks produced by a general marked point process. The problem of the agent is to derive the optimal insurance strategy which allows "lowering" the level of the…
Optimizes stochastic linear bandits with efficient, asymptotically optimal algorithm.
Proposes an online method for solving non-convex DRO with KL regularization.
Study optimal consumption with relaxed benchmarks and drawdown constraints.
The paper calibrates LSV models using optimal transport and convex optimisation.