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 solves optimization problems with convex expectation constraints using a new algorithm.
Study shows equivalence of four risk constraints in non-concave optimization problems.
We present an objective function for learning with unlabeled data that utilizes auxiliary expectation constraints. We optimize this objective function using a procedure that alternates between information and moment projections. Our method provides an alternate interpretation of the posterior regularization framework (…
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 …
Optimal transport framework for density estimation with constraints.
We show that coherent risk measures are ineffective in curbing the behaviour of investors with limited liability or excessive tail-risk seeking behaviour if the market admits statistical arbitrage opportunities which we term -arbitrage for a risk measure . We show how to determine analytically whether such -ar…
We reformulate data-dependent constraints to ensure they are always met with high probability.
In this paper, we study a type of reflected BSDE with a constraint and introduce a new kind of nonlinear expectation via BSDE with a constraint and prove the Doob-Meyer decomposition with respect to the super(sub)martingale introduced by this nonlinear expectation. We then apply the results to the pricing of American o…
BAICS identifies best arm with fairness constraints on subpopulations.
Study optimal investment and consumption in incomplete markets with nonlinear expectations.
This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a {\color{black} functional or expectation} constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), t…
We provide an economic interpretation of the practice consisting in incorporating risk measures as constraints in a classic expected return maximization problem. For what we call the infimum of expectations class of risk measures, we show that if the decision maker (DM) maximizes the expectation of a random return unde…
In this paper, we focus on the problem of stochastic optimization where the objective function can be written as an expectation function over a closed convex set. We also consider multiple expectation constraints which restrict the domain of the problem. We extend the cooperative stochastic approximation algorithm from…
Study contextual bandits with stage-wise constraints, proving regret bounds and extending results.
Group fairness is an important concern for machine learning researchers, developers, and regulators. However, the strictness to which models must be constrained to be considered fair is still under debate. The focus of this work is on constraining the expected outcome of subpopulations in kernel regression and, in part…
Study optimal consumption and portfolio strategies with no-borrowing constraint in financial markets.
New method optimizes costly functions with unknown costs and budget constraints.
Dynamic risk constraints help limit risky behavior in financial portfolios.
Optimizes multi-period portfolios with tail-risk constraints using neural networks.
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…
New method optimizes processes under constraints using bivariate Gaussian models.
Paper tackles online DR-submodular maximization with stochastic constraints.
We consider the problem of option hedging in a market with proportional transaction costs. Since super-replication is very costly in such markets, we replace perfect hedging with an expected loss constraint. Asymptotic analysis for small transactions is used to obtain a tractable model. A general expansion theory is de…
Investment strategy for DC pension plan with inflation risk and tail VaR constraint.
Paper studies optimal investing for retirees with risk constraints.
We study a novel multi-armed bandit problem that models the challenge faced by a company wishing to explore new strategies to maximize revenue whilst simultaneously maintaining their revenue above a fixed baseline, uniformly over time. While previous work addressed the problem under the weaker requirement of maintainin…
In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach is based on a general representation result for monotone convex functionals, a fu…
CEI achieves convergence rates for constrained Bayesian optimization.
We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does not exceed an upper bound. The outcome distributions are not known. We construc…
Optimal payoff choice constrained by Bregman-Wasserstein divergence.
Paper studies portfolio investment under volatility uncertainty and short-sale constraints, improving risk-adjusted returns.
In the world of modern financial theory, portfolio construction has traditionally operated under at least one of two central assumptions: the constraints are derived from a utility function and/or the multivariate probability distribution of the underlying asset returns is fully known. In practice, both the performance…
MRCs minimize worst-case expected 0-1 loss and provide performance guarantees.
CRPO solves challenging SRL problems with convergence guarantee.
We study a model of a corporation which has the possibility to choose various production/business policies with different expected profits and risks. In the model there are restrictions on the dividend distribution rates as well as restrictions on the risk the company can undertake. The objective is to maximize the exp…
Generative modelling is often cast as minimizing a similarity measure between a data distribution and a model distribution. Recently, a popular choice for the similarity measure has been the Wasserstein metric, which can be expressed in the Kantorovich duality formulation as the optimum difference of the expected value…
In recent years, the evaluation of the minimal investment risk of the quenched disordered system of a portfolio optimization problem and the investment concentration of the optimal portfolio has been actively investigated using the analysis methods of statistical mechanical informatics. However, the work to date has no…
Semi-supervised learning is an important and active topic of research in pattern recognition. For classification using linear discriminant analysis specifically, several semi-supervised variants have been proposed. Using any one of these methods is not guaranteed to outperform the supervised classifier which does not t…
Meta-gradient D4PG optimizes performance and constraint adherence in RL.
Optimal bidding strategy for multi-platform ad auctions under budget constraints.
HardCoRe-NAS finds fitting neural networks adhering to hard resource constraints.
Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…
The problem of multi-hypothesis testing with controlled sensing of observations is considered. The distribution of observations collected under each control is assumed to follow a single-parameter exponential family distribution. The goal is to design a policy to find the true hypothesis with minimum expected delay whi…
Bayesian optimization reduces CVaR portfolio risk.
Optimal withdrawal strategy for DC pension plans maximizes total withdrawals while managing risk.
We study the portfolio selection problem of a long-run investor who is maximising the asymptotic growth rate of her expected utility. We show that, somewhat surprisingly, it is essentially not affected by introduction of a floor constraint which requires the wealth process to dominate a given benchmark at all times. We…
Adaptive allocation with constraints using Thompson sampling.
This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich's OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d. generated at each round and are disclosed to the decision maker only after the decision is made. Th…