← Search

Filip Kovačević

4 accepted papers

2026

Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning

ICML 2026poster

It is folklore that reusing training data more than once can improve the statistical efficiency of gradient-based learning. However, beyond linear regression, the theoretical advantage of full-batch gradient descent (GD, which always reuses all the data) over one-pass stochastic gradient descent (on…

Cited by 0SourceScholar
2026

High-dimensional Analysis of Synthetic Data Selection

ICLR 2026oral

Despite the progress in the development of generative models, their usefulness in creating synthetic data that improve prediction performance of classifiers has been put into question. Besides heuristic principles such as ''synthetic data should be close to the real data distribution'', it is actual…

Cited by 0SourcecodeScholar
2026

Towards a Holistic Understanding of Selection Bias for Causal Effect Identification

ICML 2026poster

Selection bias is pervasive in observational studies. For example, large scale biobanks data can exhibit ``healthy volunteer bias'' when respondents are healthier and of higher socio-economic status than the population they are meant to represent. Recovering causal effects from such sub-population i…

Cited by 0SourceScholar
2025

Learning Pareto manifolds in high dimensions: How can regularization help?

AISTATS 2025poster

Simultaneously addressing multiple objectives is becoming increasingly important in modern machine learning. At the same time, data is often high-dimensional and costly to label. For a single objective such as prediction risk, conventional regularization techniques are known to improve generalizatio…

Cited by 0SourceScholar