Amjad Seyedi is a doctoral researcher in Matrix Theory and Optimization at UMONS with eight years of academic and research experience spanning representation learning, matrix factorization, and low-rank approximation. He previously led the Algebraic Machine Learning team and served as a graduate research and teaching assistant at the University of Kurdistan, focusing on robustness and generalization in unsupervised representation methods. His work bridges theoretical mathematics and practical AI applications such as semi-supervised learning, recommender systems, and multi-label classification. Amjad holds an MSc in Artificial Intelligence and bachelor-level training in software engineering, giving him both rigorous theoretical grounding and hands-on engineering skills. Known for exploring fundamental methods in representation theory, he brings a researcher’s depth to problems that require both algebraic insight and applied ML solutions. Based in Mons, Belgium, he is building on a track record of mentoring students and advising theses while advancing his PhD under Prof. Nicolas Gillis.
8 years of coding experience
5 years of employment as a software developer
Bachelor's degree, Computer Software Engineering, Bachelor's degree, Computer Software Engineering at Amirkabir Technical College
Doctor of Philosophy - PhD, Mathematics and Computer Science, Doctor of Philosophy - PhD, Mathematics and Computer Science at UMONS
Master's degree, Artificial Intelligence, Master's degree, Artificial Intelligence at University of Kurdistan, Sanandaj
High School Diploma, Computer, High School Diploma, Computer at Taleqani Technical School
Associate's degree, Computer Software Engineering, Associate's degree, Computer Software Engineering at Technical College of Tabriz
Contributions:18 commits, 19 pushes, 1 branch in 3 years 3 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.