Demo Data from EDBT 2026 / reviewers in the wild / expert
Joshua P. Zitovsky
dblp:214/7812
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous 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
1 paper |
Reinforcement learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › value function estimation
bellman error |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Machine learning › Reinforcement learning
value function estimation |
0.7 | 1 | 2023 | Revisiting Bellman Errors for Offline Model Selection · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
q-function · 0.7mean squared bellman error · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Revisiting Bellman Errors for Offline Model SelectionabstractOffline model selection (OMS), that is, choosing the best policy from a set of many policies given only logged data, is crucial for applying offline RL in real-world settings. One idea that has been extensively explored is to select policies based on the mean squared Bellman error (MSBE) of the associated Q-functions. However, previous work has struggled to obtain adequate OMS performance with Bellman errors, leading many researchers to abandon the idea. To this end, we elucidate why previous work has seen pessimistic results with Bellman errors and identify conditions under which OMS algorithms based on Bellman errors will perform well. Moreover, we develop a new estimator of the MSBE that is more accurate than prior methods. Our estimator obtains impressive OMS performance on diverse discrete control tasks, including Atari games. Joshua P. Zitovsky, Daniel de Marchi, Rishabh Agarwal, Michael R. Kosorok |
ICML | 1 |
| 2018 | Models for Early Identification of Struggling Novice ProgrammersabstractThere is much interest in predicting student performance in computer programming courses early in the semester to identify weak students who might benefit from targeted support. To this end, we analyzed detailed keystroke transcripts and outputs of compilation attempts during programming activities, both in and out of class. In linear regression models predicting grades, we identified multiple behavioral indicators and performance indicators that explained a significant portion of the variation in final grades using only the data collected within the first three weeks. Because the indicators identify specific behaviors and are generated automatically, they may be used as the basis for interventions instructors may use when counseling weaker students concerning their performance early in the course before they fall too far behind. Furthermore, in contrast with some other automated struggling-student detection models, our predictors are based on generic behaviors and generic performance metrics that can be extended to a wide range of introductory programming contexts. Our models also predict performance on a continuous scale rather than a binary "weak"/"not weak" classification, which would allow instructors to offer interventions to marginal students who want to improve, or to promising students who want to excel. Jonathan P. Munson, Joshua P. Zitovsky |
SIGCSE | 2 |