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

Ethan C. Chau

dblp:275/3867 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0008-8851-6701ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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
2 papers
Question answering and dialogue systems · 54% Efficient and distributed learning · 46%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
query log analysis
0.912025
Researchy Questions: A Dataset of Multi-Perspective, Decompositional Questions for Deep Research · SIGIR 2025
Machine learning › Efficient and distributed learning › inference efficiency
context compression
0.812024
Dodo: Dynamic Contextual Compression for Decoder-only LMs · ACL (1) 2024
Natural language and speech › Question answering and dialogue systems › question understanding
question decomposition
0.312025
Researchy Questions: A Dataset of Multi-Perspective, Decompositional Questions for Deep Research · SIGIR 2025
Machine learning › Efficient and distributed learning
model compression
0.212024
Dodo: Dynamic Contextual Compression for Decoder-only LMs · ACL (1) 2024

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

slow thinking · 1.7large language model · 1.7decomposition · 1.7parameter tuning · 0.8LoRA · 0.8
YearPublicationVenuePosition
2025 Researchy Questions: A Dataset of Multi-Perspective, Decompositional Questions for Deep Research
abstract
Existing question answering (QA) datasets are no longer challenging to most powerful Large Language Models (LLMs). Traditional QA benchmarks like TriviaQA, NaturalQuestions, ELI5 and HotpotQA mainly study ''known unknowns'' with clear indications of both what information is missing, and how to find it to answer the question. A yet unmet need of the NLP community is a bank of non-factoid, multi-perspective questions involving a great deal of unclear information needs, i.e. ''unknown unknowns''. We claim we can find such questions in search engine logs, which is surprising because most question-intent queries are indeed factoid. Furthermore, recent products like Google's DeepResearch (announced a year after this resource was released publicly) specifically address such queries, retrieving hundreds of documents to synthesize report-style responses. We present Researchy Questions, the world's first, only and largest public dataset of ''Deep Research'' questions filtered from real search engine logs to be non-factoid, ''decompositional'' and multi-perspective. We show that users spend substantial ''effort'' on these questions in terms of signals like clicks and session length. We also show that ''slow thinking'' answering techniques, like decomposition into sub-questions shows benefit over answering directly. We release (at https://huggingface.co/datasets/corbyrosset/researchy_questions) about 100k Researchy Questions with a permissive CDLA-2.0 license, along with click histograms on over 350k Clueweb22 URLs that were clicked for each question.
Corbin Rosset, Ho-Lam Chung, Guanghui Qin, Ethan C. Chau, Ahmed Awadallah 0001, Jennifer Neville, Nikhil Rao 0001
SIGIR4
2024 Dodo: Dynamic Contextual Compression for Decoder-only LMs
abstract
Transformer-based language models (LMs) are inefficient in long contexts.We propose DODO , a solution for context compression.Instead of one vector per token in a standard transformer model, DODO represents text with a dynamic number of hidden states at each layer, reducing the cost of self-attention to a fraction of typical time and space.Moreover, off-the-shelf models such as LLAMA can be adapted to DODO by efficient parameter tuning methods such as LoRA.In use, DODO can act as either an autoregressive LM or a context compressor for downstream tasks.We demonstrate through experiments in language modeling, question answering, and summarization that DODO retains capabilities in these tasks, while drastically reducing the overhead during decoding.For example, in the autoencoding task, DODO shrinks context at a 20x compression ratio with a BLEU score of 98% for reconstruction, achieving nearly lossless encoding.
Guanghui Qin, Corby Rosset, Ethan C. Chau, Benjamin Van Durme
ACL (1)3