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.

169,341 papers · 148 categories

Trend · papers per month

2755498241,098 · Jun 202019922001200920182026
48 results for optimal dual process

The paper addresses utility maximization in markets with transaction costs, focusing on stability and optimal dual processes.

problem Utility maximization in markets with proportional transaction costs.
method Analysis of primal and dual value functions, study of optimal dual process, construction of limiting ODP.
result The optimal dual process defines a shadow price in the limiting market.

Study optimal dividends in dual risk model with stochastic interest rate.

problem Optimal dividend strategy in dual risk model with stochastic interest rate.
method Geometric Brownian motion or exponential Lévy process for discounting factor.
result Closed form solutions can be obtained for optimal dividends.

Study optimal consumption with relaxed benchmarks and drawdown constraints.

problem Optimal consumption under relaxed benchmark tracking and consumption drawdown constraint.
method Transformed stochastic control problem into regular control problem with state-control constraints, then solved using dual transform and optimal consumption behavior.
result Closed-form solution for optimal investment and consumption in feedback form.

Study optimizes dividend strategies for risk processes with Lévy jumps.

problem Optimizing dividend payments in risk processes with Lévy jumps.
method Analyzes spectrally positive and negative Lévy processes, using scale functions.
result Periodic barrier strategy is optimal for spectrally negative Lévy processes with completely monotone Lévy density.

APDO optimizes CMDPs with off-policy dual updates for faster convergence.

problem Learning policies that maximize long-term reward while satisfying safety constraints.
method Accelerated Primal-Dual Optimization (APDO) incorporating off-policy dual updates.
result APDO achieves better sample efficiency and faster convergence than existing methods.

Neural model accelerates SDDP for stochastic optimization.

problem Exponential complexity of SDDP limits its applicability to low-dimensional problems.
method Trainable neural model maps problem instances to a low-dimensional piecewise linear value function.
result ν-SDDP significantly reduces problem solving cost without sacrificing solution quality.

New method improves image and signal processing with nonconvex rank surrogates and dual momentum.

problem Optimizing nonconvex rank minimization problems in image processing.
method Proposes a novel nonconvex rank surrogate, uses ADMM with dual momentum trick.
result Effective in image and signal processing applications, outperforming state-of-the-art methods.

New algorithm reduces big data processing time by sketching and random projection.

problem Efficiently processing large and high-dimensional data sets.
method Developed a new algorithm combining sketching and dual random projection, using preconditioned conjugate gradient.
result The algorithm can recover the optimum of the original problem up to arbitrary precision with a logarithmic number of small-scale solver calls.

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…

2014-04-05abs ↗pdf ↗

In this paper we study the optimal dividend problem for a company whose surplus process evolves as a spectrally positive Levy process. This model including the dual model of the classical risk model and the dual model with diffusion as special cases. We assume that dividends are paid to the shareholders according to ad…

2013-02-09abs ↗pdf ↗

We revisit the dividend payment problem in the dual model of Avanzi et al. ([2], [1], and [3]). Using the fluctuation theory of spectrally positive Lévy processes, we give a short exposition in which we show the optimality of barrier strategies for all such Lévy processes. Moreover, we characterize the optimal barrier …

2012-11-30abs ↗pdf ↗

Optimizes hybrid dividend strategies in dual models with periodic and continuous payments.

problem Determining the best dividend strategy in a dual model with periodic and continuous payments.
method Generalizes results from a Brownian model to a dual (spectrally positive Lévy) model, using the scale function.
result The optimal strategy is of the hybrid-barrier type and can be expressed using the scale function.

A new kernel for probability measures based on optimal transport.

problem Efficiently comparing and modeling distributions.
method Kernel over probability measures using regularized optimal transport and Hilbertian embedding.
result The proposed kernel enables Gaussian process modeling on distributions with theoretical and computational advantages.

Paper studies optimal tracking portfolio in mean field game of large fund competition.

