GUIDE-VAE generates user-guided data with improved realism and performance.
problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.
Recommender systems recommend items more accurately by analyzing users' potential interest on different brands' items. In conjunction with users' rating similarity, the presence of users' implicit feedbacks like clicking items, viewing items specifications, watching videos etc. have been proved to be helpful for learni…
Optimal recommendation system using user and item clustering.
problem Maximizing recommendation accuracy with limited feedback.
method Latent variable model with user and item clustering, exploiting i.i.d. structure.
result Near-optimal algorithm that combines item and user structures.
CrystalCandle creates user-friendly explanations for machine learning models.
problem Low trust in predictive models due to lack of interpretability.
method End-to-end pipeline for model interpretation, including Model Importer, Interpreter, Narrative Generator, and Exporter.
result CrystalCandle leads to higher adoption rates and improved downstream metrics.
DBRec discovers latent groups to improve recommendation.
problem Sparse user-item interaction data in recommender systems.
method Simultaneously discovers latent user/item groups and interacts them with users/items for bridging preferences.
result DBRec outperforms state-of-the-art models on real datasets.
Improved multi-user VoiceFilter-Lite model for speech recognition.
problem Limited performance of multi-user VoiceFilter-Lite models.
method Dual learning rate schedule and FiLM for feature conditioning.
result Closed the performance gap between multi-user and single-user VoiceFilter-Lite models.
MetaSelector learns to choose the best model for each user.
problem Heterogeneous datasets and user-specific historical data make it hard to find the best model for each user.
method Meta-learning framework to train a model selector that chooses the best model for each user based on their historical data.
result MetaSelector outperforms single model and sample-level model selector in AUC and LogLoss.
Improved neural model for social recommendation by integrating social and interest networks.
problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.
MRIF models dynamic user interests at multiple temporal-ranges.
problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.
Paper proposes TPathMine model for more accurate user attribute prediction.
problem Predicting user attributes from click data in heterogeneous networks.
method HetPathMine model with meta-path weights optimized for user emotional preferences.
result TPathMine model achieves higher accuracy in user attribute prediction.
Paper presents AETN for efficient user modeling from mobile app usage.
problem Efficient user modeling from mobile app usage with reduced manual effort.
method AutoEncoder-coupled Transformer Network (AETN).
result AETN achieves effective user embeddings with reduced manual effort.
Model user preferences for conversational LLMs using weak rewards.
problem Lack of persistent user models in conversational LLMs leading to repeated user restatements.
method Vector-Adapted Retrieval Scoring (VARS) framework that updates user vectors online from weak scalar rewards.
result Full VARS agent achieves strongest overall performance, matches strong Reflection baseline in task success, and reduces user effort.
FedUA trains UA models privately without raw data.
problem Training UA models requires raw user data, compromising privacy.
method Federated learning framework for privacy-preserving UA model training.
result FedUA reliably rejects unseen user data at high true positive rates.
Hybrid approach combines user feedback and machine learning for predicting user satisfaction.
problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.
We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. Each user may be recommended a given item at most once. A latent variable model specifies the user preferences: both users and items are clustered into types. Al…
Author2Vec generates user embeddings from social media data.
problem Generating useful user embeddings from noisy social media data.
method End-to-end neural network with BERT sentence representations and unsupervised pre-training.
result Author2Vec outperforms traditional methods in user classification tasks.
New method detects and measures malicious users in recommendation algorithms.
problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.
Proposes a graph neural network for personalized news recommendation.
problem Data sparsity in news recommendation systems.
method Heterogeneous graph model + Graph Neural Networks + LSTM attention mechanism.
result Significantly outperforms state-of-the-art methods on news recommendation datasets.
In human-in-the-loop machine learning, the user provides information beyond that in the training data. Many algorithms and user interfaces have been designed to optimize and facilitate this human--machine interaction; however, fewer studies have addressed the potential defects the designs can cause. Effective interacti…
Boosting trees predict Twitch subscriptions from user activity.
problem Predicting Twitch user subscriptions from activity data.
method Used boosting trees and target-encodings for high cardinality categoricals.
result User activity can be better predicted than content alone.
Optimizes convergence time of federated learning over wireless networks.
problem Limited resource blocks in wireless networks affect federated learning convergence time and performance.
method Formulates an optimization problem to minimize convergence time while optimizing performance, proposes a probabilistic user selection scheme and uses ANNs for estimation.
result Improves convergence time and performance of federated learning over wireless networks.
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.
There is a large amount of interest in understanding users of social media in order to predict their behavior in this space. Despite this interest, user predictability in social media is not well-understood. To examine this question, we consider a network of fifteen thousand users on Twitter over a seven week period. W…
Proposes using frequent sequences to improve sequential recommendation models.
problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.
A model predicts user movie preferences based on novelty-seeking traits.
problem Accurately predicting user movie preferences for competitive websites.
method DFNSM model uses demographic, genre, and novelty-seeking data.
result DFNSM outperforms previous models in movie recommendation accuracy.
FURL improves model accuracy in FL by locally training user embeddings.
problem Improving prediction accuracy of neural-network-based models in Federated Learning.
method FURL divides model parameters into federated and private parameters, training private parameters locally.
result Significant performance improvement with 8% and 51% increases on two datasets.
Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in th…
Paper uses RNN to predict SaaS user lifetime value.
problem Predicting user lifetime value in SaaS applications.
method Recurrent Neural Network with multi-cell architecture, accounting for cohort, age-in-system, and contemporaneous information.
result Significantly improved prediction accuracy compared to existing models.
Paper models MOOC users behavior using MDP for easier classification.
problem Difficulty in defining and classifying MOOC users based on their behavior.
method Uses Markov Decision Process (MDP) to model user behavior from log data.
result Classifies users based on their intentions inferred from MDP rewards.
FAIRY explains user actions and social media feeds.
problem Users struggle to understand why certain items appear in their social feeds.
method FAIRY uses an interaction graph to model user behavior and ranks feed items, scoring paths connecting user actions and feed items.
result FAIRY provides clear explanations for user actions and feed items, enhancing transparency and user understanding.
We introduce a novel latent grouping model for predicting the relevance of a new document to a user. The model assumes a latent group structure for both users and documents. We compared the model against a state-of-the-art method, the User Rating Profile model, where only users have a latent group structure. We estimat…
Study proposes a time-aware model to predict user conversion intent.
problem Weak predictive signals from users not suitable for conversion prediction.
method Time-aware approach to model user activities and capture conversion intent signals.
result Approach outperforms other models on real-world datasets.
Personalized federated learning adapts models to each user's data.
problem Training models across users without data exchange leads to a common model, not personalized.
method Develops a personalized federated learning approach using Model-Agnostic Meta-Learning (MAML).
result Personalized models can be adapted by a few gradient descent steps on local data.
This paper analyzes user-level local differential privacy in distributed systems.
problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.
Proposes CF-SFL to improve sparse data recommendation.
problem Poor performance of CF in sparse data.
method Generative user feedback loop to simulate user feedback.
result Improves recommendation results on multiple datasets.
Turbo-Aggregate reduces secure aggregation time from quadratic to nearly linear.
problem Quadratic overhead in secure model aggregation for federated learning.
method Multi-group circular strategy, additive secret sharing, and coding techniques.
result Achieves O(NlogN) overhead, compared to O(N2), for up to 50% user dropout. The paper proposes a method to infer user profiles from multiple sources of social media data.
problem Mining user profiles from social media data using a single type of information.
method Hinge-loss Markov Random Fields (HL-MRFs) integrated with multiple sources of UGC and social relations.
result HL-MRFs successfully incorporate multiple sources of information and outperform competing methods.
A new federated learning method clusters users into multiple models for better data distribution handling.
problem Non-IID data from heterogeneous sources in federated learning.
method Proposes a multi-center aggregation mechanism to learn multiple global models and optimally match users to centers.
result Our method outperforms existing federated learning methods on benchmark datasets.
Neural pedagogical agent updates user models in real-time for mobile education apps.
problem Real-time user modeling for dynamic mobile education platforms.
method Bidirectional recurrent neural networks with attention mechanism over embedded question-response pairs.
result Model outperforms existing approaches in predicting user response correctness.
We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ide…
The study proposes an audit to assess user control over recommendations in collaborative filtering systems.
problem The gap between maximizing accuracy and ensuring user control over information availability in recommender systems.
method The approach involves a computationally efficient audit for top-N linear recommender models, focusing on reachability and user agency. result The study demonstrates that model complexity affects the effort required for users to exert control over their recommendations.
We develop a Bayesian Poisson matrix factorization model for forming recommendations from sparse user behavior data. These data are large user/item matrices where each user has provided feedback on only a small subset of items, either explicitly (e.g., through star ratings) or implicitly (e.g., through views or purchas…
Protects user privacy in models using optional personal data.
problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.
There are great interests as well as many challenges in applying reinforcement learning (RL) to recommendation systems. In this setting, an online user is the environment; neither the reward function nor the environment dynamics are clearly defined, making the application of RL challenging. In this paper, we propose a …
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.
New policy reduces spectrum access regret in uncoordinated systems.
problem Uncoordinated spectrum access with user-dependent rewards.
method Multi-user multi-armed bandit (MAB) model with user-specific rewards.
result Achieves O(logT) regret for spectrum access. Study personalizes user experience to maximize rewards with patience budget.
problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3) and Ω(N2/3). Personalized recommendation systems (RS) are extensively used in many services. Many of these are based on learning algorithms where the RS uses the recommendation history and the user response to learn an optimal strategy. Further, these algorithms are based on the assumption that the user interests are rigid. Specifi…