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.

Ellen L. Zippi

dblp:241/3432 · 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 · 61% Efficient and distributed learning · 30% Representation and self-supervised learning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.912025
Efficient Source-Free Time-Series Adaptation via Parameter Subspace Disentanglement · ICLR 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation
source-free domain adaptation
0.912025
Efficient Source-Free Time-Series Adaptation via Parameter Subspace Disentanglement · ICLR 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
time series domain adaptation
0.912025
Efficient Source-Free Time-Series Adaptation via Parameter Subspace Disentanglement · ICLR 2025

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

tucker decomposition · 0.9PAC-Bayesian analysis · 0.9
YearPublicationVenuePosition
2025 Efficient Source-Free Time-Series Adaptation via Parameter Subspace Disentanglement
abstract
In this paper, we propose a framework for efficient Source-Free Domain Adaptation (SFDA) in the context of time-series, focusing on enhancing both parameter efficiency and data-sample utilization. Our approach introduces an improved paradigm for source-model preparation and target-side adaptation, aiming to enhance training efficiency during target adaptation. Specifically, we reparameterize the source model's weights in a Tucker-style decomposed manner, factorizing the model into a compact form during the source model preparation phase. During target-side adaptation, only a subset of these decomposed factors is fine-tuned, leading to significant improvements in training efficiency. We demonstrate using PAC Bayesian analysis that this selective fine-tuning strategy implicitly regularizes the adaptation process by constraining the model's learning capacity. Furthermore, this re-parameterization reduces the overall model size and enhances inference efficiency, making the approach particularly well suited for resource-constrained devices. Additionally, we demonstrate that our framework is compatible with various SFDA methods and achieves significant computational efficiency, reducing the number of fine-tuned parameters and inference overhead in terms of MACs by over 90\% while maintaining model performance.
Gaurav Patel, Christopher M. Sandino, Behrooz Mahasseni, Ellen L. Zippi, Erdrin Azemi, Ali Moin, Juri Minxha
ICLR4