problem Optimal tracking portfolio in large fund competition with relative performance benchmark.
method Formulated mean field game problem, established existence of mean field equilibrium using PDE approach, constructed approximate Nash equilibrium.
result Existence of mean field equilibrium and consistency condition verified.

Unified framework for entropy-regularized reinforcement learning in MDPs.

problem Entropy-regularized reinforcement learning in Markov decision processes.
method Extending linear programming to accommodate convex regularization functions.
result Using conditional entropy as regularization yields a dual problem similar to Bellman equations.

Study optimal dividend strategy with time of ruin constraint for financial firms.

problem Optimal dividend strategy with time of ruin constraint for spectrally one-sided Lévy risk models.
method Introduced a longevity feature to the classical optimal dividend problem, extended results to one-sided Lévy risk models, and characterized the solution using dual problems.
result Characterized the solution to the constrained optimal dividend problem for spectrally one-sided Lévy processes.

Algorithm optimizes constrained reinforcement learning with dual variables.

problem Minimizing convex functional subject to convex constraint in large state spaces.
method VPDPO algorithm using Lagrangian and Fenchel duality.
result Achieves sublinear regret and constraint violation, globally optimal policy.

Improves SDCA convergence for convex objectives with linear constraints.

problem Minimizing convex objectives with linear constraints under gradient-Lipschitz assumption failure.
method Shifted Stochastic Dual Coordinate Ascent (SDCA) under smoothness assumption.
result Obtains linear convergence rate for Poisson regression and Hawkes process objectives.

This paper solves a utility maximization problem under utility-based shortfall risk constraint, by proposing an approach using Lagrange multiplier and convex duality. Under mild conditions on the asymptotic elasticity of the utility function and the loss function, we find an optimal wealth process for the constrained p…

2015-01-29abs ↗pdf ↗

New SPD methods improve online policy estimation in MDPs with reduced storage and complexity.

problem Online estimation of optimal policies in Markov decision processes (MDPs).
method Stochastic Primal-Dual (SPD) methods that update few coordinates of value and policy estimates.
result SPD methods find absolute-εε-optimal policies with high probability using a specified number of iterations/samples.

Paper develops efficient estimator for Hawkes processes using representer theorem.

problem Estimating latent triggering kernels for Hawkes processes from event sequences.
method Penalized least squares minimization in RKHS framework.
result Efficient estimator with competitive accuracy and improved computational efficiency.

The paper solves a finance problem using stochastic equations.

problem Risk minimization with portfolio constraints in financial markets.
method Uses Forward and Backward Stochastic Differential Equations (FBSDEs) to model and solve the problem.
result Explicit representations of solutions to quadratic risk minimization problems with constraints are derived.

The paper solves a control problem using reflections to track a benchmark process.

problem Optimal consumption with a benchmark process that grows over time.
method Introduced two auxiliary state processes with reflections to transform the problem into a more tractable form.
result Established the existence of a unique classical solution to the dual PDE.

A new GAN training method using primal-dual subgradient methods.

problem Training GANs to avoid mode collapse and generate diverse samples.
method Relating GANs to convex optimization via Lagrangian perspective and primal-dual subgradient methods.
result The proposed method resolves mode collapse and generates diverse samples.

We maximize the expected utility of terminal wealth in an incomplete market where there are cone constraints on the investor's portfolio process and the utility function is not assumed to be strictly concave or differentiable. We establish the existence of the optimal solutions to the primal and dual problems and their…

2010-10-19abs ↗pdf ↗

Dual ML approach predicts peak temperatures in AFSD, improving process optimization.

problem Lack of understanding between process parameters and resulting microstructure in AFSD.
method Combines supervised machine learning and physics-informed neural networks.
result Ensemble techniques like gradient boosting outperform other SML methods in predicting peak temperatures.

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…

2012-01-31abs ↗pdf ↗

New algorithm for fast nonsmooth optimization with applications in image processing and machine learning.

problem Minimizing the sum of three convex functions with specific properties.
method PDDY algorithm, based on Davis-Yin splitting in a primal-dual product space.
result Sublinear and linear convergence rates in various scenarios, including strong convexity.