Unconstrained optimization (characterization of optimal solution, gradient method, convergence analysis, Newton method, local convergence analysis).
Convex optimization with constraints (Farkas Lemma, Fritz John conditions, conditions Karush-Kuhn-Tucker (KKT) - examples).
Duality, Lagrangian, dual function, weak and strong duality – examples of dual problems.
Convex optimization with affine equality constraints (Newton method, primal-dual).
General convex optimization problems (barrier function, interior point method, primal-dual).
Alternating Direction Method of Multipliers
Introduction to distributed optimization
The Lab part of the course consists of four (4) projects which contain theoretical questions as well as matlab (or octave) code implementing selected optimization algorithms.
Grading;
Final Exam 6/10,
Projects (4/10).
Our main source will be the textbook
S. Boyd and L. Vandenberghe. "Convex Optimization," Cambridge University Press, 2004 (I uploaded the textbook in the "Εγγραφα" section).
See also the video series of recent Boy's lectures
Uncertainty and probabilistic reasoning. Robotic perception and action. Recursive state estimation: state space, belief space, prediction and correction, Bayes filter. Estimation filters: linear Kalman filter, extended Kalman filter, unscented Kalman filter, histogram filter, particle filter. Probabilistic motion models: velocity model, odometry model, sampling and probability density. Probabilistic observation models: beam model, scan model, feature model, sampling and probability density. Robot localization: Markov, Gaussian, Grid, Monte-Carlo. Robotic mapping: occupancy grid maps, feature maps, simultaneous localization and mapping (SLAM). Decision making under uncertainty, Markov decision processes (MDPs), optimal policies, value iteration, policy iteration. Partial observability, partially observable MPDs (POMDPs), augmented MDPs. Reinforcement learning, prediction and control, trial and error, approximate representations. Multi-robot planning, coordination, and learning. syllabus
Probability Theory & Introduction to Machine Learning
(MLDS101 - TEL 901)
ΜΙΧΑΗΛ ΠΑΤΕΡΑΚΗΣ και ΓΕΩΡΓΙΟΣ ΚΑΡΥΣΤΙΝΟΣ
—
Probability Theory & Introduction to Machine Learning - Fall 2024
(TEL 901)
ΓΕΩΡΓΙΟΣ ΚΑΡΥΣΤΙΝΟΣ
—
Programming and Database Fundamentals
(MLDS103-s)
Vasilis Samoladas
Programming and Database Fundamentals
MLDS103-s - Vasilis Samoladas
Database design and use of databases in applications. Design and implementation issues in databases. Design and implementation of relational systems. Design and implementation of object–oriented systems. XML databases. Query optimization in databases. Optimizing the performance of applications with design at the physical level, cost optimization for transactions, recovery. Distributed databases. Data Warehousing. Data mining on databases. Continuous Databases. Stream Processing. Big Data Systems and Frameworks. SQL.