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

Benjamin J. Zhang

dblp:304/3214 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 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
2 papers
Motion planning and robot control · 32% Trustworthy machine learning · 32% Deep learning architectures and training · 17%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot control
optimal control
0.912025
Optimal Control for Transformer Architectures: Enhancing Generalization, Robustness and Efficiency · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness › robust learning
robust generalization
0.912025
Optimal Control for Transformer Architectures: Enhancing Generalization, Robustness and Efficiency · NeurIPS 2025
Machine learning › Deep learning architectures and training
transformer
0.912025
Optimal Control for Transformer Architectures: Enhancing Generalization, Robustness and Efficiency · NeurIPS 2025
Robotics › Motion planning and robot control › robot control › robust control
robustness analysis
0.812024
Score-based generative models are provably robust: an uncertainty quantification perspective · NeurIPS 2024
Machine learning › Generative modeling › diffusion model
score-based generative model
0.812024
Score-based generative models are provably robust: an uncertainty quantification perspective · NeurIPS 2024
Machine learning › Trustworthy machine learning
uncertainty estimation
0.812024
Score-based generative models are provably robust: an uncertainty quantification perspective · NeurIPS 2024
Machine learning › Learning theory
generalization bounds
0.212024
Score-based generative models are provably robust: an uncertainty quantification perspective · NeurIPS 2024

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

optimal control theory · 0.9continuous-time formulation · 0.9wasserstein distance · 0.8fokker-planck equation · 0.8Hamilton-Jacobi-Bellman PDE · 0.8
YearPublicationVenuePosition
2025 Optimal Control for Transformer Architectures: Enhancing Generalization, Robustness and Efficiency
abstract
We study Transformers through the perspective of optimal control theory, using tools from continuous-time formulations to derive actionable insights into training and architecture design. This framework improves the performance of existing Transformer models while providing desirable theoretical guarantees, including generalization and robustness. Our framework is designed to be plug-and-play, enabling seamless integration with established Transformer models and requiring only slight changes to the implementation. We conduct seven extensive experiments on tasks motivated by text generation, sentiment analysis, image classification, and point cloud classification. Experimental results show that the framework improves the test performance of the baselines, while being more parameter-efficient. On character-level text generation with nanoGPT, our framework achieves a 46\% reduction in final test loss while using 42\% fewer parameters. On GPT-2, our framework achieves a 9.3\% reduction in final test loss, demonstrating scalability to larger models. To the best of our knowledge, this is the first work that applies optimal control theory to both the training and architecture of Transformers. It offers a new foundation for systematic, theory-driven improvements and moves beyond costly trial-and-error approaches.
Kelvin Kan, Xingjian Li 0005, Benjamin J. Zhang, Tuhin Sahai, Stanley J. Osher, Markos A. Katsoulakis
NeurIPS3
2025 ExAct: A Video-Language Benchmark for Expert Action Analysis
abstract
We present ExAct, a new video-language benchmark for expert-level understanding of skilled physical human activities. Our new benchmark contains 3,521 expert-curated video question-answer pairs spanning 11 physical activities in 6 domains: Sports, Bike Repair, Cooking, Health, Music, and Dance. ExAct requires the correct answer to be selected from five carefully designed candidate options, thus necessitating a nuanced, fine-grained, expert-level understanding of physical human skills. Evaluating the recent state-of-the-art VLMs on ExAct reveals a substantial performance gap relative to human expert performance. Specifically, the best-performing Gemini 2.5 Pro model achieves only 55.35% accuracy, well below the 82.02% attained by trained human experts. We believe that ExAct will be beneficial for developing and evaluating VLMs capable of precise understanding of human skills in various physical and procedural domains. Dataset and code are available at https://texaser.github.io/exactprojectpage/.
Han Yi, Yulu Pan, Feihong He, Benjamin J. Zhang, Oluwatumininu Oguntola, Gedas Bertasius
NeurIPS5
2024 Score-based generative models are provably robust: an uncertainty quantification perspective
abstract
Through an uncertainty quantification (UQ) perspective, we show that score-based generative models (SGMs) are provably robust to the multiple sources of error in practical implementation. Our primary tool is the Wasserstein uncertainty propagation (WUP) theorem, a *model-form UQ* bound that describes how the $L^2$ error from learning the score function propagates to a Wasserstein-1 ($\mathbf{d}_1$) ball around the true data distribution under the evolution of the Fokker-Planck equation. We show how errors due to (a) finite sample approximation, (b) early stopping, (c) score-matching objective choice, (d) score function parametrization expressiveness, and (e) reference distribution choice, impact the quality of the generative model in terms of a $\mathbf{d}_1$ bound of computable quantities. The WUP theorem relies on Bernstein estimates for Hamilton-Jacobi-Bellman partial differential equations (PDE) and the regularizing properties of diffusion processes. Specifically, *PDE regularity theory* shows that *stochasticity* is the key mechanism ensuring SGM algorithms are provably robust. The WUP theorem applies to integral probability metrics beyond $\mathbf{d}_1$, such as the total variation distance and the maximum mean discrepancy. Sample complexity and generalization bounds in $\mathbf{d}_1$ follow directly from the WUP theorem. Our approach requires minimal assumptions, is agnostic to the manifold hypothesis and avoids absolute continuity assumptions for the target distribution. Additionally, our results clarify the *trade-offs* among multiple error sources in SGMs.
Nikiforos Mimikos-Stamatopoulos, Benjamin J. Zhang, Markos A. Katsoulakis
NeurIPS2