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

Zachary S. Siegel

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

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

Artificial intelligence and machine learning · 2 · 2 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 44% Language models and text generation · 44% Robot manipulation · 13%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval
reasoning-intensive retrieval
0.912025
BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval · ICLR 2025
Information retrieval
retrieval models
0.912025
BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
hierarchical planning
0.812024
Learning Grounded Action Abstractions from Language · ICLR 2024
Information retrieval
evaluation
0.312025
BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval · ICLR 2025
Information retrieval › evaluation › test collection
retrieval benchmark
0.312025
BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval · ICLR 2025
Robotics › Robot manipulation
language-conditioned task planning
0.212024
Learning Grounded Action Abstractions from Language · ICLR 2024

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

language model · 0.8hierarchical planner · 0.8goal-conditioned policy · 0.8
YearPublicationVenuePosition
2025 BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval
abstract
Existing retrieval benchmarks primarily consist of information-seeking queries (e.g., aggregated questions from search engines) where keyword or semantic-based retrieval is usually sufficient. However, many complex real-world queries require in-depth reasoning to identify relevant documents that go beyond surface form matching. For example, finding documentation for a coding question requires understanding the logic and syntax of the functions involved. To better benchmark retrieval on such challenging queries, we introduce BRIGHT, the first text retrieval benchmark that requires intensive reasoning to retrieve relevant documents. Our dataset consists of 1,398 real-world queries spanning diverse domains such as economics, psychology, mathematics, coding, and more. These queries are drawn from naturally occurring or carefully curated human data. Extensive evaluation reveals that even state-of-the-art retrieval models perform poorly on BRIGHT. The leading model on the MTEB leaderboard (Muennighoff et al., 2023), which achieves a score of 59.0 nDCG@10,1 produces a score of nDCG@10 of 18.0 on BRIGHT. We show that incorporating explicit reasoning about the query improves retrieval performance by up to 12.2 points. Moreover, incorporating retrieved documents from the top-performing retriever boosts question answering performance by over 6.6 points. We believe that BRIGHT paves the way for future research on retrieval systems in more realistic and challenging settings.
Hongjin Su, Howard Yen, Mengzhou Xia, Niklas Muennighoff, Han-yu Wang, Haisu Liu, Zachary S. Siegel, Michael Tang, Ruoxi Sun 0002, Jinsung Yoon, Sercan Ö. Arik, Danqi Chen 0001, Tao Yu 0009
ICLR9
2024 Learning Grounded Action Abstractions from Language
abstract
Effective planning in the real world requires not only world knowledge, but the ability to leverage that knowledge to build the right representation of the task at hand. Decades of hierarchical planning techniques have used domain-specific temporal action abstractions to support efficient and accurate planning, almost always relying on human priors and domain knowledge to decompose hard tasks into smaller subproblems appropriate for a goal or set of goals. This paper describes Ada (Action Domain Acquisition), a framework for automatically constructing task-specific planning representations using task-general background knowledge from language models (LMs). Starting with a general-purpose hierarchical planner and a low-level goal-conditioned policy, Ada interactively learns a library of planner-compatible high-level action abstractions and low-level controllers adapted to a particular domain of planning tasks. On two language-guided interactive planning benchmarks (Mini Minecraft and ALFRED Household Tasks), Ada strongly outperforms other approaches that use LMs for sequential decision-making, offering more accurate plans and better generalization to complex tasks.
Lionel Wong, Jiayuan Mao, Pratyusha Sharma, Zachary S. Siegel, Jiahai Feng, Noa Korneev, Josh Tenenbaum, Jacob Andreas
ICLR4