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.

Rohit Pyati

dblp:408/2832 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 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
Transfer learning and domain adaptation · 87% Learning theory · 13%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
learning under distribution shift
0.912025
Adaptive Estimation and Learning under Temporal Distribution Shift · ICML 2025
Machine learning › Transfer learning and domain adaptation › domain shift
temporal distribution shift
0.912025
Adaptive Estimation and Learning under Temporal Distribution Shift · ICML 2025
Information theory › signal processing
denoising
0.912025
Adaptive Estimation and Learning under Temporal Distribution Shift · ICML 2025
Information theory › estimation theory
signal estimation
0.912025
Adaptive Estimation and Learning under Temporal Distribution Shift · ICML 2025
Machine learning › Learning theory
excess risk bounds
0.312025
Adaptive Estimation and Learning under Temporal Distribution Shift · ICML 2025

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

wavelet soft-thresholding · 1.7total variation denoising · 1.7
YearPublicationVenuePosition
2025 Adaptive Estimation and Learning under Temporal Distribution Shift
abstract
In this paper, we study the problem of estimation and learning under temporal distribution shift. Consider an observation sequence of length $n$, which is a noisy realization of a time-varying ground-truth sequence. Our focus is to develop methods to estimate the groundtruth at the final time-step while providing sharp point-wise estimation error rates. We show that, without prior knowledge on the level of temporal shift, a wavelet soft-thresholding estimator provides an optimal estimation error bound for the groundtruth. Our proposed estimation method generalizes existing researches (Mazetto and Upfal, 2023) by establishing a connection between the sequence’s non-stationarity level and the sparsity in the wavelet-transformed domain. Our theoretical findings are validated by numerical experiments. Additionally, we applied the estimator to derive sparsity-aware excess risk bounds for binary classification under distribution shift and to develop computationally efficient training objectives. As a final contribution, we draw parallels between our results and the classical signal processing problem of total-variation denoising (Mammen and van de Geer 1997; Tibshirani 2014 ), uncovering novel optimal algorithms for such task.
Dheeraj Baby, Yifei Tang, Hieu Duy Nguyen, Yu-Xiang Wang 0003, Rohit Pyati
ICML5