default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAran Nayebi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Aran Nayebi
, Nathan C. L. Kong, Chengxu Zhuang, Justin L. Gardner, Anthony M. Norcia, Daniel L. K. Yamins:
Mouse visual cortex as a limited resource system that self-learns an ecologically-general representation. PLoS Comput. Biol. 19(10) (2023)- [c10]Aran Nayebi, Rishi Rajalingham, Mehrdad Jazayeri, Guangyu Robert Yang:
Neural Foundations of Mental Simulation: Future Prediction of Latent Representations on Dynamic Scenes. NeurIPS 2023 - [i14]Aran Nayebi, Rishi Rajalingham, Mehrdad Jazayeri, Guangyu Robert Yang:
Neural Foundations of Mental Simulation: Future Prediction of Latent Representations on Dynamic Scenes. CoRR abs/2305.11772 (2023) - [i13]Aran Nayebi:
A Goal-Driven Approach to Systems Neuroscience. CoRR abs/2311.02704 (2023) - 2022
- [j4]Aran Nayebi, Javier Sagastuy-Breña, Daniel M. Bear, Kohitij Kar, Jonas Kubilius, Surya Ganguli, David Sussillo, James J. DiCarlo, Daniel L. K. Yamins:
Recurrent Connections in the Primate Ventral Visual Stream Mediate a Trade-Off Between Task Performance and Network Size During Core Object Recognition. Neural Comput. 34(8): 1652-1675 (2022) - 2021
- [j3]Chengxu Zhuang, Siming Yan, Aran Nayebi, Martin Schrimpf, Michael C. Frank, James J. DiCarlo, Daniel L. K. Yamins:
Unsupervised neural network models of the ventral visual stream. Proc. Natl. Acad. Sci. USA 118(3): e2014196118 (2021) - [c9]Aran Nayebi, Alexander Attinger, Malcolm Campbell, Kiah Hardcastle, Isabel Low, Caitlin S. Mallory, Gabriel Mel, Ben Sorscher, Alex H. Williams, Surya Ganguli, Lisa M. Giocomo, Daniel L. K. Yamins:
Explaining heterogeneity in medial entorhinal cortex with task-driven neural networks. NeurIPS 2021: 12167-12179 - 2020
- [c8]Daniel Kunin, Aran Nayebi, Javier Sagastuy-Breña, Surya Ganguli, Jonathan M. Bloom, Daniel Yamins:
Two Routes to Scalable Credit Assignment without Weight Symmetry. ICML 2020: 5511-5521 - [c7]Daniel Bear, Chaofei Fan, Damian Mrowca, Yunzhu Li, Seth Alter, Aran Nayebi, Jeremy Schwartz, Li Fei-Fei, Jiajun Wu, Josh Tenenbaum, Daniel L. K. Yamins:
Learning Physical Graph Representations from Visual Scenes. NeurIPS 2020 - [c6]Aran Nayebi, Sanjana Srivastava, Surya Ganguli, Daniel L. K. Yamins:
Identifying Learning Rules From Neural Network Observables. NeurIPS 2020 - [i12]Daniel Kunin, Aran Nayebi, Javier Sagastuy-Breña, Surya Ganguli, Jonathan M. Bloom, Daniel L. K. Yamins:
Two Routes to Scalable Credit Assignment without Weight Symmetry. CoRR abs/2003.01513 (2020) - [i11]Daniel M. Bear, Chaofei Fan, Damian Mrowca, Yunzhu Li, Seth Alter, Aran Nayebi, Jeremy Schwartz, Li Fei-Fei, Jiajun Wu, Joshua B. Tenenbaum, Daniel L. K. Yamins:
Learning Physical Graph Representations from Visual Scenes. CoRR abs/2006.12373 (2020) - [i10]Aran Nayebi, Sanjana Srivastava, Surya Ganguli, Daniel L. K. Yamins:
Identifying Learning Rules From Neural Network Observables. CoRR abs/2010.11765 (2020)
2010 – 2019
- 2019
- [c5]Hidenori Tanaka, Aran Nayebi, Niru Maheswaranathan, Lane McIntosh, Stephen Baccus, Surya Ganguli:
From deep learning to mechanistic understanding in neuroscience: the structure of retinal prediction. NeurIPS 2019: 8535-8545 - [c4]Jonas Kubilius, Martin Schrimpf, Ha Hong, Najib J. Majaj, Rishi Rajalingham, Elias B. Issa, Kohitij Kar, Pouya Bashivan, Jonathan Prescott-Roy, Kailyn Schmidt, Aran Nayebi, Daniel Bear, Daniel L. K. Yamins, James J. DiCarlo:
Brain-Like Object Recognition with High-Performing Shallow Recurrent ANNs. NeurIPS 2019: 12785-12796 - [i9]Jonas Kubilius, Martin Schrimpf, Ha Hong, Najib J. Majaj, Rishi Rajalingham, Elias B. Issa, Kohitij Kar, Pouya Bashivan, Jonathan Prescott-Roy, Kailyn Schmidt, Aran Nayebi, Daniel Bear, Daniel L. K. Yamins, James J. DiCarlo:
Brain-Like Object Recognition with High-Performing Shallow Recurrent ANNs. CoRR abs/1909.06161 (2019) - [i8]Hidenori Tanaka, Aran Nayebi, Niru Maheswaranathan, Lane McIntosh, Stephen A. Baccus, Surya Ganguli:
From deep learning to mechanistic understanding in neuroscience: the structure of retinal prediction. CoRR abs/1912.06207 (2019) - 2018
- [c3]Aran Nayebi, Daniel Bear, Jonas Kubilius, Kohitij Kar, Surya Ganguli, David Sussillo, James J. DiCarlo, Daniel L. K. Yamins:
Task-Driven Convolutional Recurrent Models of the Visual System. NeurIPS 2018: 5295-5306 - [i7]Aran Nayebi, Daniel Bear, Jonas Kubilius, Kohitij Kar, Surya Ganguli, David Sussillo, James J. DiCarlo, Daniel L. K. Yamins:
Task-Driven Convolutional Recurrent Models of the Visual System. CoRR abs/1807.00053 (2018) - 2017
- [c2]Pradeep Javangula, Kourosh Modarresi, Paresh Shenoy, Yi Liu, Aran Nayebi:
Efficient Hybrid Algorithms for Computing Clusters Overlap. ICCS 2017: 1050-1059 - [i6]Aran Nayebi, Surya Ganguli:
Biologically inspired protection of deep networks from adversarial attacks. CoRR abs/1703.09202 (2017) - 2016
- [c1]Lane McIntosh, Niru Maheswaranathan, Aran Nayebi, Surya Ganguli, Stephen Baccus:
Deep Learning Models of the Retinal Response to Natural Scenes. NIPS 2016: 1361-1369 - 2015
- [j2]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Quantum Inf. Comput. 15(11&12): 901-913 (2015) - 2014
- [j1]Aran Nayebi:
Practical Intractability: A Critique of the Hypercomputation Movement. Minds Mach. 24(3): 275-305 (2014) - [i5]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. CoRR abs/1408.3193 (2014) - [i4]Aran Nayebi, Virginia Vassilevska Williams:
Quantum algorithms for shortest paths problems in structured instances. CoRR abs/1410.6220 (2014) - [i3]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [i2]Aran Nayebi:
Plausible hypercomputability. CoRR abs/1210.3304 (2012)
2000 – 2009
- 2009
- [i1]Aran Nayebi:
Parallel DNA implementation of fast matrix multiplication techniques based on an $n$-moduli set. CoRR abs/0912.0750 (2009)
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:14 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:
