{"url":"/dataset/boolq","name":"BoolQ","full_name":"Boolean Questions","description_markdown":"**BoolQ** is a question answering dataset for yes/no questions containing 15942 examples. These questions are naturally occurring – they are generated in unprompted and unconstrained settings.\r\nEach example is a triplet of (question, passage, answer), with the title of the page as optional additional context.\r\n\r\nQuestions are gathered from anonymized, aggregated queries to the Google search engine. Queries that are likely to be yes/no questions are heuristically identified and questions are only kept if a Wikipedia page is returned as one of the first five results, in which case the question and Wikipedia page are given to a human annotator for further processing. Annotators label question/article pairs in a three-step process. First, they decide if the question is good, meaning it is comprehensible, unambiguous, and requesting factual information. This judgment is made before the annotator sees the Wikipedia page. Next, for good questions, annotators find a passage within the document that contains enough information to answer the question. Annotators can mark questions as “not answerable” if the Wikipedia article does not contain the requested information. Finally, annotators mark whether the question’s answer is “yes” or “no”. Only questions that were marked as having a yes/no answer are used, and each question is paired with the selected passage instead of the entire document.\r\n\r\nSource: [https://github.com/google-research-datasets/boolean-questions](https://github.com/google-research-datasets/boolean-questions)\r\nImage Source: [BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions](https://paperswithcode.com/paper/boolq-exploring-the-surprising-difficulty-of/)","description_withheld":null,"homepage":"https://github.com/google-research-datasets/boolean-questions","introduced_date":"2019-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","first_author":"Christopher Clark","url":null},"license":{"name":"CC BY-SA 3.0","url":"https://creativecommons.org/licenses/by-sa/3.0/"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Classification","url":"/task/classification-1","datasets_with_task":"/datasets/task/classification-1"},{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Text Generation","url":"/task/text-generation","datasets_with_task":"/datasets/task/text-generation"},{"name":"parameter-efficient fine-tuning","url":"/task/parameter-efficient-fine-tuning","datasets_with_task":"/datasets/task/parameter-efficient-fine-tuning"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["BoolQ"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/d0rj/boolq-ru","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/boolq","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/1-800-SHARED-TASKS/boolq-TrueFalse-Instruct","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/Hindi-Gemma/boolq-TrueFalse-Instruct","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/google/boolq","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/bool_q","frameworks":["tf","jax"]},{"repo":"https://github.com/google-research-datasets/boolean-questions","url":"https://github.com/google-research-datasets/boolean-questions","frameworks":[]}],"num_papers_in_archive":701,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-boolq","task":"Question Answering","dataset_variant":"BoolQ","rows":65,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Mistral-Nemo 12B (HPT)","paper":"/paper/hierarchical-prompting-taxonomy-a-universal","metrics":{"Accuracy":"99.87"},"code_links":[{"title":"devichand579/HPT","url":"https://github.com/devichand579/HPT"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/parameter-efficient-fine-tuning-on-boolq","task":"parameter-efficient fine-tuning","dataset_variant":"BoolQ","rows":4,"metrics":["Accuracy (% )"],"first_row_in_archive_order":{"model":"LLaMA2-7b","paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","metrics":{"Accuracy (% )":"82.63"},"code_links":[{"title":"qwenlm/qwen","url":"https://github.com/qwenlm/qwen"},{"title":"QwenLM/Qwen-7B","url":"https://github.com/QwenLM/Qwen-7B"},{"title":"artidoro/qlora","url":"https://github.com/artidoro/qlora"},{"title":"huggingface/text-generation-inference","url":"https://github.com/huggingface/text-generation-inference"},{"title":"timdettmers/bitsandbytes","url":"https://github.com/timdettmers/bitsandbytes"},{"title":"qwenlm/qwen-vl","url":"https://github.com/qwenlm/qwen-vl"},{"title":"internlm/xtuner","url":"https://github.com/internlm/xtuner"},{"title":"openmedlab/pulse","url":"https://github.com/openmedlab/pulse"},{"title":"flagai-open/aquila2","url":"https://github.com/flagai-open/aquila2"},{"title":"pilancilab/caldera","url":"https://github.com/pilancilab/caldera"},{"title":"daniel-furman/sft-demos","url":"https://github.com/daniel-furman/sft-demos"},{"title":"ist-daslab/rosa","url":"https://github.com/ist-daslab/rosa"},{"title":"cornell-zhang/llm-datatypes","url":"https://github.com/cornell-zhang/llm-datatypes"},{"title":"brandon3964/multimodal-task-vector","url":"https://github.com/brandon3964/multimodal-task-vector"},{"title":"BatsResearch/LexC-Gen","url":"https://github.com/BatsResearch/LexC-Gen"},{"title":"jerrywu-code/susgen","url":"https://github.com/jerrywu-code/susgen"},{"title":"12kimih/hicupid","url":"https://github.com/12kimih/hicupid"},{"title":"Luohh5/Chain-of-Exemplar","url":"https://github.com/Luohh5/Chain-of-Exemplar"},{"title":"erikaawang/probing-multilingual-dynamics","url":"https://github.com/erikaawang/probing-multilingual-dynamics"},{"title":"Rain9876/ShareLoRA","url":"https://github.com/Rain9876/ShareLoRA"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/classification-on-boolq","task":"Classification","dataset_variant":"BoolQ","rows":2,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"OPT-1.3B","paper":"/paper/achieving-dimension-free-communication-in","metrics":{"Test Accuracy":"62.5%"},"code_links":[{"title":"ZidongLiu/DeComFL","url":"https://github.com/ZidongLiu/DeComFL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-classification-on-boolq","task":"Text Classification","dataset_variant":"BoolQ","rows":0,"metrics":["Accuracy"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-generation-on-boolq","task":"Text Generation","dataset_variant":"BoolQ","rows":0,"metrics":["acc"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/shakti-a-2-5-billion-parameter-small-language","title":"SHAKTI: A 2.5 Billion Parameter Small Language Model Optimized for Edge AI and Low-Resource Environments","date":"2024-10-15","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":5,"samples_ran":3,"samples_unverified":2,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hierarchical-prompting-taxonomy-a-universal","title":"Hierarchical Prompting Taxonomy: A Universal Evaluation Framework for Large Language Models Aligned with Human Cognitive Principles","date":"2024-06-18","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":6,"samples_ran":4,"samples_unverified":2,"pointer_only_for_licence":6,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/achieving-dimension-free-communication-in","title":"Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization","date":"2024-05-24","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":11,"samples_ran":6,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":15,"samples_ran":8,"samples_unverified":7,"pointer_only_for_licence":14,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":52,"samples_ran":31,"samples_unverified":21,"pointer_only_for_licence":16,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","title":"QLoRA: Efficient Finetuning of Quantized LLMs","date":"2023-05-23","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":26,"samples_ran":18,"samples_unverified":8,"pointer_only_for_licence":17,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":58,"samples_ran":37,"samples_unverified":21,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hyena-hierarchy-towards-larger-convolutional","title":"Hyena Hierarchy: Towards Larger Convolutional Language Models","date":"2023-02-21","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":5,"samples_ran":5,"samples_unverified":0,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hungry-hungry-hippos-towards-language","title":"Hungry Hungry Hippos: Towards Language Modeling with State Space Models","date":"2022-12-28","rows_on_this_dataset":5,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":15,"samples_ran":7,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/opt-iml-scaling-language-model-instruction","title":"OPT-IML: Scaling Language Model Instruction Meta Learning through the Lens of Generalization","date":"2022-12-22","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/toward-efficient-language-model-pretraining","title":"Toward Efficient Language Model Pretraining and Downstream Adaptation via Self-Evolution: A Case Study on SuperGLUE","date":"2022-12-04","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/ask-me-anything-a-simple-strategy-for","title":"Ask Me Anything: A simple strategy for prompting language models","date":"2022-10-05","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":2,"samples_ran":2,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/alexatm-20b-few-shot-learning-using-a-large","title":"AlexaTM 20B: Few-Shot Learning Using a Large-Scale Multilingual Seq2Seq Model","date":"2022-08-02","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":6,"samples_ran":6,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":16,"samples_ran":15,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":37,"samples_ran":32,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":11,"samples_ran":8,"samples_unverified":3,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":5,"samples_ran":5,"samples_unverified":0,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","rows_on_this_dataset":3,"code_links":8,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","rows_on_this_dataset":1,"code_links":74,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":84,"samples_ran":51,"samples_unverified":33,"pointer_only_for_licence":28,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":3,"samples_ran":1,"samples_unverified":2,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/muppet-massive-multi-task-representations","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","date":"2021-01-26","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":13,"samples_ran":4,"samples_unverified":9,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":65,"samples_ran":41,"samples_unverified":24,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":31,"samples_ran":21,"samples_unverified":10,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","date":"2019-05-24","rows_on_this_dataset":5,"code_links":1,"syntology":null}],"syntology_totals":{"read_at":"2026-09-25T09:33:49+00:00","papers_with_samples":23,"samples_harvested":469,"samples_ran":307,"samples_unverified":162,"pointer_only_for_licence":108,"papers_with_no_sample_that_ran":1,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}