Pith. sign in

REVIEW 4 major objections 3 minor 1 cited by

Towards Generalizable Safety in Crowd Navigation via Conformal Uncertainty Handling

T0 review · 4 major / 3 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Crowd navigation gets safer by feeding robot policies calibrated uncertainty bounds from conformal inference, the abstract claims.

desk verdict The uploaded manuscript body is a live-streaming dataset paper, not the crowd-navigation paper promised in the abstract, so the reported safety gains are unsupported by anything in the submission. read the letter →

arxiv 2508.05634 v1 pith:SPLZGD76 submitted 2025-08-07 cs.RO cs.AIcs.CVcs.LGcs.SYeess.SY

Jianpeng Yao , Xiaopan Zhang , Yu Xia , Zejin Wang , Amit K. Roy-Chowdhury , Jiachen Li This is my paper
classification cs.ROcs.AIcs.CVcs.LGcs.SYeess.SY
keywords crowdnavigationconformalinferenceuncertaintyhandlingconstrainedreinforcementlearningdistributionshiftpedestriantrajectorypredictionrobotsafetyadaptive
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper's abstract claims that a crowd-navigation robot can stay safe under distribution shifts if its policy is fed uncertainty estimates for each pedestrian rather than raw predictions alone. The proposed method augments the robot's observations with adaptive conformal inference uncertainty bounds and uses constrained reinforcement learning to keep the robot out of regions where predictions are unreliable. In the in-distribution benchmark the abstract reports a 96.93% success rate, 8.80 percentage points above prior baselines, with 3.72 times fewer collisions and 2.43 times fewer intrusions into pedestrians' future paths. Under shifted velocities, changed pedestrian policies, and transitions from individual to group motion, the abstract claims the same approach degrades far less than baselines, and a real-robot deployment is reported. The uploaded manuscript body, however, is a different paper on a live-streaming recommendation dataset, so the claims rest entirely on the abstract.

What carries the argument

The key mechanism is the coupling of adaptive conformal inference with constrained reinforcement learning. Adaptive conformal inference produces a per-pedestrian uncertainty bound on trajectory predictions, and the constrained RL policy treats that bound as a safety constraint rather than as mere side information. The mechanism is meant to work by making the robot slow down, stop, or reroute when the predicted uncertainty in a nearby pedestrian's motion is high, and the adaptive component is meant to keep the bounds calibrated as the environment changes.

What would settle it

Run the same benchmark with the conformal uncertainty feature replaced by the pedestrian predictor's own variance estimate or by a fixed uncertainty constant: if success rate and collision counts stay roughly unchanged, the conformal bounds carry no causal safety benefit. A second decisive check is to measure empirical coverage of the claimed uncertainty intervals under the closed-loop policy and confirm it remains near the nominal level when pedestrian behavior shifts.

Watch

Extended reading notes

Core claim

The central claim, as stated in the abstract, is that accounting for prediction uncertainty is what makes a crowd-navigation policy robust to distribution shifts. The proposed system generates pedestrian trajectory prediction uncertainty with adaptive conformal inference, appends those uncertainty estimates to the robot's observations, and then trains the robot's policy with constrained reinforcement learning so that the uncertainty signals actively regulate the agent's actions. The abstract reports that this yields a 96.93% success rate in the in-distribution environment, over 8.80% higher than the previous state-of-the-art baselines, with more than 3.72 times fewer collisions and 2.43 time

Load-bearing premise

The load-bearing premise is that the adaptive conformal uncertainty estimates stay calibrated and informative even while the robot's own policy is actively reacting to them, so that the safety constraints they impose are meaningful rather than empty; the manuscript body provides no argument or experiment showing this.

Editorial extensions

