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

Adam Richardson

dblp:186/8171 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Artificial intelligence
1 paper
Multi-agent systems · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
incentive mechanism
0.812024
Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization · AAAI 2024
Algorithmic game theory and mechanism design › mechanism design › incentive mechanism design
peer prediction
0.812024
Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization · AAAI 2024
Knowledge, reasoning and agents › Multi-agent systems
crowdsourcing
0.212024
Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization · AAAI 2024

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

peer prediction · 1.5neighborhood matching · 1.5
YearPublicationVenuePosition
2024 Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization
abstract
Peer prediction incentive mechanisms for crowdsourcing are generally limited to eliciting samples from categorical distributions. Prior work on extending peer prediction to arbitrary distributions has largely relied on assumptions on the structures of the distributions or known properties of the data providers. We introduce a novel class of incentive mechanisms that extend peer prediction mechanisms to arbitrary distributions by replacing the notion of an exact match with a concept of neighborhood matching. We present conditions on the belief updates of the data providers that guarantee incentive-compatibility for rational data providers, and admit a broad class of possible reasonable updates.
Adam Richardson, Boi Faltings
AAAI1
2022 Drug repurposing based on a quantum-inspired method versus classical fingerprinting uncovers potential antivirals against SARS-CoV-2
abstract
The COVID-19 pandemic has accelerated the need to identify new antiviral therapeutics at pace, including through drug repurposing. We employed a Quadratic Unbounded Binary Optimization (QUBO) model, to search for compounds similar to Remdesivir, the first antiviral against SARS-CoV-2 approved for human use, using a quantum-inspired device. We modelled Remdesivir and compounds present in the DrugBank database as graphs, established the optimal parameters in our algorithm and resolved the Maximum Weighted Independent Set problem within the conflict graph generated. We also employed a traditional Tanimoto fingerprint model. The two methods yielded different lists of lead compounds, with some overlap. While GS-6620 was the top compound predicted by both models, the QUBO model predicted BMS-986094 as second best. The Tanimoto model predicted different forms of cobalamin, also known as vitamin B12. We then determined the half maximal inhibitory concentration (IC50) values in cell culture models of SARS-CoV-2 infection and assessed cytotoxicity. We also demonstrated efficacy against several variants including SARS-CoV-2 Strain England 2 (England 02/2020/407073), B.1.1.7 (Alpha), B.1.351 (Beta) and B.1.617.2 (Delta). Lastly, we employed an in vitro polymerization assay to demonstrate that these compounds directly inhibit the RNA-dependent RNA polymerase (RdRP) of SARS-CoV-2. Together, our data reveal that our QUBO model performs accurate comparisons (BMS-986094) that differed from those predicted by Tanimoto (different forms of vitamin B12); all compounds inhibited replication of SARS-CoV-2 via direct action on RdRP, with both models being useful. While Tanimoto may be employed when performing relatively small comparisons, QUBO is also accurate and may be well suited for very complex problems where computational resources may limit the number and/or complexity of possible combinations to evaluate. Our quantum-inspired screening method can therefore be employed in future searches for novel pharmacologic inhibitors, thus providing an approach for accelerating drug deployment.
Jose M. Jimenez-Guardeño, Ana Maria Ortega-Prieto, Borja Menendez Moreno, Thomas J. A. Maguire, Adam Richardson, Juan Ignacio Diaz-Hernandez, Javier Díez-Pérez, Mark Zuckerman, Albert Mercadal Playa, Carlos Cordero Deline, Michael H. Malim, Rocio Teresa Martinez-Nunez
PLoS Comput. Biol.5
2017 Shape completion enabled robotic grasping
abstract
This work provides an architecture to enable robotic grasp planning via shape completion. Shape completion is accomplished through the use of a 3D convolutional neural network (CNN). The network is trained on our own new open source dataset of over 440,000 3D exemplars captured from varying viewpoints. At runtime, a 2.5D pointcloud captured from a single point of view is fed into the CNN, which fills in the occluded regions of the scene, allowing grasps to be planned and executed on the completed object. Runtime shape completion is very rapid because most of the computational costs of shape completion are borne during offline training. We explore how the quality of completions vary based on several factors. These include whether or not the object being completed existed in the training data and how many object models were used to train the network. We also look at the ability of the network to generalize to novel objects allowing the system to complete previously unseen objects at runtime. Finally, experimentation is done both in simulation and on actual robotic hardware to explore the relationship between completion quality and the utility of the completed mesh model for grasping.
Jacob Varley, Chad DeChant, Adam Richardson, Joaquín Ruales, Peter K. Allen
IROS3