Can AI help in ideation? A theory-based model for idea screening in crowdsourcing contests

JJ Bell, C Pescher, GJ Tellis, J Füller - Marketing Science, 2024‏ - pubsonline.informs.org
Crowdsourcing generates up to thousands of ideas per contest. The selection of best ideas
is costly because of the limited number, objectivity, and attention of experts. Using a data set …

Pal: Pluralistic alignment framework for learning from heterogeneous preferences

D Chen, Y Chen, A Rege, RK Vinayak - arxiv preprint arxiv:2406.08469, 2024‏ - arxiv.org
Large foundation models pretrained on raw web-scale data are not readily deployable
without additional step of extensive alignment to human preferences. Such alignment is …

Deep embedding learning with discriminative sampling policy

Y Duan, L Chen, J Lu, J Zhou - Proceedings of the IEEE …, 2019‏ - openaccess.thecvf.com
Deep embedding learning aims to learn a distance metric for effective similarity
measurement, which has achieved promising performance in various tasks. As the vast …

Metric learning from limited pairwise preference comparisons

Z Wang, G So, RK Vinayak - arxiv preprint arxiv:2403.19629, 2024‏ - arxiv.org
We study metric learning from preference comparisons under the ideal point model, in which
a user prefers an item over another if it is closer to their latent ideal item. These items are …

Fast generalization rates for distance metric learning: Improved theoretical analysis for smooth strongly convex distance metric learning

HJ Ye, DC Zhan, Y Jiang - Machine Learning, 2019‏ - Springer
Distance metric learning (DML) aims to find a suitable measure to compute a distance
between instances. Facilitated by side information, the learned metric can often improve the …

Strongly truthful interactive regret minimization

M **e, RCW Wong, A Lall - … of the 2019 International Conference on …, 2019‏ - dl.acm.org
When faced with a database containing millions of tuples, an end user might be only
interested in finding his/her (close to) favorite tuple in the database. Recently, a regret …

Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learning

A Xu, A McRae, J Wang… - Advances in Neural …, 2023‏ - proceedings.neurips.cc
We introduce a new type of query mechanism for collecting human feedback, called the
perceptual adjustment query (PAQ). Being both informative and cognitively lightweight, the …

[PDF][PDF] One for All: Simultaneous Metric and Preference Learning over Multiple Users.

G Canal, B Mason, RK Vinayak, R Nowak - NeurIPS, 2022‏ - proceedings.neurips.cc
This paper investigates simultaneous preference and metric learning from a crowd of
respondents. A set of items represented by d-dimensional feature vectors and paired …

Simultaneous preference and metric learning from paired comparisons

A Xu, M Davenport - Advances in Neural Information …, 2020‏ - proceedings.neurips.cc
A popular model of preference in the context of recommendation systems is the so-called
ideal point model. In this model, a user is represented as a vector u together with a collection …

[PDF][PDF] Deep metric learning: The generalization analysis and an adaptive algorithm.

M Huai, H Xue, C Miao, L Yao, L Su, C Chen, A Zhang - IJCAI, 2019‏ - cse.buffalo.edu
As an effective way to learn a distance metric between pairs of samples, deep metric
learning (DML) has drawn significant attention in recent years. The key idea of DML is to …