Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kevin Zhou

dblp:244/5409 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
Reinforcement learning · 43% Motion planning and robot control · 17% Learning theory · 17%
Theoretical computer science
1 paper
Automated reasoning and model checking · 50% Logic in computer science · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 15 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
automotive systems
1.012026
Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking · FM (1) 2026
Automated reasoning and model checking
model checking
1.012026
Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking · FM (1) 2026
Logic in computer science › modal logic
temporal and spatial logic
1.012026
Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking · FM (1) 2026
Machine learning › Reinforcement learning › bandit
contextual bandit
0.712023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Machine learning › Reinforcement learning › value-based reinforcement learning
distributional reinforcement learning
0.712023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Machine learning › Reinforcement learning
offline reinforcement learning
0.712023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Machine learning › Learning theory › online learning › regret bounds
small-loss bounds
0.712023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Robotics › Robot manipulation
learning from demonstration
0.412020
Optical Coherence Tomography-Guided Robotic Ophthalmic Microsurgery via Reinforcement Learning from Demonstration · IEEE Trans. Robotics 2020
Robotics › Motion planning and robot control
robot control
0.412020
Optical Coherence Tomography-Guided Robotic Ophthalmic Microsurgery via Reinforcement Learning from Demonstration · IEEE Trans. Robotics 2020
Robotics › Motion planning and robot control
robot learning
0.412020
Optical Coherence Tomography-Guided Robotic Ophthalmic Microsurgery via Reinforcement Learning from Demonstration · IEEE Trans. Robotics 2020
Natural language and speech › Information extraction and text analysis › text classification › low-resource text classification
few-shot text classification
0.412019
Hierarchical Attention Prototypical Networks for Few-Shot Text Classification · EMNLP/IJCNLP (1) 2019
Natural language and speech › Information extraction and text analysis
text classification
0.412019
Hierarchical Attention Prototypical Networks for Few-Shot Text Classification · EMNLP/IJCNLP (1) 2019
Machine learning › Reinforcement learning › markov decision process
low-rank MDP
0.212023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Machine learning › Learning theory › PAC learning
PAC bounds
0.212023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning · NeurIPS 2023
Medical and health informatics
surgical robotics
0.112020
Optical Coherence Tomography-Guided Robotic Ophthalmic Microsurgery via Reinforcement Learning from Demonstration · IEEE Trans. Robotics 2020

Methods — techniques the papers use, named apart from their topics

optical coherence tomography · 0.9maximum likelihood estimation · 0.7eluder dimension · 0.7reinforcement learning from demonstrations · 0.4reinforcement learning from demonstration · 0.4prototypical network · 0.4hierarchical attention · 0.4
YearPublicationVenuePosition
2026 Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
abstract
Abstract We introduce a hybrid spatiotemporal logic for automotive safety applications (HSTL), focused on highway driving. Spatiotemporal logic features specifications about vehicles throughout space and time, while hybrid logic enables precise references to individual vehicles and their historical positions. We define the semantics of HSTL and provide a baseline model-checking algorithm for it. We propose two optimized model-checking algorithms, which reduce the search space based on the reachable states and possible transitions from one state to another. All three model-checking algorithms are evaluated on a series of common driving scenarios such as safe following, safe crossings, overtaking, and platooning. An exponential performance improvement is observed for the optimized algorithms.
Radu Florin Tulcan, Rose Bohrer, Yoàv Montacute, Kevin Zhou, Yusuke Kawamoto 0001, Ichiro Hasuo
FM (1)4
2024 Query Learning Bounds for Advice and Nominal Automata
Kevin Zhou
ATVA1
2023 The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning
abstract
While distributional reinforcement learning (DistRL) has been empirically effective, the question of when and why it is better than vanilla, non-distributional RL has remained unanswered. This paper explains the benefits of DistRL through the lens of small-loss bounds, which are instance-dependent bounds that scale with optimal achievable cost. Particularly, our bounds converge much faster than those from non-distributional approaches if the optimal cost is small. As warmup, we propose a distributional contextual bandit (DistCB) algorithm, which we show enjoys small-loss regret bounds and empirically outperforms the state-of-the-art on three real-world tasks. In online RL, we propose a DistRL algorithm that constructs confidence sets using maximum likelihood estimation. We prove that our algorithm enjoys novel small-loss PAC bounds in low-rank MDPs. As part of our analysis, we introduce the $\ell_1$ distributional eluder dimension which may be of independent interest. Then, in offline RL, we show that pessimistic DistRL enjoys small-loss PAC bounds that are novel to the offline setting and are more robust to bad single-policy coverage.
Kevin Zhou, Runzhe Wu, Nathan Kallus, Wen Sun 0002
NeurIPS2
2020 Optical Coherence Tomography-Guided Robotic Ophthalmic Microsurgery via Reinforcement Learning from Demonstration
abstract
Ophthalmic microsurgery is technically difficult because the scale of required surgical tool manipulations challenge the limits of the surgeon's visual acuity, sensory perception, and physical dexterity. Intraoperative optical coherence tomography (OCT) imaging with micrometer-scale resolution is increasingly being used to monitor and provide enhanced real-time visualization of ophthalmic surgical maneuvers, but surgeons still face physical limitations when manipulating instruments inside the eye. Autonomously controlled robots are one avenue for overcoming these physical limitations. We demonstrate the feasibility of using learning from demonstration and reinforcement learning with an industrial robot to perform OCT-guided corneal needle insertions in an ex vivo model of deep anterior lamellar keratoplasty (DALK) surgery. Our reinforcement learning agent trained on ex vivo human corneas, then outperformed surgical fellows in reaching a target needle insertion depth in mock corneal surgery trials. This work shows the combination of learning from demonstration and reinforcement learning is a viable option for performing OCT guided robotic ophthalmic surgery.
Brenton Keller, Mark Draelos, Kevin Zhou, Ruobing Qian, Anthony N. Kuo, George Dimitri Konidaris, Kris Hauser, Joseph A. Izatt
IEEE Trans. Robotics3
2019 Hierarchical Attention Prototypical Networks for Few-Shot Text Classification
abstract
Shengli Sun, Qingfeng Sun, Kevin Zhou, Tengchao Lv. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Shengli Sun, Qingfeng Sun, Kevin Zhou, Tengchao Lv
EMNLP/IJCNLP (1)3