activity
20192026
most citedKernel k-Means, By All Means: Algorithms and Strong Consistency

9 citations · 15 across the 12 of their papers we have counts for

collaborators

15 papers

stat.ML2026

Robust Detection of LLM-Generated Text under Contamination

Jiaxun Li, Saptarshi Chakraborty, Ambuj Tewari

We study the detection of LLM-generated text under editing and contamination. Modeling human and machine text as finite-order Markov processes with Huber contamination, we characte…

stat.ML2025

Convex Clustering Redefined: Robust Learning with the Median of Means Estimator

Sourav De, Koustav Chowdhury, Bibhabasu Mandal +4

Clustering approaches that utilize convex loss functions have recently attracted growing interest in the formation of compact data clusters. Although classical methods like k-means…

stat.ML2025

A New Framework for Convex Clustering in Kernel Spaces: Finite Sample Bounds, Consistency and Performance Insights

Shubhayan Pan, Kushal Bose, Debolina Paul +2

Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's -means, without requiring a predefined cluster count. It starts…

stat.ME2022

Topical Hidden Genome: Discovering Latent Cancer Mutational Topics using a Bayesian Multilevel Context-learning Approach

Saptarshi Chakraborty, Zoe Guan, Colin B. Begg +1

Statistical inference on the cancer-site specificities of collective ultra-rare whole genome somatic mutations is an open problem. Traditional statistical methods cannot handle who…

stat.ML2022

Bregman Power k-Means for Clustering Exponential Family Data

Adithya Vellal, Saptarshi Chakraborty, Jason Xu

Recent progress in center-based clustering algorithms combats poor local minima by implicit annealing, using a family of generalized means. These methods are variations of Lloyd's…

stat.ML2022

Robust Linear Predictions: Analyses of Uniform Concentration, Fast Rates and Model Misspecification

Saptarshi Chakraborty, Debolina Paul, Swagatam Das

The problem of linear predictions has been extensively studied for the past century under pretty generalized frameworks. Recent advances in the robust statistics literature allow u…

stat.ML2021★ 2 cited

Uniform Concentration Bounds toward a Unified Framework for Robust Clustering

Debolina Paul, Saptarshi Chakraborty, Swagatam Das +1

Recent advances in center-based clustering continue to improve upon the drawbacks of Lloyd's celebrated -means algorithm over years after its introduction. Various methods…

cs.IT2021

t-Entropy: A New Measure of Uncertainty with Some Applications

Saptarshi Chakraborty, Debolina Paul, Swagatam Das

The concept of Entropy plays a key role in Information Theory, Statistics, and Machine Learning.This paper introduces a new entropy measure, called the t-entropy, which exploits th…

stat.ML2021

Robust Principal Component Analysis: A Median of Means Approach

Debolina Paul, Saptarshi Chakraborty, Swagatam Das

Principal Component Analysis (PCA) is a fundamental tool for data visualization, denoising, and dimensionality reduction. It is widely popular in Statistics, Machine Learning, Comp…

cs.LG2020

Automated Clustering of High-dimensional Data with a Feature Weighted Mean Shift Algorithm

Saptarshi Chakraborty, Debolina Paul, Swagatam Das

Mean shift is a simple interactive procedure that gradually shifts data points towards the mode which denotes the highest density of data points in the region. Mean shift algorithm…

stat.ML2020★ 9 cited

Kernel k-Means, By All Means: Algorithms and Strong Consistency

Debolina Paul, Saptarshi Chakraborty, Swagatam Das +1

Kernel -means clustering is a powerful tool for unsupervised learning of non-linearly separable data. Since the earliest attempts, researchers have noted that such algorithms of…

stat.ME2020

Principal Ellipsoid Analysis (PEA): Efficient non-linear dimension reduction & clustering

Debolina Paul, Saptarshi Chakraborty, Didong Li +1

Even with the rise in popularity of over-parameterized models, simple dimensionality reduction and clustering methods, such as PCA and k-means, are still routinely used in an amazi…

stat.ME2020

Biconvex Clustering

Saptarshi Chakraborty, Jason Xu

Convex clustering has recently garnered increasing interest due to its attractive theoretical and computational properties, but its merits become limited in the face of high-dimens…

stat.ML2020★ 2 cited

Entropy Regularized Power k-Means Clustering

Saptarshi Chakraborty, Debolina Paul, Swagatam Das +1

Despite its well-known shortcomings, -means remains one of the most widely used approaches to data clustering. Current research continues to tackle its flaws while attempting to…

stat.ML2019★ 2 cited

A Strongly Consistent Sparse -means Clustering with Direct Penalization on Variable Weights

Saptarshi Chakraborty, Swagatam Das

We propose the Lasso Weighted -means (--means) algorithm as a simple yet efficient sparse clustering procedure for high-dimensional data where the number of features (…