Demo Data from VLDB 2026 / reviewers in the wild / expert
Robert Belfer
dblp:220/2069
· DBLP profile ↗
8ranked-venue papers
1as first author
4since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 4 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 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 |
Motion planning and robot control · 44% Information extraction and text analysis · 34% Transfer learning and domain adaptation · 17% | |
| Human-computer interaction and pervasive computing
1 paper |
Learning and educational technologies · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
discourse analysis |
0.5 | 1 | 2021 | Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor Systems · AAAI 2021 |
Natural language and speech › Information extraction and text analysis › text segmentation
discourse segmentation |
0.5 | 1 | 2021 | Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor Systems · AAAI 2021 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.5 | 1 | 2021 | Back-Training excels Self-Training at Unsupervised Domain Adaptation of Question Generation and Passage Retrieval · EMNLP (1) 2021 |
Learning and educational technologies
intelligent tutoring systems |
0.5 | 1 | 2021 | Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor Systems · AAAI 2021 |
Learning and educational technologies › educational feedback
personalized feedback |
0.5 | 1 | 2021 | Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor Systems · AAAI 2021 |
Robotics › Motion planning and robot control › motion planning
configuration space |
0.4 | 1 | 2020 | C-Space tunnel discovery for puzzle path planning · ACM Trans. Graph. 2020 |
Robotics › Motion planning and robot control
motion planning |
0.4 | 1 | 2020 | C-Space tunnel discovery for puzzle path planning · ACM Trans. Graph. 2020 |
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning |
0.4 | 1 | 2020 | C-Space tunnel discovery for puzzle path planning · ACM Trans. Graph. 2020 |
Natural language and speech › Question answering and dialogue systems
question generation |
0.1 | 1 | 2021 | Back-Training excels Self-Training at Unsupervised Domain Adaptation of Question Generation and Passage Retrieval · EMNLP (1) 2021 |
Information retrieval › document retrieval
passage retrieval |
0.1 | 1 | 2021 | Back-Training excels Self-Training at Unsupervised Domain Adaptation of Question Generation and Passage Retrieval · EMNLP (1) 2021 |
Methods — techniques the papers use, named apart from their topics
self-training · 1.0relational graph · 1.0neural discourse segmentation · 1.0neural classifier · 1.0consistency filtering · 1.0machine learning · 0.4geometric heuristics · 0.4feature matching · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Raising Student Completion Rates with Adaptive Curriculum and Contextual Bandits
Robert Belfer, Ekaterina Kochmar, Iulian Serban |
AIED (1) | 1 |
| 2021 | Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor SystemsabstractWe explore creating automated, personalized feedback in an intelligent tutoring system (ITS). Our goal is to pinpoint correct and incorrect concepts in student answers in order to achieve better student learning gains. Although automatic methods for providing personalized feedback exist, they do not explicitly inform students about which concepts in their answers are correct or incorrect. Our approach involves decomposing students answers using neural discourse segmentation and classification techniques. This decomposition yields a relational graph over all discourse units covered by the reference solutions and student answers. We use this inferred relational graph structure and a neural classifier to match student answers with reference solutions and generate personalized feedback. Although the process is completely automated and data-driven, the personalized feedback generated is highly contextual, domain-aware and effectively targets each student's misconceptions and knowledge gaps. We test our method in a dialogue-based ITS and demonstrate that our approach results in high-quality feedback and significantly improved student learning gains. Matt Grenander, Robert Belfer, Ekaterina Kochmar, Iulian Serban, François St-Hilaire, Jackie Chi Kit Cheung |
AAAI | 2 |
| 2021 | A Comparative Study of Learning Outcomes for Online Learning Platforms
François St-Hilaire, Nathan Burns, Robert Belfer, Muhammad Shayan, Ariella Smofsky, Dung Do Vu, Antoine Frau, Joseph Potochny, Farid Faraji, Vincent Pavero, Neroli Ko, Ansona Onyi Ching, Sabina Elkins, Anush Stepanyan, Adela Matajova, Laurent Charlin, Yoshua Bengio, Iulian Serban, Ekaterina Kochmar |
AIED (2) | 3 |
| 2021 | Back-Training excels Self-Training at Unsupervised Domain Adaptation of Question Generation and Passage RetrievalabstractIn this work, we introduce back-training, an alternative to self-training for unsupervised domain adaptation (UDA) from source to target domain.While self-training generates synthetic training data where natural inputs are aligned with noisy outputs, back-training results in natural outputs aligned with noisy inputs.This significantly reduces the gap between the target domain and synthetic data distribution, and reduces model overfitting to the source domain.We run UDA experiments on question generation and passage retrieval from the Natural Questions domain to machine learning and biomedical domains.We find that back-training vastly outperforms selftraining by a mean improvement of 7.8 BLEU-4 points on generation, and 17.6% top-20 retrieval accuracy across both domains.We further propose consistency filters to remove low-quality synthetic data before training.We also release a new domain-adaptation dataset-MLQuestions containing 35K unaligned questions, 50K unaligned passages, and 3K aligned question-passage pairs. Devang Kulshreshtha, Robert Belfer, Iulian Serban, Siva Reddy |
EMNLP (1) | 2 |
| 2020 | Automated Personalized Feedback Improves Learning Gains in An Intelligent Tutoring System
Ekaterina Kochmar, Dung Do Vu, Robert Belfer, Iulian Serban, Joelle Pineau |
AIED (2) | 3 |
| 2020 | A Large-Scale, Open-Domain, Mixed-Interface Dialogue-Based ITS for STEM
Iulian Serban, Ekaterina Kochmar, Dung Do Vu, Robert Belfer, Joelle Pineau, Aaron C. Courville, Laurent Charlin, Yoshua Bengio |
AIED (2) | 5 |
| 2020 | C-Space tunnel discovery for puzzle path planningabstractRigid body disentanglement puzzles are challenging for both humans and motion planning algorithms because their solutions involve tricky twisting and sliding moves that correspond to navigating through narrow tunnels in the puzzle's configuration space (C-space). We propose a tunnel-discovery and planning strategy for solving these puzzles. First, we locate important features on the pieces using geometric heuristics and machine learning, and then match pairs of these features to discover collision free states in the puzzle's C-space that lie within the narrow tunnels. Second, we propose a Rapidly-exploring Dense Tree (RDT) motion planner variant that builds tunnel escape roadmaps and then connects these roadmaps into a solution path connecting start and goal states. We evaluate our approach on a variety of challenging disentanglement puzzles and provide extensive baseline comparisons with other motion planning techniques. Xinya Zhang, Robert Belfer, Paul G. Kry, Etienne Vouga |
ACM Trans. Graph. | 2 |
| 2018 | Sentiment Analysis: It's Complicated!abstractSentiment analysis is used as a proxy to measure human emotion, where the objective is to categorize text according to some predefined notion of sentiment.Sentiment analysis datasets are typically constructed with gold-standard sentiment labels, assigned based on the results of manual annotations.When working with such annotations, it is common for dataset constructors to discard "noisy" or "controversial" data where there is significant disagreement on the proper label.In datasets constructed for the purpose of Twitter sentiment analysis (TSA), these controversial examples can compose over 30% of the originally annotated data.We argue that the removal of such data is a problematic trend because, when performing real-time sentiment classification of short-text, an automated system cannot know a priori which samples would fall into this category of disputed sentiment.We therefore propose the notion of a "complicated" class of sentiment to categorize such text, and argue that its inclusion in the short-text sentiment analysis framework will improve the quality of automated sentiment analysis systems as they are implemented in real-world settings.We motivate this argument by building and analyzing a new publicly available TSA dataset of over 7,000 tweets annotated with 5x coverage, named MTSA.Our analysis of classifier performance over our dataset offers insights into sentiment analysis dataset and model design, how current techniques would perform in the real world, and how researchers should handle difficult data. Kian Kenyon-Dean, Eisha Ahmed, Scott Fujimoto, Jeremy Georges-Filteau, Christopher Glasz, Barleen Kaur, Auguste Lalande, Shruti Bhanderi, Robert Belfer, Nirmal Kanagasabai, Roman Sarrazingendron, Derek Ruths |
NAACL-HLT | 9 |