Predicting and improving player retention is crucial to the success of mobile Free-to-Play games. This paper explores the problem of rapid retention prediction in this context. Heuristic modeling approaches are introduced as a way of building simple rules for predicting short-term retention. Compared to common classifi…
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “information retention”
Maximizing product use is a central goal of many businesses, which makes retention and monetization two central analytics metrics in games. Player retention may refer to various duration variables quantifying product use: total playtime or session playtime are popular research targets, and active playtime is well-suite…
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.
This paper illustrates the similarities between the problems of customer churn and employee turnover. An example of employee turnover prediction model leveraging classical machine learning techniques is developed. Model outputs are then discussed to design \& test employee retention policies. This type of retention dis…
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.
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.
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…
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.
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
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.
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.
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.
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.
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.
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.
Current generation of memory-augmented neural networks has limited scalability as they cannot efficiently process data that are too large to fit in the external memory storage. One example of this is lifelong learning scenario where the model receives unlimited length of data stream as an input which contains vast majo…
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.
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.
Qini-based Uplift Regressionstat.AP
Uplift models provide a solution to the problem of isolating the marketing effect of a campaign. For customer churn reduction, uplift models are used to identify the customers who are likely to respond positively to a retention activity only if targeted, and to avoid wasting resources on customers that are very likely …
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.
Bayesian optimization has been successful at global optimization of expensive-to-evaluate multimodal objective functions. However, unlike most optimization methods, Bayesian optimization typically does not use derivative information. In this paper we show how Bayesian optimization can exploit derivative information to …
Powerful generative models, particularly in Natural Language Modelling, are commonly trained by maximizing a variational lower bound on the data log likelihood. These models often suffer from poor use of their latent variable, with ad-hoc annealing factors used to encourage retention of information in the latent variab…
Information Theory in Open-world Machine Learning Foundations, Frameworks, and Future Directionstat.ML
This paper reviews information theory in open-world machine learning.
problem Lack of a unified theoretical foundation for open-world machine learning.
method Synthesis of information theoretic approaches.
result Established a pathway toward provable and trustworthy open world intelligence.
A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safetycs.LG
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.
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.
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…
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.
Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraintscs.LG
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.
This paper studies how AMMs can minimize losses from arbitrage while retaining uninformed trading activity.
problem Minimizing losses from arbitrage in AMMs while retaining uninformed trading activity.
method Modeling arbitrage dynamics and sensitivity to fee choices, mapping to a random walk with a reward scheme.
result AMMs can maximize value retention by optimizing fee structures.
In this paper, we have proposed a brain signal classification method, which uses eigenvalues of the covariance matrix as features to classify images (topomaps) created from the brain signals. The signals are recorded during the answering of 2D and 3D questions. The system is used to classify the correct and incorrect a…
Machine Learning (ML) models trained on data from multiple demographic groups can inherit representation disparity (Hashimoto et al., 2018) that may exist in the data: the model may be less favorable to groups contributing less to the training process; this in turn can degrade population retention in these groups over …
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…
Privacy policies are legal documents that describe how a website will collect, use, and distribute a user's data. Unfortunately, such documents are often overly complicated and filled with legal jargon; making it difficult for users to fully grasp what exactly is being collected and why. Our solution to this problem is…
A new method converts neural networks to function space for scalable sequential learning.
problem Challenges in gradient-based deep learning for sequential data.
method Dual parameterization of neural networks from weight to function space.
result Efficient scaling, knowledge retention, and new data incorporation.
Paper tackles treatment leakage in text-based causal inference, proposing methods to mitigate bias.
problem Treatment leakage in text-as-confounder applications introduces bias in causal estimates.
method Formal definitions, four text distillation methods (passage removal, classification, salient feature removal, nullspace projection).
result Moderate distillation optimally balances bias reduction against confounder retention.
LCBM model improves image classification without human supervision.
problem Improving interpretability and generalization of unsupervised concept-based models.
method LCBM models concepts as random variables in a Bernoulli latent space, reducing the number of concepts without sacrificing performance.
result LCBM outperforms existing models in generalization and interpretability.
The emergence of mobile games has caused a paradigm shift in the video-game industry. Game developers now have at their disposal a plethora of information on their players, and thus can take advantage of reliable models that can accurately predict player behavior and scale to huge datasets. Churn prediction, a challeng…
Proposes a greedy algorithm for telecom offers to retain subscribers.
problem Maximizing revenue while preventing churn in telecom subscribers.
method Combinatorial algorithm for offer optimization under heterogeneous incentives.
result Efficient and accurate solution for large subscriber bases.
CogScale benchmarks AI architectures for sequential processing.
problem Evaluating AI architectures' ability to process sequential information efficiently.
method 14 scalable synthetic tasks designed to isolate cognitive and memory abilities at different scales.
result Attention mechanisms and modern state-space models consistently maintain high performance as task difficulty scales.
A framework combining HSMM and survival analysis for lifecycle-oriented mobility analysis.
problem Understanding individual metro usage dynamics over multi-year horizons.
method A state-based lifecycle modeling framework integrating HSMM and discrete-time survival analysis.
result Identification of interpretable mobility states, transition dynamics, and state-dependent exit and re-entry processes.
Firm growth process in the developing economies is known to produce divergence in their growth path giving rise to bimodality in the size distribution. Similar bimodality has been observed in wealth distribution as well. Here, we introduce a modified kinetic exchange model which can reproduce such features. In particul…
Optimal Insurance to Minimize the Probability of Ruin: Inverse Survival Function Formulationq-fin.RM
Optimal insurance minimizes ruin probability with non-decreasing functions.
problem Minimizing ruin probability with insurance premiums and non-decreasing functions.
method Reformulated problem with inverse survival function as control variable.
result Deductible insurance with maximum limit is optimal.
This paper converts NACE classification into embeddings to preserve hierarchical structure.
problem Preserving hierarchical structure in NACE classification while reducing dimensions.
method Custom metrics for hierarchical structure retention; state-of-the-art models and dimensionality reduction.
result The proposed approach effectively preserves hierarchical structures in NACE classification.
Exponential-family harmoniums (EFHs), which extend restricted Boltzmann machines (RBMs) from Bernoulli random variables to other exponential families (Welling et al., 2005), are generative models that can be trained with unsupervised-learning techniques, like contrastive divergence (Hinton et al. 2006; Hinton, 2002), a…
This paper finds efficient algorithms for approximating Markov networks with k-tree topologies.
problem Efficiently approximating Markov networks with complex topologies.
method Developed O(n^{k+1})-time algorithms for finding maximum spanning k-trees (MSkT) that retain certain subgraphs.
result Optimal approximation of Markov networks with k-tree topology is achieved in polynomial time.
Beta Survival Modelscs.LG
This article analyzes the problem of estimating the time until an event occurs, also known as survival modeling. We observe through substantial experiments on large real-world datasets and use-cases that populations are largely heterogeneous. Sub-populations have different mean and variance in their survival rates requ…
The aim of this paper is to introduce an insurance model allowing reinsurance and dividend payment. Our model deals with several homogeneous contracts and takes into account the legislation regarding the provisions to be justified by the insurance companies. This translates into some restriction on the (maximal) number…