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. Bayesian Analysis of Combinatorial Gaussian Process Bandits

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

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

  4. Mining Transactional Tree Databases under Homeomorphism

  5. Tree Ensembles for Contextual Bandits

  6. Hierarchical Correlation Clustering and Tree Preserving Embedding

  7. Correlation Clustering with Active Learning of Pairwise Similarities

  8. Utilizing Reinforcement Learning for de novo Drug Design

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

  10. de novo generated combinatorial chemical libraries

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

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

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

  14. Efficient Online Decision Tree Learning with Active Feature Acquisition

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

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

  17. Online Learning of Network Bottlenecks via Minimax Paths

  18. Shift of Pairwise Similarities for Data Clustering

  19. Deep Q-learning: a robust control approach

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

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

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

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

  24. Non-Uniform Sampling Methods for Large Itemset Mining

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

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

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

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

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

  30. Analysis of Knowledge Transfer in Kernel Regime

  31. A Unified Framework for Online Trip Destination Prediction

  32. Active Learning of Driving Scenario Trajectories

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

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

  35. Autonomous Drug Design with Multi-Armed Bandits

  36. Graph Clustering Using Node Embeddings: An Empirical Study

  37. Memory-Efficient Minimax Distance Measures

  38. Trip Prediction by Leveraging Trip Histories from Neighboring Users

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

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

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

  42. Shallow Node Representation Learning using Centrality Indices

  43. Vehicle Motion Trajectories Clustering Via Embedding Transitive Relations

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

  45. Reliable Agglomerative Clustering

  46. Unsupervised representation learning with Minimax distance measures

  47. Learning representations from dendrograms

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

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

  50. Generation of Driving Scenario Trajectories with Generative Adversarial Networks

  51. A Non-convex Optimization Approach to Correlation Clustering

  52. Lifelong Learning Starting from Zero

  53. Dynamic Deep Learning

  54. Efficient Context-Aware K-Nearest Neighbor Search

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

  56. Classification with Minimax Distance Measures

  57. Clustering by Shift

  58. Efficient Computation of Pairwise Minimax Distance Measures

  59. Feature-Oriented Analysis of User Profile Completion Problem

  60. Adaptive Trajectory Analysis of Replicator Dynamics for Data Clustering

  61. Modeling Transitivity in Complex Networks

  62. Transactional Tree Mining

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

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

  65. Approximate Sorting

  66. Information Content in Clustering Algorithms

  67. Information Theoretic Model Validation for Spectral Clustering

  68. Probabilistic Heuristics for Hierarchical Web Data Clustering

  69. The Information Content in Sorting Algorithms

  70. Approximate Set Coding for Information Theoretic Model Validation

  71. Information Theoretic Model Selection for Pattern Analysis

  72. Model-based clustering using generative embedding

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

  74. Approximate Sorting of Preference Data

  75. Cluster Model Validation by Maximizing Approximation Capacity

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

  77. Density link-based methods for clustering web pages

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

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

  80. Novel Meta-Heuristic Algorithms for Clustering Web Documents

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

  82. A Heuristic Algorithm for Clustering Rooted Ordered Trees

  83. Attaining Higher Quality for Density Based Algorithms

  84. Mining Maximal Embedded Unordered Tree Patterns

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

  86. 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