| 2025 | COLT | Faster Algorithms for Agnostically Learning Disjunctions and their Implications. | Ilias Diakonikolas, Daniel M. Kane, Lisheng Ren |
| 2025 | COLT | Learning Intersections of Two Margin Halfspaces under Factorizable Distributions. | Ilias Diakonikolas, Mingchen Ma, Lisheng Ren, Christos Tzamos |
| 2025 | ICML | Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise. | Ilias Diakonikolas, Mingchen Ma, Lisheng Ren, Christos Tzamos |
| 2024 | ICML | Fast Co-Training under Weak Dependence via Stream-Based Active Learning. | Ilias Diakonikolas, Mingchen Ma, Lisheng Ren, Christos Tzamos |
| 2023 | ICML | Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals. | Ilias Diakonikolas, Daniel Kane, Lisheng Ren |
| 2022 | AISTATS | Hardness of Learning a Single Neuron with Adversarial Label Noise. | Ilias Diakonikolas, Daniel Kane, Pasin Manurangsi, Lisheng Ren |
| 2008 | SNPD | The Upper Bound of Coverage on Fixed Energy Budget in Wireless Sensor Networks. | Fang Wang, Lisheng Ren, Guifa Teng |
| 2008 | SNPD | Research on Mechanism of Agricultural FAQ Retrieval Based on Ontology. | Fang Wang, Guifa Teng, Lisheng Ren, Jianbin Ma |
| 2007 | SNPD | The Upper Bound of The Number of Nodes On Fixed Energy Budget in Wireless Sensor Networks. | Fang Wang, Guifa Teng, Lisheng Ren |