Moran Feldman

Computational Theory and Mathematics · 2010–2020

A researcher in the Science corpus: 8 papers; trusts 37 researchers and is trusted by 20 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 57 citations into it; #2,253 of 12,182 by trust here, #2,931 by citations
• Artificial Intelligence — 39 citations into it; #8,145 of 35,345 by trust here, #13,163 by citations
• Optimization & Training — 32 citations into it; #2,521 of 2,601 by trust here, #2,112 by citations
• Computer Graphics and Computer-Aided Design — 24 citations into it
• Algorithms & Complexity — 17 citations into it; #375 of 516 by trust here, #258 by citations
• Computer Networks and Communications — 17 citations into it; #2,854 of 9,886 by trust here, #5,133 by citations
• Computer Vision and Pattern Recognition — 12 citations into it
• Management Science and Operations Research — 9 citations into it

Whom Moran Feldman trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Andreas Krause
2. Jan Vondr'ak
3. George L. Nemhauser
4. Uriel Feige
5. Maxim Sviridenko
6. Hui-Ching Lin
7. L. Lov'asz
8. Laurence A. Wolsey
9. Carlos Guestrin
10. Shayan Oveis Gharan

Who trusts Moran Feldman overall

1. Alex Kulesza
2. Jennifer Gillenwater
3. B. Taskar
4. Francis R. Bach
5. Ashwinkumar Badanidiyuru
6. Niv Buchbinder
7. Jan Vondr'ak
8. Chandra Chekuri
9. Emilio Zagheni
10. Joseph (Seffi) Naor

Papers from Moran Feldman's perspective

Ordered by how strongly the researchers Moran Feldman trusts endorse each paper. Same corpus, a different order for every researcher.

1. Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
2. ImageNet classification with deep convolutional neural networks
3. Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
4. Gradient-based learning applied to document recognition
5. Learning Multiple Layers of Features from Tiny Images
6. An analysis of approximations for maximizing submodular set functions—I
7. A threshold of ln n for approximating set cover (preliminary version)
8. ImageNet: A large-scale hierarchical image database
9. Long Short-Term Memory
10. Attention is All you Need (Neural Information Processing Systems)

Their papers

• Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract) (2011) — 51 citations
• A Unified Continuous Greedy Algorithm for Submodular Maximization (2011) — 294 citations
• Submodular Maximization with Cardinality Constraints (2014) — 341 citations
• Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications (2019) — 122 citations
• Online Submodular Maximization with Preemption (2015) — 128 citations
• Submodular Maximization in Clean Linear Time (2020) — 27 citations
• Streaming Weak Submodularity: Interpreting Neural Networks on the Fly (2017) — 92 citations
• Automatic construction of travel itineraries using social breadcrumbs (2010) — 351 citations