18 citations · 34 across the 10 of their papers we have counts for
3 papers · 1 filter
Gradient-free stochastic optimization for additive models
Arya Akhavan, Alexandre B. Tsybakov
We address the problem of zero-order optimization from noisy observations for an objective function satisfying the Polyak-Łojasiewicz or the strong convexity condition. Additionall…
A conversion theorem and minimax optimality for continuum contextual bandits
Arya Akhavan, Karim Lounici, Massimiliano Pontil +1
We study the contextual continuum bandits problem, where the learner sequentially receives a side information vector and has to choose an action in a convex set, minimizing a funct…
Group Meritocratic Fairness in Linear Contextual Bandits
Riccardo Grazzi, Arya Akhavan, John Isak Texas Falk +2
We study the linear contextual bandit problem where an agent has to select one candidate from a pool and each candidate belongs to a sensitive group. In this setting, candidates' r…