On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for Fintech Applications

• URL: http://arxiv.org/abs/2311.00964v3
• Date: Thu, 27 Jun 2024 19:07:30 GMT
• Title: On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for Fintech Applications
• Authors: Chengyao Wen, Yin Lou,
• Abstract summary: Rules are widely used in institutions to make fraud prevention decisions. This paper focuses on improving the flexibility and efficacy of a two-stage framework for rule mining.
• Score: 0.949959422062959
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rules are widely used in Fintech institutions to make fraud prevention decisions, since rules are highly interpretable thanks to their intuitive if-then structure. In practice, a two-stage framework of fraud prevention decision rule set mining is usually employed in large Fintech institutions; Stage 1 generates a potentially large pool of rules and Stage 2 aims to produce a refined rule subset according to some criteria (typically based on precision and recall). This paper focuses on improving the flexibility and efficacy of this two-stage framework, and is concerned with finding high-quality rule subsets in a bi-objective space (such as precision and recall). To this end, we first introduce a novel algorithm called SpectralRules that directly generates a compact pool of rules in Stage 1 with high diversity. We empirically find such diversity improves the quality of the final rule subset. In addition, we introduce an intermediate stage between Stage 1 and 2 that adopts the concept of Pareto optimality and aims to find a set of non-dominated rule subsets, which constitutes a Pareto front. This intermediate stage greatly simplifies the selection criteria and increases the flexibility of Stage 2. For this intermediate stage, we propose a heuristic-based framework called PORS and we identify that the core of PORS is the problem of solution selection on the front (SSF). We provide a systematic categorization of the SSF problem and a thorough empirical evaluation of various SSF methods on both public and proprietary datasets. On two real application scenarios within Alipay, we demonstrate the advantages of our proposed methodology over existing work.

Related papers

• A-FedPD: Aligning Dual-Drift is All Federated Primal-Dual Learning Needs [57.35402286842029]
  We propose a novel Aligned Dual Dual (A-FedPD) method, which constructs virtual dual align global and local clients. We provide a comprehensive analysis of the A-FedPD method's efficiency for those protracted unicipated security consensus.
  arXiv  Detail & Related papers  (2024-09-27T17:00:32Z)
• Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning [62.81324245896717]
  We introduce an exploration-agnostic algorithm, called C-PG, which exhibits global last-ite convergence guarantees under (weak) gradient domination assumptions. We numerically validate our algorithms on constrained control problems, and compare them with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-07-15T14:54:57Z)
• Two-stage Conformal Risk Control with Application to Ranked Retrieval [1.8481458455172357]
  Two-stage ranked retrieval is a significant challenge for machine learning systems. We propose an integrated approach to control the risk of each stage by jointly identifying thresholds for both stages. Our algorithm further optimize for a weighted combination of prediction set sizes across all feasible thresholds, resulting in more effective prediction sets.
  arXiv  Detail & Related papers  (2024-04-27T03:37:12Z)
• SoFA: Shielded On-the-fly Alignment via Priority Rule Following [90.32819418613407]
  This paper introduces a novel alignment paradigm, priority rule following, which defines rules as the primary control mechanism in each dialog. We present PriorityDistill, a semi-automated approach for distilling priority following signals from simulations to ensure robust rule integration and adherence.
  arXiv  Detail & Related papers  (2024-02-27T09:52:27Z)
• Cross-Domain Few-Shot Segmentation via Iterative Support-Query Correspondence Mining [81.09446228688559]
  Cross-Domain Few-Shots (CD-FSS) poses the challenge of segmenting novel categories from a distinct domain using only limited exemplars. We propose a novel cross-domain fine-tuning strategy that addresses the challenging CD-FSS tasks.
  arXiv  Detail & Related papers  (2024-01-16T14:45:41Z)
• Social Mechanism Design: A Low-Level Introduction [31.564788318133264]
  We show that agents have preferences over both decision outcomes and the rules or procedures used to make decisions. We identify simple, intuitive preference structures at low levels that can be generalized to form the building blocks of preferences at higher levels. We analyze algorithms for acceptance in two different domains: asymmetric dichotomous choice and constitutional amendment.
  arXiv  Detail & Related papers  (2022-11-15T20:59:34Z)
• Optimizing Two-way Partial AUC with an End-to-end Framework [154.47590401735323]
  Area Under the ROC Curve (AUC) is a crucial metric for machine learning. Recent work shows that the TPAUC is essentially inconsistent with the existing Partial AUC metrics. We present the first trial in this paper to optimize this new metric.
  arXiv  Detail & Related papers  (2022-06-23T12:21:30Z)
• Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
  Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains. We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
  arXiv  Detail & Related papers  (2021-12-12T06:11:16Z)
• Unsupervised Domain Adaptation via Discriminative Manifold Propagation [26.23123292060868]
  Unsupervised domain adaptation is effective in leveraging rich information from a labeled source domain to an unlabeled target domain. The proposed method can be used to tackle a series of variants of domain adaptation problems, including both vanilla and partial settings.
  arXiv  Detail & Related papers  (2020-08-23T12:31:37Z)
• Unsupervised Domain Adaptation via Discriminative Manifold Embedding and Alignment [23.72562139715191]
  Unsupervised domain adaptation is effective in leveraging the rich information from the source domain to the unsupervised target domain. The hard-assigned pseudo labels on the target domain are risky to the intrinsic data structure. A consistent manifold learning framework is proposed to achieve transferability and discriminability consistently.
  arXiv  Detail & Related papers  (2020-02-20T11:06:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.