IP Library Granted Patent US 12,499,375
Granted Patent B2
US 12,499,375 · App. 17/163,398 · Granted Dec 16, 2025

Generating recommendations using adversarial counterfactual learning and evaluation

Inventors: Da Xu (San Jose, CA); Chuanwei Ruan (Santa Clara, CA); Sushant Kumar (Sunnyvale, CA); Evren Korpeoglu (San Jose, CA); Kannan Achan (Saratoga, CA)
Assignee: Walmart Apollo, LLC
G06N5/04G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,499,375
App. No.
17/163,398
Granted
Dec 16, 2025
Kind
B2
Abstract

A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, perform certain acts. The acts can include obtaining training data. The acts also can include training candidate recommendation models and an adversarial exposure model using the training data. The acts additionally can include generating recommendations based on a selected recommendation model of the candidate recommendation models. Other embodiments are described.

Claims (59)

1 . A system comprising:

one or more processors; and

one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to:

generate first-stage click data by mimicking a generating mechanism of a real-world dataset;

obtain training data based on the first-stage click data and based on controlling an exposure mechanism in a second stage;

generate optimized machine learning models and a most adversarial exposure model by training a plurality of candidate recommendation models and an adversarial exposure model using the training data after obtaining the training data based on the first-stage click data and based on controlling the exposure mechanism in the second stage,

wherein the plurality of candidate recommendation models comprises multiple different families of machine learning models,

wherein training the adversarial exposure model comprises using sequential optimization, with two-timescale gradient ascent descent schema to optimize a minimax objective for the adversarial exposure model, by taking turns with model updating, and

wherein training the adversarial exposure model terminates when a validation metric changes less than a predetermined threshold after a predetermined number of consecutive epochs;

select, from the optimized machine learning models, a best optimized machine learning model by using the most adversarial exposure model to evaluate the optimized machine learning models on evaluation data; and

generate, based on receiving a request from a front-end component, recommendations by using the best optimized machine learning model.

2 . The system of claim 1 , wherein the training data comprise personalized recommendation data and item recommendation data.

3 . The system of claim 2 , wherein the personalized recommendation data comprise first records each comprising a respective user feature, a respective view sequence, a respective item feature, a respective target purchase, and a respective label.

4 . The system of claim 2 , wherein the item recommendation data comprise second records each comprising a respective anchor item, a respective candidate item, a respective item feature, and a respective label.

5 . The system of claim 1 , wherein the plurality of candidate recommendation models comprise a linear regression recommendation model, a neural network recommendation model, and a matrix factorization recommendation model.

6 . The system of claim 5 , wherein training the plurality of candidate recommendation models and the adversarial exposure model further comprises:

performing the two-timescale gradient ascent descent to optimize the minimax objective for each of the plurality of candidate recommendation models.

7 . The system of claim 1 , wherein, to select the best optimized machine learning model, the one or more processors are to:

perform an evaluation of the plurality of candidate recommendation models, as trained, using the adversarial exposure model, as trained.

8 . The system of claim 1 , wherein, to generate the recommendations, the one or more processors are to:

construct a recall set of candidate recommendation pairs;

generate a ranking of candidate recommendation pairs in the recall set using the best optimized machine learning model; and

determine the recommendations based on the ranking.

9 . The system of claim 1 , wherein the one or more processors are further to:

when a user requests to view an anchor item, sending one or more of the recommendations to be displayed to the user.

10 . A method implemented via execution of computing instructions configured to run at one or more processors, the method comprising:

generating first-stage click data by mimicking a generating mechanism of a real-world dataset;

obtaining training data based on the first-stage click data and based on controlling an exposure mechanism;

generating optimized machine learning models and a most adversarial exposure model by training a plurality of candidate recommendation models and an adversarial exposure model using the training data after obtaining the training data based on the first-stage click data and based on controlling the exposure mechanism,

wherein the plurality of candidate recommendation models comprises multiple different families of machine learning models,

wherein training the adversarial exposure model comprises using sequential optimization, with two-timescale gradient ascent descent schema to optimize a minimax objective for the adversarial exposure model, by taking turns with model updating, and

wherein training the adversarial exposure model terminates when a validation metric changes less than a predetermined threshold after a predetermined number of consecutive epochs;

