5 citations · 18 across the 18 of their papers we have counts for
3 papers · 1 filter
Algorithmic Optimality Guarantees for Nonsmooth Output-Feedback Policy Search
Ashkan Soleymani, Patrick Jaillet
We study continuous-time full-order dynamic output-feedback policy search, a nonconvex and nonsmooth problem. Direct policy search is a central paradigm in reinforcement…
When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation
Patrick Jaillet, Chara Podimata, Andrew Vakhutinsky +1
In this work, we study an upgrading scheme for online resource allocation problems. We work in a sequential setting, where at each round a request for a resource arrives and the de…
Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes
Moïse Blanchard, Junhui Zhang, Patrick Jaillet
We propose a family of recursive cutting-plane algorithms to solve feasibility problems with constrained memory, which can also be used for first-order convex optimization. Precise…