Many real-world engineering problems rely on human preferences to guide their design and optimization. We present PrefOpt, an open source package to simplify sequential optimization tasks that incorporate human preference feedback. Our approach extends an existing latent variable model for binary preferences to allow f…
On-device research index
arXiv research
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Preference incorporation”
A new method for incorporating preferences in multi-objective Bayesian optimization.
problem Incorporating preferences in computationally expensive multi-objective optimization problems.
method Building independent surrogate models on each objective function and using Generalised value distribution to approximate the scalarizing function.
result The proposed multi-surrogate approach outperforms the mono-surrogate approach on benchmark and real-world problems.
Enhances preference learning by incorporating response times into binary choices.
problem Limited information from binary choices about preference strength.
method Combines choices and response times using the EZ diffusion model.
result Response times improve utility estimation for strong preferences.
A-GPS learns to generate Pareto sets efficiently with user preferences.
problem Online discrete multi-objective optimization with user preferences.
method Generative model with class probability estimator (CPE) for non-dominance and preference alignment.
result Amortized generative model for efficient Pareto set approximation.
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…
The paper enhances preference learning by incorporating response time data.
problem Lack of temporal information in user decision-making for reward model learning.
method Integrates response time alongside binary choice data using the EZ model and Neyman-orthogonal loss functions.
result Response time-augmented approach reduces error rates from exponential to polynomial scaling, improving sample efficiency.
LUQ-Learning adapts Q-learning for healthcare decisions considering patient preferences.
problem Optimizing treatment decisions for multivariate outcomes based on individual preferences.
method Latent Utility Q-Learning (LUQ-Learning) framework that adapts Q-learning for composite outcomes.
result LUQ-Learning achieves highly competitive performance compared to alternative methods in simulations.
New model recommends stocks considering individual preferences and diversification.
problem Inaccurate stock price predictions and ignoring investment theories.
method Portfolio Temporal Graph Network Recommender (PfoTGNRec) incorporating diversification-enhancing sampling.
result PfoTGNRec outperforms state-of-the-art models in real-world data.
Tutorials on preference learning with Gaussian Processes.
problem Understanding individual preferences and choices for efficient and personalized applications.
method Presentation of a comprehensive framework for preference learning with Gaussian Processes, incorporating rationality principles.
result Construction of preference learning models that encompass various utility models and scenarios.
New method adapts to user preferences dynamically, improving recommendation models.
problem Current recommendation models lack dynamic adaptation to changing user preferences.
method Preference Discerning with LLM-Enhanced Generative Retrieval
result Mender achieves state-of-the-art performance in adapting to evolving user preferences.
Bayesian optimization with preference learning identifies preferred solutions in multi-objective problems.
problem Optimizing multiple criteria with decision maker preferences in expensive functions.
method Bayesian optimization with interactive preference learning and active acquisition function.
result Identifies the most preferred solution with reduced interaction cost.
New algorithm speeds up user preference learning in conversational contexts.
problem Limited performance of existing conversational contextual bandit approaches.
method Proposes ConLinUCB framework and two algorithms, ConLinUCB-BS and ConLinUCB-MCR, with explorative key-term selection.
result Proves tighter regret bounds and achieves significant computational efficiency improvements.
The paper optimizes pension policies with guarantees and sustainability constraints.
problem Designing optimal pension policies with guarantees and sustainability constraints.
method Dynamic utility model, stochastic domain, overlapping generations, time-consistent decision criterion.
result Optimal investment/pension policy computed for a general framework.
DPA aligns LLMs with multi-objective rewards for diverse user preferences.
problem Fine-grained control over LLMs for diverse user needs.
method Integrates multi-objective reward modeling and directional preference control.
result DPA offers better performance trade-offs and intuitive user control over LLM generation.
Study tackles RLHF with diverse human feedback, showing limitations and proposing a meta-learning approach.
problem Traditional RLHF fails to balance diverse human preferences.
method Integrates meta-learning and multiple social welfare functions to optimize diverse preferences.
result Establishes sample complexity bounds for optimizing diverse social welfare functions.
JIMA uses multi-level preference data to recommend composite items.
problem Recommending composite items efficiently with multi-level preference information.
method Joint Interaction Modeling (JIMA) approach that integrates multi-level preference data and interactions.
result JIMA outperforms advanced baselines in offline and online settings.
Negative user preference is an important context that is not sufficiently utilized by many existing recommender systems. This context is especially useful in scenarios where the cost of negative items is high for the users. In this work, we describe a new recommender algorithm that explicitly models negative user prefe…
Neural network based models for collaborative filtering have started to gain attention recently. One branch of research is based on using deep generative models to model user preferences where variational autoencoders were shown to produce state-of-the-art results. However, there are some potentially problematic charac…
MAXMINLCB optimizes unknown target functions with preference feedback using a Stackelberg game approach.
problem Optimizing unknown target functions with pairwise comparisons and human feedback.
method MAXMINLCB, a zero-sum Stackelberg game, balances exploration and exploitation.
result MAXMINLCB consistently outperforms existing algorithms with a rate-optimal regret guarantee.
TechRankq-fin.CP
TechRank ranks companies and technologies based on investor preferences.
problem Estimating influence and ranking companies and technologies.
method Recursive algorithm based on a bi-partite graph with weighted nodes, incorporating investor preferences.
result Provides investors with a quantitative ranking of technologies for optimal portfolio design.
Improved ranking method for scarce data with feature info.
problem Ranking items with limited comparisons and feature data.
method Modified RankCentrality using diffusion methods for feature info.
result Meaningful rankings even with scarce comparisons.
Proposes a new theoretical framework for PbRL that requires less human feedback.
problem Lack of theoretical work capturing practical PbRL frameworks.
method Introduces a reward-agnostic PbRL framework that acquires exploratory trajectories before human feedback.
result Demonstrates improved sample complexity for learning optimal policies in linear and low-rank MDPs.
Unified approach to RLHF tackles uncertainty in reward function.
problem Uncertainty in reward function learned from human feedback.
method Value-incentivized preference optimization (VPO) that regularizes the reward function with value function.
result Theoretical and practical guarantees for both online and offline RLHF settings.
Paper introduces a novel framework for recognizing dynamic ranking structures in preference-based data.
problem Complex and noisy preference-based data often hide underlying homogeneous structures.
method Developed an approach to identify dynamic ranking groups using temporal penalties and spectral estimation. Introduced an objective function for detecting structural changes.
result Consistent recognition of ranking groups and structural changes in preference-based data.
Enhances robo-advisors with client investment preference inference.
problem Accurately inferring clients' investment preferences from past activities.
method Stochastic control framework with continuous-time model and discounting scheme.
result Proves sufficient conditions for client investment preference identifiability.
RCPO uses ranked choice modeling for better LLM alignment.
problem Pairwise preference optimization limits LLM alignment.
method Unified framework combining preference optimization and ranked choice modeling.
result RCPO outperforms competitive baselines in LLM alignment.
With online calendar services gaining popularity worldwide, calendar data has become one of the richest context sources for understanding human behavior. However, event scheduling is still time-consuming even with the development of online calendars. Although machine learning based event scheduling models have automate…
Policy gradient algorithms typically combine discounted future rewards with an estimated value function, to compute the direction and magnitude of parameter updates. However, for most Reinforcement Learning tasks, humans can provide additional insight to constrain the policy learning. We introduce a general method to i…
A new model selects low-carbon mutual funds considering ESG criteria, risk, and investor preferences.
problem Aligning financial investments with a low-carbon economy.
method Tri-criterion portfolio selection model using a preference-based multi-objective genetic algorithm (ev-MOGA).
result The model successfully incorporates carbon risk exposure and loss-adverse attitudes into portfolio construction.
Introduces RPU to explain randomization preference in dynamic settings.
problem Explains preference for randomization in dynamic investment problems.
method Introduces recursive perturbed utility (RPU) to incorporate randomization preference.
result Proves RPU-optimal portfolio policy is Gaussian and can be expressed in closed form.
Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraintscs.LG
This paper introduces -DPO, a generalized approach to Direct Preference Optimization using diverse divergence constraints.
problem Aligning large language models with human preferences while mitigating safety risks.
method Incorporates diverse divergence constraints to simplify the relationship between reward and optimal policy, eliminating the need for estimating the normalizing constant.
result Optimizes LLMs to align with human preferences more efficiently and under a broader set of divergence constraints.
The study aims to prevent unfair content presentation in recommender systems.
problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.
In recent years, Variational Autoencoders (VAEs) have been shown to be highly effective in both standard collaborative filtering applications and extensions such as incorporation of implicit feedback. We extend VAEs to collaborative filtering with side information, for instance when ratings are combined with explicit t…
Enhances BO with expert preferences about abstract properties.
problem Lack of expert knowledge in BO for black-box experimental design.
method Human-AI collaboration to incorporate expert preferences into surrogate modeling.
result Superior performance compared to baselines in synthetic and real-world datasets.
A Markov Chain approach for aligning generative models from pairwise human preferences.
problem Aligning generative models from pairwise human preferences.
method Markov Chain from Human Feedback (MCHF)
result MCHF converges geometrically fast to the stationary distribution.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.
Study optimal stopping for group with diverse discount rates using an attitude function.
problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.
To address the sparsity and cold start problem of collaborative filtering, researchers usually make use of side information, such as social networks or item attributes, to improve recommendation performance. This paper considers the knowledge graph as the source of side information. To address the limitations of existi…
New method learns from either positive or negative feedback alone.
problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.
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…
Algorithm minimizes regret in non-stationary dueling bandits with unknown parameters.
problem Minimizing regret in dueling bandits with time-varying preferences.
method Proposes Beat the Winner Reset algorithm and meta-algorithms DETECT and Monitored Dueling Bandits.
result Proves bounds on expected weak and strong regret for non-stationary dueling bandits.
Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.
problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.
Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problemcs.LG
Motivated by the phenomenon that companies introduce new products to keep abreast with customers' rapidly changing tastes, we consider a novel online learning setting where a profit-maximizing seller needs to learn customers' preferences through offering recommendations, which may contain existing products and new prod…
Point-of-Interest (POI) recommender systems play a vital role in people's lives by recommending unexplored POIs to users and have drawn extensive attention from both academia and industry. Despite their value, however, they still suffer from the challenges of capturing complicated user preferences and fine-grained user…
Recently, product images have gained increasing attention in clothing recommendation since the visual appearance of clothing products has a significant impact on consumers' decision. Most existing methods rely on conventional features to represent an image, such as the visual features extracted by convolutional neural …
Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Datacs.LG
Proposes new methods for Markov chain choice models with panel data.
problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.
New framework shifts bandit algorithms from expected reward to preference metrics, optimizing mixtures of arms.
problem Traditional bandit algorithms focus on expected rewards, ignoring variability and risk.
method Introduces preference metrics (PMs) and designs algorithms to optimize mixtures of arms.
result Optimal policy selects mixtures of arms based on specific weights, not a single best arm.
The paper improves ranking by integrating covariates and sparse intrinsic scores.
problem Ranking items with incomplete preference scores explained by covariates.
method Extends BTL model with covariate information and sparse intrinsic scores, using penalized MLE.
result Developed debiased estimator for penalized MLE with distributional properties.