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 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. Diversity-Aware Reinforcement Learning for de novo Drug Design

  2. Bayesian Analysis of Combinatorial Gaussian Process Bandits

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

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

  5. Mining Transactional Tree Databases under Homeomorphism

  6. Tree Ensembles for Contextual Bandits

  7. Hierarchical Correlation Clustering and Tree Preserving Embedding

  8. Correlation Clustering with Active Learning of Pairwise Similarities

  9. Utilizing Reinforcement Learning for de novo Drug Design

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

  11. de novo generated combinatorial chemical libraries

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

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

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

  15. Efficient Online Decision Tree Learning with Active Feature Acquisition

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

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

  18. Online Learning of Network Bottlenecks via Minimax Paths

  19. Shift of Pairwise Similarities for Data Clustering

  20. Deep Q-learning: a robust control approach

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

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

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

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

  25. Non-Uniform Sampling Methods for Large Itemset Mining

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

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

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

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

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

  31. Analysis of Knowledge Transfer in Kernel Regime

  32. A Unified Framework for Online Trip Destination Prediction

  33. Active Learning of Driving Scenario Trajectories

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

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

  36. Autonomous Drug Design with Multi-Armed Bandits

  37. Graph Clustering Using Node Embeddings: An Empirical Study

  38. Memory-Efficient Minimax Distance Measures

  39. Trip Prediction by Leveraging Trip Histories from Neighboring Users

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

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

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

  43. Shallow Node Representation Learning using Centrality Indices

  44. Vehicle Motion Trajectories Clustering Via Embedding Transitive Relations

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

  46. Reliable Agglomerative Clustering

  47. Unsupervised representation learning with Minimax distance measures

  48. Learning representations from dendrograms

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

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

  51. Generation of Driving Scenario Trajectories with Generative Adversarial Networks

  52. A Non-convex Optimization Approach to Correlation Clustering

  53. Lifelong Learning Starting from Zero

  54. Dynamic Deep Learning

  55. Efficient Context-Aware K-Nearest Neighbor Search

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

  57. Classification with Minimax Distance Measures

  58. Clustering by Shift

  59. Efficient Computation of Pairwise Minimax Distance Measures

  60. Feature-Oriented Analysis of User Profile Completion Problem

  61. Adaptive Trajectory Analysis of Replicator Dynamics for Data Clustering

  62. Modeling Transitivity in Complex Networks

  63. Transactional Tree Mining

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

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

  66. Approximate Sorting

  67. Information Content in Clustering Algorithms

  68. Information Theoretic Model Validation for Spectral Clustering

  69. Probabilistic Heuristics for Hierarchical Web Data Clustering

  70. The Information Content in Sorting Algorithms

  71. Approximate Set Coding for Information Theoretic Model Validation

  72. Information Theoretic Model Selection for Pattern Analysis

  73. Model-based clustering using generative embedding

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

  75. Approximate Sorting of Preference Data

  76. Cluster Model Validation by Maximizing Approximation Capacity

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

  78. Density link-based methods for clustering web pages

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

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

  81. Novel Meta-Heuristic Algorithms for Clustering Web Documents

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

  83. A Heuristic Algorithm for Clustering Rooted Ordered Trees

  84. Attaining Higher Quality for Density Based Algorithms

  85. Mining Maximal Embedded Unordered Tree Patterns

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

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



Patents

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

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

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

  4. Adaptive Trajectory Analysis of Replicator Dynamics for Data Clustering



Code & Data