Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rohit Kanrar

dblp:429/5722 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 67% Time series and sequential data · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Time series and sequential data
change-point detection
0.912025
Model-free Change-Point Detection Using AUC of a Classifier · J. Mach. Learn. Res. 2025
Machine learning › Learning theory
classification
0.912025
Model-free Change-Point Detection Using AUC of a Classifier · J. Mach. Learn. Res. 2025
Machine learning › Learning theory
statistical learning theory
0.912025
Model-free Change-Point Detection Using AUC of a Classifier · J. Mach. Learn. Res. 2025

Methods — techniques the papers use, named apart from their topics

data splitting · 0.9classifier-based testing · 0.9AUC · 0.9
YearPublicationVenuePosition
2025 Model-free Change-Point Detection Using AUC of a Classifier
abstract
In contemporary data analysis, it is increasingly common to work with non-stationary complex data sets. These data sets typically extend beyond the classical low-dimensional Euclidean space, making it challenging to detect shifts in their distribution without relying on strong structural assumptions. This paper proposes a novel offline change-point detection method that leverages classifiers developed in the statistics and machine learning community. With suitable data splitting, the test statistic is constructed through sequential computation of the Area Under the Curve (AUC) of a classifier, which is trained on data segments on both ends of the sequence. It is shown that the resulting AUC process attains its maxima at the true change-point location, which facilitates the change-point estimation. The proposed method is characterized by its complete nonparametric nature, high versatility, considerable flexibility, and absence of stringent assumptions on the underlying data or any distributional shifts. Theoretically, we derive the limiting pivotal distribution of the proposed test statistic under null, as well as the asymptotic behaviors under both local and fixed alternatives. The localization rate of the change-point estimator is also provided. Extensive simulation studies and the analysis of two real-world data sets illustrate the superior performance of our approach compared to existing model-free change-point detection methods.
Rohit Kanrar, Feiyu Jiang, Zhanrui Cai
J. Mach. Learn. Res.1