Tanmay Sen

Rathin Das, Tanmay Sen, Deepak Prajapati

This paper studies the optimal design of Type-I generalized progressive hybrid censoring schemes for life-testing experiments. The design problem involves simultaneously determining the inspection time, the guaranteed number of failures, and the progressive censoring scheme. First we develop a cost-constrained optimization framework for determining the optimal censoring scheme. Structural properties of the A-optimality criterion and the experimental cost with respect to the inspection time and the guaranteed number of failures are established. It reveals that they are conflicting behaviors which enables to develop an efficient search algorithm that substantially reduces the computational burden. Building on these theoretical results, a multi-objective optimization model is proposed to simultaneously minimize A-optimality criterion and the experimental cost. A Variable Neighborhood Search (VNS) algorithm is proposed to efficiently determine the optimal progressive removal vector by exploring the feasible design space while avoiding exhaustive enumeration. The resulting compromise designs simultaneously improve estimation precision and reduce experimental cost. In addition, the Shannon differential entropy of the observed lifetime distribution is derived and employed as a complementary information-theoretic measure for evaluating the selected censoring schemes. Numerical studies show that entropy-optimal designs generally differ from A-optimal designs, indicating that Shannon entropy characterizes uncertainty in the observed data rather than estimation precision. The proposed methodology provides an efficient computational framework for optimal life-test design and offers a foundation for future multi-objective optimization incorporating statistical efficiency, experimental cost, and information-theoretic uncertainty.

Raju Chowdhury, Tanmay Sen, Prajamitra Bhuyan et al.

Constrained optimization in high-dimensional black-box settings is difficult due to expensive evaluations, the lack of gradient information, and complex feasibility regions. In this work, we propose a Bayesian optimization method that combines a penalty formulation, a surrogate model, and a trust region strategy. The constrained problem is converted to an unconstrained form by penalizing constraint violations, which provides a unified modeling framework. A trust region restricts the search to a local region around the current best solution, which improves stability and efficiency in high dimensions. Within this region, we use the Expected Improvement acquisition function to select evaluation points by balancing improvement and uncertainty. The proposed Trust Region method integrates penalty-based constraint handling with local surrogate modeling. This combination enables efficient exploration of feasible regions while maintaining sample efficiency. We compare the proposed method with state-of-the-art methods on synthetic and real-world high-dimensional constrained optimization problems. The results show that the method identifies high-quality feasible solutions with fewer evaluations and maintains stable performance across different settings.

Abhishek Sarkar, Tanmay Sen, Srimanta Kundu et al.

Modern telecom systems are monitored with performance and system logs from multiple application layers and components. Detecting anomalous events from these logs is key to identify security breaches, resource over-utilization, critical/fatal errors, etc. Current supervised log anomaly detection frameworks tend to perform poorly on new types or signatures of anomalies with few or unseen samples in the training data. In this work, we propose a meta-learning-based log anomaly detection framework (LogAnMeta) for detecting anomalies from sequence of log events with few samples. LoganMeta train a hybrid few-shot classifier in an episodic manner. The experimental results demonstrate the efficacy of our proposed method

Piyush Kanti Bhunre, Tanmay Sen, Arijit Sarkar

Customer retention or churn prevention is a challenging task of a telecom operator. One of the effective approaches is to offer some attractive incentive or additional services or money to the subscribers for keeping them engaged and make sure they stay in the operator's network for longer time. Often, operators allocate certain amount of monetary budget to carry out the offer campaign. The difficult part of this campaign is the selection of a set of customers from a large subscriber-base and deciding the amount that should be offered to an individual so that operator's objective is achieved. There may be multiple objectives (e.g., maximizing revenue, minimizing number of churns) for selection of subscriber and selection of an offer to the selected subscriber. Apart from monetary benefit, offers may include additional data, SMS, hots-spot tethering, and many more. This problem is known as offer optimization. In this paper, we propose a novel combinatorial algorithm for solving offer optimization under heterogeneous offers by maximizing expected revenue under the scenario of subscriber churn, which is, in general, seen in telecom domain. The proposed algorithm is efficient and accurate even for a very large subscriber-base.