Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox

Faster First-Order Algorithms for Monotone Strongly DR-Submodular Maximization



Omid Sadeghi , Maryam Fazel


   Access Paper or Ask Questions

Improved Regret Bounds for Online Submodular Maximization



Omid Sadeghi , Prasanna Raut , Maryam Fazel


   Access Paper or Ask Questions

Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs



Mitas Ray , Omid Sadeghi , Lillian J. Ratliff , Maryam Fazel


   Access Paper or Ask Questions

Online DR-Submodular Maximization with Stochastic Cumulative Constraints



Prasanna Sanjay Raut , Omid Sadeghi , Maryam Fazel


   Access Paper or Ask Questions

Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints



Omid Sadeghi , Maryam Fazel

* Submitted to NeurIPS 2019 

   Access Paper or Ask Questions

Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems



Omid Sadeghi , Reza Eghbali , Maryam Fazel

* Submitted to NeurIPS 2019 

   Access Paper or Ask Questions