activity
20162026
most citedEfficient Orthogonal Parametrisation of Recurrent Neural Networks Using Householder Reflections

31 citations · 83 across the 30 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2026

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization

Ruichen Jiang, Zakaria Mhammedi, Mehryar Mohri +1

We study online linear optimization with matrix variables constrained by the operator norm, a setting where the geometry renders designing data-dependent and efficient adaptive alg…

math.OC2023

Projection-Free Online Convex Optimization via Efficient Newton Iterations

Khashayar Gatmiry, Zakaria Mhammedi

This paper presents new projection-free algorithms for Online Convex Optimization (OCO) over a convex domain . Classical OCO algorithms (such as O…

math.OC2022

Quasi-Newton Steps for Efficient Online Exp-Concave Optimization

Zakaria Mhammedi, Khashayar Gatmiry

The aim of this paper is to design computationally-efficient and optimal algorithms for the online and stochastic exp-concave optimization settings. Typical algorithms for these se…

math.OC2022★ 4 cited

Model Predictive Control via On-Policy Imitation Learning

Kwangjun Ahn, Zakaria Mhammedi, Horia Mania +2

In this paper, we leverage the rapid advances in imitation learning, a topic of intense recent focus in the Reinforcement Learning (RL) literature, to develop new sample complexity…

math.OC2021★ 3 cited

Efficient Projection-Free Online Convex Optimization with Membership Oracle

Zakaria Mhammedi

In constrained convex optimization, existing methods based on the ellipsoid or cutting plane method do not scale well with the dimension of the ambient space. Alternative approache…