SBS. Ilker Birbil

S. Ilker Birbil

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


S. Ilker Birbil has a total of 54 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Coherent local explanations for mathematical optimization

    by Daan Otto, Jannis Kurtz, Ş. İlKer Birbil

  • Open Access

    ECSEL: Explainable Classification via Signomial Equation Learning

    by Adia Lumadjeng, Ilker Birbil, Erman Acar

    We introduce ECSEL, an explainable classification method that learns formal expressions in the form of signomial equations, motivated by the observation that many symbolic regression benchmarks admit compact signomial structure. ECSEL directly constructs a structural, closed-form expression that serves as both a classifier and an explanation. On standard symbolic regression benchmarks, our method recovers a larger fraction of target equations than competing state-of-the-art approaches while requiring substantially less computation. Leveraging this efficiency, ECSEL achieves classification accuracy competitive with established machine learning models without sacrificing interpretability. Further, we show that ECSEL satisfies some desirable properties regarding global feature behavior, decision-boundary analysis, and local feature attributions. Experiments on benchmark datasets and two real-world case studies i.e., e-commerce and fraud detection, demonstrate that the learned equations expose dataset biases, support counterfactual reasoning, and yield actionable insights.

  • Open Access

    Why we do need explainable AI for healthcare

    by Giovanni Cinà, Tabea E. Röber, Rob Goedhart, Ş. İlKer Birbil

    The recent uptake in certified Artificial Intelligence (AI) tools for healthcare applications has renewed the debate around their adoption. Explainable AI, the sub-discipline promising to render AI devices more transparent and trustworthy, has also come under scrutiny as part of this discussion. Some experts in the medical AI space debate the reliability of Explainable AI techniques, expressing concerns on their use and inclusion in guidelines and standards. Revisiting such criticisms, this article offers a balanced perspective on the utility of Explainable AI, focusing on the specificity of clinical applications of AI and placing them in the context of healthcare interventions. Against its detractors and despite valid concerns, we argue that the Explainable AI research program is still central to human-machine interaction and ultimately a useful tool against loss of control, a danger that cannot be prevented by rigorous clinical validation alone.


  • Open Access

    Counterfactual explanations for linear optimization

    by Jannis Kurtz, Ş. İlKer Birbil, Dick Den Hertog


  • Open Access

    Rule generation for classification: Scalability, interpretability, and fairness

    by Tabea E. Röber, Adia C. Lumadjeng, M. Hakan Akyüz, Ş. İlKer Birbil


  • Open Access

    Modeling Alzheimer’s disease: Bayesian copula graphical model from demographic, cognitive, and neuroimaging data

    by Lucas Vogels, Reza Mohammadi, Marit Schoonhoven, Ş Ilker Birbil, Martin Dyrba, For The Alzheimer’S Disease Neuroimaging Initiative

    Background: The early detection of Alzheimer’s disease (AD) requires an understanding of the relationships between a wide range of features. Conditional independencies and partial correlations are suitable measures for these relationships, because they can identify the effects of confounding and mediating variables. Objective: To estimate conditional dependencies and partial correlations between relevant features in AD using a Bayesian approach to Gaussian copula graphical models (GCGMs). This approach has two key advantages. First, it includes binary, discrete, and continuous variables. Second, it quantifies the uncertainty of the estimates. Despite these advantages, Bayesian GCGMs have not been applied to AD research yet. Methods: We design a GCGM to find the conditional dependencies and partial correlations among brain-region specific gray matter volume and glucose uptake, amyloid-beta levels, demographic information, and cognitive test scores. We applied our model to 1 022 participants, including healthy and cognitively impaired, across different stages of AD. Results: We found that aging reduces cognition through three indirect pathways: hippocampal volume loss, posterior cingulate cortex (PCC) volume loss, and amyloid-beta accumulation. We found a positive partial correlation between being woman and cognition, but also discovered four indirect pathways that dampen this association in women: lower hippocampal volume, lower PCC volume, more amyloid-beta accumulation, and less education. We found limited relations between brain-region specific glucose uptake and cognition, but discovered that the hippocampus and PCC volumes are related to cognition. Conclusions: This study shows that the use of GCGMs offers valuable insights into AD pathogenesis.

  • Machine Learning for K-Adaptability in Two-Stage Robust Optimization

    by Esther Julien, Krzysztof Postek, Ş. İlKer Birbil

    Two-stage robust optimization problems constitute one of the hardest optimization problem classes. One of the solution approaches to this class of problems is K-adaptability. This approach simultaneously seeks the best partitioning of the uncertainty set of scenarios into K subsets and optimizes decisions corresponding to each of these subsets. In a general case, it is solved using the K-adaptability branch-and-bound algorithm, which requires exploration of exponentially growing solution trees. To accelerate finding high-quality solutions in such trees, we propose a machine learning-based node selection strategy. In particular, we construct a feature engineering scheme based on general two-stage robust optimization insights, which allows us to train our machine learning tool on a database of resolved branch-and-bound trees and to apply it as is to problems of different sizes and/or types. We experimentally show that using our learned node selection strategy outperforms a vanilla, random node selection strategy when tested on problems of the same type as the training problems as well as in cases when the K-value or the problem size differs from the training ones. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Grants OCENW.GROOT.2019.015 and VI.Veni.191E.035]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0314 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0314 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .


  • Open Access

    Enhancing Decision Making Through the Integration of Large Language Models and Operations Research Optimization

    by Segev Wasserkrug, Leonard Boussioux, Dick Den Hertog, Farzaneh Mirzazadeh, Ş. İlKer Birbil, Jannis Kurtz, Donato Maragno

    Many critical business and societal decisions in areas such as supply chain and healthcare involve numerous potential actions, complex constraints, and goals that can be modeled as objective functions. Mathematical optimization, a core area in Operations Research (OR), provides robust, mathematically grounded methodologies to address such decisions and has shown tremendous benefits in many applications. However, its application requires the creation of accurate and efficient optimization models, necessitating rare expertise and considerable time, creating a barrier to widespread adoption in decision-making. Thus, it is a long-standing goal to make these capabilities widely accessible. The advent of Large Language Models (LLMs) has made advanced Artificial Intelligence (AI) capabilities widely accessible through natural language. LLMs can accelerate expert work in creating formal models like computer programs, and emerging research indicates they can also speed up the development of optimization models by OR experts. We, therefore, propose integrating and advancing LLM and optimization modeling to empower organizational decision-makers to model and solve such complex problems without requiring deep expertise in optimization. In this work, we present our vision for democratizing optimization modeling for organizational decision-making by such a combination of LLMs and optimization modeling. We identify a set of fundamental requirements for the vision's implementation and describe the state of the art through a literature survey and some experimentation. We show that a) LLMs already provide substantial novel capabilities relevant to realizing this vision, but that b) major research challenges remain to be addressed. We also propose possible research directions to overcome these gaps. We would like this work to serve as a call to action to bring together the LLM and OR optimization modeling communities to pursue this vision, thereby enabling much more widespread improved decision-making and increasing by orders of magnitude the benefits AI and OR can bring to enterprises and society.


  • Top Cited Papers

    Mixed-Integer Optimization with Constraint Learning

    by Donato Maragno, Holly Wiberg, Dimitris Bertsimas, Ş. İlKer Birbil, Dick Den Hertog, Adejuyigbe O. Fajemisin

    In today’s data-driven world, there is a growing opportunity for optimization models to more closely resemble real-world scenarios, namely through learning constraints or objective functions that are not explicitly known and must be estimated through data. In “Mixed-Integer Optimization with Constraint Learning,” the authors establish a novel methodological framework for data-driven decision making. Their approach enables constraints and objectives to be embedded directly from trained machine learning models that are mixed-integer optimization representable including linear models, decision trees, ensembles, and neural networks. The authors propose two different strategies to manage uncertainty in learned constraints. The first is based on the concept of trust region where the convex hull of data points is used to avoid extrapolation. Additionally, they present an ensemble learning method for enforcing constraints across multiple estimators, improving the robustness of the downstream prediction accuracy. Practitioners can access this framework through the “OptiCL” Python package. Case studies on World Food Programme humanitarian aid planning and chemotherapy regimen optimization demonstrate the methodology’s ability to produce scalable and data-informed prescriptions.


  • Open Access

    Scalable Bayesian Structure Learning for Gaussian Graphical Models Using Marginal Pseudo-Likelihood

    by Reza Mohammadi, Marit Schoonhoven, Lucas Vogels, Ş. İlker Birbil

    Bayesian methods for learning Gaussian graphical models offer a principled framework for quantifying model uncertainty and incorporating prior knowledge. However, their scalability is constrained by the computational cost of jointly exploring graph structures and precision matrices. To address this challenge, we perform inference directly on the graph by integrating out the precision matrix. We adopt a marginal pseudo-likelihood approach, eliminating the need to compute intractable normalizing constants and perform computationally intensive precision matrix sampling. Building on this framework, we develop continuous-time (birth–death) and discrete-time (reversible jump) Markov chain Monte Carlo (MCMC) algorithms that efficiently explore the posterior over graph space. We establish theoretical guarantees for posterior contraction, convergence, and graph selection consistency. The algorithms scale to large graph spaces, enabling parallel exploration for graphs with over 1,000 nodes, while providing uncertainty quantification and supporting flexible prior specification over the graph space. Extensive simulations show substantial computational gains over state-of-the-art Bayesian approaches without sacrificing graph recovery accuracy. Applications to human and mouse gene expression datasets demonstrate the ability of our approach to recover biologically meaningful structures and quantify uncertainty in complex networks. An implementation is available in the R package BDgraph.