If this is right

  • If the abstract's claims hold, uncertainty-aware observation augmentation becomes a direct recipe for making learned crowd navigation robust to distribution shifts without retraining on new pedestrian behaviors.
  • The 3.72x reduction in collisions and 2.43x reduction in future-trajectory intrusions suggest that most of the safety gain comes from avoiding high-uncertainty regions, not from better point predictions.
  • The claimed robustness across velocity, policy, and group-dynamics shifts points toward a general principle: safe navigation policies should be trained on uncertainty features, not just on predicted trajectories.
  • Deployment on a real robot implies the uncertainty bounds can be computed online at control rates, making conformal inference a practically usable safety layer for mobile robots.
  • The method, as described, would apply to any pedestrian-prediction backbone, since the uncertainty estimate is an augmentation of the observation rather than a replacement of the predictor.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the claims are accurate, a testable extension is to replace adaptive conformal inference with other calibration schemes and compare whether the safety gains persist; the abstract's framing suggests the calibration feedback is the active ingredient, not the specific algorithm.
  • A subtle consequence the abstract does not address: because the RL policy actively reacts to the uncertainty signal, the conformal coverage guarantee is violated in principle, so the reported safety margins may depend on how mild the distribution shifts actually are.
  • The reported 2.43x reduction in intrusions into ground-truth future trajectories implies the method is not just avoiding instantaneous collisions but is also avoiding paths where pedestrians are later predicted to be, which could be reformulated as a safety metric for evaluating any crowd navigation policy.
  • The real-robot result, if reproducible, suggests that uncertainty-constrained RL could generalize beyond pedestrians to other dynamic obstacles, such as cyclists or drones, where prediction uncertainty is large and non-stationary.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The submission, arXiv:2508.05634 (cs.RO), is presented with an abstract and title claiming a crowd navigation method that uses adaptive conformal inference to produce uncertainty estimates, which are then fed into a constrained reinforcement learning policy to improve safety and out-of-distribution robustness. The abstract reports specific quantitative results (96.93% success, >8.80% over state-of-the-art, 3.72x fewer collisions, 2.43x fewer intrusions) and mentions real-robot deployment. However, the manuscript body is an entirely different paper: 'KuaiLive: A Real-time Interactive Dataset for Live Streaming Recommendation,' a SIGIR '26 dataset paper about a live-streaming recommendation dataset. The body contains no crowd navigation, no conformal inference, no reinforcement learning, no simulation experiments, and no robot deployment. None of the abstract's claims are supported by the submitted text.

Significance. If the claimed method and results were actually present and correct, they would represent a meaningful contribution to safe crowd navigation, particularly the use of conformal uncertainty estimates within constrained RL to handle distribution shifts. The quantitative improvements over state-of-the-art baselines, if reproducible, would be practically relevant. However, the manuscript as submitted does not contain the claimed work at all. There is no method, no experiment, no derivation, and no result to evaluate. The significance of the submission is therefore entirely unrealized; the paper cannot be assessed on its merits because the content is missing.

major comments (4)
  1. [Abstract vs. Sections 1-7] The manuscript body is the KuaiLive dataset paper on live-streaming recommendation. Sections 1, 3, and 7 describe a dataset from Kuaishou, with user/streamer/room statistics, data analysis, and recommendation tasks. There is no mention of crowd navigation, pedestrians, conformal prediction, constrained reinforcement learning, or robots. The abstract's claimed contribution is completely absent from the body, making the central claim unsupported by the submitted document.
  2. [Abstract (quantitative claims)] The quantitative claims (96.93% success rate, >8.80% over baselines, 3.72x fewer collisions, 2.43x fewer intrusions) appear only in the abstract. There is no experimental protocol, no simulator description, no baseline table, no error bars, and no statistical analysis anywhere in the paper. These numbers cannot be verified or meaningfully reviewed. This is a load-bearing issue: the paper's stated findings have no supporting evidence in the manuscript.
  3. [Page header (arXiv identifier)] The page header identifies the document as 'arXiv:2508.05633v2 [cs.IR]', which is the KuaiLive paper, while the submission is numbered arXiv:2508.05634 (cs.RO). This internal metadata confirms that the uploaded text is a different manuscript from the one described in the abstract. This is not a minor formatting issue; it indicates that the paper under review does not contain the work it claims to present.
  4. [Sections 1-7 (methodological content)] Even setting aside the topic mismatch, there is no method section for the proposed approach. There is no description of the conformal predictor, its calibration set, the uncertainty estimates, the constrained RL objective, the constraint formulation, or the out-of-distribution scenarios (velocity variations, policy changes, group dynamics). The sole method-related statement is the abstract's one-sentence mention of 'augments agent observations with prediction uncertainty estimates... through constrained reinforcement learning.' This is insufficient to assess correctness, novelty, or soundness.
