Tiansheng Yao

Orcid: 0009-0000-4025-170X

According to our database1, Tiansheng Yao authored at least 12 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Self-Auxiliary Distillation for Sample Efficient Learning in Google-Scale Recommenders.
Proceedings of the 18th ACM Conference on Recommender Systems, 2024

2023
Empowering Long-tail Item Recommendation through Cross Decoupling Network (CDN).
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Distributionally-robust Recommendations for Improving Worst-case User Experience.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Improving Multi-Task Generalization via Regularizing Spurious Correlation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
A Model of Two Tales: Dual Transfer Learning Framework for Improved Long-tail Item Recommendation.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Learning to Embed Categorical Features without Embedding Tables for Recommendation.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Self-supervised Learning for Large-scale Item Recommendations.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Deep Hash Embedding for Large-Vocab Categorical Feature Representations.
CoRR, 2020

Self-supervised Learning for Deep Models in Recommendations.
CoRR, 2020

2017
Learning Bayesian network parameters under equivalence constraints.
Artif. Intell., 2017

2012
A Probabilistic Approach to Robust Matrix Factorization.
Proceedings of the Computer Vision - ECCV 2012, 2012

2011
Efficient Subspace Segmentation via Quadratic Programming.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011


  Loading...