World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
36
Citations
4974
World Ranking
11330
National Ranking
4672

Overview

Michael Bendersky is a researcher affiliated with Google in the United States, with a primary focus on computer science. Their body of work spans 127 publications, chiefly centered in the field of Artificial Intelligence, where they have contributed 92 papers. Additional subfields of their research include Computer Vision and Pattern Recognition, Information Systems, Management Science and Operations Research, and Information Systems and Management.

Their research covers several main topics including Topic Modeling, Natural Language Processing Techniques, Domain Adaptation and Few-Shot Learning, Multimodal Machine Learning Applications, Advanced Text Analysis Techniques, Text and Document Classification Technologies, and Recommender Systems and Techniques.

Michael Bendersky's published work is frequently found in venues such as:

  • arXiv (Cornell University)
  • Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval
  • Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
  • Foundations and Trends® in Information Retrieval
  • Communication in Statistics- Theory and Methods

Selected recent papers illustrate the scope and thematic focus of their research. These include:

  • "Retrieval-Enhanced Machine Learning," published in 2022 at the Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval
  • "Multi-Aspect Dense Retrieval," 2022, Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
  • "Revisiting Two-tower Models for Unbiased Learning to Rank," 2022, Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval
  • "Scale Calibration of Deep Ranking Models," 2022, Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
  • "RRF102: Meeting the TREC-COVID Challenge with a 100+ Runs Ensemble," 2020, arXiv (Cornell University)

Frequent collaborators include Xuanhui Wang, Marc Najork, Honglei Zhuang, Rolf Jagerman, and Jiaming Shen, reflecting a pattern of ongoing partnerships in their research projects.

Best Publications

  • Discovering key concepts in verbose queries

    Michael Bendersky;W. Bruce Croft

  • Learning to Rank with Selection Bias in Personal Search

    Xuanhui Wang;Michael Bendersky;Donald Metzler;Marc Najork

  • Position Bias Estimation for Unbiased Learning to Rank in Personal Search

    Xuanhui Wang;Nadav Golbandi;Michael Bendersky;Donald Metzler

  • Learning concept importance using a weighted dependence model

    Michael Bendersky;Donald Metzler;W. Bruce Croft

  • Quality-biased ranking of web documents

    Michael Bendersky;W. Bruce Croft;Yanlei Diao

  • Information Retrieval with Verbose Queries

    Manish Gupta;Michael Bendersky

  • Analysis of long queries in a large scale search log

    Michael Bendersky;W. Bruce Croft

  • Parameterized concept weighting in verbose queries

    Michael Bendersky;Donald Metzler;W. Bruce Croft

  • The LambdaLoss Framework for Ranking Metric Optimization

    Xuanhui Wang;Cheng Li;Nadav Golbandi;Michael Bendersky

  • Effective query formulation with multiple information sources

    Michael Bendersky;Donald Metzler;W. Bruce Croft

  • WIT: Wikipedia-based Image Text Dataset for Multimodal Multilingual Machine Learning

    Krishna Srinivasan;Karthik Raman;Jiecao Chen;Michael Bendersky

  • TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank

    Rama Kumar Pasumarthi;Sebastian Bruch;Xuanhui Wang;Cheng Li

  • Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks

    Qingyao Ai;Xuanhui Wang;Sebastian Bruch;Nadav Golbandi

  • Finding text reuse on the web

    Michael Bendersky;W. Bruce Croft

  • Semantic Text Matching for Long-Form Documents

    Jyun-Yu Jiang;Mingyang Zhang;Cheng Li;Michael Bendersky

  • Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting

    Unknown

  • Modeling higher-order term dependencies in information retrieval using query hypergraphs

    Michael Bendersky;W. Bruce Croft

  • RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses

    Unknown

  • An Analysis of the Softmax Cross Entropy Loss for Learning-to-Rank with Binary Relevance

    Sebastian Bruch;Xuanhui Wang;Michael Bendersky;Marc Najork

  • Two-Stage learning to rank for information retrieval

    Van Dang;Michael Bendersky;W. Bruce Croft

  • Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks

    Sebastian Bruch;Masrour Zoghi;Michael Bendersky;Marc Najork

  • Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching

    Liu Yang;Mingyang Zhang;Cheng Li;Michael Bendersky

  • Addressing Trust Bias for Unbiased Learning-to-Rank

    Aman Agarwal;Xuanhui Wang;Cheng Li;Michael Bendersky

  • Learning-to-Rank with BERT in TF-Ranking

    Shuguang Han;Xuanhui Wang;Mike Bendersky;Marc Najork

  • TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank

    Rama Kumar Pasumarthi;Sebastian Bruch;Xuanhui Wang;Cheng Li

  • Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching

    Liu Yang;Mingyang Zhang;Cheng Li;Michael Bendersky

Frequent Co-Authors

Marc Najork
Marc Najork Google (United States)
Xuanhui Wang
Xuanhui Wang Google (United States)
Donald Metzler
Donald Metzler Google (United States)
W. Bruce Croft
W. Bruce Croft University of Massachusetts Amherst
Yonghui Wu
Yonghui Wu Google (United States)
Yi Tay
Yi Tay Google (United States)
Evgeniy Gabrilovich
Evgeniy Gabrilovich Google (United States)
Manish Gupta
Manish Gupta Microsoft (United States)
Maarten de Rijke
Maarten de Rijke University of Amsterdam

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a future in Computer Science opens the door to a variety of online degree options and career pathways. Many students start with online associate degree programs, which offer foundational knowledge and can be completed quickly. These are a great way to enter the tech field with minimal investment.

If you're looking to strengthen your credentials, pursuing one of the what masters program should i do can be highly beneficial. Carefully selected master’s programs in Computer Science or related fields are in high demand and can lead to broader career options.

For those in a hurry, consider the shortest master degree programs available online. Fast-tracked programs let you earn a recognized qualification in less time, helping you enter or advance in the workforce more quickly.

Additionally, earning certifications that pay well can further boost your earning potential, even if you don’t plan to pursue a full degree. Exploring these pathways ensures a flexible, rewarding career in the ever-evolving tech industry.

Best Scientists Citing Michael Bendersky

Trending Scientists

Recently Published Articles