DATA AND AI ARE CHANGING THE WAY ORGANIZATIONS THINK, DECIDE, AND ORGANIZE. IT’S TIME HUMANITIES, MANAGEMENT AND SOCIAL SCIENCES GET INVOLVED.
Metalab

NEWS

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

EVENTS

[ARTICLE] This paper introduces a mixed integer linear programming model for the Inventory Routing Problem with Pickups and Deliveries (IRP-PD), enhanced with new valid inequalities and a branch-and-cut algorithm, achieving significant improvements in solving large instances.

by Claudia Archetti (ESSEC Business School), M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle

This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at the pickup customers, with known amounts in each period of a discretized time horizon. The commodity is consumed by the delivery customers, whose demand, in each period of the time horizon, is known. The vehicles start and end their routes at the supplier depot. The objective is to determine a collection and distribution plan minimizing the sum of routing and inventory costs, satisfying inventory and capacity constraints. A mixed integer linear programming model is presented for the IRP-PD. Valid inequalities are proposed that are adapted from the inventory routing, the vehicle routing and the lot-sizing problems literature. Moreover, a new set of valid inequalities, called interval inequalities, is presented. A branch-and-cut algorithm is designed and tested on a large set of instances. Computational results show that the proposed approach is able to solve to optimality 946 out of 1280 instances. Moreover, the approach outperforms the state-of-the art method for the single vehicle case, increasing the number of instances solved to optimality from 473 to 538 out of 640 instances tested, with 133 new best known solutions.

[Please read the research paper here]

[ARTICLE] This paper presents a robust inference method for structural vector autoregressions with near unit roots by combining the Anderson-Rubin test with IVX instrumentation, improving confidence bands on impulse responses.

by Guillaume Chevillon (ESSEC Business School), Sophocles Mavroeidis, Zhaoguo Zhan

Long-run restrictions are a very popular method for identifying structural vector autoregressions, but they suffer from weak identification when the data is very persistent, i.e., when the highest autoregressive roots are near unity. Near unit roots introduce additional nuisance parameters and make standard weak-instrument robust methods of inference inapplicable. We develop a method of inference that is robust to both weak identification and strong persistence. The method is based on a combination of the Anderson-Rubin test with instruments derived by filtering potentially non-stationary variables to make them near stationary using the IVX instrumentation method of Magdalinos and Phillips (2009). We apply our method to obtain robust confidence bands on impulse responses in two leading applications in the literature.

[Please read the research paper here]

[ARTICLE] This paper evaluates how well bibliometric data and theories predict author impact and breakthroughs in research, finding limited explanatory power and suggesting improvements through machine learning.

by Sen Chai (ESSEC Business School), Alexander D’Amour, Lee Fleming

Following widespread availability of computerized databases, much research has correlated bibliometric measures from papers or patents to subsequent success, typically measured as the number of publications or citations. Building on this large body of work, we ask the following questions: given available bibliometric information in one year, along with the combined theories on sources of creative breakthroughs from the literatures on creativity and innovation, how accurately can we explain the impact of authors in a given research community in the following year? In particular, who is most likely to publish, publish highly cited work, and even publish a highly cited outlier? And, how accurately can these existing theories predict breakthroughs using only contemporaneous data? After reviewing and synthesizing (often competing) theories from the literatures, we simultaneously model the collective hypotheses based on available data in the year before RNA interference was discovered. We operationalize author impact using publication count, forward citations, and the more stringent definition of being in the top decile of the citation distribution. Explanatory power of current theories altogether ranges from less than 9% for being top cited to 24% for productivity. Machine learning (ML) methods yield similar findings as the explanatory linear models, and tangible improvement only for non-linear Support Vector Machine models. We also perform predictions using only existing data until 1997, and find lower predictability than using explanatory models. We conclude with an agenda for future progress in the bibliometric study of creativity and look forward to ML research that can explain its models.

[Please read the research paper here]

[ARTICLE] This paper proposes two integer programming formulations for the directed network design problem with relays (DNDPR) and demonstrates that branch-and-cut algorithms significantly outperform previous methods.

by Ivana Ljubić (ESSEC Business School), Markus Leitner, Martin Riedler, Mario Ruthmair

