Tao He
Orcid: 0000-0002-6052-4573Affiliations:
- Harbin Institute of Technology, Harbin, Heilongjiang, China
According to our database1,
Tao He
authored at least 12 papers
between 2022 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Good Learners Think Their Thinking: Generative PRM Makes Large Reasoning Model More Efficient Math Learner.
CoRR, July, 2025
Exploring & exploiting high-order graph structure for sparse knowledge graph completion.
Frontiers Comput. Sci., February, 2025
Simulating Before Planning: Constructing Intrinsic User World Model for User-Tailored Dialogue Policy Planning.
Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2025
Breaking the Reasoning Barrier A Survey on LLM Complex Reasoning through the Lens of Self-Evolution.
Proceedings of the Findings of the Association for Computational Linguistics, 2025
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025
2024
VEM<sup>2</sup>L: an easy but effective framework for fusing text and structure knowledge on sparse knowledge graph completion.
Data Min. Knowl. Discov., 2024
Relational Graph-Bridged Image-Text Interaction: A Novel Method for Multi-Modal Relation Extraction.
Proceedings of the IEEE International Conference on Acoustics, 2024
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024
Navigate through Enigmatic Labyrinth A Survey of Chain of Thought Reasoning: Advances, Frontiers and Future.
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024
2023
Exploring & Exploiting High-Order Graph Structure for Sparse Knowledge Graph Completion.
CoRR, 2023
2022
VEM<sup>2</sup>L: A Plug-and-play Framework for Fusing Text and Structure Knowledge on Sparse Knowledge Graph Completion.
CoRR, 2022