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.
A new method uses preference relations to reconcile contradictory trading signals from multiple securities.
Given a linearly ordered set I, every surjective map p: A --> I endows the set A with a structure of set of preferences by "replacing" the elements of I with their inverse images via p considered as "balloons" (sets endowed with an equivalence relation), lifting the linear order on A, and "agglutinating" this structure…
Preference learning (PL) is a core area of machine learning that handles datasets with ordinal relations. As the number of generated data of ordinal nature is increasing, the importance and role of the PL field becomes central within machine learning research and practice. This paper introduces an open source, scalable…
Enhances preference learning by incorporating response times into binary choices.
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous work on Bayesian inverse reinforcement learning and allows us to obtain a posterior distribution on the agent's preferences, policy and optio…
Paper uses inverse optimization to measure risk preference from investment portfolios.
The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. A social trust and preference segmentation-based matrix factorization (SPMF)…
Paper analyzes finite-time guarantees for preference-based RL.
Diversification represents the idea of choosing variety over uniformity. Within the theory of choice, desirability of diversification is axiomatized as preference for a convex combination of choices that are equivalently ranked. This corresponds to the notion of risk aversion when one assumes the von-Neumann-Morgenster…
A-GPS learns to generate Pareto sets efficiently with user preferences.
Researchers develop multi-utility representations for incomplete preferences linked to risk measures.
Investigates how diversification preferences relate to risk attitudes.
The success of recommender systems in modern online platforms is inseparable from the accurate capture of users' personal tastes. In everyday life, large amounts of user feedback data are created along with user-item online interactions in a variety of ways, such as browsing, purchasing, and sharing. These multiple typ…
The study infers risk preferences from portfolio choices and measures portfolio efficiency.
Model predicts majority of countries will prefer BRI over USD by 2020.
Many real-world applications are characterized by a number of conflicting performance measures. As optimizing in a multi-objective setting leads to a set of non-dominated solutions, a preference function is required for selecting the solution with the appropriate trade-off between the objectives. The question is: how g…
Paper proposes an active preference learning method using radial basis functions.
A new framework enables real-time task trade-off control.
We provide an axiomatic foundation for the representation of numéraire-invariant preferences of economic agents acting in a financial market. In a static environment, the simple axioms turn out to be equivalent to the following choice rule: the agent prefers one outcome over another if and only if the expected (under t…
PGRec improves recommendation by modeling user-item preferences as a graph and embedding it for better predictions.
Thermal preferences vary from person to person and may change over time. The main objective of this paper is to sequentially pose intelligent queries to occupants in order to optimally learn the indoor air temperature values which maximize their satisfaction. Our central hypothesis is that an occupant's preference rela…
For incomplete preference relations that are represented by multiple priors and/or multiple -- possibly multivariate -- utility functions, we define a certainty equivalent as well as the utility buy and sell prices and indifference price bounds as set-valued functions of the claim. Furthermore, we motivate and introduc…
While recommendation systems generally observe user behavior passively, there has been an increased interest in directly querying users to learn their specific preferences. In such settings, considering queries at different levels of granularity to optimize user information acquisition is crucial to efficiently providi…
Study optimal healthcare spending under Epstein-Zin preferences for longevity.
Object ranking or "learning to rank" is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects represented as feature vectors, the goal is to learn a ranking function that predicts a linear order of any new set of objects. In this paper, we pr…
The goal of task transfer in reinforcement learning is migrating the action policy of an agent to the target task from the source task. Given their successes on robotic action planning, current methods mostly rely on two requirements: exactly-relevant expert demonstrations or the explicitly-coded cost function on targe…
A new model selects low-carbon mutual funds considering ESG criteria, risk, and investor preferences.
A Yang-Mills theory in a purely symplectic framework is developed. The corresponding Euler-Lagrange equations are derived and first integrals are given. We relate the results to the work of Bourgeois and Cahen on preferred symplectic connections.
Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…
Building on a specific formalization of analogical relationships of the form "A relates to B as C relates to D", we establish a connection between two important subfields of artificial intelligence, namely analogical reasoning and kernel-based machine learning. More specifically, we show that so-called analogical propo…
Brazil proposes a new BRICS trade currency to dominate international trade.
A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem is seen as a two-players zero-sum game. An algorithm is proposed to incremental…
EXPO framework eliminates need for reward model, achieving better optimization.
We develop a finite horizon continuous time market model, where risk averse investors maximize utility from terminal wealth by dynamically investing in a risk-free money market account, a stock written on a default-free dividend process, and a defaultable bond, whose prices are determined via equilibrium. We analyze fi…
Paper proposes personalized climate control for driver comfort.
In machine learning, the notion of multi-armed bandits refers to a class of online learning problems, in which an agent is supposed to simultaneously explore and exploit a given set of choice alternatives in the course of a sequential decision process. In the standard setting, the agent learns from stochastic feedback …
Paper extends top-k Mallows model for better user preference analysis.
Formalizes vNM utility theorem using Lean 4, proving existence and uniqueness.
The paper defines and characterizes conditional nonlinear expectations.
In this paper we consider an interval portfolio selection problem with uncertain returns and introduce an inclusive concept of satisfaction index for interval inequality relation. Based on the satisfaction index, we propose an approach to reduce the interval programming problem with uncertain objective and constraints …
Study Epstein-Zin preferences in mean field portfolio games, proving unique equilibria.
In this paper we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Association Rules (CAR) for the Label Ranking task. In CAR, the consequent is a single class, to which th…
FinDPO uses preference optimization to improve financial sentiment analysis models.
In this paper, we propose a novel ranking framework for collaborative filtering with the overall aim of learning user preferences over items by minimizing a pairwise ranking loss. We show the minimization problem involves dependent random variables and provide a theoretical analysis by proving the consistency of the em…
In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between possible items; from these we need to predict preferences of the users for items they have not yet seen. We do so by fitting a rank score matrix to the pairwise data, and pro…
Optimizes molecular generation for chemist preferences.
Increased data gathering capacity, together with the spread of data analytics techniques, has prompted an unprecedented concentration of information related to the individuals' preferences in the hands of a few gatekeepers. In the present paper, we show how platforms' performances still appear astonishing in relation t…
New method adapts to user preferences dynamically, improving recommendation models.