A Learnheuristic Approach to A Constrained Multi-Objective Portfolio Optimisation Problem

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

1. Apparenté Pas pertinent

   OptiGrad: A Fair and more Efficient Price Elasticity Optimization via a Gradient Based Learning

   Vincent Grari, Marcin Detyniecki · 2024 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   This paper presents a novel approach to optimizing profit margins in non-life insurance markets through a gradient descent-based method, targeting three key objectives: 1) maximizing profit margins, 2) ensuring conversion rates, and 3) enforcing fairness criteria such as demographic parity (DP). Traditional pricing optimization, which heavily lean on linear and semi definite programming, encounter challenges in balancing profitability and fairness. These challenges become especially pronounced in situations that necessitate continuous rate adjustments and the incorporation of fairness criteria. Specifically, indirect Ratebook optimization, a widely-used method for new business price setting,…

2. Apparenté Pas pertinent

   KTO: Model Alignment as Prospect Theoretic Optimization

   Kawin Ethayarajh, Winnie Xu, Niklas Muennighoff et al. · 2024 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   Kahneman & Tversky's $\textit{prospect theory}$ tells us that humans perceive random variables in a biased but well-defined manner (1992); for example, humans are famously loss-averse. We show that objectives for aligning LLMs with human feedback implicitly incorporate many of these biases -- the success of these objectives (e.g., DPO) over cross-entropy minimization can partly be ascribed to them belonging to a family of loss functions that we call $\textit{human-aware losses}$ (HALOs). However, the utility functions these methods attribute to humans still differ from those in the prospect theory literature. Using a Kahneman-Tversky model of human utility, we propose a HALO that directly ma…

3. Apparenté Pas pertinent

   Optimizing Optimizers: Regret-optimal gradient descent algorithms

   Philippe Casgrain, Anastasis Kratsios · 2020 · Apprentissage automatique · Pas encore résumé

   Résumé scientifique

   The need for fast and robust optimization algorithms are of critical importance in all areas of machine learning. This paper treats the task of designing optimization algorithms as an optimal control problem. Using regret as a metric for an algorithm's performance, we study the existence, uniqueness and consistency of regret-optimal algorithms. By providing first-order optimality conditions for the control problem, we show that regret-optimal algorithms must satisfy a specific structure in their dynamics which we show is equivalent to performing dual-preconditioned gradient descent on the value function generated by its regret. Using these optimal dynamics, we provide bounds on their rates o…

4. Apparenté Pas pertinent

   Practical Deep Reinforcement Learning Approach for Stock Trading

   Xiao-Yang Liu, Zhuoran Xiong, Shan Zhong et al. · 2018 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   Stock trading strategy plays a crucial role in investment companies. However, it is challenging to obtain optimal strategy in the complex and dynamic stock market. We explore the potential of deep reinforcement learning to optimize stock trading strategy and thus maximize investment return. 30 stocks are selected as our trading stocks and their daily prices are used as the training and trading market environment. We train a deep reinforcement learning agent and obtain an adaptive trading strategy. The agent's performance is evaluated and compared with Dow Jones Industrial Average and the traditional min-variance portfolio allocation strategy. The proposed deep reinforcement learning approach…

5. Apparenté Pas pertinent

   Gradient Surgery for Multi-Task Learning

   Tianhe Yu, Saurabh Kumar, Abhishek Gupta et al. · 2020 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   While deep learning and deep reinforcement learning (RL) systems have demonstrated impressive results in domains such as image classification, game playing, and robotic control, data efficiency remains a major challenge. Multi-task learning has emerged as a promising approach for sharing structure across multiple tasks to enable more efficient learning. However, the multi-task setting presents a number of optimization challenges, making it difficult to realize large efficiency gains compared to learning tasks independently. The reasons why multi-task learning is so challenging compared to single-task learning are not fully understood. In this work, we identify a set of three conditions of th…

6. Apparenté Pas pertinent

   Practical tradeoffs between memory, compute, and performance in learned optimizers

   Luke Metz, C. Daniel Freeman, James Harrison et al. · 2022 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   Optimization plays a costly and crucial role in developing machine learning systems. In learned optimizers, the few hyperparameters of commonly used hand-designed optimizers, e.g. Adam or SGD, are replaced with flexible parametric functions. The parameters of these functions are then optimized so that the resulting learned optimizer minimizes a target loss on a chosen class of models. Learned optimizers can both reduce the number of required training steps and improve the final test loss. However, they can be expensive to train, and once trained can be expensive to use due to computational and memory overhead for the optimizer itself. In this work, we identify and quantify the design feature…

7. Apparenté Pas pertinent

   Bilevel Optimization for Machine Learning: Algorithm Design and Convergence Analysis

   Kaiyi Ji · 2021 · Apprentissage automatique · Résumé IA disponible

   Résumé scientifique

   Bilevel optimization has become a powerful framework in various machine learning applications including meta-learning, hyperparameter optimization, and network architecture search. There are generally two classes of bilevel optimization formulations for machine learning: 1) problem-based bilevel optimization, whose inner-level problem is formulated as finding a minimizer of a given loss function; and 2) algorithm-based bilevel optimization, whose inner-level solution is an output of a fixed algorithm. For the first class, two popular types of gradient-based algorithms have been proposed for hypergradient estimation via approximate implicit differentiation (AID) and iterative differentiation …

8. Apparenté Pas pertinent

   Models of human preference for learning reward functions

   W. Bradley Knox, Stephane Hatgis-Kessell, Serena Booth et al. · 2022 · Apprentissage automatique · Pas encore résumé

   Résumé scientifique

   The utility of reinforcement learning is limited by the alignment of reward functions with the interests of human stakeholders. One promising method for alignment is to learn the reward function from human-generated preferences between pairs of trajectory segments. These human preferences are typically assumed to be informed solely by partial return, the sum of rewards along each segment. We find this assumption to be flawed and propose modeling preferences instead as arising from a different statistic: each segment's regret, a measure of a segment's deviation from optimal decision-making. Given infinitely many preferences generated according to regret, we prove that we can identify a reward…