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

Zifu Wang

dblp:163/2289 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
7since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
5 papers
Language models and text generation · 29% Segmentation and scene understanding · 26% Efficient and distributed learning · 21%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
1.422024
Can LLMs Learn by Teaching for Better Reasoning? A Preliminary Study · NeurIPS 2024
Jaccard Metric Losses: Optimizing the Jaccard Index with Soft Labels · NeurIPS 2023
Machine learning › Deep learning architectures and training
loss function design
1.322023
Jaccard Metric Losses: Optimizing the Jaccard Index with Soft Labels · NeurIPS 2023
Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union · NeurIPS 2023
Computer vision › Segmentation and scene understanding
semantic segmentation
1.322023
Jaccard Metric Losses: Optimizing the Jaccard Index with Soft Labels · NeurIPS 2023
Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union · NeurIPS 2023
Machine learning › Efficient and distributed learning
inference efficiency
0.812024
Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation · ICLR 2024
Natural language and speech › Language models and text generation
large language model
0.812024
Can LLMs Learn by Teaching for Better Reasoning? A Preliminary Study · NeurIPS 2024
Natural language and speech › Language models and text generation › decoding › decoding strategy
parallel decoding
0.812024
Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation · ICLR 2024
Natural language and speech › Language models and text generation
prompting
0.812024
Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation · ICLR 2024
Natural language and speech › Language models and text generation › alignment › scalable oversight
weak-to-strong generalization
0.812024
Can LLMs Learn by Teaching for Better Reasoning? A Preliminary Study · NeurIPS 2024
Medical and health informatics › medical imaging
medical image analysis
0.812024
Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation? · NeurIPS 2024
Medical and health informatics › medical imaging › medical image analysis
medical image segmentation
0.812024
Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation? · NeurIPS 2024
Computer vision › Segmentation and scene understanding › image segmentation
segmentation evaluation
0.712023
Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union · NeurIPS 2023
Machine learning › Learning paradigms
semi-supervised learning
0.712023
Jaccard Metric Losses: Optimizing the Jaccard Index with Soft Labels · NeurIPS 2023
Machine learning › Trustworthy machine learning
out-of-distribution evaluation
0.212024
Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation? · NeurIPS 2024

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

