Search papers, labs, and topics across Lattice.
1
0
2
Optimal $O(\sqrt{d})$ regret in online inverse linear optimization is now achievable in polynomial time, shattering previous computational barriers.
