Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
What Size Net Gives Valid Generalization?
19891.1k citationsEric B. Baum et al.Neural Computationprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Eric B. Baum's research. 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 Eric B. Baum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric B. Baum more than expected).
This network shows the impact of papers produced by Eric B. Baum. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eric B. Baum. The network helps show where Eric B. Baum may publish in the future.
Co-authorship network of co-authors of Eric B. Baum
This figure shows the co-authorship network connecting the top 25 collaborators of Eric B. Baum.
A scholar is included among the top collaborators of Eric B. Baum based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Eric B. Baum. Eric B. Baum is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Baum, Eric B., Marcus Hütter, & Emanuel Kitzelmann. (2010). Artificial general intelligence: Proceedings of the Third Conference on Artificial General Intelligence, AGI 2010, Lugano, Switzerland, March 5-8, 2010.2 indexed citations
2.
Baum, Eric B.. (2007). A Working Hypothesis for General Intelligence. 55–74.2 indexed citations
Landweber, Laura F., et al.. (1999). DNA based computers II : DIMACS workshop, June 10-12, 1996. American Mathematical Society eBooks.2 indexed citations
Baum, Eric B.. (1996). Toward a model of mind as a laissez-faire economy of idiots. International Conference on Machine Learning. 28–36.5 indexed citations
7.
Lipton, Richard J., et al.. (1996). DNA based computers : proceedings of a DIMACS workshop, April 4, 1995, Princeton University. American Mathematical Society eBooks.6 indexed citations
8.
Lipton, Richard B. & Eric B. Baum. (1996). DNA Based Computers.50 indexed citations
9.
Baum, Eric B.. (1992). On optimal game tree propagation for imperfect players. National Conference on Artificial Intelligence. 507–512.5 indexed citations
Baum, Eric B. & Kevin Lang. (1990). Constructing Hidden Units using Examples and Queries. Neural Information Processing Systems. 3. 904–910.52 indexed citations
Baum, Eric B. & Frank Wilczek. (1987). Supervised Learning of Probability Distributions by Neural Networks. Neural Information Processing Systems. 52–61.99 indexed citations
Baum, Eric B.. (1982). Zeta Function Renormalization and Quantum Gravity.. PhDT.1 indexed citations
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.