mlsanityData to 14 Oct 2026

Counter-Empirical Attacking based on Adversarial Reinforcement Learning for Time-Relevant Scoring System

arXiv 2311.05144 ↗First posted 9 Nov 2023cs.LG cs.SEcited by 3

Not on the map. Why?

Abstract (arXiv)

Scoring systems are commonly seen for platforms in the era of big data. From credit scoring systems in financial services to membership scores in E-commerce shopping platforms, platform managers use such systems to guide users towards the encouraged activity pattern, and manage resources more effectively and more efficiently thereby. To establish such scoring systems, several "empirical criteria" are firstly determined, followed by dedicated top-down design for each factor of the score, which usually requires enormous effort to adjust and tune the scoring function in the new application scenario. What's worse, many fresh projects usually have no ground-truth or any experience to evaluate a reasonable scoring system, making the designing even harder. To reduce the effort of manual adjustment of the scoring function in every new scoring system, we innovatively study the scoring system from the preset empirical criteria without any ground truth, and propose a novel framework to improve the system from scratch. In this paper, we propose a "counter-empirical attacking" mechanism that can generate "attacking" behavior traces and try to break the empirical rules of the scoring system. Then an adversarial "enhancer" is applied to evaluate the scoring system and find the improvement strategy. By training the adversarial learning problem, a proper scoring function can be learned to be robust to the attacking activity traces that are trying to violate the empirical criteria. Extensive experiments have been conducted on two scoring systems including a shared computing resource platform and a financial credit system. The experimental results have validated the effectiveness of our proposed framework.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 7 of its 33 references that are in the map. First posted on arXiv 9 Nov 2023.

Builds on

7 of 33 references.

References · 7

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  3. 2017Soft-DTW: a Differentiable Loss Function for Time-Seriescited by 271
  4. 2021Fairness in Credit Scoring: Assessment, Implementation and Profit Implicationscited by 65
  5. 2018Parametrized Deep Q-Networks Learning: Reinforcement Learning with Discrete-Continuous Hybrid Action Spacecited by 58
  6. 2020Robust Spammer Detection by Nash Reinforcement Learningcited by 17
  7. 2019Social Media-based User Embedding: A Literature Reviewcited by 14

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 1.

3 papers.