Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.
Explores learning the kernel function in convex optimization, focusing on predicting outputs using a linear classifier and selecting optimal kernel functions through cross-validation.
Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.
Covers Markov Chain Monte Carlo for sampling high-dimensional distributions, discussing challenges, advantages, and applications like the Knapsack Problem and cryptography.
Explores convex optimization, emphasizing the importance of minimizing functions within a convex set and the significance of continuous processes in studying convergence rates.
Explores portfolio optimization models and strategies under uncertainty, emphasizing decision criteria like value-at-risk and mean-variance functional.
