Lab Image Machine Learning & Decision Making Lab Chalmers Image

Home Team Teaching Publications Patents Code



Home

The Machine Learning and Decision Making Lab (ML&DM Lab) is based in the Data Science and AI division in the Department of Computer Science and Engineering (CSE) at Chalmers University of Technology, Gothenburg, Sweden. The lab, led by Morteza Haghir Chehreghani, conducts research in different areas of machine learning and AI-enabled decision making.

Our research spans both the foundations of machine learning and decision making as well as real-world applications, aiming to push the boundaries of machine learning while addressing practical challenges across diverse domains such as transport, energy, life sciences, autonomous systems, recommendation systems, and decision support systems. Our current research focuses on the following topics:

Our research is supported by Swedish Research Council (VR), Vinnova, and WASP (Wallenberg AI, Autonomous Systems and Software Program).

Swedish Research Council Vinnova Wallenberg AI, Autonomous Systems and Software Program (WASP)



Team

Group Leader

Morteza Haghir Chehreghani

Morteza Haghir Chehreghani
Professor

Morteza is a Professor of Machine Learning in the Data Science and AI division, Department of Computer Science and Engineering, Chalmers University of Technology, where he leads the Machine Learning and Decision Making Lab (ML&DM Lab). Morteza received his Ph.D. in Computer Science from ETH Zurich, Switzerland, in 2014, under the supervision of Prof. Dr. Joachim M. Buhmann at the Institute for Machine Learning. Following his Ph.D., he spent about four years as a researcher at Naver Labs Europe (formerly known as Xerox Research Centre Europe) in the Machine Learning and Optimization team, where he held positions as Staff Research Scientist I and II. Morteza joined Chalmers University of Technology in 2018 as an Associate Professor and became a Professor in 2024. He is also an affiliated faculty member of Wallenberg AI, Autonomous Systems and Software Program (WASP) and Chalmers AI Research (CHAIR).


PhD Students




Linus Aronsson
Active Learning, Correlation Clustering, Deep Learning




Hampus Gummesson Svensson
Reinforcement Learning, Multi-Armed Bandits, Drug Discovery




Deepthi Pathare
Reinforcement Learning, Large Language Models (LLMs), Transport




Jack Sandberg
Multi-Armed Bandits, Reinforcement Learning, Gaussian Processes




Valter Schütz
Reinforcement Learning, Large Language Models (LLMs)

Affiliated PhD Students




Hannes Nilsson
Online Learning, Uncertainty-Aware Learning, Energy Models




Kilian Tamino Freitag
Reinforcement Learning, Deep Learning, Robotics

Alumni




Teaching

Morteza Haghir Chehreghani is the examiner and teacher of the following courses:

The other teaching activities at Chalmers include:




