The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...

HOUSTON – (Feb. 9, 2022) – Rice University computer scientist Anastasios Kyrillidis has won a National Science Foundation CAREER Award to explore the theory and design of non-convex optimization ...

Customer preferences may not be rational, so we focus on quantifying the limit of rationality (LoR) in choice modeling applications. We define LoR as the cost of approximating the observed choice ...

Neel, Seth, Aaron Leon Roth, Giuseppe Vietri, and Zhiwei Steven Wu. "Oracle Efficient Private Non-Convex Optimization." Proceedings of the International Conference on Machine Learning (ICML) 37th ...

Students enrolled in the Professional MS in Computer Science (MSCPS) program with the Algorithms, Network and Optimization (ANO) subplan must complete 30 credit hours of graduate coursework that align ...

Our visual cortex can capture images and recognize objects in a fraction of a second, even if they are barely visible or only fragmentary. One reason for this fantastic peak performance is the highly ...

The course will take an in-depth look at the main concepts and algorithms in convex optimization. The goal is to develop expert knowledge in duality and in the design and analysis of algorithms for ...