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

Ashraf Tahmasbi

dblp:231/7680 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Data stream processing · 67% Machine learning and data management · 33%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
adaptive learning
0.512021
DriftSurf: Stable-State / Reactive-State Learning under Concept Drift · ICML 2021
Data stream processing › evolving data
concept drift
0.512021
DriftSurf: Stable-State / Reactive-State Learning under Concept Drift · ICML 2021
Data stream processing › evolving data › concept drift
drift detection
0.512021
DriftSurf: Stable-State / Reactive-State Learning under Concept Drift · ICML 2021
Machine learning › Optimization for machine learning
stochastic optimization
0.312018
Variance-Reduced Stochastic Gradient Descent on Streaming Data · NeurIPS 2018
Machine learning › Optimization for machine learning › online optimization
streaming optimization
0.312018
Variance-Reduced Stochastic Gradient Descent on Streaming Data · NeurIPS 2018

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

supervised learning · 0.5stable-state/reactive-state process · 0.5variance reduction · 0.3competitive analysis · 0.3
YearPublicationVenuePosition
2022 Maximum Range-Sum for Dynamically Occurring Objects with Decaying Weights
Ashraf Tahmasbi, Goce Trajcevski
ADBIS1
2021 DriftSurf: Stable-State / Reactive-State Learning under Concept Drift
abstract
When learning from streaming data, a change in the data distribution, also known as concept drift, can render a previously-learned model inaccurate and require training a new model. We present an adaptive learning algorithm that extends previous drift-detection-based methods by incorporating drift detection into a broader stable-state/reactive-state process. The advantage of our approach is that we can use aggressive drift detection in the stable state to achieve a high detection rate, but mitigate the false positive rate of standalone drift detection via a reactive state that reacts quickly to true drifts while eliminating most false positives. The algorithm is generic in its base learner and can be applied across a variety of supervised learning problems. Our theoretical analysis shows that the risk of the algorithm is (i) statistically better than standalone drift detection and (ii) competitive to an algorithm with oracle knowledge of when (abrupt) drifts occur. Experiments on synthetic and real datasets with concept drifts confirm our theoretical analysis.
Ashraf Tahmasbi, Ellango Jothimurugesan, Srikanta Tirthapura, Phillip B. Gibbons
ICML1
2018 Variance-Reduced Stochastic Gradient Descent on Streaming Data
abstract
We present an algorithm STRSAGA for efficiently maintaining a machine learning model over data points that arrive over time, quickly updating the model as new training data is observed. We present a competitive analysis comparing the sub-optimality of the model maintained by STRSAGA with that of an offline algorithm that is given the entire data beforehand, and analyze the risk-competitiveness of STRSAGA under different arrival patterns. Our theoretical and experimental results show that the risk of STRSAGA is comparable to that of offline algorithms on a variety of input arrival patterns, and its experimental performance is significantly better than prior algorithms suited for streaming data, such as SGD and SSVRG.
Ellango Jothimurugesan, Ashraf Tahmasbi, Phillip B. Gibbons, Srikanta Tirthapura
NeurIPS2