parallel API calls · 0.8in-context learning · 0.8fine-tuning · 0.8batched decoding · 0.8worst-case metric · 0.7label smoothing · 0.7jaccard metric losses · 0.7fine-grained intersection over union · 0.7
YearPublicationVenuePosition
2024 Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation
abstract
This work aims at decreasing the end-to-end generation latency of large language models (LLMs). One of the major causes of the high generation latency is the sequential decoding approach adopted by almost all state-of-the-art LLMs. In this work, motivated by the thinking and writing process of humans, we propose Skeleton-of-Thought (SoT), which first guides LLMs to generate the skeleton of the answer, and then conducts parallel API calls or batched decoding to complete the contents of each skeleton point in parallel. Not only does SoT provide considerable speed-ups across 12 LLMs, but it can also potentially improve the answer quality on several question categories. SoT is an initial attempt at data-centric optimization for inference efficiency, and showcases the potential of eliciting high-quality answers by explicitly planning the answer structure in language.
Xuefei Ning, Zinan Lin 0001, Zifu Wang, Huazhong Yang, Yu Wang 0002
ICLR4
2024 Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation?
abstract
How can we test AI performance? This question seems trivial, but it isn't. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across various out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms on three test sets. In addition, we also evaluated pre-existing AI frameworks---which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain.
Pedro R. A. S. Bassi, Yucheng Tang, Fabian Isensee, Zifu Wang, Jieneng Chen, Yu-Cheng Chou, Yannick Kirchhoff, Maximilian Rokuss, Ziyan Huang, Jin Ye 0002, Junjun He, Tassilo Wald, Constantin Ulrich, Michael Baumgartner 0001, Saikat Roy, Klaus H. Maier-Hein, Paul F. Jaeger, Yiwen Ye, Yutong Xie 0001, Ziyang Chen 0003, Yong Xia 0001, Zhaohu Xing, Lei Zhu 0003, Yousef Sadegheih, Afshin Bozorgpour, Pratibha Kumari 0001, Reza Azad, Dorit Merhof, Yuxin Du 0001, Fan Bai 0008, Tiejun Huang 0001, Bo Zhao 0015, Xiaomeng Li 0001, Hanxue Gu, Haoyu Dong 0003, Maciej A. Mazurowski, Saumya Gupta, Linshan Wu, Jiaxin Zhuang, Hao Chen 0011, Holger Roth, Daguang Xu, Matthew B. Blaschko, Sergio Decherchi, Andrea Cavalli, Alan L. Yuille, Zongwei Zhou
NeurIPS5
2024 Can LLMs Learn by Teaching for Better Reasoning? A Preliminary Study
abstract
Teaching to improve student models (e.g., knowledge distillation) is an extensively studied methodology in LLMs. However, in human education, teaching enhances not only the students but also the teachers by fostering more rigorous and clearer reasoning, as well as deeper knowledge building. We ask: Can LLMs also learn by teaching (LbT) for better reasoning? If the answer is yes, we can potentially unlock the possibility of continuously advancing the models without solely relying on human-produced data or stronger models. In this paper, we provide a preliminary exploration of this question. We show that LbT ideas can be incorporated into existing LLM training/prompting pipelines and bring improvements. Specifically, we design three methods, each mimicking one of the three levels of LbT: observing students' feedback, learning from the feedback, and learning iteratively, with the goal of improving answer accuracy without training or improving models' inherent capability with fine-tuning. We reveal some findings: (1) Teaching materials that make it easier for students to learn (via in-context learning) have clearer and more accurate logic; (2) Weak-to-strong generalization: LbT might help improve strong models by teaching weak models; (3) Diversity in students might help: teaching multiple students could be better than teaching a single student or the teacher alone. We hope that our exploration can inspire future research on LbT and, more broadly, the adoption of advanced education techniques to improve LLMs. The code and website are at https://github.com/imagination-research/lbt and https://sites.google.com/view/llm-learning-by-teaching.
Xuefei Ning, Zifu Wang, Zinan Lin 0001, Peiran Yao, Tianyu Fu 0004, Matthew B. Blaschko, Guohao Dai 0001, Huazhong Yang, Yu Wang 0002
NeurIPS2
2023 Dice Semimetric Losses: Optimizing the Dice Score with Soft Labels
Zifu Wang, Teodora Popordanoska, Jeroen Bertels, Robin Lemmens, Matthew B. Blaschko
MICCAI (3)1
2023 Revisiting Evaluation Metrics for Semantic Segmentation: Optimization and Evaluation of Fine-grained Intersection over Union
abstract
Semantic segmentation datasets often exhibit two types of imbalance: \textit{class imbalance}, where some classes appear more frequently than others and \textit{size imbalance}, where some objects occupy more pixels than others. This causes traditional evaluation metrics to be biased towards \textit{majority classes} (e.g. overall pixel-wise accuracy) and \textit{large objects} (e.g. mean pixel-wise accuracy and per-dataset mean intersection over union). To address these shortcomings, we propose the use of fine-grained mIoUs along with corresponding worst-case metrics, thereby offering a more holistic evaluation of segmentation techniques. These fine-grained metrics offer less bias towards large objects, richer statistical information, and valuable insights into model and dataset auditing. Furthermore, we undertake an extensive benchmark study, where we train and evaluate 15 modern neural networks with the proposed metrics on 12 diverse natural and aerial segmentation datasets. Our benchmark study highlights the necessity of not basing evaluations on a single metric and confirms that fine-grained mIoUs reduce the bias towards large objects. Moreover, we identify the crucial role played by architecture designs and loss functions, which lead to best practices in optimizing fine-grained metrics. The code is available at \href{https://github.com/zifuwanggg/JDTLosses}{https://github.com/zifuwanggg/JDTLosses}.
Zifu Wang, Maxim Berman, Amal Rannen Triki, Philip Torr 0001, Devis Tuia, Tinne Tuytelaars, Luc Van Gool, Jiaqian Yu, Matthew B. Blaschko
NeurIPS1
2023 Jaccard Metric Losses: Optimizing the Jaccard Index with Soft Labels
abstract
Intersection over Union (IoU) losses are surrogates that directly optimize the Jaccard index. Leveraging IoU losses as part of the loss function have demonstrated superior performance in semantic segmentation tasks compared to optimizing pixel-wise losses such as the cross-entropy loss alone. However, we identify a lack of flexibility in these losses to support vital training techniques like label smoothing, knowledge distillation, and semi-supervised learning, mainly due to their inability to process soft labels. To address this, we introduce Jaccard Metric Losses (JMLs), which are identical to the soft Jaccard loss in standard settings with hard labels but are fully compatible with soft labels. We apply JMLs to three prominent use cases of soft labels: label smoothing, knowledge distillation and semi-supervised learning, and demonstrate their potential to enhance model accuracy and calibration. Our experiments show consistent improvements over the cross-entropy loss across 4 semantic segmentation datasets (Cityscapes, PASCAL VOC, ADE20K, DeepGlobe Land) and 13 architectures, including classic CNNs and recent vision transformers. Remarkably, our straightforward approach significantly outperforms state-of-the-art knowledge distillation and semi-supervised learning methods. The code is available at \href{https://github.com/zifuwanggg/JDTLosses}{https://github.com/zifuwanggg/JDTLosses}.
Zifu Wang, Xuefei Ning, Matthew B. Blaschko
NeurIPS1
2022 MRF-UNets: Searching UNet with Markov Random Fields
Zifu Wang, Matthew B. Blaschko
ECML/PKDD (3)1