Aleksei Ustimenko

dblp:242/3873 · DBLP profile ↗
← Back
8ranked-venue papers in the field
0as first author
8since 2021 · last 2026
0009-0006-4942-7779ORCID · corroborated

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 6Data Mining & Knowledge Discovery · 2
YearPublicationVenuePosition
2026 Variance Reduction for Heavy-Tailed Monetization Metrics in Ranking Experiments via Post-Stratification
abstract
Online evaluation of ranking and retrieval systems often relies on downstream monetization metrics such as app revenue or creator earnings. These metrics are typically heavy-tailed, with a small fraction of users dominating both mean and variance, leading to low statistical power and unreliable conclusions in A/B experiments -- especially under limited traffic. We present a practical framework for variance reduction in online experiments by combining post-stratification with CUPED. Our approach leverages pre-experiment covariates to improve the sensitivity of monetization experiments without requiring additional traffic. Deployed at ShareChat across ranking-driven monetization experiments, the method substantially reduces variance and improves decision stability, achieving equivalent statistical confidence with ~45\% less traffic than standard metrics. We further discuss practical design choices, guardrails, and limitations, providing guidance on when post-stratification is appropriate for real-world information retrieval and Recommendation systems.
Neeti Pokharna, Olivier Jeunen, Yatharth Saraf, Aleksei Ustimenko
SIGIR4
2024 Variance Reduction in Ratio Metrics for Efficient Online Experiments
Shubham Baweja, Neeti Pokharna, Aleksei Ustimenko, Olivier Jeunen
ECIR (5)3
2024 Learning-to-Rank with Nested Feedback
Hitesh Sagtani, Olivier Jeunen, Aleksei Ustimenko
ECIR (3)3
2024 On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendation
abstract
Approaches to recommendation are typically evaluated in one of two ways: (1) via a (simulated) online experiment, often seen as the gold standard, or (2) via some offline evaluation procedure, where the goal is to approximate the outcome of an online experiment. Several offline evaluation metrics have been adopted in the literature, inspired by ranking metrics prevalent in the field of Information Retrieval. (Normalised) Discounted Cumulative Gain (nDCG) is one such metric that has seen widespread adoption in empirical studies, and higher (n)DCG values have been used to present new methods as the state-of-the-art in top-n recommendation for many years.
Olivier Jeunen, Ivan Potapov, Aleksei Ustimenko
KDD3
2024 Learning Metrics that Maximise Power for Accelerated A/B-Tests
abstract
Online controlled experiments are a crucial tool to allow for confident decision-making in technology companies. A North Star metric is defined (such as long-term revenue or user retention), and system variants that statistically significantly improve on this metric in an A/B-test can be considered superior. North Star metrics are typically delayed and insensitive. As a result, the cost of experimentation is high: experiments need to run for a long time, and even then, type-II errors (i.e. false negatives) are prevalent.
Olivier Jeunen, Aleksei Ustimenko
KDD2
2024 Powerful A/B-Testing Metrics and Where to Find Them
abstract
Online controlled experiments, colloquially known as A/B-tests, are the bread and butter of real-world recommender system evaluation. Typically, end-users are randomly assigned some system variant, and a plethora of metrics are then tracked, collected, and aggregated throughout the experiment. A North Star metric (e.g. long-term growth or revenue) is used to assess which system variant should be deemed superior. As a result, most collected metrics are supporting in nature, and serve to either (i) provide an understanding of how the experiment impacts user experience, or (ii) allow for confident decision-making when the North Star metric moves insignificantly (i.e. a false negative or type-II error). The latter is not straightforward: suppose a treatment variant leads to fewer but longer sessions, with more views but fewer engagements; should this be considered a positive or negative outcome?
Olivier Jeunen, Shubham Baweja, Neeti Pokharna, Aleksei Ustimenko
RecSys4
2024 Multi-Objective Recommendation via Multivariate Policy Learning
abstract
Real-world recommender systems often need to balance multiple objectives when deciding which recommendations to present to users. These include behavioural signals (e.g. clicks, shares, dwell time), as well as broader objectives (e.g. diversity, fairness). Scalarisation methods are commonly used to handle this balancing task, where a weighted average of per-objective reward signals determines the final score used for ranking. Naturally, how these weights are computed exactly, is key to success for any online platform.
Olivier Jeunen, Jatin Mandav, Ivan Potapov, Nakul Agarwal, Sourabh Vaid, Wenzhe Shi, Aleksei Ustimenko
RecSys7
2024 Δ-OPE: Off-Policy Estimation with Pairs of Policies
abstract
The off-policy paradigm casts recommendation as a counterfactual decision-making task, allowing practitioners to unbiasedly estimate online metrics using offline data. This leads to effective evaluation metrics, as well as learning procedures that directly optimise online success. Nevertheless, the high variance that comes with unbiasedness is typically the crux that complicates practical applications. An important insight is that the difference between policy values can often be estimated with significantly reduced variance, if said policies have positive covariance. This allows us to formulate a pairwise off-policy estimation task: Δ-OPE.
Olivier Jeunen, Aleksei Ustimenko
RecSys2