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.
Paper offers a dual formulation for consumption problem with multiplicative habit.
Derives a primal-dual MLSVD formulation for multilinear data.
Dual martingales improve primal optimal stopping problem efficiency.
Paper develops a dual formulation for PCA in Hilbert spaces.
New dual formulation reduces generalization error for ERM-fDR.
We study the dual formulation of the utility maximization problem in incomplete markets when the utility function is finitely valued on the whole real line. We extend the existing results in this literature in two directions. First, we allow for nonsmooth utility functions, so as to include the shortfall minimization p…
New method accelerates convergence for entropy-regularized reinforcement learning problems.
In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows…
In modern large-scale machine learning applications, the training data are often partitioned and stored on multiple machines. It is customary to employ the "data parallelism" approach, where the aggregated training loss is minimized without moving data across machines. In this paper, we introduce a novel distributed du…
We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for building latent variable models of the data distribution based on the primal and the dual formulations of the optimal transport (OT) problem. We utilize the primal formulation to learn a flexible inference mechanism and to create an optimal approxim…
We present a novel algorithm for non-linear instrumental variable (IV) regression, DualIV, which simplifies traditional two-stage methods via a dual formulation. Inspired by problems in stochastic programming, we show that two-stage procedures for non-linear IV regression can be reformulated as a convex-concave saddle-…
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…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality theory for general marginals and measurable reward (cost) functions: absence of a…
Dual optimization connects ERM-fDR to normalization function.
In many sequential decision-making problems, the goal is to optimize a utility function while satisfying a set of constraints on different utilities. This learning problem is formalized through Constrained Markov Decision Processes (CMDPs). In this paper, we investigate the exploration-exploitation dilemma in CMDPs. Wh…
The most important examples of a double vector bundle are provided by iterated tangent and cotangent functors: TTM, TT^*M, T^*TM, and T^*T^*M. We introduce the notions of the dual double vector bundle and the dual double vector bundle morphism. Theorems on canonical isomorphisms are formulated and proved. Several examp…
We consider a general path-dependent version of the hedging problem with price impact of Bouchard et al. (2019), in which a dual formulation for the super-hedging price is obtained by means of PDE arguments, in a Markovian setting and under strong regularity conditions. Using only probabilistic arguments, we prove, in …
Revisits superfields and geometry, offering new formulations and interpretations.
The paper calibrates SPX and VIX options using optimal transport.
Multi-objective optimization (MOO) is a well-studied problem for several important recommendation problems. While multiple approaches have been proposed, in this work, we focus on using constrained optimization formulations (e.g., quadratic and linear programs) to formulate and solve MOO problems. This approach can be …
This paper concerns the dual risk model, dual to the risk model for insurance applications, where premiums are surplus-dependent. In such a model premiums are regarded as costs, while claims refer to profits. We calculate the mean of the cumulative discounted dividends paid until ruin, if the barrier strategy is applie…
In this paper, we study a semi-martingale optimal transport problem and its application to the calibration of Local-Stochastic Volatility (LSV) models. Rather than considering the classical constraints on marginal distributions at initial and final time, we optimise our cost function given the prices of a finite number…
We present a general regularization-based framework for Multi-task learning (MTL), in which the similarity between tasks can be learned or refined using -norm Multiple Kernel learning (MKL). Based on this very general formulation (including a general loss function), we derive the corresponding dual formulation …
We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual sparse reconstruction problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. More…
Paper tackles offline RL with weak assumptions on both function classes and data coverage.
We introduce a new approach for comparing reinforcement learning policies, using Wasserstein distances (WDs) in a newly defined latent behavioral space. We show that by utilizing the dual formulation of the WD, we can learn score functions over policy behaviors that can in turn be used to lead policy optimization towar…
We consider the problem of optimal consumption of multiple goods in incomplete semimartingale markets. We formulate the dual problem and identify conditions that allow for existence and uniqueness of the solution and give a characterization of the optimal consumption strategy in terms of the dual optimizer. We illustra…
We give holomorphic Chern-Simons-like action functionals on supertwistor space for self-dual supergravity theories in four dimensions, dealing with N=0,...,8 supersymmetries, the cases where different parts of the R-symmetry are gauged, and with or without a cosmological constant. The gauge group is formally the group …
We focus on the robust principal component analysis (RPCA) problem, and review a range of old and new convex formulations for the problem and its variants. We then review dual smoothing and level set techniques in convex optimization, present several novel theoretical results, and apply the techniques on the RPCA probl…
A new dual test for forward-flatness simplifies computations.
Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the Sinkhorn algorithm. However, entropy keeps the transportation plan strictly positive…
Geometries and dual field theories linked by AdS/CFT.
Sketching techniques have become popular for scaling up machine learning algorithms by reducing the sample size or dimensionality of massive data sets, while still maintaining the statistical power of big data. In this paper, we study sketching from an optimization point of view: we first show that the iterative Hessia…
Generative adversarial nets (GANs) are a promising technique for modeling a distribution from samples. It is however well known that GAN training suffers from instability due to the nature of its maximin formulation. In this paper, we explore ways to tackle the instability problem by dualizing the discriminator. We sta…
A new method for SSMF improves upon existing algorithms.
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…
Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…
Conditions for a soliton's dual form to be harmonic or Ricci harmonic are derived.
A fundamental problem in risk management is the robust aggregation of different sources of risk in a situation where little or no data are available to infer information about their dependencies. A popular approach to solving this problem is to formulate an optimization problem under which one maximizes a risk measure …
A new method for faster optimization on statistical manifolds.
Two signature-based methods solve optimal stopping in non-Markovian frameworks.
Paper studies statistical manifolds with logarithmic divergences.
The support vector machine (SVM) was originally designed for binary classifications. A lot of effort has been put to generalize the binary SVM to multiclass SVM (MSVM) which are more complex problems. Initially, MSVMs were solved by considering their dual formulations which are quadratic programs and can be solved by s…
Grassmannian sigma models extend Gross-Neveu model formulations.
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…
New scalable methods for unbalanced optimal transport improve efficiency and applicability.
Geometric problems are usually formulated by means of (exterior) differential systems. In this theory, one enriches the system by adding algebraic and differential constraints, and then looks for regular solutions. Here we adopt a dual approach, which consists to enrich a plane field, as this is often practised in cont…
A new method for compressive classification using bridge regression.