The paper sorts big data by revealed preferences, improving consumer and policy decisions.
problem Sorting diverse consumer preferences for big data objects like colleges.
method Endogenous weighting of revealed preferences, considering spillover effects.
result Consistent steady-state solution to counterbalance equilibrium.
Activists align with large fund preferences for success.
problem Aligning with large fund preferences increases activist success.
method Analyzed previous proxy voting behavior to estimate preferences and correlated them with activist success.
result Campaigns with higher alignment receive more votes and are more successful.
Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not always practical and demands strong assumptions on human rationality and data-acquisition abilities. Th…
Study metric learning from limited preference comparisons, showing how low-dimensional structure can still reveal metric information.
problem Learning metric from limited pairwise preference comparisons.
method Ideal point model, divide-and-conquer approach for low-dimensional structure.
result Metric can be jointly identified even with limited comparisons when items exhibit low-dimensional structure.
Paper improves parameter estimation of continuous distributions using preference feedback.
problem Improving parameter estimation of continuous distributions.
method Preference-based M-estimators and deterministic preferences.
result Preference-based estimators achieve an estimation error scaling of O(1/n), significantly faster than sample-only methods.
Improved DPO framework penalizes preference uncertainty to avoid overoptimization.
problem Aligning LLMs to human preferences is challenging due to varied, context-dependent, and ambiguous preferences.
method Developed a pessimistic framework for DPO by introducing preference uncertainty penalization schemes.
result Improved overall performance and better completions on high-uncertainty responses compared to vanilla DPO.
In applications such as recommendation systems and revenue management, it is important to predict preferences on items that have not been seen by a user or predict outcomes of comparisons among those that have never been compared. A popular discrete choice model of multinomial logit model captures the structure of the …
The paper solves portfolio selection for complex preferences in continuous time.
problem Dynamic portfolio selection for nonlinear preferences with time inconsistency.
method Stochastic maximum principle and verification theorems for equilibrium strategies.
result Equilibrium strategies derived in closed form for CRRA and CARA preferences.
Study finds equivalence between MMV and MV preferences with conic constraints.
problem Monotone mean-variance portfolio selection under conic constraints.
method Closed-form solutions for optimal strategies under MMV and MV preferences.
result Optimal strategies coincide with and without the conic constraint.
The definition of preferences assigned to individuals is a concept that concerns many disciplines, from economics, with the search of an acceptable outcome for an ensemble of individuals, to decision making an analysis of vote systems. We are concerned in the phenomena of good selection and economic fairness. In Arrow'…
Bayesian framework learns latent preference archetypes for many-objective optimization.
problem Expanding space of trade-offs and context-dependent human values.
method Dirichlet-process mixture model for latent preference archetypes, hybrid queries for efficient information.
result Mixture-aware Bayesian optimization outperforms standard methods on synthetic and real-world benchmarks.
The paper explores how investors make decisions under disappointment aversion, finding that they prefer not to invest.
problem Continuous-time portfolio selection under generalized disappointment aversion.
method Sufficient and necessary condition for equilibrium strategies via fully nonlinear integral equation.
result Equilibrium strategy under disappointment aversion leads to less investment in the stock market compared to classical utility theory.
In recent years rank aggregation has received significant attention from the machine learning community. The goal of such a problem is to combine the (partially revealed) preferences over objects of a large population into a single, relatively consistent ordering of those objects. However, in many cases, we might not w…
We consider the problem of learning the preferences of a heterogeneous population by observing choices from an assortment of products, ads, or other offerings. Our observation model takes a form common in assortment planning applications: each arriving customer is offered an assortment consisting of a subset of all pos…
A framework for anonymized risk sharing without revealing identities or preferences.
problem Risk sharing without revealing individual identities or preferences.
method Axiomatic framework with four key axioms: actuarial fairness, risk fairness, risk anonymity, and operational anonymity.
result The conditional mean risk sharing rule is uniquely characterized by these axioms.
Generative model reveals hidden interaction preferences in networks.
problem Separate analysis of community and hierarchy overlooks real-world network complexities.
method Generative model based on node preferences and hierarchical structures exploiting network sparsity.
result Model accurately identifies overall node preferences and discerns subsets with different behaviors.
We present a new modeling technique for solving the problem of ecological inference, in which individual-level associations are inferred from labeled data available only at the aggregate level. We model aggregate count data as arising from the Poisson binomial, the distribution of the sum of independent but not identic…
Best-of-N sampling reveals reward targets from preference data, influencing N and base distribution choices.
problem Understanding reward extraction from Best-of-N preference data and optimal N and base distribution choices.
method Specialized analysis of preference data via induced conditional distribution, deriving reward targets and design principles.
result Reward targets are explicit functions of N and base distribution, and bounded-class minimizers approach these targets as N grows.
In this paper, we investigate the impact of diverse user preference on learning under the stochastic multi-armed bandit (MAB) framework. We aim to show that when the user preferences are sufficiently diverse and each arm can be optimal for certain users, the O(log T) regret incurred by exploring the sub-optimal arms un…
Meta-Router optimizes LLM selection using gold-standard and preference-based data.
problem Training a high-quality LLM router with combined data sources is challenging due to bias and scarcity.
method Developed an integrative causal router training framework to correct bias and improve routing accuracy.
result Our approach delivers more accurate routing and improves the trade-off between cost and quality.
Study shows how diverse investors' learning and preferences shape financial markets.
problem Understanding how diverse investor behaviors and preferences affect market dynamics.
method Developed a multi-agent reinforcement learning framework with heterogeneous preferences and learning mechanisms.
result Diverse investors develop differentiated strategies through interaction, leading to realistic market dynamics.
Unified framework for aligning LLMs from human feedback.
problem Lack of strong theoretical justification for RLHF and inability to compare methods.
method Reframed alignment as distribution learning from pairwise preferences, proposing three principled objectives.
result Proposed objectives achieve strong non-asymptotic convergence to target LM.
The paper solves IRL for Bayesian stopping time problems.
problem Identifying optimal actions in Bayesian stopping time problems.
method Novel IRL framework using Bayesian revealed preferences.
result Identifies optimality and constructs cost function estimates.
This paper explores the preference-based top-K rank aggregation problem. Suppose that a collection of items is repeatedly compared in pairs, and one wishes to recover a consistent ordering that emphasizes the top-K ranked items, based on partially revealed preferences. We focus on the Bradley-Terry-Luce (BTL) model…
Study replicates reference-dependent preferences impact on risk-return trade-off in Chinese stock market.
problem Impact of reference-dependent preferences on risk-return trade-off in Chinese stock market.
method Utilized CGO proxy, econometric techniques (Dependent Double Sorting, Fama-MacBeth regressions), and data from 1995-2024.
result Reference-dependent preferences have a weaker or absent positive risk-return relationship in the Chinese market.
In this paper, we implement an information-theoretic approach to travel behaviour analysis by introducing a generative modelling framework to identify informative latent characteristics in travel decision making. It involves developing a joint tri-partite Bayesian graphical network model using a Restricted Boltzmann Ma…
Study optimizes insurance and investment strategies for risk-averse insurers under ambiguity.
problem Optimizing insurance and investment strategies for risk-averse insurers under ambiguity.
method Solves a coupled FBSDE to derive optimal strategies and value function.
result Optimal consumption, investment, and reinsurance strategies influenced by risk aversion and EIS.
The perception of facial beauty is a complex phenomenon depending on many, detailed and global facial features influencing each other. In the machine learning community this problem is typically tackled as a problem of supervised inference. However, it has been conjectured that this approach does not capture the comple…
Optimizes choice sets to influence group decisions.
problem Maximizing agreement or disagreement in group decisions.
method Discrete choice modeling to develop optimization framework.
result Promoting a choice can be easier than encouraging consensus or discord.
New method learns decisions from collective preferences without individual covariates.
problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.
Paper tackles dueling bandits with delayed feedback, revealing preference bias.
problem Real-world dueling bandit applications often face delays in feedback.
method Introduces biased dueling bandit problem with stochastic delayed feedback, presents two algorithms.
result Two algorithms achieve optimal regret bounds for dueling bandit problems with delay.
A new method for RLHF using proximal point Nash learning.
problem Capturing real human preferences in RLHF.
method Proximal point Nash learning, embedding self-play updates into a proximal point framework.
result High-probability last-iterate convergence for the combined method.
End-to-end model predicts multiagent trajectories using game theory and neural nets.
problem Predicting trajectories of interacting agents in complex scenarios.
method Hybrid neural net with game-theoretic reasoning, using implicit layers to map preferences to Nash equilibria.
result Trains an interpretable model that predicts future trajectories and transfers to decision making.
Proposes a method for ranking items across multiple aspects based on user feedback.
problem No principled solution exists for generating multiple item rankings over different aspects.
method Developed a directional multi-aspect ranking criterion using probabilistic multivariate tensor factorization.
result Demonstrated effectiveness of the proposed method through comprehensive experiments on real datasets.
We propose a new approach for constructing synthetic pseudo-panel data from cross-sectional data. The pseudo panel and the preferences it intends to describe is constructed at the individual level and is not affected by aggregation bias across cohorts. This is accomplished by creating a high-dimensional probabilistic m…
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…
While state-of-the-art NLP explainability (XAI) methods focus on explaining per-sample decisions in supervised end or probing tasks, this is insufficient to explain and quantify model knowledge transfer during (un-)supervised training. Thus, for TX-Ray, we modify the established computer vision explainability principle…
We introduce the probably approximately correct (PAC) \emph{Battling-Bandit} problem with the Plackett-Luce (PL) subset choice model--an online learning framework where at each trial the learner chooses a subset of k arms from a fixed set of n arms, and subsequently observes a stochastic feedback indicating prefere…
Self-play fine-tuning improves diffusion models for text-to-image generation.
problem Plateauing performance of diffusion models after data saturation.
method Self-play fine-tuning (SPIN-Diffusion) using competition among model versions.
result Significantly improved model performance and human preference alignment.
Study reveals DNNs prefer easy-to-learn cues over essential ones in image recognition.
problem DNNs learn easy-to-learn features that aren't essential to the task.
method WCST-ML training setup with shortcut cues on synthetic and face datasets.
result DNNs converge to solutions focusing on preferred cues, leading to flat minima.
Optimal persuasion involves projecting state vectors onto lower-dimensional 'optimal information manifolds'.
problem Optimal persuasion of another agent observing multi-dimensional data.
method Performing non-linear dimension reduction by projecting state vectors onto the 'optimal information manifold'.
result Optimal information design splits information into 'good' and 'bad' components, revealing only the direction of good information.
Gradient descent on normalized networks reveals sparsity preferences.
problem Understanding the inductive bias of gradient descent on normalized neural nets.
method Analysis of gradient descent on weight-normalized smooth homogeneous neural nets, focusing on SWN and EWN.
result EWN causes weights to be updated in a way that prefers asymptotic relative sparsity.
The paper analyzes how ESG investors can prioritize green stocks without sacrificing overall wealth.
problem Balancing sustainability goals with financial returns.
method Multivariate utility analysis with a one-factor CAPM structure.
result Investors can allocate more to high-rated ESG stocks without reducing overall wealth.
We investigate the general structure of optimal investment and consumption with small proportional transaction costs. For a safe asset and a risky asset with general continuous dynamics, traded with random and time-varying but small transaction costs, we derive simple formal asymptotics for the optimal policy and welfa…
Paper introduces Functional Effects Models to account for individual heterogeneity in panel data.
problem Accounting for preference heterogeneity in panel data with machine learning.
method Functional Effects Models using gradient boosting decision trees and deep neural networks to learn individual-specific preference parameters.
result Functional Effects Models outperform traditional models in learning inter-individual heterogeneity and predictive performance.
Study uses FDA to analyze discount functions of different temperaments.
problem Traditional finance models fail to capture individual differences in investment choices.
method Functional Data Analysis (FDA) to investigate temporal discounting behaviors.
result Heterogeneity within each temperament revealed, suggesting diverse investor profiles.
New method predicts political ideology from online activity.
problem Predicting political ideology from digital footprints.
method Statistical learning approaches applied to reddit data.
result Activity in non-political forums can predict political ideology with high accuracy.
Meta-analysis finds people value insurance for low-probability risks more than expected.
problem Low-probability risks insurance demand is lower than expected.
method Conducted a meta-analysis of contingent valuation studies.
result Average stated willingness to pay (WTP) for insurance is 87% of expected losses.