--- title: "Amos Storkey — author profile and papers · Summarization" description: "Amos Storkey, University of Edinburgh: 2 papers on Elamur Research (2018–2026), h-index 47 — affiliations, topics, co-authors and who…" canonical: "https://research.elamur.ai/free/en/authors/amos-storkey/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/amos-storkey/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Amos Storkey # Amos Storkey Amos Storkey has 2 papers in our library, in 2018–2026, most of them on [Summarization](https://md.research.elamur.ai/free/en/topics/summarization/), [Efficient models & compression](https://md.research.elamur.ai/free/en/topics/efficient-models/); often with [Boyang Xue](https://md.research.elamur.ai/free/en/authors/boyang-xue/), [Hongru Wang](https://md.research.elamur.ai/free/en/authors/hongru-wang/), [Jeff Z. Pan](https://md.research.elamur.ai/free/en/authors/jeff-z-pan/). 2 papers in our library · 2018–2026 [OpenAlex](https://openalex.org/A5007901825) · [ORCID](https://orcid.org/0000-0002-8100-506X) · [Wikidata](https://www.wikidata.org/wiki/Q131127505) · [**h-index 47**](https://openalex.org/authors/A5007901825) · [231 works](https://openalex.org/works?filter=author.id:A5007901825) · [25,422 citations](https://openalex.org/works?filter=author.id:A5007901825&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/amos-storkey/#papers) · [🔗 Cited 96 times in our library](https://md.research.elamur.ai/free/en/authors/amos-storkey/cited-by/) · [4 more in our library without a page yet](#also) · [⭐ Paper Stars ranking: #5527](https://md.research.elamur.ai/free/en/paper-stars/page/56/#star-5527) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Amos+Storkey) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Amos+Storkey) · [dblp](https://dblp.org/search?q=Amos+Storkey) · [ACL Anthology](https://aclanthology.org/search/?q=Amos+Storkey) ## Affiliations [🎓**University of Edinburgh** Edinburgh · United Kingdom 1999–2025 · 133 papers*current*](https://md.research.elamur.ai/free/en/universities/university-of-edinburgh/) · [🎓**Imperial College London** London · United Kingdom 1996–1999 · 5 papers](https://md.research.elamur.ai/free/en/universities/imperial-college-london/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 2 more institutions on single bylines are not listed. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 4 The field of science this work belongs to (OpenAlex fields).[Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Decision Sciences · 1 work](https://md.research.elamur.ai/free/en/shelves/decision-sciences/) · [Management Science and Operations Research · 1 work](https://md.research.elamur.ai/free/en/shelves/decision-sciences/management-science-and-operations-research/) 🧭 Topics 2 Research subjects and languages the work is about.[Efficient models & compression · 1 work](https://md.research.elamur.ai/free/en/topics/efficient-models/) · [Summarization · 1 work](https://md.research.elamur.ai/free/en/topics/summarization/) ## Works by year ### 2020s [**2026** 1 paper](https://md.research.elamur.ai/free/en/authors/amos-storkey/year/2026/) ### 2010s [**2018** 1 paper](https://md.research.elamur.ai/free/en/authors/amos-storkey/year/2018/) ## Papers The most cited first (OpenAlex and our library). 1. **[Exploration by Random Network Distillation](https://md.research.elamur.ai/free/en/papers/burda-2018-exploration-random-network-distillation/)** *(2018 · 302 citations)* Deep reinforcement learning agents often fail when rewards are sparse. Many existing curiosity-style or count-style exploration techniques are also hard to run across many parallel environments. The authors propose Random Network Distillation (RND). A fixed, randomly initialized target network maps each observation… 2. **[Self-Sum: Teaching an Agent to Decide Itself When and What to Summarize](https://md.research.elamur.ai/free/en/papers/wang-2026-self-sum-teaching-agent-decide/)** *(2026)* Agents that tackle long tasks pile up reasoning steps, actions and observations. Their context grows noisy and expensive to process. Common fixes compress history on a fixed schedule or hand the job to an external model. These approaches ignore where the agent actually is in the task and can discard crucial details.… ## All works 6 works of theirs in our library, the most cited first; 2 with a page here, the others link their original until we summarise them. 1. **[The 2005 PASCAL Visual Object Classes Challenge ↗](https://doi.org/10.1007/11736790_8) Lecture notes in computer science · no summary yet**Mark Everingham et al.*2006 · 743 citations* 2. **[Probabilistic inference for solving discrete and continuous state Markov Decision Processes ↗](https://doi.org/10.1145/1143844.1143963) International Conference on Machine Learning · no summary yet**Marc Toussaint, Amos Storkey*2006 · 484 citations* 3. **[Large-Scale Study of Curiosity-Driven Learning ↗](https://arxiv.org/abs/1808.04355) arXiv:1808.04355 · no summary yet**Yuri Burda et al.*2018 · 357 citations* 4. [**Exploration by Random Network Distillation arXiv:1810.12894**Yuri Burda, Harrison Edwards, Amos Storkey, et al.*2018 · 302 citations*](https://md.research.elamur.ai/free/en/papers/burda-2018-exploration-random-network-distillation/) 5. **[Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment ↗](https://doi.org/10.1007/11736790) Lecture notes in computer science · no summary yet**Mark Everingham et al.*2006 · 218 citations* 6. **[Self-Sum: Teaching an Agent to Decide Itself When and What to Summarize](https://md.research.elamur.ai/free/en/papers/wang-2026-self-sum-teaching-agent-decide/) [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/)**Hongru Wang, Rui Wang, Jushi Kai, et al.*2026* ## Co-authors here 7 co-authors with a page, the most papers together first. - [Boyang Xue](https://md.research.elamur.ai/free/en/authors/boyang-xue/) - [Hongru Wang](https://md.research.elamur.ai/free/en/authors/hongru-wang/) - [Jeff Z. Pan](https://md.research.elamur.ai/free/en/authors/jeff-z-pan/) - [Rui Wang](https://md.research.elamur.ai/free/en/authors/rui-wang/) - [Shijue Huang](https://md.research.elamur.ai/free/en/authors/shijue-huang/) - [Yongqi Li](https://md.research.elamur.ai/free/en/authors/yongqi-li/) - [Yuri Burda](https://md.research.elamur.ai/free/en/authors/yuri-burda/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - Lecture notes in computer science ×2 - [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/): [Findings of the Association for Computational Linguistics 2026](https://md.research.elamur.ai/free/en/venues/findings/2026/) - International Conference on Machine Learning ## Cited by Papers of our library cite their works 96 times (of the 149,439 papers whose bibliographies we read); [7 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/amos-storkey/cited-by/). Updated 2 November 2026