From the 2 of 4 linked papers with an AI index.
4 citations · 4 across the 3 of their papers we have counts for
4 papers
Entropy-Smooth Convex Optimization Cannot Be Accelerated
Jacob M. Aguirre, Dmitrii M. Ostrovskii
The paper proves that for convex functions that are smooth relative to negative entropy (or von Neumann entropy in the quantum case), no first-order method can achieve an accelerat…
Bandit PCA with Minimax Optimal Regret
Moïse Blanchard, Dmitrii Ostrovskii, Aadirupa Saha
The paper investigates the bandit-feedback version of online principal component analysis, presenting a new algorithm that achieves near‑optimal regret of order r√(dT) and proving…
Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain
Dmitrii M. Ostrovskii, Babak Barazandeh, Meisam Razaviyayn
We study the problem of finding approximate first-order stationary points in optimization problems of the form , where the sets are conv…
Efficient and Near-Optimal Online Portfolio Selection
Rémi Jézéquel, Dmitrii M. Ostrovskii, Pierre Gaillard
In the problem of online portfolio selection as formulated by Cover (1991), the trader repeatedly distributes her capital over assets in each of rounds, with the go…