TSTanmoy Sen

Tanmoy Sen

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tanmoy Sen has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Hard Rules, Soft Preferences: Bridging Reasoning, Learning, and Optimization for Personalized Packing Checklist Generation

    by Himel Dev, Madhusudan Basak, Tanmoy Sen, Paromita Shome, Bashima Islam

    Packing for air travel is recurring and error-prone: the checklist must be personal and context-aware, yet feasible under safety rules, item dependencies, and luggage limits. Existing packing assistants are template-driven or recommendation-driven but unconstrained, leaving users to deal with regulatory and capacity violations. We propose a reasoning-guided learning framework with three stages: (1) a symbolic engine that generates a regulation-compliant seed checklist with explicit dependency structure, (2) a two-stage preference learner that estimates inclusion and priority utilities from user add and remove actions, mitigating survivorship bias, and (3) a CP-SAT optimizer that selects a compact, feasible subset. On 604 labeled trip scenarios (29K inclusion labels, 343K pairwise comparisons), the symbolic engine attains 99.7% recall and 0.96 rubric validity versus 0.78 to 0.81 for frontier LLMs; gradient boosted trees and LambdaMART reach AUC-ROC 0.943 and NDCG@5 0.923; and CP-SAT attains 100% constraint satisfaction versus 28% for greedy and 10% for random. Deployment of the first two stages in FlyEnJoy, a production iOS travel app, doubled checklist completions and reduced completion time. The proposed architecture provides a general framework for constrained personalization, applicable wherever hard feasibility coexists with subjective preferences.

  • Open Access

    Heterogeneous SLO Guaranteed Multi-Resource-Aware Batching in LLM Serving

    by Haiying Shen, Tanmoy Sen, Yuxiong He

    In this paper, we study a mixed-prompt scenario—where both short and long prompts coexist—in an LLM inference serving system that supports diverse applications with heterogeneous iteration-time SLOs. To improve throughput for long prompts, prior work divides them into chunks and batches requests or chunks to meet the token budget to fully utilize GPU compute resource. Our measurement analysis shows that it fails to meet heterogeneous iteration-time SLOs or fully utilize both GPU compute and memory resources. Also, delayed KV cache release from processing multiple long prompts may reduce throughput. To address the limitations, based on our findings, we propose a heterogeneous SLO guaranteed Multi-Resource-aware batching system (MuRa). MuRa orders queued requests by SLOs, enabling it to prioritize tight-SLO requests and batch those with similar SLOs to improve throughput. It selectively chooses queued requests to maximize both compute and memory utilizations, and processes all chunks from one prompt before moving to the next to enable earlier KV cache release. Trace-driven real experiments demonstrate that MuRa achieves 1.42-11.21 × higher throughput, 1.43-13.71 × higher goodput, 37-90% higher SLO attainment, and 1.61-12.22 × lower response latency compared to the state-of-the-art approaches. It achieves performance near Oracle, which optimally maximizes goodput.

  • A Study on the Impact of Memory DoS Attacks on Cloud Applications and Exploring Real-Time Detection Schemes

    by Zhuozhao Li, Tanmoy Sen, Haiying Shen, Mooi Choo Chuah

    Even though memory denial-of-service attacks can cause severe performance degradations on co-located virtual machines, a previous detection scheme against such attacks cannot accurately detect the attacks and also generates high detection delay and high performance overhead since it assumes that cache-related statistics of an application follow the same probability distribution at all times, which may not be true for all types of applications. In this paper, we present the experimental results showing the impacts of memory DoS attacks on different types of cloud-based applications. Based on these results, we propose two lightweight and responsive Statistical based Detection Schemes (SDS/B and SDS/P) that can detect such attacks accurately. SDS/B constructs a profile of normal range of cache-related statistics for all applications and use statistical methods to infer an attack when the real-time collected statistics exceed this normal range, while SDS/P exploits the increased periods of access patterns for periodic applications to infer an attack. Upon SDS, we further leverage deep neural network (DNN) techniques to design a DNN-based detection scheme that is general to various types of applications and more robust to adaptive attack scenarios. Our evaluation results show that SDS/B, SDS/P and DNN outperform the state-of-the-art detection scheme, e.g., with 65% higher specificity, 40% shorter detection delay, and 7% less performance overhead. We also discuss how to use SDS and DNN-based detection schemes under different situations.


  • A Context-aware Black-box Adversarial Attack for Deep Driving Maneuver Classification Models

    by Ankur Sarker, Haiying Shen, Tanmoy Sen

    In a connected autonomous vehicle (CAV) scenario, each vehicle utilizes an onboard deep neural network (DNN) model to understand its received time-series driving signals (e.g., speed, brake status) from its nearby vehicles, and then takes necessary actions to increase traffic safety and roadway efficiency. In the scenario, it is plausible that an attacker may launch an adversarial attack, in which the attacker adds unnoticeable perturbation to the actual driving signals to fool the DNN model inside a victim vehicle to output a misclassified class to cause traffic congestion and/or accidents. Such an attack must be generated in near real-time and the adversarial maneuver must be consistent with the current traffic context. However, previously proposed adversarial attacks fail to meet these requirements. To handle these challenges, in this paper, we propose a Context- aware Black-box Adversarial Attack (CBAA) for time-series DNN models in CAV scenarios. By analyzing real driving datasets, we observe that specific driving signals at certain time points have a higher impact on the DNN output. These influential spatio-temporal factors differ in different traffic contexts (a combination of different traffic factors (e.g., congestion, slope, and curvature)). Thus, CBAA first generates the perturbation only on the influential spatio-temporal signals for each context offline. In generating an attack online, CBAA uses the offline perturbation for the current context to start searching the minimum perturbation using the zeroth-order gradient descent method that will lead to the misclassification. Limiting the spatio-temporal searching scope with the constraint of context greatly expedites finding the final perturbation. Our extensive experimental studies using two different real driving datasets show that CBAA requires 43% fewer queries (to the DNN model to verify the attack success) and 53% less time than existing adversarial attacks.


  • A Suspicion-Free Black-box Adversarial Attack for Deep Driving Maneuver Classification Models

    by Ankur Sarker, Haiying Shen, Tanmoy Sen

    The current autonomous vehicles are equipped with onboard deep neural network (DNN) models to process the data from different sensor and communication units. In the connected autonomous vehicle (CAV) scenario, each vehicle receives time-series driving signals (e.g., speed, brake status) from nearby vehicles through the wireless communication technologies. In the CAV scenario, several black-box adversarial attacks have been proposed, in which an attacker deliberately sends false driving signals to its nearby vehicle to fool its onboard DNN model and cause unwanted traffic incidents. However, the previously proposed black-box adversarial attack can be easily detected. To handle this problem, in this paper, we propose a Suspicion-free Boundary Black-box Adversarial (SBBA) attack, where the attacker utilizes the DNN model's output to design the adversarial perturbation. First, we formulate the attack design problem as a goal satisfying optimization problem with constraints so that the proposed attack will not be easily detectable by detection methods. Second, we solve the proposed optimization problem using the Bayesian optimization method. In our Bayesian optimization framework, we use the Gaussian process to model the posterior distribution of the DNN model, and we use the knowledge gradient function to choose the next sample point. We devise a gradient estimation technique for the knowledge gradient method to reduce the solution searching time. Finally, we conduct extensive experimental evaluations using two real driving datasets. The experimental results show that SBBA outperforms the previous adversarial attacks by 56% higher success rate under detection methods, 238% less time to launch the attacks, and 76% less perturbation (to avoid being detected), and 257% fewer queries (to the DNN model to verify the attack success).