Machine Learning and Artificial Intelligence

Figure : Sports sciences through data sciences (Louvain-la-Neuve Running Heatmap)

ICTEAM research activities in this field are conducted by ten primary investigators and about fourty researchers. There are two main domains of activity : Machine Learning and Constraint Programming.

Principal Investigators :

Pierre-Antoine Absil, Jean-Charles Delvenne, Yves Deville, Pierre Dupont, John Lee, Siegfried Nijssen, Marco Saerens, Pierre Schaus, Michel Verleysen, Vincent Wertz

Research Labs :

Machine Learning Group, Constraint Group

Research areas :

The research carried out by the UCLouvain Machine Learning Group (MLG) covers both fundamental and applied aspects of machine learning.

Machine learning aims at mining large collection of data and at building models to predict future data. This multidisciplinary field has links to statistics, signal processing, information theory and optimization. It also covers a wide range of applications such as biomedical data analysis, image and video analysis, time series prediction, graph mining, natural language processing, ...

The group specifically addresses the following topics:

  • High-dimensional, functional and non-linear data analysis
  • Feature and model selection
  • Data visualization and manifold learning
  • Bayesian learning
  • Biomedical signal processing and analysis, including ECG, EEG, and respiratory signal analysis, and medical image filtering
  • High-throughput biological data analysis, including microarray data analysis and next-generation sequencing
  • Temporal series prediction, including electrical workload prediction, financial time-series forecasting, networking measurement prediction
  • Automata and Grammar induction with application to software system modeling
  • Structured data analysis, graph mining and collaborative filtering

The UCL Machine Learning Group is organizing, on a yearly basis since 1993, the European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning

Constraint Programming (CP) is a powerful paradigm for modelling and solving complex combinatorial (optimization) problems. It integrates techniques from artificial intelligence, computer science, operational research and optimization. CP separates the modelling of the problem from the search for solutions. It offers high level modelling languages based on constraints. CP proposes two complementary search mechanisms. Standard CP is based on systematic tree search coupled with pruning techniques to remove infeasable solutions. Constraint-Based Local Search (CBLS) allows heuristic search based on the exploration of neighborhoods. The Constraint Group is mainly interested in consistency techniques, integration of CP and CBLS, graph matching, routing problems, applications in networking, ...

Most recent publications

Below are listed the 10 most recent journal articles and conference papers produced in this research area. You also can access all publications by following this link : see all publications.

Journal Articles

1. Van Hoorebeeck, Loïc; Absil, Pierre-Antoine; Papavasiliou, Anthony. Solving non-convex economic dispatch with valve-point effects and losses with guaranteed accuracy. In: International Journal of Electrical Power & Energy Systems, Vol. 134, p. 107143 (2022). doi:10.1016/j.ijepes.2021.107143.

2. Wang, Lei; Gao, Bin; Liu, Xin. Multipliers Correction Methods for Optimization Problems over the Stiefel Manifold. In: CSIAM Transactions on Applied Mathematics, Vol. 2, no.3, p. 508-531 (2021). doi:10.4208/

3. Gao, Bin; Nguyen, Thanh Son; Absil, Pierre-Antoine; Stykel, Tatjana. Riemannian Optimization on the Symplectic Stiefel Manifold. In: SIAM Journal on Optimization, Vol. 31, no.2, p. 1546-1575 (2021). doi:10.1137/20m1348522.

4. Hamer, Victor; Dupont, Pierre. An Importance Weighted Feature Selection Stability Measure. In: Journal of Machine Learning Research, Vol. 22, no.116, p. 1-57 (2021).

5. Marrinan, Tim; Absil, Pierre-Antoine; Gillis, Nicolas. On a minimum enclosing ball of a collection of linear subspaces. In: Linear Algebra and its Applications, Vol. 625, p. 248-278 (2021). doi:10.1016/j.laa.2021.05.006.

6. Musolas, Antoni; Massart, Estelle; Hendrickx, Julien; Absil, Pierre-Antoine; Marzouk, Youssef. Low-rank multi-parametric covariance identification. In: BIT Numerical Mathematics, , p. 1-29 (2021). doi:10.1007/s10543-021-00867-y.