We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum cost network that enables the communication of a given set of origin-destination pairs. Thereby, expensive signal regeneration devices need to be placed to cover communication distances exceeding a predefined threshold. Applications of the DNDPR arise in telecommunications and transportation. We propose two new integer programming formulations for the DNDPR. The first one is a flow-based formulation with a pseudo-polynomial number of variables and constraints and the second is a cut-based formulation with an exponential number of constraints. Fractional distance values are handled efficiently by augmenting both models with an exponentially-sized set of infeasible path constraints. We develop branch-and-cut algorithms and also consider valid inequalities to strengthen the obtained dual bounds and to speed up convergence. The results of our extensive computational study on diverse sets of benchmark instances show that our algorithms outperform the previous state-of-the-art method based on column generation.

[Please read the research paper here]

[ARTICLE] This study develops a framework showing how digitalization of unorganized retail in emerging markets transforms socio-economic conditions for subsistence consumer-merchants.

by Malobi Mukherjee (ESSEC Business School), Jacob Wood

This study explores whether digitalisation of unorganised retail (UR) businesses in emerging markets have a positive socio-economic impact on the lives of the subsistence consumer–merchants who perform the dual role of being, not only consumers providing for themselves and their families, but also the managers of micro-UR businesses. We develop a framework for sustainable business model innovation at the base of the pyramid by undertaking content analysis of 65 newspaper articles (interviews with senior executives and founders of digital app-based platforms, expert analysis) as well as social media and YouTube testimonials of UR business users of these platforms in Vietnam, Indonesia, Malaysia and the Philippines. Using the Gioian coding structure of open and second order comparative coding, we develop a framework for sustainable business model innovation from the base of the pyramid perspective. The framework captures how digitalisation enables the UR businesses to circumvent resource shortages, consolidate procurement and inventory management and diversify product and service offerings, which leads to significant economic and social transformation for both the micro enterprises and their owners. Our framework contributes to the emergent literature on sustainable business model innovation and inclusive innovation in resource-constrained contexts. We conclude that sustainable business model innovations enable socio-economic transformations similar to those experienced by UR businesses in emerging Asian markets. Such developments can create local level pathways for local tropical countries seeking to achieve UN social development goals.

[Please read the research paper here]

[ARTICLE] This paper presents the (α,Γ)-descent algorithm for Bayesian α-divergence minimization, demonstrating improved optimization for mixture models in high dimensions.

by Kamélia Daudel (ESSEC Business School), Randal Douc, François Portier

This paper introduces the (α,Γ) -descent, an iterative algorithm which operates on measures and performs α-divergence minimisation in a Bayesian framework. This gradient-based procedure extends the commonly-used variational approximation by adding a prior on the variational parameters in the form of a measure. We prove that for a rich family of functions Γ, this algorithm leads at each step to a systematic decrease in the α-divergence and derive convergence results. Our framework recovers the Entropic Mirror Descent algorithm and provides an alternative algorithm that we call the Power Descent. Moreover, in its stochastic formulation, the (α,Γ)-descent allows to optimise the mixture weights of any given mixture model without any information on the underlying distribution of the variational parameters. This renders our method compatible with many choices of parameters updates and applicable to a wide range of Machine Learning tasks. We demonstrate empirically on both toy and real-world examples the benefit of using the Power Descent and going beyond the Entropic Mirror Descent framework, which fails as the dimension grows.

[Please read the research paper here]

[ARTICLE] This paper establishes risk bounds for Regularized Empirical Risk Minimizers (RERM) under both subgaussian and heavy-tailed assumptions, introducing an alternative minmax MOM procedure for robust estimation in the presence of outliers.

by Guillaume Lecué (ESSEC Business School), Geoffrey Chinot, Matthieu Lerasle

We establish risk bounds for Regularized Empirical Risk Minimizers (RERM) when the loss is Lipschitz and convex and the regularization function is a norm. In a first part, we obtain these results in the i.i.d. setup under subgaussian assumptions on the design. In a second part, a more general framework where the design might have heavier tails and data may be corrupted by outliers both in the design and the response variables is considered. In this situation, RERM performs poorly in general. We analyse an alternative procedure based on median-of-means principles and called “minmax MOM”. We show optimal subgaussian deviation rates for these estimators in the relaxed setting. The main results are meta-theorems allowing a wide-range of applications to various problems in learning theory. To show a non-exhaustive sample of these potential applications, it is applied to classification problems with logistic loss functions regularized by LASSO and SLOPE, to regression problems with Huber loss regularized by Group LASSO and Total Variation. Another advantage of the minmax MOM formulation is that it suggests a systematic way to slightly modify descent based algorithms used in high-dimensional statistics to make them robust to outliers. We illustrate this principle in a Simulations section where a “ minmax MOM” version of classical proximal descent algorithms are turned into robust to outliers algorithms.

