Computer Engineering is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Computer Engineering
Optimization in Machine Learning
Gradient and Newton methods, stochastic and evolution strategies, convex optimisation, genetic algorithms, PSO and ant colonies.
Notes for Optimization in Machine Learning are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.
Coming next in Optimization in Machine Learning
- Classification of optimisation problems· notes coming
- Types of optima· notes coming
- Convex objective functions· notes coming
- Gradient descent and conjugate gradient· notes coming
- Momentum and adaptive methods· notes coming
- Newton's method· notes coming
- Noisy descent and direct search· notes coming
- Cross-entropy method· notes coming
- Evolution strategies and CMA-ES· notes coming
- Convex optimisation problems· notes coming
- Linear and quadratic programming· notes coming
- Geometric programming· notes coming
- Evolutionary algorithms· notes coming
- Selection operators· notes coming
- Canonical genetic algorithm· notes coming
- Particle swarm optimisation· notes coming
- Ant colony optimisation· notes coming
- Vector spaces, matrices and eigenvalues for optimisation· notes coming
- Quadratic forms and matrix norms· notes coming
- One-dimensional search: golden section and Fibonacci· notes coming
- Secant method· notes coming
- Simplex method and duality· notes coming
- Equality and inequality constraints· notes coming
- Karush–Kuhn–Tucker conditions· notes coming
- Projected gradient methods· notes coming
- Penalty methods· notes coming