New study shows personalized content recommendations can lead to polarization of user preferences.
problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.
Spotify improves content mix using contextual bandits.
problem Skewed historical data and varying user preferences across contexts.
method Contextual bandits to dynamically learn optimal content type distribution.
result Improved precision and user engagement with under-represented content types.
Proposes a method to predict content preferences for mobile users in decentralized caching networks.
problem Determining caching schemes for decentralized caching networks with mobile traffic.
method Formulates content preference learning as a DRMTL problem, integrates mobility prediction, and uses ADMM for optimization.
result Mobility-aware content preference learning provides more accurate predictions and improved hit ratios.
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.
Proposes D2D-LSTM for predicting mobile social network content diffusion paths.
problem Lack of accurate content popularity prediction considering time and location in mobile social networks.
method D2D-LSTM, a deep neural network combining user social features and files features.
result Significantly improved prediction accuracy (up to 85.858%) and faster convergence (less than 100 steps).
WCF uses Wasserstein distance to recommend cold-start items based on content similarity.
problem Recommendation performance drops for new items with little interaction history.
method Applies Wasserstein distance to map interaction history to contents, inferring user preferences.
result WCF outperforms state-of-the-art methods in cold-start recommendation.
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.
We quantify content availability and user discovery opportunities in recommender systems.
problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.
DCMIX learns channel importance for high content imaging.
problem Lack of channel importance information in deep learning-based image analysis.
method Image blending concepts with alpha compositing for arbitrary channels.
result DCMIX learns biologically relevant channel importance without sacrificing prediction performance.
Proposes a model to optimize feedback for content creators on social media.
problem Nurturing content creation on social media platforms.
method Modeling feedback distribution to incentivize creators and optimize newsfeed experience.
result Optimized newsfeed for content creators without compromising user experience.
FSPO optimizes synthetic preferences for LLM personalization.
problem Personalizing large language models for diverse users.
method FSPO reframes reward modeling as a meta-learning problem, using few labeled preferences and synthetic data.
result FSPO achieves high winrates in personalized responses, both synthetic and real.
New term ADS describes how machine learning can change user behavior.
problem Machine learning systems can unintentionally change user behavior, affecting performance.
method Introduced `unit tests` and mitigation strategy for hidden incentives in auto-induced distributional shift.
result Meta-learning and Q-learning sometimes fail unit tests but pass with mitigation strategy.
The use of computational methods to evaluate aesthetics in photography has gained interest in recent years due to the popularization of convolutional neural networks and the availability of new annotated datasets. Most studies in this area have focused on designing models that do not take into account individual prefer…
State of the art music recommender systems mainly rely on either matrix factorization-based collaborative filtering approaches or deep learning architectures. Deep learning models usually use metadata for content-based filtering or predict the next user interaction by learning from temporal sequences of user actions. D…
Bandit problem on graphs aims to recommend items with high expected ratings.
problem Online learning problems involving graphs, such as content-based recommendation.
method Study of a bandit problem on graphs, introducing effective dimension and proposing algorithms.
result Proposed algorithms scale linearly and sublinearly in the effective dimension, improving cumulative regret.
The paper tackles a bandit problem on graphs with smooth functions, aiming to recommend items with high expected ratings.
problem Online learning problems involving graphs, such as content-based recommendation.
method Introduced the notion of effective dimension and proposed two algorithms for solving the problem.
result The algorithms can learn good estimators of user preferences from just tens of nodes evaluations.
In recommender systems, cold-start issues are situations where no previous events, e.g. ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g. item attributes) and initial user ratings are valuable for seizing users' preferences on a new ite…
Deep learning improves conversational recommender systems.
problem Creating effective goal-oriented dialogue systems through natural language interactions.
method Apply deep learning techniques to conversational recommender systems.
result Deep learning models enhance user preference learning in CRS.
Estimates users' preference for a site over others using engagement data.
problem Lack of data on users' interactions with other sites makes it hard to estimate preferences for a focal site.
method Uses Hierarchical Bayes Method with two estimation techniques: Markov Chain Monte Carlo and Stochastic Gradient with Langevin Dynamics.
result Good support found for the approach to computing personalized share of engagement.
Study bandit problem on smooth graph functions for recommender systems.
problem Online learning problems involving graphs, like content-based recommendation.
method Introduced spectral bandit problem and two algorithms that scale linearly in effective dimension.
result Learned user preferences for thousands of items from just tens nodes evaluations.
Collaborative filtering (CF) and content-based filtering (CBF) have widely been used in information filtering applications. Both approaches have their strengths and weaknesses which is why researchers have developed hybrid systems. This paper proposes a novel approach to unify CF and CBF in a probabilistic framework, n…
Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation and computational advertisement, where the set of items and users is very fluid.…
Nowadays, users open multiple accounts on social media platforms and e-commerce sites, expressing their personal preferences on different domains. However, users' behaviors change across domains, depending on the content that users interact with, such as movies, music, clothing and retail products. In this paper, we pr…
Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.
problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.
In this paper, the distributed edge caching problem in fog radio access networks (F-RANs) is investigated. By considering the unknown spatio-temporal content popularity and user preference, a user request model based on hidden Markov process is proposed to characterize the fluctuant spatio-temporal traffic demands in F…
A new model considers fatigue in online content recommendation systems.
problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.
Sensory data are often comprised of independent content and transformation factors. For example, face images may have shapes as content and poses as transformation. To infer separately these factors from given data, various ``disentangling'' models have been proposed. However, many of these are supervised or semi-super…
Method optimizes diffusion model generation to meet user preferences.
problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.
In the industry of video content providers such as VOD and IPTV, predicting the popularity of video contents in advance is critical not only from a marketing perspective but also from a network optimization perspective. By predicting whether the content will be successful or not in advance, the content file, which is l…
Improves content allocation in educational platforms with sparse data.
problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.
We consider visual domains in which a class label specifies the content of an image, and class-irrelevant properties that differentiate instances constitute the style. We present a domain-independent method that permits the open-ended recombination of style of one image with the content of another. Open ended simply me…
New model improves website ranking by considering user choices as a whole.
problem Optimizing content ordering for user clicks in website design.
method Introduced multinomial logit (MNL) choice model to LTR framework, proposing UCB algorithms.
result Proved theoretical bounds on regret for UCB algorithms in both known and unknown position parameter settings.
Information systems experience an ever-growing volume of unstructured data, particularly in the form of textual materials. This represents a rich source of information from which one can create value for people, organizations and businesses. For instance, recommender systems can benefit from automatically understanding…
Proposes a VAE variant for ordinal content factors.
problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.
Simple method disentangles content and style from pre-trained vision models.
problem Learning interpretable features in visual representations.
method Probabilistic linear entanglement model and simple disentanglement algorithm.
result Method provably disentangles content and style features.
Foreign policy analysis has been struggling to find ways to measure policy preferences and paradigm shifts in international political systems. This paper presents a novel, potential solution to this challenge, through the application of a neural word embedding (Word2vec) model on a dataset featuring speeches by heads o…
New PCGML approach generates novel game content across multiple platformer domains.
problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.
Social network analysis (SNA), which is a research field describing and modeling the social connection of a certain group of people, is popular among network services. Our topic words analysis project is a SNA method to visualize the topic words among emails from Obama.com to accounts registered in Columbus, Ohio. Base…
Data science predicts user interest for midwifery content.
problem Improving midwives' learning and preventing maternal and newborn deaths.
method Forecasting methods using user-generated logs from online learning apps.
result Determining future user interest in midwifery content types.
Reinforcement learning improves game level design.
problem Creating high-quality game levels with limited examples.
method Transforming level design into a Markov decision process and training with reinforcement learning.
result Trained reinforcement learning agents can generate high-quality levels quickly.
The paper tackles carousel personalization in music streaming apps using contextual bandits.
problem Selecting relevant items to display in carousels for personalized content recommendation.
method Modeling carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback.
result Empirically shows the effectiveness of the framework in capturing characteristics of real-world carousels.
Bayesian optimization agent learns user preferences from pairwise comparisons.
problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.
With rapid development of the Internet, web contents become huge. Most of the websites are publicly available, and anyone can access the contents from anywhere such as workplace, home and even schools. Nevertheless, not all the web contents are appropriate for all users, especially children. An example of these content…
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…
New RLHF framework handles general preference oracles without reward functions.
problem Handling general preference oracles without assuming a reward function.
method Developed a minimax game between two LLMs for RLHF under a general preference oracle, focusing on KL-regularized preference.
result Proposed algorithms for efficient offline and online RLHF learning.
DPS uses posterior sampling for preference-based RL, achieving a first regret guarantee.
problem Formal frameworks for preference-based RL with theoretical analysis.
method Preference-based posterior sampling, Bayesian credit assignment.
result First asymptotic Bayesian no-regret rate for preference-based RL.
Bayesian optimization learns DM preferences for multi-outcome experiments.
problem Optimizing expensive experiments with unknown utility functions and multiple outcomes.
method Alternates preference learning and Bayesian optimization, using pairwise comparisons.
result Preference exploration strategies improve Bayesian optimization performance.
Paper investigates monotonicity issues in AI preference learning.
problem AI models may violate monotonicity when learning preferences.
method Investigates root causes of non-monotonicity in comparison-based preference learning.
result Proves local pairwise monotonicity under mild assumptions.