arXiv research

Dual martingales improve primal optimal stopping problem efficiency.

Dual optimization connects ERM-fDR to normalization function.

Optimizes subset selection in sparse learning problems.

Paper proposes a novel metric learning algorithm using Riemannian optimization.

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…

The dual problem of optimal transportation in Lorentz-Finsler geometry is studied. It is shown that in general no solution exists even in the presence of an optimal coupling. Under natural assumptions dual solutions are established. It is further shown that the existence of a dual solution implies that the optimal tran…

Paper offers a dual formulation for consumption problem with multiplicative habit.

This paper discusses the numéraire-based utility maximization problem in markets with proportional transaction costs. In particular, the investor is required to liquidate all her position in stock at the terminal time. We first observe the stability of the primal and dual value functions as well as the convergence of t…

A new method for faster optimization on statistical manifolds.

We study primal-dual type stochastic optimization algorithms with non-uniform sampling. Our main theoretical contribution in this paper is to present a convergence analysis of Stochastic Primal Dual Coordinate (SPDC) Method with arbitrary sampling. Based on this theoretical framework, we propose Optimality Violation-ba…

Drago optimizes DRO problems with faster convergence.

The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach lattice $\cal{X}$ with a order unit. The primal problem is given as the supremum o…

Study investigates duality and dual optimizers for various transport problems.

Researchers prove uniqueness and continuity of solution to L_p dual Minkowski problem.

New algorithm selects robust martingale for optimal stopping problems.

A new method for distributed optimization reduces communication rounds without minibatches.

Algorithm optimizes constrained reinforcement learning with dual variables.

This work studies the strong duality of non-convex matrix factorization problems: we show that under certain dual conditions, these problems and its dual have the same optimum. This has been well understood for convex optimization, but little was known for non-convex problems. We propose a novel analytical framework an…

Optimal dividend strategy in dual risk model is well studied in the literatures. But to the best of our knowledge, all the previous works assumes deterministic interest rate. In this paper, we study the optimal dividends strategy in dual risk model, under a stochastic interest rate, assuming the discounting factor foll…

In this paper we study a utility maximization problem with both optimal control and optimal stopping in a finite time horizon. The value function can be characterized by a variational equation that involves a free boundary problem of a fully nonlinear partial differential equation. Using the dual control method, we der…

Constrained Markov Decision Process (CMDP) is a natural framework for reinforcement learning tasks with safety constraints, where agents learn a policy that maximizes the long-term reward while satisfying the constraints on the long-term cost. A canonical approach for solving CMDPs is the primal-dual method which updat…

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum $\sum_{i=1}^{m}f_i(z)$ of functions over in a network. We provide complexity bounds for four different cases, namely: each function $f_i$ is strongly convex and smooth, each function is ei…

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…

Paper develops Byzantine-resilient algorithms for decentralized learning.

We prove dual attainment for multi-asset financial derivatives pricing.

The dual risk model is a popular model in finance and insurance, which is often used to model the wealth process of a venture capital or high tech company. Optimal dividends have been extensively studied in the literature for a dual risk model. It is well known that the value function of this optimal control problem do…

Unified Kantorovich duality for multimarginal optimal transport on Polish spaces.

Paper introduces SGA for barycenter optimization in optimal transport.

Study optimal consumption with relaxed benchmarks and drawdown constraints.

Quantized Stochastic Primal-Dual Methods for Distributed Optimization

We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove that our algorithm achieves optimal $\mathcal{O}(n/k)$ and $\mathcal{O}(n^2/k^2)$…

New algorithm for federated learning with non-smooth regularizers.

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…

Optimizes wireless network resource management with state-augmented policies.

In this paper we introduce and study the concept of optimal and surely optimal dual martingales in the context of dual valuation of Bermudan options, and outline the development of new algorithms in this context. We provide a characterization theorem, a theorem which gives conditions for a martingale to be surely optim…

Optimal portfolio yields a digital option payoff.

Paper tightens optimization bounds using conformal prediction.

Radial Basis Functions Neural Networks (RBFNNs) are tools widely used in regression problems. One of their principal drawbacks is that the formulation corresponding to the training with the supervision of both the centers and the weights is a highly non-convex optimization problem, which leads to some fundamentally dif…

The paper improves Gaussian process models for efficient batch optimization.

PDCA algorithm learns policies for RL with constraints using a primal-dual approach.

In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…

PDA method optimizes neural networks with global convergence rate analysis.

We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov's excessive gap te…

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…

Paper develops a dual formulation for PCA in Hilbert spaces.

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 revisit the portfolio optimization problems of the minimization/maximization of investment risk under constraints of budget and investment concentration (primal problem) and the maximization/minimization of investment concentration under constraints of budget and investment risk (dual problem) for the…

Optimal hedging framework with variational preferences under convex risk measures.