Explore >> Select a destination
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
francisbach.com
|
|
| | | | | [AI summary] The blog post discusses non-convex quadratic optimization problems and their solutions, including the use of strong duality, semidefinite programming (SDP) relaxations, and efficient algorithms. It highlights the importance of these problems in machine learning and optimization, particularly for non-convex problems where strong duality holds. The post also mentions the equivalence between certain non-convex problems and their convex relaxations, such as SDP, and provides examples of when these relaxations are tight or not. Key concepts include the role of eigenvalues in quadratic optimization, the use of Lagrange multipliers, and the application of methods like Newton-Raphson for solving these problems. The author also acknowledges contributions... | |
| | | | |
www.jeremykun.com
|
|
| | | | | This post is a sequel to Formulating the Support Vector Machine Optimization Problem. The Karush-Kuhn-Tucker theorem Generic optimization problems are hard to solve efficiently. However, optimization problems whose objective and constraints have special structure often succumb to analytic simplifications. For example, if you want to optimize a linear function subject to linear equality constraints, one can compute the Lagrangian of the system and find the zeros of its gradient. More generally, optimizing... | |
| | | | |
jhui.github.io
|
|
| | | | | [AI summary] The provided text discusses various mathematical and computational concepts relevant to deep learning, including poor conditioning in matrices, underflow/overflow in softmax functions, Jacobian and Hessian matrices, learning rate optimization using Taylor series, Newton's method, saddle points, constrained optimization with Lagrange multipliers, and KKT conditions. These concepts are crucial for understanding numerical stability, optimization algorithms, and solving constrained problems in machine learning. | |
| | | | |
liorsinai.github.io
|
|
| | | A series on automatic differentiation in Julia. Part 1 provides an overview and defines explicit chain rules. | ||
