default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason Pazis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j1]Dong-Ki Kim
, Shayegan Omidshafiei, Jason Pazis, Jonathan P. How:
Crossmodal attentive skill learner: learning in Atari and beyond with audio-video inputs. Auton. Agents Multi Agent Syst. 34(1): 16 (2020)
2010 – 2019
- 2018
- [c12]Shayegan Omidshafiei, Dong-Ki Kim, Jason Pazis, Jonathan P. How:
Crossmodal Attentive Skill Learner. AAMAS 2018: 139-146 - 2017
- [c11]Shayegan Omidshafiei, Jason Pazis, Christopher Amato, Jonathan P. How, John Vian:
Deep Decentralized Multi-task Multi-Agent Reinforcement Learning under Partial Observability. ICML 2017: 2681-2690 - [c10]Liam Paull, Jacopo Tani, Heejin Ahn, Javier Alonso-Mora, Luca Carlone, Michal Cáp, Yu Fan Chen, Changhyun Choi, Jeff Dusek, Yajun Fang, Daniel Hoehener, Shih-Yuan Liu, Michael Novitzky, Igor Franzoni Okuyama, Jason Pazis, Guy Rosman, Valerio Varricchio, Hsueh-Cheng Wang, Dmitry S. Yershov, Hang Zhao, Michael Benjamin, Christopher Carr, Maria T. Zuber, Sertac Karaman, Emilio Frazzoli, Domitilla Del Vecchio, Daniela Rus, Jonathan P. How, John J. Leonard, Andrea Censi:
Duckietown: An open, inexpensive and flexible platform for autonomy education and research. ICRA 2017: 1497-1504 - [i2]Shayegan Omidshafiei, Jason Pazis, Christopher Amato, Jonathan P. How, John Vian:
Deep Decentralized Multi-task Multi-Agent Reinforcement Learning under Partial Observability. CoRR abs/1703.06182 (2017) - [i1]Shayegan Omidshafiei, Dong-Ki Kim, Jason Pazis, Jonathan P. How:
Crossmodal Attentive Skill Learner. CoRR abs/1711.10314 (2017) - 2016
- [c9]Jason Pazis, Ronald Parr:
Efficient PAC-Optimal Exploration in Concurrent, Continuous State MDPs with Delayed Updates. AAAI 2016: 1977-1985 - [c8]Jason Pazis, Ronald Parr, Jonathan P. How:
Improving PAC Exploration Using the Median Of Means. NIPS 2016: 3891-3899 - 2015
- [b1]Jason Pazis:
PAC-optimal, Non-parametric Algorithms and Bounds for Exploration in Concurrent MDPs with Delayed Updates. Duke University, Durham, NC, USA, 2015 - 2013
- [c7]Jason Pazis, Ronald Parr:
PAC Optimal Exploration in Continuous Space Markov Decision Processes. AAAI 2013: 774-781 - [c6]Jason Pazis, Ronald Parr:
Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming. AAAI 2013: 782-788 - 2011
- [c5]Jason Pazis, Ronald Parr:
Non-Parametric Approximate Linear Programming for MDPs. AAAI 2011: 459-464 - [c4]Jason Pazis, Michail G. Lagoudakis:
Reinforcement learning in multidimensional continuous action spaces. ADPRL 2011: 97-104 - [c3]Jason Pazis, Ronald Parr:
Generalized Value Functions for Large Action Sets. ICML 2011: 1185-1192
2000 – 2009
- 2009
- [c2]Jason Pazis, Michail G. Lagoudakis:
Learning continuous-action control policies. ADPRL 2009: 169-176 - [c1]Jason Pazis, Michail G. Lagoudakis:
Binary action search for learning continuous-action control policies. ICML 2009: 793-800
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-04-24 23:16 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:
