Timezone: »
Preference learning has been studied for several decades and has drawn increasing attention in recent years due to its importance in diverse applications such as web search, ad serving, information retrieval, recommender systems, electronic commerce, and many others. In all of these applications, we observe (often discrete) choices that reflect preferences among several entities, such as documents, webpages, products, songs etc. Since the observation then is partial, or censored, the goal is to learn the complete preference model, e.g. to reconstruct a general ordering function from observed preferences in pairs.
Traditionally, preference learning has been studied independently in several research areas, such as machine learning, data and web mining, artificial intelligence, recommendation systems, and psychology among others, with a high diversity of application domains such as social networks, information retrieval, web search, medicine, biology, etc. However, contributions developed in one application domain can, and should, impact other domains. One goal of this workshop is to foster this type of interdisciplinary exchange, by encouraging abstraction of the underlying problem (and solution) characteristics during presentation and discussion. In particular, the workshop is motivated by the two following lines of research:
1. Large scale preference learning with sparse data: There has been a great interest and take-up of machine learning techniques for preference learning in learning to rank, information retrieval and recommender systems, as supported by the large proportion of preference learning based literature in the widely regarded conferences such as SIGIR, WSDM, WWW, CIKM. Different paradigms of machine learning have been further developed and applied to these challenging problems, particularly when there is a large number of users and items but only a small set of user preferences are provided.
2. Personalization in social networks: recent wide acceptance of social networks has brought great opportunities for services in different domains, thanks to Facebook, Linkin, Douban, Twitter, etc. It is important for these service providers to offer personalized service (e.g., personalization of Twitter recommendations). Social information can improve the inference for user preferences. However, it is still challenging to infer user preferences based on social relationship.
As such, we especially encourage submissions on theory, methods, and applications focusing on large-scale preference learning in social media. In order to avoid a dispersed research workshop, we solicit submissions (papers, demos and project descriptions) and participation that specifically tackle the research areas as below:
Preference elicitation
Ranking aggregation
Discrete choice models and inference
Statistical relational learning for preferences
Link prediction for preferences
Learning Structured Preferences
Multi-task preference learning
Important Dates:
Paper submission deadline: 3 November 2011 (Extended)
Author notification: 5 November 2011
Final paper due: 1 December 2011
Workshop date: 17 December 2011
Submission Instructions:
We solicit extended abstracts using the NIPS style files, preferably 2 to 4 pages, but no more than 8 pages. Submissions should include the title, authors' names, and email addresses. We will post the final version of the papers on the workshop web page and encourage authors to post their contribution on arXiv.
Papers should be submitted to the EasyChair system at https://www.easychair.org/conferences/?conf=cmpl2011.
We are seeking funds to publish the talks on http://videolectures.net/.
Author Information
Jean-Marc Andreoli (Xerox Research Centre Europe)
Cedric Archambeau (Amazon, Berlin)
Guillaume Bouchard (Xerox Research Center Europe)
Shengbo Guo (Facebook)
Kristian Kersting (University of Bonn and Fraunhofer IAIS)
Scott Sanner (Nicta)
Martin Szummer (Microsoft Research Cambridge)
Paolo Viappiani (CNRS)
Onno Zoeter (Xerox Research Centre Europe)
More from the Same Authors
-
2022 : Graphs, Constraints, and Search for the Abstraction and Reasoning Corpus »
Yudong Xu · Elias Khalil · Scott Sanner -
2022 : Differentially Private Gradient Boosting on Linear Learners for Tabular Data »
Saeyoung Rho · Shuai Tang · Sergul Aydore · Michael Kearns · Aaron Roth · Yu-Xiang Wang · Steven Wu · Cedric Archambeau -
2022 Poster: Learning to Follow Instructions in Text-Based Games »
Mathieu Tuli · Andrew Li · Pashootan Vaezipoor · Toryn Klassen · Scott Sanner · Sheila McIlraith -
2022 Poster: Memory Efficient Continual Learning with Transformers »
Beyza Ermis · Giovanni Zappella · Martin Wistuba · Aditya Rawal · Cedric Archambeau -
2022 Poster: Private Synthetic Data for Multitask Learning and Marginal Queries »
Giuseppe Vietri · Cedric Archambeau · Sergul Aydore · William Brown · Michael Kearns · Aaron Roth · Ankit Siva · Shuai Tang · Steven Wu -
2021 Poster: Risk-Aware Transfer in Reinforcement Learning using Successor Features »
Michael Gimelfarb · Andre Barreto · Scott Sanner · Chi-Guhn Lee -
2021 Poster: Representer Point Selection via Local Jacobian Expansion for Post-hoc Classifier Explanation of Deep Neural Networks and Ensemble Models »
Yi Sui · Ga Wu · Scott Sanner -
2020 Session: Orals & Spotlights Track 16: Continual/Meta/Misc Learning »
Laurent Charlin · Cedric Archambeau -
2017 : Industry talk: Cedric Archambeau (TBA) »
Cedric Archambeau -
2014 Workshop: Learning Semantics »
Cedric Archambeau · Antoine Bordes · Leon Bottou · Chris J Burges · David Grangier -
2014 Poster: Mind the Nuisance: Gaussian Process Classification using Privileged Noise »
Daniel Hernández-lobato · Viktoriia Sharmanska · Kristian Kersting · Christoph Lampert · Novi Quadrianto -
2012 Poster: Symbolic Dynamic Programming for Continuous State and Observation POMDPs »
Zahra Zamani · Scott Sanner · Pascal Poupart · Kristian Kersting -
2011 Session: Spotlight Session 7 »
Cedric Archambeau -
2011 Session: Oral Session 9 »
Cedric Archambeau -
2011 Poster: Sparse Bayesian Multi-Task Learning »
Cedric Archambeau · Shengbo Guo · Onno Zoeter -
2010 Spotlight: Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets »
Paolo Viappiani · Craig E Boutilier -
2010 Poster: Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets »
Paolo Viappiani · Craig E Boutilier -
2010 Poster: Variational bounds for mixed-data factor analysis »
Mohammad Emtiyaz Khan · Benjamin Marlin · Guillaume Bouchard · Kevin Murphy -
2010 Poster: Gaussian Process Preference Elicitation »
Edwin Bonilla · Shengbo Guo · Scott Sanner -
2009 Workshop: The Generative and Discriminative Learning Interface »
Simon Lacoste-Julien · Percy Liang · Guillaume Bouchard -
2009 Poster: Asymptotically Optimal Regularization in Smooth Parametric Models »
Percy Liang · Francis Bach · Guillaume Bouchard · Michael Jordan -
2008 Poster: Sparse probabilistic projections »
Cedric Archambeau · Francis Bach -
2008 Spotlight: Sparse probabilistic projections »
Cedric Archambeau · Francis Bach -
2007 Poster: Variational Inference for Diffusion Processes »
Cedric Archambeau · Manfred Opper · Yuan Shen · Dan Cornford · John Shawe-Taylor -
2006 Workshop: Dynamical Systems, Stochastic Processes and Bayesian Inference »
Manfred Opper · Cedric Archambeau · John Shawe-Taylor