On the public citation graph

Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees

0 signed · 110 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-88693-8_44openalex-snapshot
Implementing Decision Trees and Forests on a GPU
inferredcites →https://doi.org/10.1007/978-3-642-36973-5_13openalex-snapshot
Training Efficient Tree-Based Models for Document Ranking
inferredcites →https://doi.org/10.1007/s10791-009-9112-1openalex-snapshot
Adapting boosting for information retrieval measures
inferredcites →https://doi.org/10.1016/c2013-0-08305-3openalex-snapshot
Computer Organization and Design
inferredcites →https://doi.org/10.1016/j.ipm.2016.05.004openalex-snapshot
Quality versus efficiency in document scoring with learning-to-rank models
inferredcites →https://doi.org/10.1023/b:visi.0000013087.49260.fbopenalex-snapshot
Robust Real-Time Face Detection
inferredcites →https://doi.org/10.1109/fccm.2012.47openalex-snapshot
Accelerating a Random Forest Classifier: Multi-Core, GP-GPU, or FPGA?
inferredcites →https://doi.org/10.1109/tkde.2013.73openalex-snapshot
Runtime Optimizations for Tree-Based Machine Learning Models
inferredcites →https://doi.org/10.1145/1718487.1718538openalex-snapshot
Early exit optimizations for additive machine learned ranking systems
inferredcites →https://doi.org/10.1145/1835449.1835475openalex-snapshot
Learning to efficiently rank
inferredcites →https://doi.org/10.1145/1871437.1871452openalex-snapshot
Ranking under temporal constraints
inferredcites →https://doi.org/10.1145/2009916.2009932openalex-snapshot
Bagging gradient-boosted trees for high precision, low variance ranking models
inferredcites →https://doi.org/10.1145/2009916.2009934openalex-snapshot
A cascade ranking model for efficient ranked retrieval
inferredcites →https://doi.org/10.1145/2600428.2609525openalex-snapshot
Cache-conscious runtime optimization for ranking ensembles
inferredcites →https://doi.org/10.1145/2766462.2767733openalex-snapshot
QuickScorer
inferredcites →https://doi.org/10.1145/2911451.2911520openalex-snapshot
A Comparison of Cache Blocking Methods for Fast Execution of Ensemble-based Score Computation
inferredcites →https://doi.org/10.1145/2911451.2914758openalex-snapshot
Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles
inferredcites →https://doi.org/10.1145/2911451.2914763openalex-snapshot
Post-Learning Optimization of Tree Ensembles for Efficient Ranking
inferredcites →https://doi.org/10.1145/2939672.2939677openalex-snapshot
Ranking Relevance in Yahoo Search
inferredcites →https://doi.org/10.1145/2939672.2939785openalex-snapshot
XGBoost
inferredcites →https://doi.org/10.1145/582415.582418openalex-snapshot
Cumulated gain-based evaluation of IR techniques
inferredcites →https://doi.org/10.1214/aos/1013203451openalex-snapshot
Greedy function approximation: A gradient boosting machine.
inferredcites →https://doi.org/10.1561/1500000016openalex-snapshot
Learning to Rank for Information Retrieval
inferredcites →https://doi.org/10.1561/1500000019openalex-snapshot
The Probabilistic Relevance Framework: BM25 and Beyond
inferredcites →https://doi.org/10.48550/arxiv.1206.6451openalex-snapshot
The Greedy Miser: Learning under Test-time Budgets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-15712-8_25openalex-snapshot
Optimizing Ranking Models in an Online Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-99736-6_18openalex-snapshot
Ensemble Model Compression for Fast and Energy-Efficient Ranking on FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-031-26419-1_32openalex-snapshot
Immediate Split Trees: Immediate Encoding of Floating Point Split Values in Random Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-28244-7_26openalex-snapshot
Contrasting Neural Click Models and Pointwise IPS Rankers
inferred← citeshttps://doi.org/10.1007/978-3-031-56063-7_39openalex-snapshot
An In-Depth Comparison of Neural and Probabilistic Tree Models for Learning-to-rank
inferred← citeshttps://doi.org/10.1007/978-3-031-56066-8_29openalex-snapshot
Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?
inferred← citeshttps://doi.org/10.1007/978-3-319-71273-4_36openalex-snapshot
Efficient Traversal of Large Ensembles of Decision Trees.
inferred← citeshttps://doi.org/10.1007/s10489-024-05755-wopenalex-snapshot
Learning to rank through graph-based feature fusion using fuzzy integral operators
inferred← citeshttps://doi.org/10.1007/s10791-022-09413-yopenalex-snapshot
Reinforcement online learning to rank with unbiased reward shaping
inferred← citeshttps://doi.org/10.1007/s41060-023-00406-8openalex-snapshot
Graph-based comparative analysis of learning to rank datasets
inferred← citeshttps://doi.org/10.1016/j.ipm.2021.102682openalex-snapshot
Adaptive utterance rewriting for conversational search
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.04.008openalex-snapshot
Efficient traversal of decision tree ensembles with FPGAs
inferred← citeshttps://doi.org/10.1016/j.softx.2020.100614openalex-snapshot
RankEval: Evaluation and investigation of ranking models
inferred← citeshttps://doi.org/10.1016/j.vlsi.2020.02.004openalex-snapshot
A survey on attack vectors in stack cache memory
inferred← citeshttps://doi.org/10.1109/access.2023.3331088openalex-snapshot
Early Exit Strategies for Learning-to-Rank Cascades
inferred← citeshttps://doi.org/10.1109/hpcs.2017.154openalex-snapshot
Multicore/Manycore Parallel Traversal of Large Forests of Regression Trees
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00360openalex-snapshot
LT2R: Learning to Online Learning to Rank for Web Search
inferred← citeshttps://doi.org/10.1109/icecet61485.2024.10698440openalex-snapshot
A Comparative Analysis of the Lossless Data Compression Methods for Unsparsed Tabular Data
inferred← citeshttps://doi.org/10.1109/tkde.2022.3152585openalex-snapshot
Distilled Neural Networks for Efficient Learning to Rank
inferred← citeshttps://doi.org/10.1109/tpds.2018.2860982openalex-snapshot
Parallel Traversal of Large Ensembles of Decision Trees
inferred← citeshttps://doi.org/10.1109/tsc.2023.3279839openalex-snapshot
Privet: A Privacy-Preserving Vertical Federated Learning Service for Gradient Boosted Decision Tables
inferred← citeshttps://doi.org/10.1134/s1054661826700483openalex-snapshot
New Schemes for Constructing Ensembles Based on Divergent Forest
inferred← citeshttps://doi.org/10.1145/3077136.3080714openalex-snapshot
On Including the User Dynamic in Learning to Rank
inferred← citeshttps://doi.org/10.1145/3077136.3080725openalex-snapshot
X-DART
inferred← citeshttps://doi.org/10.1145/3121050.3121109openalex-snapshot
Efficiency/Effectiveness Trade-offs in Learning to Rank
inferred← citeshttps://doi.org/10.1145/3132847.3132895openalex-snapshot
Sensitive and Scalable Online Evaluation with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1145/3205453openalex-snapshot
X-CLE a VER
inferred← citeshttps://doi.org/10.1145/3209978.3209992openalex-snapshot
Ranking for Relevance and Display Preferences in Complex Presentation Layouts
inferred← citeshttps://doi.org/10.1145/3209978.3210048openalex-snapshot
Selective Gradient Boosting for Effective Learning to Rank
inferred← citeshttps://doi.org/10.1145/3209978.3210137openalex-snapshot
Universal Approximation Functions for Fast Learning to Rank
inferred← citeshttps://doi.org/10.1145/3219819.3219857openalex-snapshot
RapidScorer
inferred← citeshttps://doi.org/10.1145/3269206.3271686openalex-snapshot
Differentiable Unbiased Online Learning to Rank
inferred← citeshttps://doi.org/10.1145/3289600.3290986openalex-snapshot
Joint Optimization of Cascade Ranking Models
inferred← citeshttps://doi.org/10.1145/3331184.3331207openalex-snapshot
Accelerated Query Processing Via Similarity Score Prediction
inferred← citeshttps://doi.org/10.1145/3331184.3331331openalex-snapshot
Block-distributed Gradient Boosted Trees
inferred← citeshttps://doi.org/10.1145/3331184.3334824openalex-snapshot
Learning to Rank in Theory and Practice
inferred← citeshttps://doi.org/10.1145/3397271.3401093openalex-snapshot
Efficient Document Re-Ranking for Transformers by Precomputing Term Representations
inferred← citeshttps://doi.org/10.1145/3397271.3401333openalex-snapshot
Feature Transformation for Neural Ranking Models
inferred← citeshttps://doi.org/10.1145/3404835.3462830openalex-snapshot
Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness
inferred← citeshttps://doi.org/10.1145/3404835.3462937openalex-snapshot
How do Online Learning to Rank Methods Adapt to Changes of Intent?
inferred← citeshttps://doi.org/10.1145/3442381.3450018openalex-snapshot
Robust Generalization and Safe Query-Specializationin Counterfactual Learning to Rank
inferred← citeshttps://doi.org/10.1145/3477495.3531704openalex-snapshot
ReNeuIR: Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3477495.3531740openalex-snapshot
The Istella22 Dataset
inferred← citeshttps://doi.org/10.1145/3477495.3531842openalex-snapshot
Learning-to-Rank at the Speed of Sampling
inferred← citeshttps://doi.org/10.1145/3477495.3531849openalex-snapshot
On Optimizing Top-K Metrics for Neural Ranking Models
inferred← citeshttps://doi.org/10.1145/3477495.3531948openalex-snapshot
Can Clicks Be Both Labels and Features?
inferred← citeshttps://doi.org/10.1145/3485447.3512014openalex-snapshot
Mostra: A Flexible Balancing Framework to Trade-off User, Artist and Platform Objectives for Music Sequencing
inferred← citeshttps://doi.org/10.1145/3508019openalex-snapshot
Efficient Realization of Decision Trees for Real-Time Inference
inferred← citeshttps://doi.org/10.1145/3511808.3557066openalex-snapshot
Addressing Cold Start in Product Search via Empirical Bayes
inferred← citeshttps://doi.org/10.1145/3534678.3539065openalex-snapshot
Rax: Composable Learning-to-Rank Using JAX
inferred← citeshttps://doi.org/10.1145/3534678.3539072openalex-snapshot
Scale Calibration of Deep Ranking Models
inferred← citeshttps://doi.org/10.1145/3539618.3591760openalex-snapshot
Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization
inferred← citeshttps://doi.org/10.1145/3539618.3591922openalex-snapshot
ReNeuIR at SIGIR 2023: The Second Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3539813.3545137openalex-snapshot
Reaching the End of Unbiasedness
inferred← citeshttps://doi.org/10.1145/3569453openalex-snapshot
Doubly Robust Estimation for Correcting Position Bias in Click Feedback for Unbiased Learning to Rank
inferred← citeshttps://doi.org/10.1145/3582084.3582085openalex-snapshot
Propensity-Dependent Model for Unbiased Learning-to-Rank
inferred← citeshttps://doi.org/10.1145/3582900.3582916openalex-snapshot
Report on the 1st Workshop on Reaching Efficiency in Neural Information Retrieval (ReNeuIR 2022) at SIGIR 2022
inferred← citeshttps://doi.org/10.1145/3583780.3614712openalex-snapshot
Regression Compatible Listwise Objectives for Calibrated Ranking with Binary Relevance
inferred← citeshttps://doi.org/10.1145/3583780.3614948openalex-snapshot
LambdaRank Gradients are Incoherent
inferred← citeshttps://doi.org/10.1145/3589334.3645474openalex-snapshot
Whole Page Unbiased Learning to Rank
inferred← citeshttps://doi.org/10.1145/3589334.3645487openalex-snapshot
Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach
inferred← citeshttps://doi.org/10.1145/3626772.3657892openalex-snapshot
Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search Dataset
inferred← citeshttps://doi.org/10.1145/3626772.3657918openalex-snapshot
Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees
inferred← citeshttps://doi.org/10.1145/3626772.3657994openalex-snapshot
ReNeuIR at SIGIR 2024: The Third Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3627673.3679531openalex-snapshot
Practical and Robust Safety Guarantees for Advanced Counterfactual Learning to Rank
inferred← citeshttps://doi.org/10.1145/3701716.3717577openalex-snapshot
Cost-Efficiency Trade-offs for Neural Cascade Rankers in Web Search
inferred← citeshttps://doi.org/10.1145/3711896.3736866openalex-snapshot
Breaking the Top- K Barrier: Advancing Top- K Ranking Metrics Optimization in Recommender Systems
inferred← citeshttps://doi.org/10.1145/3711896.3737443openalex-snapshot
FULTR: A Large-Scale Fusion Learning to Rank Dataset and Its Application for Satisfaction-Oriented Ranking
inferred← citeshttps://doi.org/10.1145/3721146.3721945openalex-snapshot
Decentralized Adaptive Ranking using Transformers
inferred← citeshttps://doi.org/10.1145/3726302.3730179openalex-snapshot
Document Similarity Enhanced IPS Estimation for Unbiased Learning to Rank
inferred← citeshttps://doi.org/10.1145/3726302.3730358openalex-snapshot
ReNeuIR at SIGIR 2025: The Fourth Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3731120.3744604openalex-snapshot
Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank
inferred← citeshttps://doi.org/10.1145/3805712.3809529openalex-snapshot
An Epistemic Position-Based Click Model: From Interactions to Epistemic Distributions of Relevance and Bias
inferred← citeshttps://doi.org/10.1145/3805712.3809596openalex-snapshot
OPS: An Order-Preserving Sorting Network for Information Retrieval
inferred← citeshttps://doi.org/10.1145/3805713.3820419openalex-snapshot
Prior-Data Fitted Networks as Tabular Foundation Models for Ranking in Low-Data Settings
inferred← citeshttps://doi.org/10.1515/9783110785944-010openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.18653/v1/2023.emnlp-main.665openalex-snapshot
Enhancing the Ranking Context of Dense Retrieval through Reciprocal Nearest Neighbors
inferred← citeshttps://doi.org/10.24963/ijcai.2022/743openalex-snapshot
Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness (Extended Abstract)
inferred← citeshttps://doi.org/10.3233/faia240703openalex-snapshot
Pessimistic Off-Policy Optimization for Learning to Rank
inferred← citeshttps://doi.org/10.48550/arxiv.1901.10262openalex-snapshot
Optimizing Ranking Models in an Online Setting
inferred← citeshttps://doi.org/10.48550/arxiv.2005.03932openalex-snapshot
Modeling Document Interactions for Learning to Rank with Regularized Self-Attention
inferred← citeshttps://doi.org/10.48550/arxiv.2012.06576openalex-snapshot
Learning from User Interactions with Rankings: A Unification of the Field
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08656openalex-snapshot
Dive into Decision Trees and Forests: A Theoretical Demonstration
inferred← citeshttps://doi.org/10.48550/arxiv.2101.11347openalex-snapshot
Decision Machines: Congruent Decision Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07831openalex-snapshot
NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.