minor comments (3)
  1. [Abstract] The abstract states that code and videos are available at https://gen-safe-nav.github.io/, but the body references the KuaiLive project page (https://imgkkk574.github.io/KuaiLive). No gen-safe-nav resources appear anywhere in the manuscript.
  2. [References] The reference list consists entirely of recommender-systems and live-streaming papers, with no citations to crowd navigation, conformal prediction, or reinforcement learning literature. This is consistent with the body being a different paper, but it further underscores the absence of the claimed research context.
  3. [Title and metadata] The paper's title and subject classification (cs.RO) do not match the content (cs.IR). While this could be an upload or metadata mix-up, as a submitted manuscript it is internally inconsistent.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation found; the crowd-navigation abstract and the uploaded manuscript body describe different papers, so the claims are unverifiable rather than circular.

full rationale

The supplied manuscript body is the SIGIR '26 dataset paper 'KuaiLive: A Real-time Interactive Dataset for Live Streaming Recommendation,' while the abstract describes a crowd-navigation method using adaptive conformal inference and constrained RL. The body contains no method, equations, experiments, or results matching the abstract; it is entirely about a recommendation dataset. Consequently, there is no derivation chain or experimental pipeline to audit for circularity. There are no fitted parameters renamed as predictions, no self-citation carrying the argument, and no equation where an output is identical to an input by construction. The abstract's claims are unsupported by the given document, but unsupported is not circular. Per the hard rule not to claim circularity without quoting a specific reduction, no circular steps can be identified. Score 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The ledger is necessarily based on the abstract alone because the manuscript body is an unrelated paper. No free parameters or invented entities are visible. The listed axioms are the implicit assumptions behind adaptive conformal inference and constrained RL as described in the abstract.

assumptions (3)
  • domain assumption Pedestrian trajectory prediction errors are sufficiently exchangeable (or adaptively handled) that conformal uncertainty estimates provide valid coverage under distribution shift.
    Adaptive conformal inference is invoked in the abstract as the source of uncertainty estimates; its validity requires a calibration assumption that is not stated in the abstract.
  • domain assumption The uncertainty signal remains informative when the robot's RL policy acts on it, i.e., no adverse feedback loop renders the constraints vacuous.
    The policy is trained (via constrained RL) to respond to the uncertainty estimates; the abstract does not state how this feedback is handled.
  • domain assumption Simulation and real-robot test conditions reflect the claimed out-of-distribution scenarios.
    The abstract reports robustness across velocity, policy, and group-dynamics shifts, but the protocol is not present in the body.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Towards Generalizable Safety in Crowd Navigation via Conformal Uncertainty Handling." pith.science (2026). https://pith.science/paper/SPLZGD76

@misc{pith2026250805634,
  author       = {Pith},
  title        = {Pith review of: Towards Generalizable Safety in Crowd Navigation via Conformal Uncertainty Handling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SPLZGD76}},
  note         = {Machine review of arXiv:2508.05634}
}
read the original abstract

Mobile robots navigating in crowds trained using reinforcement learning are known to suffer performance degradation when faced with out-of-distribution scenarios. We propose that by properly accounting for the uncertainties of pedestrians, a robot can learn safe navigation policies that are robust to distribution shifts. Our method augments agent observations with prediction uncertainty estimates generated by adaptive conformal inference, and it uses these estimates to guide the agent's behavior through constrained reinforcement learning. The system helps regulate the agent's actions and enables it to adapt to distribution shifts. In the in-distribution setting, our approach achieves a 96.93% success rate, which is over 8.80% higher than the previous state-of-the-art baselines with over 3.72 times fewer collisions and 2.43 times fewer intrusions into ground-truth human future trajectories. In three out-of-distribution scenarios, our method shows much stronger robustness when facing distribution shifts in velocity variations, policy changes, and transitions from individual to group dynamics. We deploy our method on a real robot, and experiments show that the robot makes safe and robust decisions when interacting with both sparse and dense crowds. Our code and videos are available on https://gen-safe-nav.github.io/.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MM-Nav: Multi-View VLA Model for Robust Visual Navigation via Multi-Expert Learning

    cs.RO 2025-10 conditional novelty 6.0 of 10

    A four-camera VLA navigation model trained by distilling multiple RL experts achieves strong simulation performance and qualitative real-world transfer.

