10 research outputs found
Convergence acceleration for multiobjective sparse reconstruction via knowledge transfer
© Springer Nature Switzerland AG 2019. Multiobjective sparse reconstruction (MOSR) methods can potentially obtain superior reconstruction performance. However, they suffer from high computational cost, especially in high-dimensional reconstruction. Furthermore, they are generally implemented independently without reusing prior knowledge from past experiences, leading to unnecessary computational consumption due to the re-exploration of similar search spaces. To address these problems, we propose a sparse-constraint knowledge transfer operator to accelerate the convergence of MOSR solvers by reusing the knowledge from past problem-solving experiences. Firstly, we introduce the deep nonlinear feature coding method to extract the feature mapping between the search of the current problem and a previously solved MOSR problem. Through this mapping, we learn a set of knowledge-induced solutions which contain the search experience of the past problem. Thereafter, we develop and apply a sparse-constraint strategy to refine these learned solutions to guarantee their sparse characteristics. Finally, we inject the refined solutions into the iteration of the current problem to facilitate the convergence. To validate the efficiency of the proposed operator, comprehensive studies on extensive simulated signal reconstruction are conducted
Cross-Domain Labeled LDA for Cross-Domain Text Classification
Cross-domain text classification aims at building a classifier for a target
domain which leverages data from both source and target domain. One promising
idea is to minimize the feature distribution differences of the two domains.
Most existing studies explicitly minimize such differences by an exact
alignment mechanism (aligning features by one-to-one feature alignment,
projection matrix etc.). Such exact alignment, however, will restrict models'
learning ability and will further impair models' performance on classification
tasks when the semantic distributions of different domains are very different.
To address this problem, we propose a novel group alignment which aligns the
semantics at group level. In addition, to help the model learn better semantic
groups and semantics within these groups, we also propose a partial supervision
for model's learning in source domain. To this end, we embed the group
alignment and a partial supervision into a cross-domain topic model, and
propose a Cross-Domain Labeled LDA (CDL-LDA). On the standard 20Newsgroup and
Reuters dataset, extensive quantitative (classification, perplexity etc.) and
qualitative (topic detection) experiments are conducted to show the
effectiveness of the proposed group alignment and partial supervision.Comment: ICDM 201
Bi-Directional Generation for Unsupervised Domain Adaptation
Unsupervised domain adaptation facilitates the unlabeled target domain
relying on well-established source domain information. The conventional methods
forcefully reducing the domain discrepancy in the latent space will result in
the destruction of intrinsic data structure. To balance the mitigation of
domain gap and the preservation of the inherent structure, we propose a
Bi-Directional Generation domain adaptation model with consistent classifiers
interpolating two intermediate domains to bridge source and target domains.
Specifically, two cross-domain generators are employed to synthesize one domain
conditioned on the other. The performance of our proposed method can be further
enhanced by the consistent classifiers and the cross-domain alignment
constraints. We also design two classifiers which are jointly optimized to
maximize the consistency on target sample prediction. Extensive experiments
verify that our proposed model outperforms the state-of-the-art on standard
cross domain visual benchmarks.Comment: 9 pages, 4 figure
Subdomain Adaptation with Manifolds Discrepancy Alignment
Reducing domain divergence is a key step in transfer learning problems.
Existing works focus on the minimization of global domain divergence. However,
two domains may consist of several shared subdomains, and differ from each
other in each subdomain. In this paper, we take the local divergence of
subdomains into account in transfer. Specifically, we propose to use
low-dimensional manifold to represent subdomain, and align the local data
distribution discrepancy in each manifold across domains. A Manifold Maximum
Mean Discrepancy (M3D) is developed to measure the local distribution
discrepancy in each manifold. We then propose a general framework, called
Transfer with Manifolds Discrepancy Alignment (TMDA), to couple the discovery
of data manifolds with the minimization of M3D. We instantiate TMDA in the
subspace learning case considering both the linear and nonlinear mappings. We
also instantiate TMDA in the deep learning framework. Extensive experimental
studies demonstrate that TMDA is a promising method for various transfer
learning tasks
Recent Advances in Transfer Learning for Cross-Dataset Visual Recognition: A Problem-Oriented Perspective
This paper takes a problem-oriented perspective and presents a comprehensive
review of transfer learning methods, both shallow and deep, for cross-dataset
visual recognition. Specifically, it categorises the cross-dataset recognition
into seventeen problems based on a set of carefully chosen data and label
attributes. Such a problem-oriented taxonomy has allowed us to examine how
different transfer learning approaches tackle each problem and how well each
problem has been researched to date. The comprehensive problem-oriented review
of the advances in transfer learning with respect to the problem has not only
revealed the challenges in transfer learning for visual recognition, but also
the problems (e.g. eight of the seventeen problems) that have been scarcely
studied. This survey not only presents an up-to-date technical review for
researchers, but also a systematic approach and a reference for a machine
learning practitioner to categorise a real problem and to look up for a
possible solution accordingly