Demo Data from EDBT 2026 / reviewers in the wild / expert
Ronit Katikaneni
dblp:426/0770
· DBLP profile ↗
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
Applied, interdisciplinary, general and emerging computing · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems › real-time AI systems › real-time inference
real-time classification |
0.9 | 1 | 2025 | Work-in-Progress: Optimizing IDK Cascades Skip Decisions Utilizing Random Forest Predictions · RTSS 2025 |
Methods — techniques the papers use, named apart from their topics
random forest · 1.7confidence thresholding · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Work-in-Progress: Optimizing IDK Cascades Skip Decisions Utilizing Random Forest PredictionsabstractIDK Cascades are a framework used to improve time usage within classification tasks. A cascade is comprised of a series of classification models with increasing levels of complexity. A prediction occurs when a single model's computed confidence is above a certain threshold; otherwise, an IDK classification is made, which leads to the next model in the series considering the input. A recent improvement to this scheme is the idea of skipping a model in the case where the prior model's confidence was extremely low. However, this method has inherent issues when predicting whether to skip. This paper improves on the method of skipping certain models by using a Random Forest model trained on multiple parameters, resulting in smart skipping. Unlike the previous threshold skipping approach, the Random Forest's is able to more accurately predict when a skip should occur, leading to larger time savings. Ultimately, we are able to obtain an IDK Cascade utilizing Random Forest skipping that is more computationally efficient than threshold skipping across three datasets. Ronit Katikaneni, Albert Mo Kim Cheng, Thomas Carroll |
RTSS | 1 |