Demo Data from EDBT 2026 / reviewers in the wild / expert
Guoshuai Ma
dblp:298/5611
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Learning paradigms · 50% Representation and self-supervised learning · 50% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › shared representation
feature sharing |
0.8 | 1 | 2024 | Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024 |
Machine learning › Learning paradigms
multi-task learning |
0.8 | 1 | 2024 | Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding |
0.8 | 1 | 2024 | Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024 |
Machine learning › Learning paradigms › multi-task learning
sparse multi-task learning |
0.8 | 1 | 2024 | Learning Multi-Task Sparse Representation Based on Fisher Information · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
fisher information · 0.8alternating optimization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Learning Multi-Task Sparse Representation Based on Fisher InformationabstractMulti-task learning deals with multiple related tasks simultaneously by sharing knowledge. In a typical deep multi-task learning model, all tasks use the same feature space and share the latent knowledge. If the tasks are weakly correlated or some features are negatively correlated, sharing all knowledge often leads to negative knowledge transfer among. To overcome this issue, this paper proposes a Fisher sparse multi-task learning method. It can obtain a sparse sharing representation for each task. In such a way, tasks share features on a sparse subspace. Our method can ensure that the knowledge transferred among tasks is beneficial. Specifically, we first propose a sparse deep multi-task learning model, and then introduce Fisher sparse module into traditional deep multi-task learning to learn the sparse variables of task. By alternately updating the neural network parameters and sparse variables, a sparse sharing representation can be learned for each task. In addition, in order to reduce the computational overhead, an heuristic method is used to estimate the Fisher information of neural network parameters. Experimental results show that, comparing with other methods, our proposed method can improve the performance for all tasks, and has high sparsity in multi-task learning. Yayu Zhang, Guoshuai Ma, Keyin Zheng, Guoqing Liu 0001, Qingfu Zhang 0001 |
AAAI | 3 |
| 2024 | ESSR: Evolving Sparse Sharing Representation for Multitask LearningabstractMulti-task learning uses knowledge transfer among tasks to improve the generalization performance of all tasks. For deep multi-task learning, knowledge transfer is often implemented via sharing all hidden features of tasks. A major shortcoming is that it can lead to negative knowledge transfer across tasks when task correlation is weak. To overcome it, this paper proposes an evolutionary method to learn sparse sharing representations adaptively. By embedding the neural network optimization into evolutionary multitasking, our proposed method finds an optimal combination of tasks and sharing features. It can identify negative correlation and redundant features and then remove them from the hidden feature set. Thus, an optimal sparse sharing subnetwork can be produced for each task. Experiment results show that the proposed method achieve better learning performance with a smaller inference model than other related methods. Yayu Zhang, Guoshuai Ma, Xinyan Liang, Guoqing Liu 0001, Qingfu Zhang 0001, Ke Tang 0001 |
IEEE Trans. Evol. Comput. | 3 |