VLDB 2026 Research / reviewers in the wild / expert
Botao Li
dblp:179/3223
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Deep learning architectures and training · 52% Language models and text generation · 30% Optimization for machine learning · 17% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
LLM agents |
1.0 | 1 | 2026 | Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4 · ACL (1) 2026 |
Automated reasoning and model checking
automated theorem proving |
1.0 | 1 | 2026 | Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4 · ACL (1) 2026 |
Machine learning › Deep learning architectures and training › feedforward neural network
deep linear networks |
0.6 | 1 | 2022 | Exact Solutions of a Deep Linear Network · NeurIPS 2022 |
Machine learning › Deep learning architectures and training
loss landscape |
0.6 | 1 | 2022 | Exact Solutions of a Deep Linear Network · NeurIPS 2022 |
Machine learning › Optimization for machine learning
stochastic gradient descent |
0.6 | 1 | 2022 | SGD Can Converge to Local Maxima · ICLR 2022 |
Machine learning › Deep learning architectures and training › regularization › norm-based regularization
weight decay |
0.6 | 1 | 2022 | Exact Solutions of a Deep Linear Network · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
lean 4 · 2.0agentic framework · 2.0stochastic gradient descent · 0.6analytical solution · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4abstractChengwu Liu, Yichun Yin, Ye Yuan, Jiaxuan Xie, Botao Li, Siqi Li, Jianhao Shen, Yan Xu, Lifeng Shang, Ming Zhang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Chengwu Liu 0001, Yichun Yin, Ye Yuan 0016, Jiaxuan Xie, Botao Li, Jianhao Shen, Lifeng Shang, Ming Zhang 0004 |
ACL (1) | 5 |
| 2025 | Adaptive DETR: A framework with dynamic sampling points and feature-guided adaptive attention updates
Botao Li, Huguang Yang, Chenglong Xia, Aziguli Wulamu, Taohong Zhang |
Comput. Vis. Image Underst. | 1 |
| 2025 | Innovative surface roughness detection method based on white light interference images
Huguang Yang, Xiaojing Su, Botao Li, Chenglong Xia, Mingyang Yang, Taohong Zhang |
Mach. Vis. Appl. | 3 |
| 2022 | SGD Can Converge to Local Maxima
Liu Ziyin 0001, Botao Li, James B. Simon, Masahito Ueda |
ICLR | 2 |
| 2022 | Exact Solutions of a Deep Linear NetworkabstractThis work finds the analytical expression of the global minima of a deep linear network with weight decay and stochastic neurons, a fundamental model for understanding the landscape of neural networks. Our result implies that zero is a special point in deep neural network architecture. We show that weight decay strongly interacts with the model architecture and can create bad minima at zero in a network with more than $1$ hidden layer, qualitatively different from a network with only $1$ hidden layer. Practically, our result implies that common deep learning initialization methods are insufficient to ease the optimization of neural networks in general. Liu Ziyin 0001, Botao Li, Xiangming Meng |
NeurIPS | 2 |