Diego Klabjan

Diego Klabjan

Auto-generated profile, based on publicly available information

Diego Klabjan

Northwestern University, Evanston, IL, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2018 in Transportation Science
Verified
Journal Article
Closed access
FSFrank Schneider
Frank Schneider
UTUlrich W. Thonemann
Ulrich W. Thonemann
DKDiego Klabjan
Diego Klabjan
An operator of a network of battery swap stations for electric vehicles must make a long-term investment decision on the number of batteries and charging bays in the system and periodic short-term decisions on when and how many batteries to recharge. Both decisions must be made concurrently, because there exists a trade-off between the long-term investment in batteries and charging bays, and short-term expenses for operating the system. Costs for electric energy as well as demand rates for batteries are stochastic: We consider an infinite time horizon for operation of the system. We derive an optimization problem, which cannot be solved optimally in a reasonable time for real world instances. By optimally solving various small problem instances, we show the mechanics of the model and the influence of its parameters on the optimal cost. We then develop a near-optimal solution heuristic based on Monte Carlo sampling following the ideas of approximate dynamic programming for the infinite horizon dynamic program. We show that operating battery swap stations in a network where lateral transshipments are allowed can substantially decrease expected operating costs. The online appendix is available at https://doi.org/10.1287/trsc.2017.0781

26 February 2013 in Production and Operations Management
Verified
Journal Article
Open access
PDF file
DKDiego Klabjan
Diego Klabjan
DSDavid Simchi‐Levi
David Simchi‐Levi
MSMiao Song
Miao Song
Traditional approaches in inventory control first estimate the demand distribution among a predefined family of distributions based on data fitting of historical demand observations, and then optimize the inventory control using the estimated distributions. These approaches often lead to fragile solutions whenever the preselected family of distributions was inadequate. In this article, we propose a minimax robust model that integrates data fitting and inventory optimization for the single‐item multi‐period periodic review stochastic lot‐sizing problem. In contrast with the standard assumption of given distributions, we assume that histograms are part of the input. The robust model generalizes the Bayesian model, and it can be interpreted as minimizing history‐dependent risk measures. We prove that the optimal inventory control policies of the robust model share the same structure as the traditional stochastic dynamic programming counterpart. In particular, we analyze the robust model based on the chi‐square goodness‐of‐fit test. If demand samples are obtained from a known distribution, the robust model converges to the stochastic model with true distribution under generous conditions. Its effectiveness is also validated by numerical experiments.

2 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
QGQiang Gao
Qiang Gao
ZLZhipeng Luo
Zhipeng Luo
DKDiego Klabjan
Diego Klabjan
FZFengli Zhang
Fengli Zhang
Continual learning with neural networks, which aims to learn a sequence of tasks, is an important learning framework in artificial intelligence (AI). However, it often confronts three challenges: 1) overcome the catastrophic forgetting problem; 2) adapt the current network to new tasks; and 3) control its model complexity. To reach these goals, we propose a novel approach named continual learning with efficient architecture search (CLEAS). CLEAS works closely with neural architecture search (NAS), which leverages reinforcement learning techniques to search for the best neural architecture that fits a new task. In particular, we design a neuron-level NAS controller that decides which old neurons from previous tasks should be reused (knowledge transfer) and which new neurons should be added (to learn new knowledge). Such a fine-grained controller allows finding a very concise architecture that can fit each new task well. Meanwhile, since we do not alter the weights of the reused neurons, we perfectly memorize the knowledge learned from the previous tasks. We evaluate CLEAS on numerous sequential classification tasks, and the results demonstrate that CLEAS outperforms other state-of-the-art alternative methods, achieving higher classification accuracy while using simpler neural architectures.

24 February 2006
Verified
Book Chapter
Closed access
PDF file
CBCynthia Barnhart
Cynthia Barnhart
Amy CohnAmy Cohn
Amy Cohn
EJEllis L. Johnson
Ellis L. Johnson
DKDiego Klabjan
Diego Klabjan
GNGeorge L. Nemhauser
George L. Nemhauser
PVPamela H. Vance
Pamela H. Vance

1 April 2019 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
YXYe Xue
Ye Xue
DKDiego Klabjan
Diego Klabjan
YLYuan Luo
Yuan Luo

6 March 2019 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
CKCheolmin Kim
Cheolmin Kim
DKDiego Klabjan
Diego Klabjan
We present an algorithm for L1-norm kernel PCA and provide a convergence analysis for it. While an optimal solution of L2-norm kernel PCA can be obtained through matrix decomposition, finding that of L1-norm kernel PCA is not trivial due to its non-convexity and non-smoothness. We provide a novel reformulation through which an equivalent, geometrically interpretable problem is obtained. Based on the geometric interpretation of the reformulated problem, we present a \enquote{fixed-point} type algorithm that iteratively computes a binary weight for each observation. As the algorithm requires only inner products of data vectors, it is computationally efficient and the kernel trick is applicable. In the convergence analysis, we show that the algorithm converges to a local optimal solution in a finite number of steps. Moreover, we provide a rate of convergence analysis, which has been never done for any L1-norm PCA algorithm, proving that the sequence of objective values converges at a linear rate. In numerical experiments, we show that the algorithm is robust in the presence of entry-wise perturbations and computationally scalable, especially in a large-scale setting. Lastly, we introduce an application to outlier detection where the model based on the proposed algorithm outperforms the benchmark algorithms.