Reference graph

Works this paper leans on

61 extracted references · 26 canonical work pages · cited by 1 Pith paper

  1. [1]

    Jiangxia Cao, Shen Wang, Yue Li, Shenghui Wang, Jian Tang, Shiyao Wang, Shuang Yang, Zhaojie Liu, and Guorui Zhou. 2024. Moment&Cross: Next- Generation Real-Time Cross-Domain CTR Prediction for Live-Streaming Recom- mendation at Kuaishou.arXiv preprint arXiv:2408.05709(2024)

    arXiv 2024

  2. [2]

    Sirui Chen, Yuan Wang, Zijing Wen, Zhiyu Li, Changshuo Zhang, Xiao Zhang, Quan Lin, Cheng Zhu, and Jun Xu. 2023. Controllable Multi-Objective Re-ranking with Policy Hypernetworks. InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 3855–3864

    work page 2023

  3. [3]

    Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, et al

  4. [4]

    Sunhao Dai, Changle Qu, Sirui Chen, Xiao Zhang, and Jun Xu. 2024. Recode: Modeling repeat consumption with neural ode. InProceedings of the 47th In- ternational ACM SIGIR Conference on Research and Development in Information Retrieval. 2599–2603

    work page 2024

  5. [5]

    Jiaxin Deng, Dong Shen, Shiyao Wang, Xiangyu Wu, Fan Yang, Guorui Zhou, and Gaofeng Meng. 2023. ContentCTR: Frame-level Live Streaming Click-Through Rate Prediction with Multimodal Transformer.arXiv preprint arXiv:2306.14392 (2023)

    arXiv 2023

  6. [6]

    Jiaxin Deng, Shiyao Wang, Dong Shen, Liqin Zhao, Fan Yang, Guorui Zhou, and Gaofeng Meng. 2024. A Multimodal Transformer for Live Streaming Highlight Prediction. In2024 IEEE International Conference on Multimedia and Expo (ICME). IEEE, 1–6

    work page 2024

  7. [7]

    Jiaxin Deng, Shiyao Wang, Yuchen Wang, Jiansong Qi, Liqin Zhao, Guorui Zhou, and Gaofeng Meng. 2024. MMBee: Live Streaming Gift-Sending Recommenda- tions via Multi-Modal Fusion and Behaviour Expansion. InProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 4896–4905

    work page 2024

  8. [8]

    Manqing Dong, Feng Yuan, Lina Yao, Xiwei Xu, and Liming Zhu. 2020. Mamo: Memory-augmented meta-optimization for cold-start recommendation. InPro- ceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. 688–697

    work page 2020

