6 papers
Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
Ashkan Soleymani, Georgios Piliouras, Gabriele Farina
We introduce Cautious Optimism, a framework for substantially faster regularized learning in general games. Cautious Optimism, as a variant of Optimism, adaptively controls the lea…
Double Machine Learning Based Structure Identification from Temporal Data
Emmanouil Angelis, Francesco Quinzan, Ashkan Soleymani +2
Learning the causes of time-series data is a fundamental task in many applications, spanning from finance to earth sciences or bio-medical applications. Common approaches for this…
Data Generation without Function Estimation
Hadi Daneshmand, Ashkan Soleymani
Estimating the score function (or other population-density-dependent functions) is a fundamental component of most generative models. However, such function estimation is computati…
Double Machine Learning for Conditional Moment Restrictions: IV Regression, Proximal Causal Learning and Beyond
Daqian Shao, Ashkan Soleymani, Francesco Quinzan +1
Solving conditional moment restrictions (CMRs) is a key problem considered in statistics, causal inference, and econometrics, where the aim is to solve for a function of interest t…
Faster Rates for No-Regret Learning in General Games via Cautious Optimism
Ashkan Soleymani, Georgios Piliouras, Gabriele Farina
We establish the first uncoupled learning algorithm that attains per-player regret in multi-player general-sum games, where is the number of players, …
Learning with Exact Invariances in Polynomial Time
Ashkan Soleymani, Behrooz Tahmasebi, Stefanie Jegelka +1
We study the statistical-computational trade-offs for learning with exact invariances (or symmetries) using kernel regression. Traditional methods, such as data augmentation, group…