Paper solves MV portfolio selection in jump-diffusion models with no-shorting constraint.
problem Mean-variance portfolio selection in jump-diffusion model with no-shorting constraint.
method Reduces problem to LQ control and finding a maximal point of a function, constructs viscosity solution.
result Explicit viscosity solution to Hamilton-Jacobi-Bellman equation, optimal controls derived.
Reinsurance can help life insurers maintain higher capital guarantees without losing utility.
problem Decreasing capital guarantees in life insurance products.
method Dynamic investment-reinsurance optimization problem with simultaneous Value-at-Risk and no-short-selling constraints. Introduced guarantee-equivalent utility gain for comparison.
result Optimally managed reinsurance allows insurers to offer higher capital guarantees without reducing expected utility.
The paper optimizes investment strategies with constraints for life-cycle models.
problem Maximizing consumption, death benefit, and wealth under trading constraints.
method Deep pricing kernel approach to solve constrained portfolio optimization.
result Individuals reduce consumption, insurance demand, and wealth due to constraints.
Study portfolio optimization with partial info and drawdown constraints using deep learning.
problem Optimizing portfolios with partial information and maximum drawdown constraints.
method Bayesian framework, dynamic programming, semi-explicit solutions, deep learning for stochastic control.
result Numerical solutions and performance analysis with deep learning, convergence to Merton problem.
A financial market model with general semimartingale asset-price processes and where agents can only trade using no-short-sales strategies is considered. We show that wealth processes using continuous trading can be approximated very closely by wealth processes using simple combinations of buy-and-hold trading. This ap…
Study optimal investment-reinsurance strategy for insurers under random coefficients and jumps.
problem Optimal investment-reinsurance strategy for insurers with random coefficients and jumps.
method Solves backward stochastic differential equations with jumps under a convex cone constraint.
result Optimal strategy and value remain the same even with random coefficients and jumps.
A large portfolio of independent returns is optimized under the variance risk measure with a ban on short positions. The no-short selling constraint acts as an asymmetric ℓ1 regularizer, setting some of the portfolio weights to zero and keeping the out of sample estimator for the variance bounded, avoiding the di…
This article is the term paper of the course Investments. We mainly focus on modeling long-term investment decisions of a typical utility-maximizing individual, with features of Chinese stock market in perspective. We adopt an OR based methodology with market information as input parameters to carry out the solution. T…
The paper solves multi-period portfolio selection with constraints using a dynamic factor model.
problem Multi-period mean-variance portfolio selection with constraints.
method Dynamic factor model, dynamic programming, piecewise linear feedback policy.
result Optimal portfolio policies determined by two stochastic processes.
This paper considers a sequence of discrete-time random walk markets with a safe and a single risky investment opportunity, and gives conditions for the existence of arbitrages or free lunches with vanishing risk, of the form of waiting to buy and selling the next period, with no shorting, and furthermore for weak conv…
Optimal withdrawal strategy for DC pension plans maximizes total withdrawals while managing risk.
problem Maximizing withdrawals from DC pension plans while managing risk.
method Optimal stochastic control approach with constraints on withdrawal and asset allocation.
result Optimal strategy yields higher average withdrawals with minimal increase in risk.
Mathematical model for focused investing reduces diversification risks.
problem Reduces diversification risks in focused investing portfolios.
method Generalized Kelly Criterion with constraints for optimal capital allocation.
result Software shows excessive diversification in real portfolios.
We study the problem of optimal portfolio selection in an illiquid market with discrete order flow. In this market, bids and offers are not available at any time but trading occurs more frequently near a terminal horizon. The investor can observe and trade the risky asset only at exogenous random times corresponding to…
Paper optimizes portfolios for absolute return funds with constraints.
problem Optimizing portfolios with constraints for absolute return funds.
method Stochastic control framework with numerical solution using kernel-based collocation method.
result Leverage is necessary to achieve the target level.
Paper solves complex game theory problems with new equations.
problem Zero-sum stochastic games with non-Markovian switching.
method New multidimensional SRE and BSDE solutions.
result Existence and uniqueness of SRE solutions.
Paper optimizes ES estimation under an ℓ1 constraint, reducing estimation errors.
problem High instability and infeasibility of ES estimation above a critical ratio r=N/T. method Analytical approach using the method of replicas from statistical physics.
result Regularization with ℓ1 constraint renormalizes the aspect ratio r=N/T. Markowitz (1952, 1959) laid down the ground-breaking work on the mean-variance analysis. Under his framework, the theoretical optimal allocation vector can be very different from the estimated one for large portfolios due to the intrinsic difficulty of estimating a vast covariance matrix and return vector. This can res…
New insights into optimal portfolios and ecological equilibria reveal surprising complexity.
problem Optimal portfolio construction with ecological constraints.
method Computational analysis of multispecies Lotka-Volterra equations with unit rank interaction matrices.
result Logarithm of the average number of solutions grows as \(N^{2/3}\), with most likely solutions being much smaller.
The optimization of the variance supplemented by a budget constraint and an asymmetric ℓ1 regularizer is carried out analytically by the replica method borrowed from the theory of disordered systems. The asymmetric regularizer allows us to penalize short and long positions differently, so the present treatment in…
Investigates optimal portfolio selection with regime-switching-induced stock price shocks.
problem Mean-variance portfolio selection with regime-switching and stock price jumps.
method Modeling regime-switching and stock price jumps, deriving optimal portfolio strategy and efficient frontier using ODEs.
result Added complexity due to regime-switching-induced stock price shocks, leading to nonlinear ODEs.
Investigates multi-period portfolio optimization for DC plans using buffered Probability of Exceedance.
problem Optimizing long-term Defined Contribution plans with realistic constraints and dynamic dynamics.
method Formulates and solves bilevel optimization problems for pre-commitment and time-consistent Mean-bPoE and Mean-CVaR portfolio optimization.
result Time-consistent Mean-bPoE strategies maintain investor preferences for minimum terminal wealth, unlike Mean-CVaR.
We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (…
Study optimal portfolio strategies with periodic evaluation under short-selling prohibition.
problem Optimal portfolio strategies with periodic evaluation under short-selling prohibition.
method Reformulate the original problem into an auxiliary one-period optimization problem and introduce dual control problem.
result Derive and verify the value function and optimal constrained portfolio for the original problem.
Investigates optimal portfolio strategies in markets with latent side information.
problem Investment problem in markets with latent dependence structure and side information.
method Dynamic and constant portfolio strategies, analyzing log-optimal portfolio as benchmark.
result Optimal dynamic strategy growth rate asymptotically converges to constant strategy in stationary markets.
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.
A new ML method teaches constraints directly to models.
problem Addressing safety and fairness in AI systems.
method Directly teaching constraint satisfaction to ML models using a constraint solver.
result Empirically, our approach performs well on fairness and synthetic constraints.
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.
The paper explores how to learn models that respect constraints in probabilistic learning.
problem Learning models that respect declared constraints in probabilistic learning.
method Mathematical inquiry on tractable probabilistic models like sum-product networks.
result Determines conditions under which constraints can be integrated with model learning.
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.