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

Sam Havens

dblp:361/7360 · 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
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › evaluation › benchmark
benchmark construction
0.912025
FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents · NeurIPS 2025
Information retrieval
ranking
0.912025
FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents · NeurIPS 2025
Information retrieval
reranking
0.912025
FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents · NeurIPS 2025
Information retrieval
retrieval-augmented generation
0.912025
FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents · NeurIPS 2025
Information retrieval
retrieval evaluation
0.912025
FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents · NeurIPS 2025
Machine learning › Efficient and distributed learning › efficient training
efficient pre-training
0.712023
MosaicBERT: A Bidirectional Encoder Optimized for Fast Pretraining · NeurIPS 2023

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

nugget-based evaluation · 0.9hybrid retrieval · 0.9masked language modeling · 0.7low precision layernorm · 0.7gated linear unit · 0.7flashattention · 0.7ALiBi · 0.7
YearPublicationVenuePosition
2025 FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents
abstract
We introduce FreshStack, a holistic framework for automatically building information retrieval (IR) evaluation benchmarks by incorporating challenging questions and answers. FreshStack conducts the following steps:(1) automatic corpus collection from code and technical documentation,(2) nugget generation from community-asked questions and answers, and(3) nugget-level support, retrieving documents using a fusion of retrieval techniques and hybrid architectures.We use FreshStack to build five datasets on fast-growing, recent, and niche domains to ensure the tasks are sufficiently challenging. On FreshStack, existing retrieval models, when applied out-of-the-box, significantly underperform oracle approaches on all five domains, denoting plenty of headroom to improve IR quality. In addition, we identify cases where rerankers do not improve first-stage retrieval accuracy (two out of five domains) and oracle context helps an LLM generator generate a high-quality RAG answer.We hope FreshStack will facilitate future work toward constructing realistic, scalable, and uncontaminated IR and RAG evaluation benchmarks.
Nandan Thakur, Jimmy Lin, Sam Havens, Michael Carbin, Omar Khattab, Andrew Drozdov
NeurIPS3
2023 MosaicBERT: A Bidirectional Encoder Optimized for Fast Pretraining
abstract
Although BERT-style encoder models are heavily used in NLP research, many researchers do not pretrain their own BERTs from scratch due to the high cost of training. In the past half-decade since BERT first rose to prominence, many advances have been made with other transformer architectures and training configurations that have yet to be systematically incorporated into BERT. Here, we introduce MosaicBERT, a BERT-style encoder architecture and training recipe that is empirically optimized for fast pretraining. This efficient architecture incorporates FlashAttention, Attention with Linear Biases (ALiBi), Gated Linear Units (GLU), a module to dynamically remove padded tokens, and low precision LayerNorm into the classic transformer encoder block. The training recipe includes a 30% masking ratio for the Masked Language Modeling (MLM) objective, bfloat16 precision, and vocabulary size optimized for GPU throughput, in addition to best-practices from RoBERTa and other encoder models. When pretrained from scratch on the C4 dataset, this base model achieves a downstream average GLUE (dev) score of 79.6 in 1.13 hours on 8 A100 80 GB GPUs at a cost of roughly $20. We plot extensive accuracy vs. pretraining speed Pareto curves and show that MosaicBERT base and large are consistently Pareto optimal when compared to a competitive BERT base and large. This empirical speed up in pretraining enables researchers and engineers to pretrain custom BERT-style models at low cost instead of finetune on existing generic models. We open source our model weights and code.
Jacob P. Portes, Alexander Trott, Sam Havens, Daniel King, Abhinav Venigalla, Moin Nadeem, Nikhil Sardana, Daya Khudia, Jonathan Frankle
NeurIPS3