[Please read the research paper here]

[ARTICLE] This paper leverages advanced techniques from empirical process theory and Statistical Learning Theory to provide precise statistical analysis and guarantees for Semi-Definite Programming (SDP) estimators across various machine learning problems.

by Guillaume Lecué (ESSEC Business School), Stéphane Chrétien, Mihai Cucuringu, Lucie Neirac

Many statistical learning problems have recently been shown to be amenable to Semi-Definite Programming (SDP), with community detection and clustering in Gaussian mixture models as the most striking instances Javanmard et al. (2016). Given the growing range of applications of SDP-based techniques to machine learning problems, and the rapid progress in the design of efficient algorithms for solving SDPs, an intriguing question is to understand how the recent advances from empirical process theory and Statistical Learning Theory can be leveraged for providing a precise statistical analysis of SDP estimators. In the present paper, we borrow cutting edge techniques and concepts from the Learning Theory literature, such as fixed point equations and excess risk curvature arguments, which yield general estimation and prediction results for a wide class of SDP estimators. From this perspective, we revisit some classical results in community detection from Guédon and Vershynin (2016) and Fei and Chen (2019), and we obtain statistical guarantees for SDP estimators used in signed clustering, angular group synchronization (for both multiplicative and additive models) and MAX-CUT. Our theoretical findings are complemented by numerical experiments for each of the three problems considered, showcasing the competitiveness of the SDP estimators.

[Please read the research paper here]

[ARTICLE] This paper constructs a robust alternative to cross-validation for hyperparameter tuning and model selection using a median-of-means principle.

by Guillaume Lecué (ESSEC Business School), Joon Kwon, Matthieu Lerasle

Hyperparameter tuning and model selection are important steps in machine learning. Unfortunately, classical hyperparameter calibration and model selection procedures are sensitive to outliers and heavy-tailed data. In this work, we construct a selection procedure which can be seen as a robust alternative to cross-validation and is based on a median-of-means principle. Using this procedure, we also build an ensemble method which, trained with algorithms and corrupted heavy-tailed data, selects an algorithm, trains it with a large uncorrupted subsample and automatically tunes its hyperparameters. In particular, the approach can transform any procedure into a robust to outliers and to heavy-tailed data procedure while tuning automatically its hyperparameters.

[Please read the research paper here]

[ARTICLE] This paper proposes a new parameter constraint for non-Gaussian mixture models using a small dictionary of elements.

by Pierre Alquier (ESSEC Business School), Léna Carel

Mixture models are among the most popular tools for clustering. However, when the dimension and the number of clusters is large, the estimation of the clusters become challenging, as well as their interpretation. Restriction on the parameters can be used to reduce the dimension. An example is given by mixture of factor analyzers for Gaussian mixtures. The extension of MFA to non-Gaussian mixtures is not straightforward. We propose a new constraint for parameters in non-Gaussian mixture model: the K components parameters are combinations of elements from a small dictionary, say H elements, with H≪K. Including a nonnegative matrix factorization (NMF) in the EM algorithm allows us to simultaneously estimate the dictionary and the parameters of the mixture. We propose the acronym NMF-EM for this algorithm, implemented in the R package nmfem. This original approach is motivated by passengers clustering from ticketing data: we apply NMF-EM to data from two Transdev public transport networks. In this case, the words are easily interpreted as typical slots in a timetable.

[Please read the research paper here]

Founded in 2020 by ESSEC Business School, The Institute for AI and Business for Artificial Intelligence, Data and Society helps organizations navigate and better understand the social, economic, cultural, and ethical impacts of AI and data

metalab@essec.edu

Learn more about the Institute for AI and Business

copyright © 2026 Institute for AI and Business

↓
Résumé de la politique de confidentialité

Ce site utilise des cookies afin que nous puissions vous fournir la meilleure expérience utilisateur possible. Les informations sur les cookies sont stockées dans votre navigateur et remplissent des fonctions telles que vous reconnaître lorsque vous revenez sur notre site Web et aider notre équipe à comprendre les sections du site que vous trouvez les plus intéressantes et utiles.