Paper predicts player retention in mobile games quickly.
problem Predicting player retention in free-to-play mobile games.
method Heuristic modeling to build simple retention prediction rules.
result Heuristic approach achieves comparable performance to common algorithms.
Predicts employee turnover and designs retention policies.
problem Employee turnover prediction and retention policy design.
method Classical machine learning techniques for prediction, policy design based on model outputs.
result Developed model outputs for designing effective retention policies.
New approach to continual learning prioritizes adaptation over retention.
problem Catastrophic forgetting in lifelong learning models.
method Formalized CL as an online optimization problem, introduced Transfer Efficiency, and derived a Critical Task Duration.
result Retention can hinder real-time adaptation in non-stationary environments.
Predicts student dropout using transcript data.
problem Student attrition in higher education.
method Machine learning model using transcript data.
result Dropout can be accurately predicted from a single term of transcript data.
The brain optimizes memory by forgetting what's predictable, improving generalization.
problem Memory consolidation struggles with representational drift, semanticisation, and offline replay.
method Proposes predictive forgetting as a mechanism to optimize generalization by reducing complexity.
result Predictive forgetting improves information-theoretic generalization bounds on stored representations.
This study integrates cost-sensitive and causal classification methods.
problem Improving classification model performance in business decision-making.
method A unifying evaluation framework for cost-sensitive and causal classification.
result Conventional classification is a specific case of causal classification.
Trimming helps in conformal prediction when it separates anomaly scores.
problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.
In the hypothesis of rare loss events, the general expression of the policy value has been determined as a functional of the "expected frequency / loss severity" function and of the retention function. Exponential disutility has been chosen after mathematical characterization of some of its economical aspects, where fu…
New theory explains forgetting in learning algorithms.
problem Tendency of learning algorithms to forget past knowledge.
method Proposes a self-consistency theory of forgetting as a loss of predictive information.
result Exact Bayesian inference allows for adaptation without forgetting.
A Qini-based uplift model improves retention marketing campaign performance.
problem Isolating the marketing effect of a campaign and identifying responsive customers.
method Qini-based uplift regression model using logistic regression.
result Qini-optimized uplift models improve performance and provide interpretable models.
Survival analysis improves playtime measurement in games.
problem Measuring and improving player retention in games.
method Survival analysis for playtime data without covariates.
result Survival and hazard estimates provide a visual and analytic interpretation of playtime.
Survival ensembles improve churn prediction in mobile social games.
problem Predicting user churn in mobile social games to retain players.
method Survival analysis and ensemble learning techniques.
result Survival ensembles provide more accurate and robust churn predictions.
Endogenous reinsurance pricing in large insurance markets
problem Endogenous reinsurance pricing in large insurance markets
method Stackelberg leader and insurer equilibrium analysis
result Characterization of insurers' equilibrium retention and Stackelberg equilibria
Machine learning models can lead to group representation disparity, affecting long-term retention.
problem Representation disparity in ML models can lead to group retention issues over time.
method Analyzed user dynamics and fairness criteria in a sequential decision-making framework.
result Representation disparity can worsen over time without proper fairness criteria.
A new uplift modeling approach uses binary treatment indicators more efficiently.
problem Lack of full value utilization in binary uplift modeling.
method Design a novel transformed outcome for binary target variables.
result Our new approach outperforms traditional methods in synthetic and real-world datasets.
New insights into continual learning with task similarity.
problem Challenges in learning similar tasks without interference.
method Linear teacher-student model with latent structure.
result High input feature similarity with low readout similarity is catastrophic.
LEMN improves memory networks for learning from streaming data.
problem Efficiently processing large data streams in memory-augmented neural networks.
method LEMN uses a RNN-based retention agent to learn and replace less important memory entries based on their importance and historical context.
result LEMN achieves significant improvements over existing methods in learning from streaming data.
MACI improves LLM factuality inference with higher retention and lower time cost.
problem Ensuring factuality in LLM responses for high-stakes domains.
method Reformulated conformal inference in a multiplicative filtering setting, leveraging ensembles for more accurate factuality scores and group-conditional calibration.
result MACI achieves higher retention and lower time cost compared to baselines, preserving validity through group-conditional calibration.
Graph-based approach predicts stock trends using dynamic multi-relational graphs.
problem Predicting future stock movements in complex, time-evolving stock relationships.
method Dynamic multi-relational stock graphs, stochastic diffusion process, parallel retention.
result Outperforms state-of-the-art baselines in stock trend forecasting.
Proposes p-RBM for retaining memory in RBM models for stock market prediction.
problem Lack of memory in RBM models for dynamic data like time-series analysis.
method Generalizes RBM to p-RBM, capable of retaining p past states, and trains using contrastive divergence.
result p-RBM offers promising prediction potential for stock market direction.
The paper analyzes dynamics of momentum in high dimensions with sparse updates.
problem Theoretical analysis of momentum dynamics in high-dimensional sparse settings.
method Theoretical analysis of two models: least squares with sparse inputs and logistic regression with a rare class.
result Characterization of high-dimensional limits of momentum dynamics and phase structure.
Study compares classification techniques to predict customer churn in banking.
problem Predicting customer churn in banking industry.
method Comparison of six supervised classification techniques (ANN and random forest) on 10000 European bank customers.
result ANN structure with five nodes in a single hidden layer is the best performing classifier.
A new AMM design reduces impermanent loss and retains more liquidity.
problem Inefficiencies in conventional AMM designs lead to liquidity loss and user engagement issues in DEXs.
method Proposes a dual-mechanism framework: a power-law invariant BMM and dynamic rebate system.
result Reduces impermanent loss by 36% and retains 3.98x more liquidity during price volatility.
The study clusters neighborhoods based on childhood vulnerability data and program retention rates.
problem Improving childhood outcomes and decision-making in early childhood development.
method Data-driven approaches combining public and private sources to visualize children's experiences and analyze program retention rates.
result Neighborhoods can be clustered based on childhood vulnerability, and certain programs have higher retention rates.
The paper uses RFM and clustering to segment bank customers.
problem Challenges in customer retention and profitable segmentation in banking.
method RFM technique and clustering algorithms applied to real data.
result Successful customer segmentation improves conversion rates.
Proposes Decodable Information Bottleneck for optimal representation learning.
problem Finding optimal representations for supervised learning.
method Integrates information retention and compression with the desired predictive family.
result Optimal representations lead to better expected test performance and can be estimated with guarantees.
CPP improves predictive model outputs for better intervention decisions.
problem Predictive models often misguide resource allocation.
method Causal post-processing techniques using limited experimental data.
result CPP can improve intervention decisions, especially with imperfect causal signals.
Mobile game developers use a scalable churn prediction model to predict player abandonment.
problem Predicting player abandonment in mobile games.
method Survival ensembles approach for accurate churn prediction.
result Accurate predictions on player abandonment and playtime.
The Open University studies student online behavior in virtual learning environments.
problem Improving retention rates in online modules.
method GUHA and Markov chain-based analysis of student activity.
result Both methods are valid for modeling student activities.
A new framework ensures model safety by retaining old model capabilities while improving new tasks.
problem Catastrophic forgetting in continual learning systems.
method Retention-centric framework with data-dependent constraints and an efficient constrained optimization algorithm.
result The method ensures that new models retain important capabilities of old models while improving new tasks.
Optimizes learning schedules for better memory retention.
problem Finding the best review schedule for spaced repetition.
method Flexible representation of spaced repetition using marked temporal point processes and optimal control for stochastic differential equations with jumps.
result Optimal reviewing schedule is the recall probability of content.
New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.
problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.
Based on a point of view that solvency and security are first, this paper considers regular-singular stochastic optimal control problem of a large insurance company facing positive transaction cost asked by reinsurer under solvency constraint. The company controls proportional reinsurance and dividend pay-out policy to…
PARMESAN learns from memory without parameters for fast, efficient continual learning.
problem Inflexibility in deep learning methods for continual learning.
method Transductive reasoning and memory search for parameter-free learning.
result 3-4 orders of magnitude faster than baselines, comparable performance.
ProfitTree uses evolutionary algorithms to build churn prediction models that maximize profit.
problem Predicting customer churn with profit maximization in mind.
method Integrates EMPC metric into profit-driven decision trees using evolutionary algorithms.
result Significant profit improvements over classic accuracy-driven models.
New model analyzes customer churn with tensor completion and binary data.
problem Analyzing the impact of interventions on customer churn.
method Tensorized latent factor block hazard model with 1-bit tensor completion.
result Effective categorization of interventions by similar impacts.
A framework uses proxies to prioritize treatment without estimating causal effects.
problem Prioritizing treatment when causal effects are hard to estimate.
method Decision-focused framework identifying conditions for proxy usefulness.
result Proxies can recover correct effect ordering under specific conditions.
Paper explores a consumer-friendly approach to explain machine learning decisions.
problem Challenges in providing understandable explanations for machine learning predictions.
method Consumer-driven approach called TED that asks for explanations in training data.
result TED is robust to increasing numbers of explanations, noisy explanations, and missing explanations.
PLS-SVD struggles with missing data in multimodal datasets, showing a phase transition in performance.
problem Missing data in PLS-SVD for multimodal datasets.
method Replica-symmetric analysis of spiked rectangular random matrices with missing entries.
result PLS-SVD performance transitions from uninformative to informative singular vectors at a critical signal-to-noise threshold.
Predicts STEM attrition using transcript data.
problem High rates of STEM students leaving fields in higher education.
method Machine learning on student transcript data.
result Attrition from STEM fields can be accurately predicted.
Unified framework for unlearning in diffusion models using KL divergence and likelihood constraints.
problem Removing undesirable data or concepts while preserving utility of pretrained models.
method Constrained optimization framework based on reverse and forward KL divergences, and likelihood constraints.
result Our KL-constrained approach achieves superior retention-unlearning tradeoffs compared to weight-based baselines.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
Study analyzes player churn and purchasing behavior in games.
problem Retaining players and predicting churn in video games.
method Deep behavioral analysis and ensemble learning models.
result Discarding certain churners improves prediction models.
This paper considers nonlinear regular-singular stochastic optimal control of large insurance company. The company controls the reinsurance rate and dividend payout process to maximize the expected present value of the dividend pay-outs until the time of bankruptcy. However, if the optimal dividend barrier is too low t…
Study predicts individual treatment effects in ride-sharing competitions.
problem Understanding how team competitions affect individual drivers' outcomes.
method Analyzed data from 500 competitions, built machine learning models.
result Reduced out-sample prediction error by over 24%.
PSI-KT improves KT accuracy and interpretability in learning materials.
problem Optimizing learning materials selection and timing for understanding and retention.
method Hierarchical generative approach using Bayesian inference.
result Superior multi-step predictive accuracy and scalable inference.
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.
System predicts HIV patients at risk of dropping out of care.
problem High non-adherence and dropout rates among HIV patients.
method Predictive machine learning model based on resource constraints, stability, and fairness.
result Model performs 3x better than baseline for clinical use and 2.3x better for city-wide use.