CV

Education

• B.S. in Applied Mathematics, University of Science and Technology of China (USTC), 2015-2019
• M.S. in Electrical Engineering, Texas A&M University, 2019-2022
• Ph.D in Computer Science, Texas A&M University, 2022-present

Research experience

• Summer 2022 - present
  • Submodular maximization
• Summer 2022 - Spring 2023
  • Motion planning in robotics
• Fall 2021 - Summer 2022
  • Offline goal-oriented reinforcement learning (stochastic shortest path)
• Fall 2021
  • Proving theoretical lower bound in coding theory with large-scale linear programming
• Spring 2019 - Fall 2020
  • $m$-wise partial ranking and data aggregation

Skills

• C/C++, Matlab, Python, Mathematica

Publications

On Top-k Selection from m-wise Partial Rankings via Borda Counting

Wenjing Chen, Ruida Zhou, Chao Tian, Cong Shen. (2022). "On Top-k Selection from m-wise Partial Rankings via Borda Counting." IEEE Transaction on Signal Processing. 1(1).

A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes

Wenjing Chen, and Chao Tian. (2009). "A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes." IEEE International Symposium on Information Theory.

Offline stochastic shortest path: Learning, evaluation and towards optimality

Ming Yin, Wenjing Chen, Mengdi Wang, and Yu-Xiang Wang. (2022). "Offline stochastic shortest path: Learning, evaluation and towards optimality." Uncertainty in Artificial Intelligence (UAI) .

Teaching

Reviewer

• Spring 2022
  • Reviewer for UAI 2022