selecting, from the optimized machine learning models, a best optimized machine learning model by using the most adversarial exposure model to evaluate the optimized machine learning models on evaluation data; and

generating, based on receiving a request from a front-end component, recommendations by using the best optimized machine learning model.

11 . The method of claim 10 , wherein the training data comprise personalized recommendation data and item recommendation data.

12 . The method of claim 11 , wherein the personalized recommendation data comprise first records each comprising a respective user feature, a respective view sequence, a respective item feature, a respective target purchase, and a respective label.

13 . The method of claim 11 , wherein the item recommendation data comprise second records each comprising a respective anchor item, a respective candidate item, a respective item feature, and a respective label.

14 . The method of claim 10 , wherein the plurality of candidate recommendation models comprise a linear regression recommendation model, a neural network recommendation model, and a matrix factorization recommendation model.

15 . The method of claim 14 , wherein training the plurality of candidate recommendation models and the adversarial exposure model further comprises:

performing the two-timescale gradient ascent descent to optimize the minimax objective for each of the plurality of candidate recommendation models.

16 . The method of claim 10 , wherein selecting the best optimized machine learning model comprises:

performing an evaluation of the plurality of candidate recommendation models, as trained, using the adversarial exposure model, as trained; and

selecting the best optimized machine learning model based on the evaluation.

17 . The method of claim 10 , wherein generating the recommendations comprises:

constructing a recall set of candidate recommendation pairs;

generating a ranking of candidate recommendation pairs in the recall set using the best optimized machine learning model; and

determining the recommendations based on the ranking.

18 . The method of claim 10 , further comprising:

when a user requests to view an anchor item, sending one or more of the recommendations to be displayed to the user.

19 . A non-transitory computer-readable medium storing computing instructions that, when executed on a processor, causes the processor to perform operations comprising:

generating first-stage click data by mimicking a generating mechanism of a real-world dataset;

obtaining training data based on the first-stage click data and based on controlling an exposure mechanism;

generating optimized machine learning models and a most adversarial exposure model by training a plurality of candidate recommendation models and an adversarial exposure model using the training data after obtaining the training data based on the first-stage click data and based on controlling the exposure mechanism,

wherein the plurality of candidate recommendation models comprises multiple different families of machine learning models,

wherein training the adversarial exposure model comprises using sequential optimization, with two-timescale gradient ascent descent schema to optimize a minimax objective for the adversarial exposure model, by taking turns with model updating, and

wherein training the adversarial exposure model terminates when a validation metric changes less than a predetermined threshold after a predetermined number of consecutive epochs;

selecting, from the optimized machine learning models, a best optimized machine learning model by using the most adversarial exposure model to evaluate the optimized machine learning models on evaluation data; and

generating, based on receiving a request from a front-end component, recommendations by using the best optimized machine learning model.

