default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoshua Lockhart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i9]Tiffany Tuor, Joshua Lockhart, Daniele Magazzeni:
Asynchronous Collaborative Learning Across Data Silos. CoRR abs/2203.12637 (2022)- [i8]Thomas Spooner, Rui Silva, Joshua Lockhart, Jason Long, Vacslav Glukhov:
Reductive MDPs: A Perspective Beyond Temporal Horizons. CoRR abs/2205.07338 (2022) - [i7]Mattia Villani, Joshua Lockhart, Daniele Magazzeni:
Feature Importance for Time Series Data: Improving KernelSHAP. CoRR abs/2210.02176 (2022) - [i6]Joshua Lockhart, Nicolas Marchesotti, Daniele Magazzeni, Manuela Veloso:
Towards learning to explain with concept bottleneck models: mitigating information leakage. CoRR abs/2211.03656 (2022) - [i5]Joshua Lockhart, Daniele Magazzeni, Manuela Veloso:
Learn to explain yourself, when you can: Equipping Concept Bottleneck Models with the ability to abstain on their concept predictions. CoRR abs/2211.11690 (2022) - 2021
- [c4]Tiffany Tuor, Joshua Lockhart, Daniele Magazzeni:
Asynchronous collaborative learning across data silos. ICAIF 2021: 29:1-29:8 - 2020
- [c3]Joshua Lockhart, Samuel Assefa, Ayham Alajdad, Andrew Alexander, Tucker Balch, Manuela Veloso:
SURF: improving classifiers in production by learning from busy and noisy end users. ICAIF 2020: 37:1-37:8 - [i4]Joshua Lockhart, Samuel Assefa, Tucker Balch, Manuela Veloso:
Some people aren't worth listening to: periodically retraining classifiers with feedback from a team of end users. CoRR abs/2004.13152 (2020) - [i3]Joshua Lockhart, Samuel Assefa, Ayham Alajdad, Andrew Alexander, Tucker Balch, Manuela Veloso:
SURF: Improving classifiers in production by learning from busy and noisy end users. CoRR abs/2010.05852 (2020)
2010 – 2019
- 2019
- [b1]Joshua Lockhart:
Combinatorial structures in quantum information. University College London, UK, 2019 - [i2]Tucker Hybinette Balch, Mahmoud Mahfouz, Joshua Lockhart, Maria Hybinette, David Byrd:
How to Evaluate Trading Strategies: Single Agent Market Replay or Multiple Agent Interactive Simulation? CoRR abs/1906.12010 (2019) - 2018
- [c2]Erik D. Demaine, Joshua Lockhart, Jayson Lynch:
The Computational Complexity of Portal and Other 3D Video Games. FUN 2018: 19:1-19:22 - 2017
- [j1]Joshua Lockhart
, Otfried Gühne, Simone Severini:
Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs. Electron. Notes Discret. Math. 61: 819-825 (2017) - 2016
- [c1]Joshua Lockhart, Giorgia Minello, Luca Rossi, Simone Severini, Andrea Torsello:
Edge Centrality via the Holevo Quantity. S+SSPR 2016: 143-152 - [i1]Erik D. Demaine, Joshua Lockhart, Jayson Lynch:
The Computational Complexity of Portal and Other 3D Video Games. CoRR abs/1611.10319 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
