Proposes a deep learning model to predict user attrition.
problem Attrition prediction in user activity logs.
method End-to-end learning scheme integrating logs and profiles.
result Offers superior performance compared to existing methods.
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “user attrition”
Proactive Intervention to Downtrend Employee Attrition using Artificial Intelligence Techniquesstat.ML
To predict the employee attrition beforehand and to enable management to take individualized preventive action. Using Ensemble classification modeling techniques and Linear Regression. Model could predict over 91% accurate employee prediction, lead-time in separation and individual reasons causing attrition. Prior inti…
New findings show pure strategy equilibria are more robust in a war of attrition game.
problem Analyzing a game of war of attrition under complete information.
method Examined the stability of equilibria in pure and mixed strategies under varying payoffs.
result Pure strategy equilibria are more robust to perturbations of the canonical model.
New bandit model accounts for user departures in recommender systems.
problem Capturing user departures in recommender systems with multi-armed bandits.
method Proposes a novel multi-armed bandit setup with two types of users and analyzes optimal and efficient algorithms.
result Achieves optimal and efficient learning algorithms for user types and reward probabilities.
Science, technology, engineering, and math (STEM) fields play growing roles in national and international economies by driving innovation and generating high salary jobs. Yet, the US is lagging behind other highly industrialized nations in terms of STEM education and training. Furthermore, many economic forecasts predi…
Each year, roughly 30% of first-year students at US baccalaureate institutions do not return for their second year and over $9 billion is spent educating these students. Yet, little quantitative research has analyzed the causes and possible remedies for student attrition. Here, we describe initial efforts to model stud…
A game theory study examines gradual concessions in variable contribution games under uncertainty.
problem Gradualism in contribution games due to free rider effect.
method Stochastic game analysis of variable contribution games, extending Nerlove-Arrow model.
result Equilibrium characterized by regular control strategies leading to gradual concession.
Method estimates treatment effect bounds in sample selection models.
problem Estimating heterogeneous treatment effects in presence of sample selection.
method Debiased/double machine learning approach for non-linear and high-dimensional confounders.
result Substantially tighter effect bounds for younger users.
Clustering is the problem of separating a set of objects into groups (called clusters) so that objects within the same cluster are more similar to each other than to those in different clusters. Spectral clustering is a now well-known method for clustering which utilizes the spectrum of the data similarity matrix to pe…
In many developing countries intellectual property infringement and the commerce of pirate goods is an entrepreneurial activity. Digital piracy is very often the only media for having access to music, cinema, books and software. At the same time, bio-prospecting and infringement of indigenous knowledge rights by intern…
We aim to predict whether an employee of a company will leave or not, using the k-Nearest Neighbors algorithm. We use evaluation of employee performance, average monthly hours at work and number of years spent in the company, among others, as our features. Other approaches to this problem include the use of ANNs, decis…
With pressure to increase graduation rates and reduce time to degree in higher education, it is important to identify at-risk students early. Automated early warning systems are therefore highly desirable. In this paper, we use unsupervised clustering techniques to predict the graduation status of declared majors in fi…
Proposes a variational autoencoder for long-term customer revenue forecasting.
problem Predicting long-term customer revenue from sparse and irregular transaction data.
method Variational Autoencoder (VAE) with flexible latent representation.
result Improves upon latest benchmarks in multiple real-world datasets.
The paper develops methods to estimate treatment effects in sample selection models.
problem Evaluation of treatments when outcomes are only observed for a subpopulation due to sample selection or attrition.
method Combines selection-on-observables and instrumental variable assumptions with double machine learning for treatment evaluation.
result Proposed estimators are asymptotically normal and root-n consistent.
Churn Prediction in Mobile Social Games: Towards a Complete Assessment Using Survival Ensemblesstat.ML
Reducing user attrition, i.e. churn, is a broad challenge faced by several industries. In mobile social games, decreasing churn is decisive to increase player retention and rise revenues. Churn prediction models allow to understand player loyalty and to anticipate when they will stop playing a game. Thanks to these pre…
Study shows OAT decomposition generates unexplained profit and loss, while SU decompositions depend on risk factor order.
problem Understanding profit and loss attribution in financial markets.
method Used financial market data from 2003 to 2022 to compare OAT, SU, and ASU decompositions.
result SU decompositions are sensitive to risk factor order and cannot identify all relevant risk factors.
The high level of attrition and low rate of certification in Massive Open Online Courses (MOOCs) has prompted a great deal of research. Prior researchers have focused on predicting dropout based upon behavioral features such as student confusion, click-stream patterns, and social interactions. However, few studies have…
Improved antibody humanness prediction using patent data.
problem Predicting the immunogenic response of antibody therapeutics.
method Multi-stage, multi-loss training process with contrastive learning and cross-entropy loss.
result The model outperforms baselines on five out of six inference tasks, improving humanness prediction.
New method predicts customer churn using mixed-penalty logistic regression.
problem Predicting customer churn in CRM systems.
method Mixed-penalty logistic regression for big data analysis.
result Proposed method enhances logistic regression for better predictive analytics.
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.
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.
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.
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.
CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.
problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.
FAIRY: A Framework for Understanding Relationships between Users' Actions and their Social Feedscs.SI
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.
The paper proposes a method to learn user representations invariant to social media behavior changes.
problem Difficulty in comparing users over time due to evolving behavior.
method Learning a mapping from user activity to a vector space capturing invariant features.
result The learned mapping enables efficient comparisons of users not seen at training time.
Explicit Feedbacks Meet with Implicit Feedbacks : A Combined Approach for Recommendation Systemcs.IR
Paper proposes a combined model for better recommendation by integrating explicit and implicit feedbacks.
problem Improve recommendation accuracy by considering both explicit and implicit feedbacks.
method Developed three models (RHC-PMF, RV-PMF, RHCV-PMF) that incorporate users' explicit and implicit feedbacks for better rating prediction.
result RHCV-PMF model outperforms other models in cold start scenarios for both users and items.
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 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.
A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…
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…
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 regret for spectrum access.
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.
The paper tackles robust policy learning in multitask contextual bandits with adversarial users.
problem Learning optimal policies in multitask contextual bandits with a small fraction of adversarial users.
method Developed efficient robust mean estimators for both uni-variate and high-dimensional random variables.
result Lower bound of per-user interactions to learn an -optimal policy for good users.
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++.
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.
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…
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 and .
Estimates population mean from user-level data with privacy, accounting for heterogeneity.
problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.
Deep learning predicts user identity, activity, and location from Wi-Fi signals.
problem Privacy concerns and need for non-invasive user authentication, activity classification, and tracking.
method End-to-end deep learning framework using passive Wi-Fi signals.
result System autonomously predicts user identity, activity, and location without user intervention.
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.
AI2V learns user representations by focusing on recent interests.
problem User interests and behavior change over time, affecting recommendation quality.
method Introduces AI2V, a neural attentive model that learns user representations by focusing on recent interests.
result AI2V outperforms other models on various datasets.
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.
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.
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.
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.
Rating platforms enable large-scale collection of user opinion about items (products, other users, etc.). However, many untrustworthy users give fraudulent ratings for excessive monetary gains. In the paper, we present FairJudge, a system to identify such fraudulent users. We propose three metrics: (i) the fairness of …
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.