20 . The non-transitory computer-readable medium of claim 19 , wherein the training data comprise personalized recommendation data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 27, 2021
From: XU, DA; RUAN, CHUANWEI; KUMAR, SUSHANT; KORPEOGLU, EVREN; ACHAN, KANNAN
To: WALMART APOLLO, LLC
Reel/Frame 055744/0076 →
Continuity (1)
Related Publication 20220253721A1 · Aug 11, 2022
References Cited (62)
US 8606608B2 · Bottou et al. · 2013 [cited by applicant]
US 20190026274A1 · Deng et al. · 2019 [cited by applicant]
US 20200327600A1 · Mlmazcoban et al. · 2020 [cited by applicant]
US 20220230089A1 · Peraud · 2022 [cited by examiner]
KR 20200107389A · 2020 [cited by examiner]
Zhongchuan Sun et al., “APL: Adversarial Pairwise Learning for Recommender Systems”, Expert Systems with Applications vol. 118, 2019, pp. 573-584, https://doi.org/10.1016/j.eswa.2018.10.024. (Year: 2019). [cited by examiner]
Mi Luo et al., Meta-Selector: Meta-Learning for Recommendation with User-Level Adaptive Model Selection, Proceedings of The Web Conference 2020 (WWW '20). Association for Computing Machinery, pp. 2507-2513, https://doi.… [cited by examiner]
Kim et al., “Rating Augmentation and Item Recommendation Method and System Based on Generative Adversarial Networks”, English machine translation of KR20200107389A, Clarivate Analytics, 2023, EP1-13 (Year: 2023). [cited by examiner]
Heusel, Martin, et al. “Gans trained by a two time-scale update rule converge to a local nash equilibrium.” Advances in neural information processing systems 30 (2017). (Year: 2017). [cited by examiner]
Bai, X., Guan, J., and Wang, H., “Model-Based Reinforcement Learning With Adversarial Training for Online Recommendation,” 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, 12 p… [cited by applicant]
Ding, J., et al., “Reinforced Negative Sampling for Recommendation With Exposure Data,” Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19), pp. 2230-2236 2019. [cited by applicant]
Xu, D., et al., “Adversarial Counterfactual Learning and Evaluation for Recommender System,” 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, Canada, 25 pgs. 2020. [cited by applicant]
Agarwal, A., Zaitsev, I., and Joachims, T., “Counterfactual Learning-to-Rank for Additive Metrics and Deep Models,” Preprint, 2018, 10 pgs. 2018. [cited by applicant]
Ai, Q., et al. “Unbiased Learning to Rank With Unbiased Propensity Estimation,” arXiv:1804.05938v2 [cs.IR], Apr. 23, 2018, 10 pgs. Apr. 23, 2018. [cited by applicant]
Austin, P., “An Introduction to Propensity Score Methods for Reducing the Effects of Confounding in Observational Studies,” Multivariate Behavioral Research, 46:3, 399-424, DOI: 10.1080/00273171.2011.568786, 27 pgs. 201… [cited by applicant]
Austin, P. and Stuart, E., “Moving Towards Best Practice When Using Inverse Probability of Treatment Weighting (IPTW) Using the Propensity Score to Estimate Casual Treatment Effects in Observational Studies,” Statistics… [cited by applicant]
Cheng, H., et al., “Wide & Deep Learning for Recommender Systems,” DLRS '16, Sep. 15, 2016, Boston, MA, 4 pgs. Sep. 15, 2016. [cited by applicant]
Covington, P., Adams, J., and Sargin E., “Deep Neural Networks for YouTube Recommendatoins,” RecSys '16, Sep. 15-19, 2016, Boston, MA, DOI: http://dx.doi.org/10.1145/2959100.2959190, pp. 191-198 Sep. 15, 2016. [cited by applicant]
Dacrema, M., Cremonesi, P., and Jannach, D., “Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches,” arXiv:1907.06902v3 [CS.IR] Aug. 16, 2019, 10 pgs. Aug. 16, 2019. [cited by applicant]
Franks, A., D'Amour, A., and Feller, A., “Flexible Sensitivity Analysis for Observational Studies Without Observable Implications,” arXiv:1809.00399v3 [stat.ME] Jan. 14, 2019, 38 pgs. Jan. 14, 2019. [cited by applicant]
Franks, A., Airoldi, E., and Rubin, D., “Non-Standard Conditionally Specified Models for Non-Ignorable Missing Data,” arXiv:1603.06045v1 [stat.ME] Mar. 19, 2016, 41 pgs. Mar. 19, 2016. [cited by applicant]
Gao, R., Chen, X., and Kleywegt, A., “Wasserstein Distributional Robustness and Regularization,” arXiv:1712.06050v3, Oct. 3, 2020, 44 pgs. Dec. 17, 2017. [cited by applicant]
Goodfellow, I., “NIPS 2016 Tutorial: Generative Adversarial Networks,” arXiv:1701.00160v4 [cs.LG] Apr. 3, 2017, 57 pgs. Apr. 3, 2017. [cited by applicant]
He, X., et al., “Neural Collaborative Filtering,” arXiv:1708.05031v2 {cs.IR] Aug. 26, 2017, 10 pgs. Aug. 26, 2017. [cited by applicant]
He, X., He, Z., Du, X., and Chua, T., “Adversarial Personalized Ranking for Recommendation,” arXiv:1808.03908v1 [cs.IR] Aug. 12, 2018, 10 pgs. Aug. 12, 2018. [cited by applicant]
Hernandez-Lobato, J.M., Houlsby, N., and Ghahramani, Z., “Probabilistic Matrix Factorization With Non-Random Missing Data,” Proceedings of the 31st International Conference on Machine Learning, Beijing, China, 2014, JML… [cited by applicant]
Heusel, M., et al., “GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium,” 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, 12 pgs. 2017. [cited by applicant]
Hirano, K., and Imbens, G.W., “Estimation of Casual Effects Using Propensity Score Weighting: An Application to Data on Right Heart Catheterization,” Health Services & Outcomes Research Methodology 2:259-278, 2001, 2002… [cited by applicant]
Jin, C., Netrapalli, P., and Jordan, M.I., “What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?,” Proceedings of the 37th Internatoinal Conference on Machine Learning, Online, PMLR 119, 2020, 10 pgs. … [cited by applicant]
Joachims, T., Swaminathan, A., and Schnabel, T., “Unbiased Learning-to-Rank With Biased Feedback,” WSDM 2017, Feb. 6-10, 2017, Cambridge, United Kingdom, DOI: http://dx.doi.org/10.1145/3018661.3018669, pp. 781-789 Feb. … [cited by applicant]
Kallus, N., “DeepMatch: Balancing Deep Covariate Representations for Casual Inference Using Adversarial Training,” Proceedings of the 37th International Conference on Machine Learning, Vienna, Austria, PMLR 119, 2020, 1… [cited by applicant]
Kang, W. and McAuley, J., “Self-Attentive Sequential Recommendatoin,” arXiv:1808.09781v1 [cs.IR] Aug. 20, 2018, 10 pgs. Aug. 20, 2018. [cited by applicant]
Li, L., et al., “A Contextual-Bandit Approach to Personalized News Article Recommendation, ” arXiv:1003.0146v2 [cs.LG] Mar. 1, 2012, originally in WWW 2010, Apr. 26-30, 2010, Raleigh, NC, USA, 10 pgs. Apr. 26, 2020. [cited by applicant]
Liang, D., et al., “Casual Inference for Recommendatoin.” 2016, 10 pgs. 2016. [cited by applicant]
Liang, D., et al., “Modeling User Exposure in Recommendation,” arXiv:1510.07025v2 [stat.ML] Feb. 4, 2016, 11 pgs. Feb. 4, 2016. [cited by applicant]
Panaretos V.M. and Zemel, Y., “Statistical Aspects of Wasserstein Distances,” arXiv:1806.05500v3 [stat.ME], Apr. 9, 2019, 37 pgs. Apr. 9, 2019. [cited by applicant]
Pearl, J., “Causal Inference in Statistics: An Overview,” Statistical Surveys, vol. 3 (2009) pp. 96-146, DOI: 10.1214/09-SS057, 51 pgs. Sep. 2009. [cited by applicant]
Rahimian, H. and Mehrotra, S., “Distributionally Robust Optimization: A Review,” arXiv:1908.05659v1 [math.OC] Aug. 13, 2019, 90 pgs. Aug. 13, 2019. [cited by applicant]
Ratliff, L.J., Burden, S.A., and Sastry, S.S., “Characterization and Computation of Local Nash Equilibria in Continuous Games,” Trust Conference, Oct. 3, 2013, 28 pgs. Oct. 3, 2013. [cited by applicant]
Rendle, S., et al., “Neural Collaborative Filtering vs. Matrix Factorization Revisited,” RecSys '20, Sep. 22-26, 2020, Virtual Event, Brazil, https://doi.org/10.1145/3383313.3412488, pp. 240-248 Sep. 22, 2020. [cited by applicant]
Rosenbaum, P.R. and Rubin, D.B., “The Central Role of the Propensity Score in Observational Studies for Casual Effects,” Biometrika (1983), 70, 1, pp. 41-55, downloaded from https://academic.oup.com/biomet/article/70/1/… [cited by applicant]
Rosenbaum, P.R., “Design of Observational Studies,” Springer Series in Statistics, published by Springer Science +Business Media, LLC 2010, DOI 10.1007/978-1-4419-1213-8, 382 pgs. 2010. [cited by applicant]
Saito, Y., et al., Unbiased Recommender Learning From Missing-Not-At-Random Implicit Feedback, arXiv:1909.03601v3 [stat.ML] Feb. 9, 2020, 9 pgs. Feb. 9, 2020. [cited by applicant]
Schafer, J.B., et al., “Collaborative Filtering Recommender Systems,” P. Brusilovsky, A. Kobsa, and W. Nejdl (Eds): The Adaptive Web, LNCS 4321, pp. 291-324, 2007, published by Springer-Verlag Berlin Heidelberg Jan. 200… [cited by applicant]
Schnabel, T., et al., “Recommendations as Treatments: Debiasing Learning and Evaluation,” Proceedings of the 33rd Int'l Conference on Machine Learning, New York, NY USA, 2016, JMLR: W7CP vol. 48, 10 pgs. 2016. [cited by applicant]
Shafieezadeh-Abadeh, S., et al., “Regularization via Mass Transportation,” Journal of Machine Learning Research 20 (2019) pp. 1-68 Oct. 17, 2019. [cited by applicant]
Tramer, F., et al., “Ensemble Adversarial Training: Attacks and Defenses,” arXiv:1705.07204v5 [stat.ML] Apr. 26, 2020, published as a conference paper at ICLR in 2018, 22 pgs. 2018. [cited by applicant]
Villani, C., “Optimal Transport, Old and New,” published by Springer, 2008—998 pgs. Jun. 13, 2008. [cited by applicant]
Wang, J., et al., “IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models,” arXiv:1705.10513v2 [cs.UR] Feb. 20, 2018, 12 pgs. Feb. 22, 2018. [cited by applicant]
Wang, M., et al., “Modeling Dynamic Missingness of Implicit Feedback for Recommendation,” Adv Neural Inf Process Syst. Dec. 2018; vol. 31; pp. 6669-6678 Dec. 2018. [cited by applicant]
Xie, C., et al., “Feature Denoising for Improving Adversarial Robustness,” arXiv:1812.03411v2 [cs.CV] Mar. 25, 2019, 9 pgs. Mar. 25, 2019. [cited by applicant]
Xu, D., et al., “Self-Attention With Functional Time Representation Learning,” 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, 11 pgs. 2019. [cited by applicant]
Yang, L., et al., “Unbiased Offline Recommender Evaluation for Missing-Not-At Random Implicity Feedback,” RecSys 18, Oct. 2-7, 2018, Vancouver, BC, Canada, https://doi.org/10.1145/3240323.3240355, pp. 279-287 Oct. 2, 20… [cited by applicant]
Ying, R., et al., “Graph Convolutional Neural Networks for Web-Scale Recommender Systems,” arXiv:1806.01973v1 [cs.IR] Jun. 6, 2018, 10 pgs. Jun. 6, 2018. [cited by applicant]
Yoon, J., Jordon, J., and van der Schaar, M., “GANITE: Estimation of Individualized Treatment Effects Using Generative Adversarial Nets,” Published as a conference paper at ICLR 2018, 22 pgs. 2018. [cited by applicant]
Zhang, S., et al., “Deep Learning Based Recommender System: A Survey and New Perspectives,” ACM Comput. Surv. 1, 1, Article 1 (Jul. 2018), 35 pgs. arXiv:1707.07435v7 [cs.IR] Jul. 10, 2019 Jul. 10, 2019. [cited by applicant]
Zheng, G., et al., “DRN: A Deep Reinforcement Learning Framework for News Recommendation,” WWW 2018, Apr. 23-27, 2018, Lyon, France, https://doi.org/10.1145/3178876.3185994, pp. 167-176 Apr. 23, 2018. [cited by applicant]
Zhou, G., et al., “Deep Interest Network for Click-Through Rate Prediction,” arXiv:1706.06978v4 [stat.ML] Sep. 13, 2018, 9 pgs. Sep. 13, 2018. [cited by applicant]
Morgan, S.L. and Winship, C., “Counterfactuals and Causal Inference—Methods and Principles for Social Research,” Cambridge University Press, 2007, 335 pgs. 2007. [cited by applicant]
Prasad, H.L., Prashanth, L.A., and Bhatnagar, S., “Two-Timescale Algorithms for Learning Nash Equilibria in General-Sum Stocastic Games,” Proceedings of the 14th International Conference on Autonomous Agents and Multiag… [cited by applicant]
Terkelsen, F., “Some Minimax Theorems,” Math. Scand. 31 (1972), pp. 405-413 1972. [cited by applicant]
Talagrand, M., “Upper and Lower Bounds for Stochastic Processes,” Springer-Verlag, 163 pgs. Jun. 8, 2021. [cited by applicant]