Learning Fast Approximations of Sparse Coding
- Authors
- Karol GregorYann LeCun
- Journal
- International Conference on Machine Learning
In The Last Decade
doi.org/w6368439 →Countries where authors are citing Learning Fast Approximations of Sparse Coding
This map shows the geographic impact of Learning Fast Approximations of Sparse Coding. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Learning Fast Approximations of Sparse Coding with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Learning Fast Approximations of Sparse Coding more than expected).
Fields of papers citing Learning Fast Approximations of Sparse Coding
This network shows the impact of Learning Fast Approximations of Sparse Coding. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Learning Fast Approximations of Sparse Coding.
About Learning Fast Approximations of Sparse Coding
This paper, published in 2010, received 663 indexed citations . Written by Karol Gregor and Yann LeCun covering the research area of Signal Processing, Artificial Intelligence and Computational Mechanics. It is primarily cited by scholars working on Computer Vision and Pattern Recognition (337 citations), Computational Mechanics (283 citations), Artificial Intelligence (126 citations), Biomedical Engineering (119 citations) and Signal Processing (106 citations). Published in International Conference on Machine Learning.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w6368439.