This paper solves an optimal dividend payout problem with ratcheting constraints using a novel method.
problem Optimal dividend payout under ratcheting constraints for a Brownian motion surplus process.
method Novel partial differential equation method to solve the Hamilton-Jacobi-Bellman (HJB) equation.
result Existence and uniqueness of solution in stronger functional spaces, strict monotonicity, boundedness, and C∞-smoothness of the free boundary. Optimal dividend payout strategy found for Brownian risk model with ratcheting constraint.
problem Optimal dividend payout from a surplus process governed by Brownian motion with drift under ratcheting constraint.
method Solved a two-dimensional optimal control problem using viscosity solutions of Hamilton-Jacobi-Bellman equations.
result Threshold and curve strategies identified as optimal for different dividend rate sets.
Optimal dividend strategy with irreversible reinsurance constraints.
problem Maximizing dividends while adhering to ratcheting and irreversible reinsurance constraints.
method Modeling dividend and reinsurance levels as nondecreasing processes, solving Hamilton-Jacobi-Bellman equation.
result Threshold strategy is optimal for maximizing discounted dividends until ruin.
Optimal dividend strategy with ratcheting and capital injection under Cramér-Lundberg model.
problem Optimal dividend payout for an insurance company with ratcheting constraints and capital injections.
method Systematic probabilistic and PDE-based approach to solve HJB equation, constructing strong solution and optimal strategy.
result Existence and uniqueness of strong solution, explicit optimal feedback control strategy.
Optimal portfolio tracking with dynamic capital injection into a ratcheting benchmark.
problem Optimizing a portfolio's performance by dynamically adding capital to a non-decreasing benchmark.
method Formulated as an unconstrained control problem with a running maximum cost, transformed into an auxiliary problem with a nonlinear HJB equation, solved using probabilistic representation and stochastic flow analysis.
result Established the existence of a unique classical solution to the HJB equation, providing feedback optimal portfolio strategies.
We assume that an agent's rate of consumption is {\it ratcheted}; that is, it forms a non-decreasing process. Given the rate of consumption, we act as financial advisers and find the optimal investment strategy for the agent who wishes to minimize his probability of ruin.
Investigates optimal withdrawal strategies in VA contracts with tax and ratchet mechanisms.
problem Optimizing withdrawal strategies and behavior of policyholders in VA contracts with tax and ratchet mechanisms.
method Solving a backward dynamic programming problem to optimize cash flows from VA contracts, considering hybrid products and taxation effects.
result Tax-shielding effect of the cash fund enhances contract attractiveness, ratchet mechanism discourages early surrender, and cash fund discourages active withdrawals.
We address a long-standing open problem in risk theory, namely the optimal strategy to pay out dividends from an insurance surplus process, if the dividend rate can never be decreased. The optimality criterion here is to maximize the expected value of the aggregate discounted dividend payments up to the time of ruin. I…
We consider the optimal dividend problem under a habit formation constraint that prevents the dividend rate to fall below a certain proportion of its historical maximum, the so-called drawdown constraint. This is an extension of the optimal Duesenberry's ratcheting consumption problem, studied by Dybvig (1995) [Review …
New control theory for self-path-dependent problems solves unique constraints.
problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.
Optimizes gradual reduction of excess carbon emissions to net-zero.
problem Achieving net-zero carbon emissions through gradual reduction of excess emissions.
method Stochastic control approach to identify optimal emission strategy under constraints.
result Identifies the emission strategy that maximizes future profit from excess emissions.
Optimal dividend payout strategies with drawdown constraint identified.
problem Optimal dividend payout strategies under a drawdown constraint.
method Solving a two-dimensional optimal control problem using viscosity solutions and calculus of variations.
result A two-curve strategy is optimal for sufficiently large initial and maximum dividend rates, with a surprising limit result for large maximum dividend rates.
We consider a simple stochastic model of a urban rental housing market, in which the interaction of tenants and landlords induces rent fluctuations. We simulate the model numerically and measure the equilibrium rent distribution, which is found to be close to a lognormal law. We also study the influence of the density …
A neural network method estimates entropy production from system trajectories.
problem Estimating entropy production from system trajectories without detailed dynamics.
method Developed a neural estimator (NEEP) for entropy production (EP).
result NEEP rigorously proves to provide stochastic EP by optimizing an objective function.
The LIBOR market model is very popular for pricing interest rate derivatives, but is known to have several pitfalls. In addition, if the model is driven by a jump process, then the complexity of the drift term is growing exponentially fast (as a function of the tenor length). In this work, we consider a Lévy-driven LIB…
Adaptive batching improves Gaussian process surrogates for noisy level set estimation.
problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.
In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and uses principal component analysis (PCA) of the underlying process in combination w…
Study uses deep learning for efficient hedging of long-term financial derivatives.
problem Optimizing hedging strategies for long-term financial derivatives with various penalties and stylized facts.
method Deep reinforcement learning applied to neural networks optimizing hedging policies with quadratic and non-quadratic penalties.
result Non-quadratic global hedging policies result in significantly smaller downside risk metrics and significant hedging gains.
Method infers MJPs from noisy observations without prior training.
problem Inference of MJPs from noisy and sparse observations is challenging.
method Broad probability distribution, synthetic dataset, and neural network model.
result Zero-shot inference of MJPs across different state spaces.
JFR-rg model explains Japan's stable debt despite high interest rates and low growth.
problem Understanding Japan's stable government debt despite high interest rates and low growth.
method Formalizes financial repression channels through JFR-rg model, incorporating financial repression bias and exchange-rate channel.
result Identifies Normalization Trap and Captive Financial System Parameter, showing debt dynamics under financial repression.
A new algorithm tackles submodular bandit problems with multiple constraints.
problem Addressing diversified retrieval and online learning with budget constraints.
method Non-greedy algorithm focusing on upper-confidence bounds.
result High-probability upper bound of an approximation regret matching fast offline algorithm's ratio.
This work proposes an online learning approach to tighten constraints in stochastic control problems.
problem Solving chance-constrained stochastic optimal control problems is computationally challenging.
method Reformulate chance constraints as a binary regression problem and use a GP model to learn constraint-tightening parameters online.
result The approach tightens constraints more effectively, leading to lower costs in numerical experiments.
We study constrained clustering, where constraints guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the cluster labels of two instances to be the same (must-link constraints) or different (…
Simplifies neural network constraints with computationally efficient method.
problem Implementing hard output constraints in neural networks.
method Additional neural network layer for output constraints.
result Computational simplicity with complexity O(n*m) for linear constraints.
Reduces Lie (bi-)algebroids and Dirac manifolds using constraint vector bundles.
problem Reduction of Lie (bi-)algebroids and Dirac manifolds.
method Introduces constraint manifolds and constraint vector bundles; proves constraint Serre-Swan theorem; introduces Cartan calculus for constraint forms and multivector fields; shows compatibility with reduction.
result Reduction procedure for Lie (bi-)algebroids and Dirac manifolds.
Optimistic algorithm reduces regret and constraint violations in online convex optimization with adversarial constraints.
problem Online convex optimization with adversarial constraints.
method Improved algorithm using accurate predictions of loss and constraint functions.
result Improved bounds on regret and cumulative constraint violations.
Holistic GLMs add constraints for better model quality.
problem Improving classical linear regression models.
method Sparsity-inducing, sign-coherence, and linear constraints.
result Holistic GLMs reliably solve GLMs for various responses.
Paper tackles constrained bandit problems with a new learning framework.
problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.
In the present paper, the minimal investment risk for a portfolio optimization problem with imposed budget and investment concentration constraints is considered using replica analysis. Since the minimal investment risk is influenced by the investment concentration constraint (as well as the budget constraint), it is i…
Survey of Gaussian process constraints for modeling expensive data.
problem Modeling expensive data with physical constraints.
method Overview of various Gaussian process constraints and their implementation.
result Discussion of computational challenges introduced by constraints.
This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the proj…
We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …
Iterative method learns unknown constraints for MPC control.
problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.
We reformulate data-dependent constraints to ensure they are always met with high probability.
problem Ensuring fairness and stability in machine learning models with data-dependent constraints.
method Calibrated reformulation of constraints to guarantee satisfaction with a specified probability.
result Our method guarantees that fairness constraints are met at test time with high probability.
New algorithm reduces regret and constraint violation in online convex optimization with complex constraints.
problem Online convex optimization with multiple functional constraints and a simple constraint set.
method Instance-dependent bound using online primal-dual mirror-prox algorithm in general normed spaces.
result Achieves an O(√V*(T)) regret and O(1) constraint violation, improving over previous works.
Adding constraint support in Machine Learning has the potential to address outstanding issues in data-driven AI systems, such as safety and fairness. Existing approaches typically apply constrained optimization techniques to ML training, enforce constraint satisfaction by adjusting the model design, or use constraints …
Algorithm ensures privacy while strictly adhering to constraints.
problem Differential privacy with linear constraints that must be strictly followed.
method Developed an algorithm that releases a nearly-optimal solution satisfying constraints with probability 1.
result Achieved nearly optimal performance while preserving privacy and strictly adhering to constraints.
Proposes NUV priors for half-space and box constraints.
problem Adding constraints to linear Gaussian models without computational cost.
method Introduces NUV representations for half-space and box constraints.
result Adds constraints to linear Gaussian models without affecting computational tractability.
Meta-gradient D4PG optimizes performance and constraint adherence in RL.
problem Balancing performance and adherence to complex constraints in RL.
method Uses meta-gradients to find a balance between expected return and minimizing constraint violations.
result Meta-gradient D4PG consistently outperforms baselines across MuJoCo domains.
Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.
problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.
This work is a further study on the Generalized Constraint Neural Network (GCNN) model [1], [2]. Two challenges are encountered in the study, that is, to embed any type of prior information and to select its imposing schemes. The work focuses on the second challenge and studies a new constraint imposing scheme for equa…
The paper improves Gaussian processes by adding sum constraints, enhancing prediction accuracy.
problem Improving Gaussian process predictions with background knowledge constraints.
method Conditioning the prior distribution on sum constraints to ensure fulfillment of linear and nonlinear constraints.
result The approach fulfills constraints with high precision and improves prediction accuracy.
Develops a new method for optimizing with uncertain data.
problem Uncertainty in real-world optimization problems.
method Combines chance constraints and constraint learning for mixed-integer linear optimization.
result Data-driven solution for setting probabilistic bounds on learned constraints.
Efficient algorithms decide algebraic constraints of causal graphs.
problem Distinguish causal graphs with latent confounders.
method Study algebraic constraints and propose efficient algorithms.
result Decide equivalence or subset of algebraic constraints.
The paper introduces MU for NMF with β-divergences and disjoint constraints.
problem Nonnegative matrix factorization with constraints.
method Design multiplicative updates for NMF based on β-divergences with disjoint constraints. result Multiplicative updates satisfy constraints and decrease the objective function.
FISAR uses neural networks to optimize safe reinforcement learning with forward-invariant constraints.
problem Safe reinforcement learning with constraints in safety-critical environments.
method Imposing linear constraints on policy parameters' updating dynamics, using a DNN-based optimizer to satisfy these constraints.
result The policy decreases constraint violation and maximizes cumulative reward monotonically.
Solves Einstein constraint equations on compact manifolds with specified boundaries.
problem Solving Einstein constraint equations with specified boundaries.
method Studies conformal constraint equations with low regularity assumptions.
result Solves Einstein constraint equations on compact manifolds with specified boundaries.
We propose a general method for deformation quantization of any second-class constrained system on a symplectic manifold. The constraints determining an arbitrary constraint surface are in general defined only locally and can be components of a section of a non-trivial vector bundle over the phase-space manifold. The c…