7. Dong, Shuyu; Absil, Pierre-Antoine; Gallivan, K.A. Riemannian gradient descent methods for graph-regularized matrix completion. In: Linear Algebra and its Applications, Vol. 623, p. 193-235 (2021). doi:10.1016/j.laa.2020.06.010.

8. Gerniers, Alexander; Bricard, Orian; Dupont, Pierre. MicroCellClust: mining rare and highly specific subpopulations from single-cell expression data. In: Bioinformatics, Vol. 37, no. 19, p. 3220-3227 (2021). doi:10.1093/bioinformatics/btab239.

9. Yuan, Xinru; Huang, Wen; Absil, Pierre-Antoine; Gallivan, Kyle A. Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method. In: Numerical Linear Algebra with Applications, Vol. 27, no.5, p. 2321 (2020). doi:10.1002/nla.2321.

10. Coelho, Frederico; Costa, Marcelo; Verleysen, Michel; Braga, Antônio P. LASSO multi-objective learning algorithm for feature selection. In: Soft Computing, Vol. 24, no.4, p. 9 (2020). doi:10.1007/s00500-020-04734-w.

Conference Papers

1. Hamer, Victor; Dupont, Pierre. Robust Selection Stability Estimation in Correlated Spaces. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Vol. 1, no.1, p. 446-461 (2021). Springer, 2021 xxx.

2. Gao, Bin; Nguyen, Thanh Son; Absil, Pierre-Antoine; Stykel, Tatjana. Geometry of the Symplectic Stiefel Manifold Endowed with the Euclidean Metric. In: Lecture Notes in Computer Science : Geometric Science of Information, Springer International Publishing,2021, 2021, 978-3-030-80208-0, p. 789-796 xxx. doi:10.1007/978-3-030-80209-7_85.

3. Hamer, Victor; Dupont, Pierre. Joint optimization of predictive performance and selection stability. In: ESANN 2020 - Proceedings. Vol. 1, no.1, p. 381-386 (2020). 2020 xxx.

4. Hamer, Victor; Dupont, Pierre. Explicit Control of Feature Relevance and Selection Stability Through Pareto Optimality. In: CEUR Workshop Proceedings. Vol. 2444, no.1, p. 64-79 (2019). CEUR, 2019 xxx.

5. Nguyen, Thanh Son; Gousenbourger, Pierre-Yves; Massart, Estelle; Absil, Pierre-Antoine. Online balanced truncation for linear time-varying systems using continuously differentiable interpolation on Grassmann manifold. In: 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), IEEE, 2019, 9781728105215, p. 165-170 xxx. doi:10.1109/codit.2019.8820675.

6. Massart, Estelle; Hendrickx, Julien; Absil, Pierre-Antoine. Curvature of the Manifold of Fixed-Rank Positive-Semidefinite Matrices Endowed with the Bures–Wasserstein Metric. In: Lecture Notes in Computer Science : Geometric Science of Information (Geometric Science of information), Frank Nielsen, Frédéric Barbaresco Eds. 2019, 9783030269791, p. 739-748 xxx. doi:10.1007/978-3-030-26980-7_77.

7. Renard, Emilie; Absil, Pierre-Antoine; Gallivan, Kyle A.. Minimax center to extract a common subspace from multiple datasets. In: ESANN 2019 Proceedings, 2019, 978-287-587-065-0, p. 275-280 xxx.

8. Dong, Shuyu; Absil, Pierre-Antoine; Gallivan, Kyle A.. Preconditioned conjugate gradient algorithms for graph regularized matrix completion. In: ESANN 2019 Proceedings, 2019, 978-287-587-065-0, p. 239-244 xxx.

9. Renard, Emilie; Gallivan, Kyle A.; Absil, Pierre-Antoine. A Grassmannian Minimum Enclosing Ball Approach for Common Subspace Extraction. In: Latent Variable Analysis and Signal Separation : Lecture Notes in Computer Science, Springer International Publishing, 2018, 9783319937632, p. 69-78 xxx. doi:10.1007/978-3-319-93764-9_7.

10. Hamer, Victor; Dupont, Pierre. Learning Computationally Efficient Metrics for Large Scale Person Identification. In: Proceedings of the Annual Machine Learning Conference of Belgium and the Netherlands 2018. Vol. /, no./, p. / (2018). 2018 xxx.