Show all 61 references
  1. [9]

    Chongming Gao, Shijun Li, Wenqiang Lei, Jiawei Chen, Biao Li, Peng Jiang, Xiangnan He, Jiaxin Mao, and Tat-Seng Chua. 2022. KuaiRec: A Fully-Observed Dataset and Insights for Evaluating Recommender Systems. InProceedings of the 31st ACM International Conference on Information ...

    2022

  2. [10]

    Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction.In Proceedings of IJCAI.(2017)

    2017

  3. [11]

    Ke Guo, Changle Qu, Xiao Zhang, Liqin Zhao, Shijun Wang, Yanan Niu, and Jun Xu. 2026. Room Matters: Dynamic Room-level Collaboration Information Modeling for Live Streaming Recommendation. InProceedings of the ACM Web Conference 2026. 6045–6056

    2026

  4. [12]

    Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, and Meng Wang. 2020. Lightgcn: Simplifying and powering graph convolution network for recommendation. InProceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval. 639–648

    2020

  5. [13]

    Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural collaborative filtering. InProceedings of the 26th international conference on world wide web. 173–182

    2017

  6. [14]

    Balázs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk

  7. [15]

    Bowen Jin, Chen Gao, Xiangnan He, Depeng Jin, and Yong Li. 2020. Multi- behavior Recommendation with Graph Convolutional Networks. InProceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 659–668

    2020

  8. [16]

    Wang-Cheng Kang and Julian McAuley. 2018. Self-attentive sequential recom- mendation. In2018 IEEE international conference on data mining (ICDM). IEEE, 197–206

    2018

  9. [17]

    Hoyeop Lee, Jinbae Im, Seongwon Jang, Hyunsouk Cho, and Sehee Chung. 2019. Melu: Meta-learned user preference estimator for cold-start recommendation. InProceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. 1073–1082

    2019

  10. [18]

    Jing Li, Pengjie Ren, Zhumin Chen, Zhaochun Ren, Tao Lian, and Jun Ma. 2017. Neural attentive session-based recommendation. InProceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1419–1428

    2017

  11. [19]

    Jiacheng Li, Yujie Wang, and Julian McAuley. 2020. Time interval aware self- attention for sequential recommendation. InProceedings of the 13th international conference on web search and data mining. 322–330

    2020

  12. [20]

    Xiaodong Li, Ruochen Yang, Shuang Wen, Shen Wang, Yueyang Liu, Guoquan Wang, Weisong Hu, Qiang Luo, Jiawei Sheng, Tingwen Liu, et al. 2025. FARM: Frequency-Aware Model for Cross-Domain Live-Streaming Recommendation. arXiv preprint arXiv:2502.09375(2025)

    2025 arXiv

  13. [21]

    Jianxun Lian, Xiaohuan Zhou, Fuzheng Zhang, Zhongxia Chen, Xing Xie, and Guangzhong Sun. 2018. xdeepfm: Combining explicit and implicit feature in- teractions for recommender systems. InProceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data m...

    2018

  14. [22]

    Fengqi Liang, Baigong Zheng, Liqin Zhao, Guorui Zhou, Qian Wang, and Yanan Niu. 2024. Ensure Timeliness and Accuracy: A Novel Sliding Window Data Stream Paradigm for Live Streaming Recommendation.arXiv preprint arXiv:2402.14399 (2024)

    2024 arXiv

  15. [23]

    Yueyang Liu, Jiangxia Cao, Shen Wang, Shuang Wen, Xiang Chen, Xiangyu Wu, Shuang Yang, Zhaojie Liu, Kun Gai, and Guorui Zhou. 2025. LLM-Alignment Live-Streaming Recommendation.arXiv preprint arXiv:2504.05217(2025)

    2025 arXiv

  16. [24]

    Yucheng Lu, Jiangxia Cao, Xu Kuan, Wei Cheng, Wei Jiang, Jiaming Zhang, Yang Shuang, Liu Zhaojie, and Liyin Hong. 2025. LiveForesighter: Generating Future Information for Live-Streaming Recommendations at Kuaishou.arXiv preprint arXiv:2502.06557(2025)

    2025 arXiv

  17. [25]

    Qi Pi, Weijie Bian, Guorui Zhou, Xiaoqiang Zhu, and Kun Gai. 2019. Practice on long sequential user behavior modeling for click-through rate prediction. InProceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. 2671–2679

    2019

  18. [26]

    Changle Qu, Liqin Zhao, Yanan Niu, Xiao Zhang, and Jun Xu. 2025. Bridging Short Videos and Streamers with Multi-Graph Contrastive Learning for Live Streaming Recommendation. InProceedings of the 48th International ACM SIGIR Conference on Research and Development in Information...

    2025

  19. [27]

    Shashank Rajput, Nikhil Mehta, Anima Singh, Raghunandan Hulikal Keshavan, Trung Vu, Lukasz Heldt, Lichan Hong, Yi Tay, Vinh Tran, Jonah Samost, et al

  20. [28]

    Jérémie Rappaz, Julian McAuley, and Karl Aberer. 2021. Recommendation on live-streaming platforms: Dynamic availability and repeat consumption. InPro- ceedings of the 15th ACM Conference on Recommender Systems. 390–399

    2021

  21. [29]

    Steffen Rendle. 2010. Factorization machines. In2010 IEEE International conference on data mining. IEEE, 995–1000

    2010

  22. [30]

    Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme

  23. [31]

    Chenglei Shen, Yi Zhan, Weijie Yu, Xiao Zhang, and Jun Xu. 2026. Enhancing Bandit Algorithms with LLMs for Time-varying User Preferences in Streaming Recommendations.ACM Transactions on Information Systems44, 3 (2026), 1–30

    2026

  24. [32]

    Chenglei Shen, Xiao Zhang, Teng Shi, Changshuo Zhang, Guofu Xie, Jun Xu, Ming He, and Jianping Fan. 2025. A survey of controllable learning: Methods and applications in information retrieval.Frontiers of Computer Science(2025), https://doi.org/10.1007/s11704–025–41366–5

    2025 doi

  25. [33]

    Zhongxiang Sun, Zihua Si, Xiaoxue Zang, Dewei Leng, Yanan Niu, Yang Song, Xiao Zhang, and Jun Xu. 2023. KuaiSar: A unified search and recommendation dataset. InProceedings of the 32nd ACM international conference on information and knowledge management. 5407–5411

    2023

  26. [34]

    Jiaxi Tang and Ke Wang. 2018. Personalized top-n sequential recommenda- tion via convolutional sequence embedding. InProceedings of the eleventh ACM international conference on web search and data mining. 565–573

    2018

  27. [35]

    Chenyang Wang, Yuanqing Yu, Weizhi Ma, Min Zhang, Chong Chen, Yiqun Liu, and Shaoping Ma. 2022. Towards representation alignment and uniformity in collaborative filtering. InProceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining. 1816–1825

    2022

  28. [36]

    Chenyang Wang, Min Zhang, Weizhi Ma, Yiqun Liu, and Shaoping Ma. 2020. Make it a chorus: knowledge-and time-aware item modeling for sequential rec- ommendation. InProceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval. 109–118

    2020

  29. [37]

    Ruoxi Wang, Bin Fu, Gang Fu, and Mingliang Wang. 2017. Deep & cross network for ad click predictions. InProceedings of the ADKDD’17. 1–7

    2017

  30. [38]

    Ruoxi Wang, Rakesh Shivanna, Derek Cheng, Sagar Jain, Dong Lin, Lichan Hong, and Ed Chi. 2021. Dcn v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems. InProceedings of the web conference 2021. 1785–1797

    2021

  31. [39]

    Dinghao Xi, Liumin Tang, Runyu Chen, and Wei Xu. 2023. A multimodal time- series method for gifting prediction in live streaming platforms.Information Processing & Management60, 3 (2023), 103254

    2023

  32. [40]

    Chen Xu, Sirui Chen, Jun Xu, Weiran Shen, Xiao Zhang, Gang Wang, and Zhenhua Dong. 2023. P-MMF: Provider max-min fairness re-ranking in recommender system. InProceedings of the ACM Web Conference 2023. 3701–3711

    2023

  33. [41]

    Xiaopeng Ye, Chen Xu, Jun Xu, Xuyang Xie, Gang Wang, and Zhenhua Dong

  34. [42]

    Sanshi Yu, Zhuoxuan Jiang, Dong-Dong Chen, Shanshan Feng, Dongsheng Li, Qi Liu, and Jinfeng Yi. 2021. Leveraging tripartite interaction information from live stream e-commerce for improving product recommendation. InProceedings of the 27th ACM SIGKDD Conference on Knowledge Di...

    2021

  35. [43]

    Enming Yuan, Wei Guo, Zhicheng He, Huifeng Guo, Chengkai Liu, and Ruiming Tang. 2022. Multi-behavior sequential transformer recommender. InProceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1642–1652

    2022

  36. [44]

    Guanghu Yuan, Fajie Yuan, Yudong Li, Beibei Kong, Shujie Li, Lei Chen, Min Yang, Chenyun Yu, Bo Hu, Zang Li, et al . 2022. Tenrec: A large-scale multipurpose benchmark dataset for recommender systems.Advances in Neural Information Processing Systems35 (2022), 11480–11493

    2022

  37. [45]

    Kepu Zhang, Teng Shi, Sunhao Dai, Xiao Zhang, Yinfeng Li, Jing Lu, Xiaoxue Zang, Yang Song, and Jun Xu. 2024. SAQRec: Aligning Recommender Systems to User Satisfaction via Questionnaire Feedback. InProceedings of the 33rd ACM International Conference on Information and Knowled...

    2024

  38. [46]

    Xiao Zhang, Sunhao Dai, Jun Xu, Zhenhua Dong, Quanyu Dai, and Ji-Rong Wen

  39. [47]

    Xiao Zhang, Haonan Jia, Hanjing Su, Wenhan Wang, Jun Xu, and Ji-Rong Wen

  40. [48]

    Xiao Zhang, Ninglu Shao, Zihua Si, Jun Xu, Wenhan Wang, Hanjing Su, and Ji-Rong Wen. 2023. Reward imputation with sketching for contextual batched bandits.Advances in Neural Information Processing Systems36 (2023), 64577– 64588

    2023

  41. [49]

    Yixin Zhang, Yong Liu, Hao Xiong, Yi Liu, Fuqiang Yu, Wei He, Yonghui Xu, Lizhen Cui, and Chunyan Miao. 2023. Cross-domain disentangled learning for e-commerce live streaming recommendation. In2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 2955–2968

    2023

  42. [50]

    Bowen Zheng, Yupeng Hou, Hongyu Lu, Yu Chen, Wayne Xin Zhao, Ming Chen, and Ji-Rong Wen. 2024. Adapting large language models by integrating collaborative semantics for recommendation. In2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 1435–1448

    2024

  43. [51]

    Jiawei Zheng, Hao Gu, Chonggang Song, Dandan Lin, Lingling Yi, and Chuan Chen. 2023. Dual Interests-Aligned Graph Auto-Encoders for Cross-domain Rec- ommendation in WeChat. InProceedings of the 32nd ACM International Conference on Information and Knowledge Management. 4988–4994

    2023

  44. [52]

    Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. 2019. Deep interest evolution network for click-through rate prediction. InProceedings of the AAAI conference on artificial intelligence, Vol. 33. 5941–5948

    2019

  45. [53]

    Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018. Deep interest network for click-through rate prediction. InProceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. ...

    2018

  46. [54]

    Mengxiao Zhu, Qi Shu, Shuanghong Shen, Li Feng, Jiancan Wu, and Zhenya Huang. 2025. Live Streaming Recommendation Based on Multiple Types of Repeated Behaviors.Expert Systems with Applications(2025), 128217

    2025

  47. [2009]

    InProceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence

    BPR: Bayesian personalized ranking from implicit feedback. InProceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452–461

  48. [2015]

    Session-based recommendations with recurrent neural networks.In Proceedings of 4th International Conference on Learning Representations (ICLR). (2015)

    2015

  49. [2016]

    InProceedings of the 1st workshop on deep learning for recommender systems

    Wide & deep learning for recommender systems. InProceedings of the 1st workshop on deep learning for recommender systems. 7–10

  50. [2021]

    InProceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2021)

    Counterfactual reward modification for streaming recommendation with delayed feedback. InProceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2021). 41–50

    2021

  51. [2022]

    InProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2022)

    Counteracting user attention bias in music streaming recommendation via reward modification. InProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2022). 2504–2514

    2022

  52. [2023]

    Recommender systems with generative retrieval.Advances in Neural Information Processing Systems36 (2023), 10299–10315

    2023

  53. [2024]

    InProceedings of the 33rd ACM Inter- national Conference on Information and Knowledge Management

    Guaranteeing Accuracy and Fairness under Fluctuating User Traffic: A Bankruptcy-Inspired Re-ranking Approach. InProceedings of the 33rd ACM Inter- national Conference on Information and Knowledge Management. 2991–3001

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.