Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions
Not on the map. Why?
Abstract (arXiv)
Due to the rise of privacy concerns, in many practical applications the training data is aggregated before being shared with the learner, in order to protect privacy of users' sensitive responses. In an aggregate learning framework, the dataset is grouped into bags of samples, where each bag is available only with an aggregate response, providing a summary of individuals' responses in that bag. In this paper, we study two natural loss functions for learning from aggregate responses: bag-level loss and the instance-level loss. In the former, the model is learnt by minimizing a loss between aggregate responses and aggregate model predictions, while in the latter the model aims to fit individual predictions to the aggregate responses. In this work, we show that the instance-level loss can be perceived as a regularized form of the bag-level loss. This observation lets us compare the two approaches with respect to bias and variance of the resulting estimators, and introduce a novel interpolating estimator which combines the two approaches. For linear regression tasks, we provide a precise characterization of the risk of the interpolating estimator in an asymptotic regime where the size of the training set grows in proportion to the features dimension. Our analysis allows us to theoretically understand the effect of different factors, such as bag size on the model prediction risk. In addition, we propose a mechanism for differentially private learning from aggregate responses and derive the optimal bag size in terms of prediction risk-privacy trade-off. We also carry out thorough experiments to corroborate our theory and show the efficacy of the interpolating estimator.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 16 of its 51 references that are in the map. First posted on arXiv 20 Jan 2024.
Builds on
16 of 51 references.
References · 16
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2016Towards the Science of Security and Privacy in Machine Learningcited by 89
- 2018Privacy Preserving Machine Learning: Threats and Solutionscited by 79
- 2020Precise Tradeoffs in Adversarial Training for Linear Regressioncited by 77
- 2018On the Minimal Supervision for Training Any Binary Classifier from Only Unlabeled Datacited by 43
- 2022The curse of overparametrization in adversarial training: Precise analysis of robust generalization for random features regressioncited by 41
- 2020An Overview of Privacy in Machine Learningcited by 39
- 2014On Learning from Label Proportionscited by 38
- 2019Deep multi-class learning from label proportionscited by 33
- 2020Learning from Aggregate Observationscited by 30
- 2017Co-training for Demographic Classification Using Deep Learning from Label Proportionscited by 28
4 more
- 2023Easy Learning from Label Proportionscited by 20
- 2023Learning from Aggregated Data: Curated Bags versus Random Bagscited by 11
- 2019Learning Neural Networks with Adaptive Regularizationcited by 5
- 2020On the Complexity of Learning from Label Proportionscited by 4
Built on by
Citing papers per year: 2024: 2.
2 papers.