Dhish Kumar Saxena

Dr. Dhish Kumar Saxena

Department of Mechanical and Industrial Engineering, Indian Institute of Technology, Roorkee, India

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 December 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SMSukrit Mittal
Sukrit Mittal
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
Erik GoodmanErik Goodman
Erik Goodman
Innovization is a task of learning common relationships among some or all of the Pareto-optimal (PO) solutions in multi-and many-objective optimization problems. A recent study has shown that a chronological sequence of non-dominated solutions obtained along the successive generations of an optimizer possesses salient patterns that can be learnt using a Machine Learning (ML) model, and can help the offspring solutions progress in useful directions. This paper enhances each constitutive module of the above approach, including novel interventions on management of the convergence-diversity tradeoff while mapping the solutions from the previous and current generation; use of a computationally more efficient ML method, namely Random Forest; and changing the manner and extent to which the learnt ML model is utilized towards advancement of the offspring. The proposed modules constitute what is called the enhanced innovized progress (IP2) operator. To investigate the search efficacy provided by the IP2 operator, it is integrated with multi-and many-objective optimization algorithms, such as NSGA-II, NSGA-III, MOEA/D, and MaOEA-IGD, and tested on a range of two-to ten-objective test problems, and five real-world problems. Since the IP2 operator utilizes the history of gradual and progressive improvements in solutions over generations, without requiring any additional solution evaluations, it opens up a new direction for ML-assisted evolutionary optimization.

6 June 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
AAAmit Agarwal
Amit Agarwal
DSDeorishabh Sahu
Deorishabh Sahu
RMRishabh Mohata
Rishabh Mohata
KJKuldeep Jeengar
Kuldeep Jeengar
ANAnuj Nautiyal
Anuj Nautiyal
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena

1 May 2009
Verified
Conference Paper
Closed access
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
TRTapabrata Ray
Tapabrata Ray
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
Ashutosh TiwariAshutosh Tiwari
Ashutosh Tiwari
Many objective optimization is a natural extension to multi-objective optimization where the number of objectives are significantly more than five. The performance of current state of the art algorithms (e.g. NSGA-II, SPEA2) is known to deteriorate significantly with increasing number of objectives due to the lack of adequate convergence pressure. It is of no surprise that the performance of NSGA-II on some constrained many-objective optimization problems (Deb and Saxena, 2006) (e.g., DTLZ5-(5,M), M = 10, 20) in an earlier study (Saxena, 2008) was far from satisfactory. Till date, research in many-objective optimization has focussed on two major areas (a) dimensionality reduction in the objective space and (b) preference ordering based approaches. This paper introduces a novel evolutionary algorithm powered by epsilon dominance (implemented within the framework of NSGA-II) and controlled infeasibility for improved convergence while the critical set of objectives is identified through a nonlinear dimensionality reduction scheme. Since approaching the Pareto-optimal front from within the feasible search space will need to overcome the problems associated with low selection pressure, the mechanism to approach the front from within the infeasible search space is promising as illustrated in this paper. The performance of the proposed algorithm is compared with NSGA-II (original, with crowding distance measure) and NSGA-II (epsilon dominance) on the above set of constrained multiobjective problems to highlight the benefits.

9 September 2020 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
SKSarang Kapoor
Sarang Kapoor
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
MLMatthijs van Leeuwen
Matthijs van Leeuwen
Many real-world phenomena can be represented as dynamic graphs, i.e., networks that change over time. The problem of dynamic graph summarization, i.e., to succinctly describe the evolution of a dynamic graph, has been widely studied. Existing methods typically use objective measures to find fixed structures such as cliques, stars, and cores. Most of the methods, however, do not consider the problem of online summarization, where the summary is incrementally conveyed to the analyst as the graph evolves, and (thus) do not take into account the knowledge of the analyst at a specific moment in time. We address this gap in the literature through a novel, generic framework for subjective interestingness for sequential data. Specifically, we iteratively identify atomic changes, called ‘actions’, that provide most information relative to the current knowledge of the analyst. For this, we introduce a novel information gain measure, which is motivated by the minimum description length (MDL) principle. With this measure, our approach discovers compact summaries without having to decide on the number of patterns. As such, we are the first to combine approaches for data mining based on subjective interestingness (using the maximum entropy principle) with pattern-based summarization (using the MDL principle). We instantiate this framework for dynamic graphs and dense subgraph patterns, and present DSSG, a heuristic algorithm for the online summarization of dynamic graphs by means of informative actions, each of which represents an interpretable change to the connectivity structure of the graph. The experiments on real-world data demonstrate that our approach effectively discovers informative summaries. We conclude with a case study on data from an airline network to show its potential for real-world applications.

4 July 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
SMSukrit Mittal
Sukrit Mittal
SKSarang Kapoor
Sarang Kapoor
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
The practicality of Pareto-dominance in solving many-objective optimization problems becomes questionable due to its inability to factor the critical Human Decision-making (HDM) elements, including, the number of better objectives, the degree of betterment in objectives, and objectives’ relative preference. Relevant dominance principles are recently proposed to incorporate the first two HDM elements, often with the need for new tunable parameters. This paper proposes a high-fidelity-dominance principle, that factors all the three HDM elements, explicitly and simultaneously, and without requiring tuning of any parameter. This principle has been implemented in a reference vector based framework, leading to a computationally efficient many-objective Evolutionary Algorithm (MaOEA), namely localized high-fidelity-dominance based EA (LHFiD). Critically, LHFiD also has an inbuilt mechanism for on-the-fly determination of the timing for: (a) intermittent nadir point estimation that enables faster convergence, and (b) its self-termination that bears practically utility. This paper is based on an extensive study involving 41,912 experiments, in which the proposed LHFiD approach is compared with existing competitive MaOEAs. The paper reports statistically better performance in about 60% instances, making it practical and worthy of further investigation and application.

Verified
Journal Article
Open access
PDF file
CCCarlos Coello
Carlos Coello
Erik GoodmanErik Goodman
Erik Goodman
Kaisa MiettinenKaisa Miettinen
Kaisa Miettinen
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
Oliver SchuetzeOliver Schuetze
Oliver Schuetze
Lothar ThieleLothar Thiele
Lothar Thiele
Kalyanmoy Deb was born in Udaipur, Tripura, the smallest state of India at the time, in 1963