Optimal and Efficient Online Inverse Optimization
A deterministic polynomial-time algorithm achieves optimal O(sqrt d) regret for online inverse linear optimization.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
A deterministic polynomial-time algorithm achieves optimal O(sqrt d) regret for online inverse linear optimization.
Today 251 readers · 270 views · 20 reads · all time 108K views