Sebastian Bruch

Orcid: 0000-0002-2469-8242

Affiliations:
  • Google Research
  • University of Maryland, College Park, MD, USA (former)


According to our database1, Sebastian Bruch authored at least 37 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors.
ACM Trans. Inf. Syst., March, 2024

An Analysis of Fusion Functions for Hybrid Retrieval.
ACM Trans. Inf. Syst., January, 2024

Foundations of Vector Retrieval.
CoRR, 2024

Foundations of Vector Retrieval
Springer, ISBN: 978-3-031-55181-9, 2024

2023
Efficient and Effective Tree-based and Neural Learning to Rank.
Found. Trends Inf. Retr., 2023

Bridging Dense and Sparse Maximum Inner Product Search.
CoRR, 2023

Preface WI-IAT 2023.
Proceedings of the IEEE International Conference on Web Intelligence and Intelligent Agent Technology, 2023

Shielded Learning for Resilience and Performance Based on Statistical Model Checking in Simulink.
Proceedings of the Bridging the Gap Between AI and Reality, 2023

ReNeuIR at SIGIR 2023: The Second Workshop on Reaching Efficiency in Neural Information Retrieval.
Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023

Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Report on the 1st Workshop on Reaching Efficiency in Neural Information Retrieval (ReNeuIR 2022) at SIGIR 2022.
SIGIR Forum, December, 2022

ReNeuIR: Reaching Efficiency in Neural Information Retrieval.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

2021
An Alternative Cross Entropy Loss for Learning-to-Rank.
Proceedings of the WWW '21: The Web Conference 2021, 2021

2020
Modeling Text with Decision Forests using Categorical-Set Splits.
CoRR, 2020

Learning Representations for Axis-Aligned Decision Forests through Input Perturbation.
CoRR, 2020

A Stochastic Treatment of Learning to Rank Scoring Functions.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

2019
Learning to Rank in Theory and Practice: From Gradient Boosting to Neural Networks and Unbiased Learning.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Neural Learning to Rank using TensorFlow Ranking: A Hands-on Tutorial.
Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information Retrieval, 2019

An Analysis of the Softmax Cross Entropy Loss for Learning-to-Rank with Binary Relevance.
Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information Retrieval, 2019

Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks.
Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information Retrieval, 2019

2014
Runtime Optimizations for Tree-Based Machine Learning Models.
IEEE Trans. Knowl. Data Eng., 2014

2013
Multi-Stage Search Architectures for Streaming Documents.
PhD thesis, 2013

Fast candidate generation for real-time tweet search with bloom filter chains.
ACM Trans. Inf. Syst., 2013

Document vector representations for feature extraction in multi-stage document ranking.
Inf. Retr., 2013

Fast, Incremental Inverted Indexing in Main Memory for Web-Scale Collections
CoRR, 2013

Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

Dynamic memory allocation policies for postings in real-time Twitter search.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Training Efficient Tree-Based Models for Document Ranking.
Proceedings of the Advances in Information Retrieval, 2013

2012
Runtime Optimizations for Prediction with Tree-Based Models
CoRR, 2012

Mr. LDA: a flexible large scale topic modeling package using variational inference in MapReduce.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Using Variational Inference and MapReduce to Scale Topic Modeling
CoRR, 2011

Cross-corpus relevance projection.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Pseudo test collections for learning web search ranking functions.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

2010
UMD and USC/ISI: TREC 2010 Web Track Experiments with Ivory.
Proceedings of The Nineteenth Text REtrieval Conference, 2010


  Loading...