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

Natalia Shepeleva

dblp:184/6364 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1

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 · 50% Transfer learning and domain adaptation · 25% Optimization for machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
generalization bounds
0.512021
The balancing principle for parameter choice in distance-regularized domain adaptation · NeurIPS 2021
Machine learning › Optimization for machine learning › hyperparameter optimization
regularization parameter selection
0.512021
The balancing principle for parameter choice in distance-regularized domain adaptation · NeurIPS 2021
Machine learning › Learning theory › generalization error
target error bound
0.512021
The balancing principle for parameter choice in distance-regularized domain adaptation · NeurIPS 2021
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.512021
The balancing principle for parameter choice in distance-regularized domain adaptation · NeurIPS 2021

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

regularization · 0.5inverse problem · 0.5balancing principle · 0.5
YearPublicationVenuePosition
2021 The balancing principle for parameter choice in distance-regularized domain adaptation
abstract
We address the unsolved algorithm design problem of choosing a justified regularization parameter in unsupervised domain adaptation. This problem is intriguing as no labels are available in the target domain. Our approach starts with the observation that the widely-used method of minimizing the source error, penalized by a distance measure between source and target feature representations, shares characteristics with regularized ill-posed inverse problems. Regularization parameters in inverse problems are optimally chosen by the fundamental principle of balancing approximation and sampling errors. We use this principle to balance learning errors and domain distance in a target error bound. As a result, we obtain a theoretically justified rule for the choice of the regularization parameter. In contrast to the state of the art, our approach allows source and target distributions with disjoint supports. An empirical comparative study on benchmark datasets underpins the performance of our approach.
Werner Zellinger, Natalia Shepeleva, Marius-Constantin Dinu, Hamid Eghbalzadeh, Hoan Duc Nguyen, Bernhard Nessler, Sergei V. Pereverzyev, Bernhard Moser 0001
NeurIPS2
2019 Optimization and deployment of CNNs at the edge: the ALOHA experience
abstract
Deep learning (DL) algorithms have already proved their effectiveness on a wide variety of application domains, including speech recognition, natural language processing, and image classification. To foster their pervasive adoption in applications where low latency, privacy issues and data bandwidth are paramount, the current trend is to perform inference tasks at the edge. This requires deployment of DL algorithms on low-energy and resource-constrained computing nodes, often heterogenous and parallel, that are usually more complex to program and to manage without adequate support and experience. In this paper, we present ALOHA, an integrated tool flow that tries to facilitate the design of DL applications and their porting on embedded heterogenous architectures. The proposed tool flow aims at automating different design steps and reducing development costs. ALOHA considers hardware-related variables and security, power efficiency, and adaptivity aspects during the whole development process, from pre-training hyperparameter optimization and algorithm configuration to deployment.
Paolo Meloni, Daniela Loi, Paola Busia, Gianfranco Deriu, Andy D. Pimentel, Dolly Sapra, Todor P. Stefanov, Svetlana Minakova, Francesco Conti 0001, Luca Benini, Maura Pintor, Battista Biggio, Bernhard Moser 0001, Natalia Shepeleva, Nikos Fragoulis, Ilias Theodorakopoulos, Michael Masin, Francesca Palumbo
CF14