Optimal resource allocation in censored semi-bandits with unknown thresholds.
problem Sequential resource allocation with unknown thresholds and hidden parameters.
method Established equivalence to MP-MAB and Combinatorial Semi-Bandits, derived optimal algorithms.
result Validated performance of proposed algorithms on synthetic data.
New loss function reduces outage probability in ML-assisted resource allocation.
problem Minimizing outage probability in ML-assisted resource allocation systems.
method Developed a novel loss function and trained an ML model to address the outage probability challenge.
result Exact and asymptotic expressions for the system's outage probability were established.
New method for risk allocation under multimodality of loss distribution.
problem Risk assessment under multimodal conditional loss distribution.
method Maximum Likelihood Allocation (MLA) and multimodality adjustment.
result Multimodality adjustment improves soundness of risk allocations.
Study on resource allocation with unknown thresholds in semi-bandit problems.
problem Learning optimal allocation of resources to arms with unknown threshold values.
method Established equivalence to MP-MAB and Combinatorial Semi-Bandits, derived optimal algorithms.
result Developed algorithms validated by experiments on synthetic data.
New method allocates capital based on tail central moments for financial risk assessment.
problem Inability of CTE-based capital allocation to reflect tail behavior of losses.
method Developed TCM-based capital allocation for normal mean-variance mixture distributions.
result TCM-based method captures tail risk contributions not detected by CTE.
Investors face constraints in Heston's model; optimal allocation differs from naive capped strategy.
problem Optimizing portfolio allocation with convex constraints in Heston's stochastic volatility model.
method Applied duality methods to derive a closed-form solution.
result The optimal constrained portfolio allocation differs from the naive capped portfolio, leading to different wealth outcomes.
In this paper, we address the aggregation of dependent stop loss reinsurance risks where the dependence among the ceding insurer(s) risks is governed by the Sarmanov distribution and each individual risk belongs to the class of Erlang mixtures. We investigate the effects of the ceding insurer(s) risk dependencies on th…
New MCMC method estimates systemic risk allocations efficiently.
problem Efficiently estimating systemic risk allocations under rare events.
method Markov chain Monte Carlo (MCMC) methods for estimating conditional marginal loss distributions.
result MCMC estimator provides efficient estimates of risk allocations.
Two models predict net loan losses using Bayesian and frequentist regression.
problem Predicting net loan losses using financial and sociological data.
method Bayesian and frequentist regression analysis.
result Improved understanding of net loan loss relationships.
This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…
The paper optimizes DIA purchase policies using lifecycle models and asset allocation.
problem Determining the optimal allocation to Deferred Income Annuities (DIAs).
method Employed a lifecycle model with utility of consumption and bequest, formalized optimization process, analyzed results, and extended model to include asset allocation.
result Optimal DIA allocation varies based on refundability, asset allocation, and perceived longevity.
Comonotonic allocations are restored under certain constraints, improving risk-sharing.
problem Feasibility constraints can distort optimal risk-sharing allocations.
method Identified componentwise convex-order solidity as a sufficient condition to restore comonotonic allocations.
result Componentwise convex-order solidity ensures comonotonic improvements under feasible constraints.
Despite the fact that the Euler allocation principle has been adopted by many financial institutions for their internal capital allocation process, a comprehensive description of Euler allocation seems still to be missing. We try to fill this gap by presenting the theoretical background as well as practical aspects. In…
LCA measures neural network training changes, revealing parameter contributions.
problem Limited understanding of neural network training process.
method LCA decomposes training trajectory using Runge-Kutta integrator.
result 50% of parameters help during training, some layers hurt overall.
We introduce a statistical model for operational losses based on heavy-tailed distributions and bipartite graphs, which captures the event type and business line structure of operational risk data. The model explicitly takes into account the Pareto tails of losses and the heterogeneous dependence structures between the…
Paper addresses FL over wireless networks, optimizing learning and resource allocation.
problem Training FL algorithms over wireless networks with limited resources and errors.
method Formulated as an optimization problem to minimize FL loss function, derived expected convergence rate, derived optimal transmit power, optimized user selection and RB allocation.
result Joint framework reduces FL loss by up to 10% and 16% compared to alternatives.
This article deals with the problem of optimal allocation of capital to corporate bonds in fixed income portfolios when there is the possibility of correlated defaults. Using a multivariate normal Copula function for the joint default probabilities we show that retaining the first few moments of the portfolio default l…
The ongoing concern about systemic risk since the outburst of the global financial crisis has highlighted the need for risk measures at the level of sets of interconnected financial components, such as portfolios, institutions or members of clearing houses. The two main issues in systemic risk measurement are the compu…
Improves GBDT accuracy with differential privacy.
problem Balancing privacy and accuracy in GBDT models.
method Adaptive gradient control and novel boosting framework for privacy budget allocation.
result Achieves better model accuracy with differential privacy.
DeepFolio uses neural networks to predict stock price movements from LOB data.
problem Predicting price movements from LOB data.
method Convolutional Neural Networks (CNNs) for portfolio management.
result DeepFolio outperforms state-of-the-art models in various scenarios.
This article deals with the problem of optimal allocation of capital to corporate bonds in fixed income portfolios when there is the possibility of correlated defaults. Under fairly general assumptions for the distribution of the total net assets of a set of firms we show that retaining the first few moments of the por…
Scaling laws for neural language models reveal optimal model size and compute allocation.
problem Understanding the optimal model size and compute allocation for neural language models.
method Empirical analysis of scaling laws for cross-entropy loss across model size, dataset size, and compute.
result Simple equations govern the dependence of overfitting and training speed on model/dataset size and model size, respectively.
Regulator allocates buffers to prevent financial contagion in networks with common assets.
problem Containment of default contagion in financial networks with common asset exposures.
method Allocates nonnegative buffer vectors under linear budget constraints to maximize default or insolvency resilience margins or minimize worst-case systemic losses.
result Exact synthesis results for buffer allocation under ℓ∞ and ℓ1 uncertainty sets, showing significant gains over uniform and exposure-proportional allocations. This paper explores portfolio management strategies to maximize alpha and minimize beta.
problem Maximizing returns while minimizing risk in investment portfolios.
method Examines asset allocation, diversification, active management, and risk management strategies.
result Combining these strategies optimizes portfolio performance.
Designing neural network architectures is a task that lies somewhere between science and art. For a given task, some architectures are eventually preferred over others, based on a mix of intuition, experience, experimentation and luck. For many tasks, the final word is attributed to the loss function, while for some ot…
A new portfolio model considers investor aversion to loss and risk.
problem Constructing a robust portfolio under uncertain asset returns and investor aversion.
method Distributional robust optimization (DRP) with a Wasserstein ball centered on empirical distribution, mixed-integer quadratic programming, and hybrid algorithm.
result Empirical testing shows superior performance in asset allocation compared to common strategies.
The paper optimizes stock portfolios with constraints based on performance attribution.
problem Optimizing stock portfolios with performance attribution constraints.
method Minimizes expected tail loss, constrains asset allocation and selection effect, tests on Dow Jones stocks.
result Imposing constraints on asset allocation and selection effect improves portfolio performance.
Optimizes asset allocation for risk measures in a Lévy market.
problem Maximizing time-consistent mean-risk reward with general risk measures.
method Uses a generalized Lévy market model and Hamilton-Jacobi-Bellman equation.
result Deterministic optimal solution under certain conditions.
Model calculates capital requirements for multi-line insurance companies.
problem Measuring and capitalizing on incurred claims risk for multi-line property and casualty insurers.
method Stochastic model integrating accident semester, development lag effects, autocorrelation, and hierarchical copula.
result Model accurately reproduces empirical loss ratio dynamics and quantifies overall portfolio risk.
Investors optimize liquid staking decisions in LSP and AMM protocols.
problem Optimal timing and allocation in liquid staking protocols.
method Derive optimal allocation strategy and model optimal exit timing using Laplace transforms and free-boundary techniques.
result Optimal stop-loss strategy maximizes expected payoff, influenced by fees and opportunity gains.
Existing approaches to online convex optimization (OCO) make sequential one-slot-ahead decisions, which lead to (possibly adversarial) losses that drive subsequent decision iterates. Their performance is evaluated by the so-called regret that measures the difference of losses between the online solution and the best ye…
The paper introduces a new class of multivariate mixtures for actuarial applications.
problem Developing a new class of multivariate mixtures for actuarial calculations.
method Proposed a class of multivariate matrix-exponential affine mixtures with matrix-exponential marginals.
result Explicit calculations of actuarial quantities are possible due to the proposed class's properties.
Unified framework for portfolio optimization using multiple hypotheses.
problem Risk diversification in portfolio allocation.
method Structured ensemble learning approach with diversity control.
result Structured ensembles link predictor diversity to risk diversification.
New framework identifies worst-case shifts for predictive resource allocation models.
problem Identifying harmful shifts in predictive models for resource allocation.
method Hierarchical model structure and submodular optimization for worst-case loss.
result Empirical evidence shows divergent worst-case shifts identified by different metrics.
We present a simulation-and-regression method for solving dynamic portfolio allocation problems in the presence of general transaction costs, liquidity costs and market impacts. This method extends the classical least squares Monte Carlo algorithm to incorporate switching costs, corresponding to transaction costs and t…
We develop a dual-control method for approximating investment strategies in incomplete environments that emerge from the presence of trading constraints. Convex duality enables the approximate technology to generate lower and upper bounds on the optimal value function. The mechanism rests on closed-form expressions per…
Agents prefer non-diversification in markets with extreme losses.
problem Optimal risk allocation and equilibria in markets with extremely heavy-tailed losses.
method Analysis of super-Pareto loss distributions and stochastic dominance.
result Non-diversification is preferred in markets with super-Pareto losses.
Paper provides new bounds for risk aggregation and sharing.
problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.
The paper analyzes fairness of compensation-based risk-sharing schemes for fund payouts.
problem Fair allocation of payouts in an endowment contingency fund.
method Analyzes two types of administrators and general non-negative loss distributions.
result General conditions for actuarial fairness are provided.
Federated Learning over wireless networks tackles resource allocation challenges.
problem Heterogeneity in UE data and resources in Federated Learning.
method Proposed FL algorithm for heterogeneous data, convergence rate analysis, and resource allocation optimization.
result The proposed algorithm outperforms vanilla FedAvg in convergence rate and accuracy.
SARD improves adversarial robustness in two-stage L2D systems.
problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.
Proposes a deep learning approach for optimizing portfolios with stocks and options.
problem Optimizing portfolios with time-inconsistent objectives and trading constraints.
method Neural networks with adaptive activation functions for asset allocation and option strike prices.
result Adding options leads to more stable and consistent stock allocations.
Determining contributions by sub-portfolios or single exposures to portfolio-wide economic capital for credit risk is an important risk measurement task. Often economic capital is measured as Value-at-Risk (VaR) of the portfolio loss distribution. For many of the credit portfolio risk models used in practice, the VaR c…
Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective ins…
In this paper, we develop an expected utility model for the retirement behavior in the decumulation phase of Australian retirees with sequential family status subject to consumption, housing, investment, bequest and government provided means-tested Age Pension. We account for mortality risk and risky investment assets,…
Network agents solve adaptive regression problems with compressed signals.
problem Solving regression problems in networks with communication constraints.
method ACTC diffusion strategy with randomized differential compression.
result Optimized resource allocation improves performance.
Chinchilla Approach 2 biases neural scaling law estimates, leading to unnecessary compute costs.
problem Systematic biases in Chinchilla Approach 2's parabolic fits of neural scaling laws.
method Analyzes three sources of error: IsoFLOP sampling grid width, uncentered sampling, and loss surface asymmetry.
result Chinchilla Approach 3 largely eliminates these biases, offering a more convenient or scalable alternative.
The paper studies how to allocate human validation in AI-assisted tasks to minimize errors.
problem Heterogeneous reliability of AI-generated signals across tasks, products, and customer segments.
method Tuned prediction-powered inference, upper confidence bounds policy, Neyman square-root rule.
result The proposed policy outperforms uniform and epsilon-greedy allocation, closing most of the gap to the oracle when reliability is heterogeneous.