Publications

  1. Learning for routing: A guided review of recent developments and future directions

  2. Diversity-Aware Reinforcement Learning for de novo Drug Design

  3. Bayesian Analysis of Combinatorial Gaussian Process Bandits

  4. Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach

  5. Diesel Combustion Parameter Estimation via Machine Learning – A Comparative Study

  6. Mining Transactional Tree Databases under Homeomorphism

  7. Tree Ensembles for Contextual Bandits

  8. Hierarchical Correlation Clustering and Tree Preserving Embedding

  9. Correlation Clustering with Active Learning of Pairwise Similarities

  10. Utilizing Reinforcement Learning for de novo Drug Design

  11. Online Learning Models for Vehicle Usage Prediction During COVID-19

  12. De novo generated combinatorial library design

  13. A contextual combinatorial semi-bandit approach to network bottleneck identification

  14. A unified active learning framework for annotating graph data for regression tasks

  15. Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms Regularization Framework

  16. Efficient Online Decision Tree Learning with Active Feature Acquisition

  17. Online Learning of Energy Consumption for Navigation of Electric Vehicles

  18. A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles

  19. Online Learning of Network Bottlenecks via Minimax Paths

  20. Shift of Pairwise Similarities for Data Clustering

  21. Deep Q-learning: a robust control approach

  22. Do Kernel and Neural Embeddings Help in Training and Generalization?

  23. Long-Distance Electric Vehicle Navigation using a Combinatorial Semi-Bandit Approach

  24. Batch Mode Deep Active Learning for Regression on Graph Data

  25. Diverse Data Expansion with Semi-Supervised k-Determinantal Point Processes

  26. Non-Uniform Sampling Methods for Large Itemset Mining

  27. Improved Tactical Decision Making and Control Architecture for Autonomous Truck in SUMO Using Reinforcement Learning

  28. A Deep Learning Framework for Generation and Analysis of Driving Scenario Trajectories

  29. Convolutional Spiking Neural Networks for Spatio-Temporal Feature Extraction

  30. Controlling gene expression with deep generative design of regulatory DNA

  31. Efficient Optimization of Dominant Set Clustering with Frank-Wolfe Algorithms

  32. Analysis of Knowledge Transfer in Kernel Regime

  33. A Unified Framework for Online Trip Destination Prediction

  34. Active Learning of Driving Scenario Trajectories

  35. Using Active Learning to Develop Machine Learning Models for Reaction Yield Prediction

  36. On Using Node Indices and Their Correlations for Fake Account Detection

  37. Autonomous Drug Design with Multi-Armed Bandits

  38. Graph Clustering Using Node Embeddings: An Empirical Study

  39. Memory-Efficient Minimax Distance Measures

  40. Trip Prediction by Leveraging Trip Histories from Neighboring Users

  41. Passive and Active Learning of Driver Behavior from Electric Vehicles

  42. TEP-GNN: Accurate Execution Time Prediction of Functional Tests using Graph Neural Networks

  43. Model-Centric and Data-Centric Aspects of Active Learning for Deep Neural Networks

  44. Shallow Node Representation Learning using Centrality Indices

  45. Vehicle Motion Trajectories Clustering Via Embedding Transitive Relations

  46. Annotation of Traffic Scenarios for AD Verification Using Active Learning

  47. Reliable Agglomerative Clustering

  48. Unsupervised representation learning with Minimax distance measures

  49. Learning representations from dendrograms

  50. Accelerated Proximal Incremental Algorithm Schemes for Non-Strongly Convex Functions

  51. An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles

  52. Generation of Driving Scenario Trajectories with Generative Adversarial Networks

  53. A Non-convex Optimization Approach to Correlation Clustering

  54. Lifelong Learning Starting from Zero

  55. Dynamic Deep Learning

  56. Efficient Context-Aware K-Nearest Neighbor Search

  57. Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting

  58. Classification with Minimax Distance Measures

  59. Clustering by Shift

  60. Efficient Computation of Pairwise Minimax Distance Measures

  61. Feature-Oriented Analysis of User Profile Completion Problem

  62. Adaptive Trajectory Analysis of Replicator Dynamics for Data Clustering

  63. Modeling Transitivity in Complex Networks

  64. Transactional Tree Mining

  65. K-Nearest Neighbor Search and Outlier Detection via Minimax Distances

  66. Inferring causal metabolic signals that regulate the dynamic TORC1-dependent transcriptome

  67. Approximate Sorting

  68. Information Content in Clustering Algorithms

  69. Information Theoretic Model Validation for Spectral Clustering

  70. Probabilistic Heuristics for Hierarchical Web Data Clustering

  71. The Information Content in Sorting Algorithms

  72. Approximate Set Coding for Information Theoretic Model Validation

  73. Information Theoretic Model Selection for Pattern Analysis

  74. Model-based clustering using generative embedding

  75. OInduced: An Efficient Algorithm for Mining Induced Patterns from Rooted Ordered Trees

  76. Approximate Sorting of Preference Data

  77. Cluster Model Validation by Maximizing Approximation Capacity

  78. The Minimum Transfer Cost Principle for Model-Order Selection

  79. Density link-based methods for clustering web pages

  80. Efficient Rule Based Structural Algorithms for Classification of Tree-Structured Data

  81. Improving Density Based Methods for Hierarchical Clustering of the Web Pages

  82. Novel Meta-Heuristic Algorithms for Clustering Web Documents

  83. Improving Tree Structures to Find Dense Clusters from Web Documents

  84. A Heuristic Algorithm for Clustering Rooted Ordered Trees

  85. Attaining Higher Quality for Density Based Algorithms

  86. Mining Maximal Embedded Unordered Tree Patterns

  87. H-BayesClust: A new Hierarchical Clustering based on Bayesian Networks

  88. Design and Implementation of a 2-D Barcode based on Data Matrix Format and Reed-Solomon Error Correcting Codes



Patents

  1. Method and computer system for multi-level control of motion actuators in an autonomous vehicle

  2. System and method for performing k-nearest neighbor search based on minimax distance measure and efficient outlier detection

  3. Efficient Calculation of All-Pair Path-based Distance Measures

  4. Method of Trip Prediction by Leveraging Trip Histories from Neighboring Users

  5. Adaptive Trajectory Analysis of Replicator Dynamics for Data Clustering



Code & Data