SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2405.11377 · ICML · 2024

Causal Customer Churn Analysis with Low-rank Tensor Block Hazard Model

Chenyin Gao, Zhiming Zhang, Shu Yang

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 2 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
Gaochenyin/Low-Rank-Tensor-Block-Hazard-Model — 1 of 2
FunctionStatusWhere it lives
get_theta_binary Ran Gaochenyin/Low-Rank-Tensor-Block-Hazard-Model/utils.py
pointer only (licence: NONE) · get_code("0cbda9a71cffde5e")
TensorCompletionCovariateBinary Not yet run Gaochenyin/Low-Rank-Tensor-Block-Hazard-Model/utils.py
pointer only (licence: NONE) · get_code("d1959404d6846612")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

This study introduces an innovative method for analyzing the impact of various interventions on customer churn, using the potential outcomes framework. We present a new causal model, the tensorized latent factor block hazard model, which incorporates tensor completion methods for a principled causal analysis of customer churn. A crucial element of our approach is the formulation of a 1-bit tensor completion for the parameter tensor. This captures hidden customer characteristics and temporal elements from churn records, effectively addressing the binary nature of churn data and its time-monotonic trends. Our model also uniquely categorizes interventions by their similar impacts, enhancing the precision and practicality of implementing customer retention strategies. For computational efficiency, we apply a projected gradient descent algorithm combined with spectral clustering. We lay down the theoretical groundwork for our model, including its non-asymptotic properties. The efficacy and superiority of our model are further validated through comprehensive experiments on both simulated and real-world applications.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2405.11377")
get_code_for_paper("2405.11377")
have("2405.11377")

Connect an agent — have() is free.