Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aditya Srinivas Timmaraju

dblp:137/7926 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0001-5934-6079ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Efficient and distributed learning · 47% Trustworthy machine learning · 36% Reinforcement learning · 18%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
Matryoshka Model Learning for Improved Elastic Student Models · KDD (2) 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Matryoshka Model Learning for Improved Elastic Student Models · KDD (2) 2025
Machine learning › Trustworthy machine learning › fairness › algorithmic fairness
advertising fairness
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Machine learning › Trustworthy machine learning
fairness
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Machine learning › Reinforcement learning › multi-objective reinforcement learning
fair reinforcement learning
0.712023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023
Information retrieval › online advertising
ad targeting
0.212023
Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning · KDD 2023

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.3teacher-student training · 0.9reranking · 0.7re-ranking · 0.7
YearPublicationVenuePosition
2025 Matryoshka Model Learning for Improved Elastic Student Models
abstract
Industry-grade ML models are carefully designed to meet rapidly evolving serving constraints, which requires significant resources for model development. In this paper, we propose MatTA, a framework for training multiple accurate Student models using a novel Teacher-TA-Student recipe. TA models are larger versions of the Student models with higher capacity, and thus allow Student models to better relate to the Teacher model and also bring in more domain-specific expertise. Furthermore, multiple accurate Student models can be extracted from the TA model. Therefore, despite only one training run, our methodology provides multiple servable options to trade off accuracy for lower serving cost. We demonstrate the proposed method, MatTA, on proprietary datasets and models. Its practical efficacy is underscored by live A/B tests within a production ML system, demonstrating 20% improvement on a key metric. We also demonstrate our method on GPT-2 Medium, a public model, and achieve relative improvements of over 24% on SAT Math and over 10% on the LAMBADA benchmark.
Chetan Verma, Aditya Srinivas Timmaraju, Cho-Jui Hsieh, Suyash Damle, Ngot Bui, Prateek Jain 0002, Inderjit S. Dhillon
KDD (2)2
2023 Towards Fairness in Personalized Ads Using Impression Variance Aware Reinforcement Learning
abstract
Variances in ad impression outcomes across demographic groups are increasingly considered to be potentially indicative of algorithmic bias in personalized ads systems. While there are many definitions of fairness that could be applicable in the context of personalized systems, we present a framework which we call the Variance Reduction System (VRS) for achieving more equitable outcomes in Meta's ads systems. VRS seeks to achieve a distribution of impressions with respect to selected protected class (PC) attributes that more closely aligns the demographics of an ad's eligible audience (a function of advertiser targeting criteria) with the audience who sees that ad, in a privacy-preserving manner. We first define metrics to quantify fairness gaps in terms of ad impression variances with respect to PC attributes including gender and estimated race. We then present the VRS for re-ranking ads in an impression variance-aware manner. We evaluate VRS via extensive simulations over different parameter choices and study the effect of the VRS on the chosen fairness metric. We finally present online A/B testing results from applying VRS to Meta's ads systems, concluding with a discussion of future work. We have deployed the VRS to all users in the US for housing ads, resulting in significant improvement in our fairness metric. VRS is the first large-scale deployed framework for pursuing fairness for multiple PC attributes in online advertising.
Aditya Srinivas Timmaraju, Mehdi Mashayekhi, Mingliang Chen 0001, Quintin Fettes, Wesley Cheung, Yihan Xiao, Manojkumar Rangasamy Kannadasan, Pushkar Tripathi, Sean Gahagan, Miranda Bogen, Rob Roudani
KDD1
2020 Addressing Challenges in Building Web-Scale Content Classification Systems
abstract
Understanding the semantic meaning of content on the web through the lens of a taxonomy has many practical advantages. However, when building large-scale content classification systems, practitioners are faced with unique challenges involving finding the best ways to leverage the scale and variety of data available on internet platforms. We present learnings from our efforts in building a content classification system for multiple document types at Facebook using Multi-modal Transformers. We empirically demonstrate the effectiveness of multi-lingual, multi-modal and cross-document type learning. We describe effective strategies for exploiting weakly supervised signals as a pre-training step and show that they lead to significant gains in downstream classification accuracy. We also discuss label collection schemes that help minimize the amount of noise in collected data.
Aditya Srinivas Timmaraju, Angli Liu, Pushkar Tripathi
ICASSP1