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

Lefan Zhang

dblp:229/4234 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0001-6559-9630ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 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
2 papers
Language models and text generation · 36% Trustworthy machine learning · 31% Efficient and distributed learning · 18%
Human-computer interaction and pervasive computing
2 papers
User interface design and tools · 100%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 50% Debugging and program repair · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
decoding
0.912025
Learning Harmonized Representations for Speculative Sampling · ICLR 2025
Machine learning › Efficient and distributed learning
inference acceleration
0.912025
Learning Harmonized Representations for Speculative Sampling · ICLR 2025
Natural language and speech › Language models and text generation › large language model inference
speculative sampling
0.912025
Learning Harmonized Representations for Speculative Sampling · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.812024
Learning from Long-Tailed Noisy Data with Sample Selection and Balanced Loss · IJCAI 2024
Machine learning › Learning paradigms › class imbalance
long-tailed learning
0.812024
Learning from Long-Tailed Noisy Data with Sample Selection and Balanced Loss · IJCAI 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Learning from Long-Tailed Noisy Data with Sample Selection and Balanced Loss · IJCAI 2024
User interface design and tools › end-user development
trigger-action programming
0.512021
Understanding Trigger-Action Programs Through Novel Visualizations of Program Differences · CHI 2021
Debugging and program repair
program repair
0.412019
AutoTap: synthesizing and repairing trigger-action programs using LTL properties · ICSE 2019
User interface design and tools
end-user programming
0.112019
AutoTap: synthesizing and repairing trigger-action programs using LTL properties · ICSE 2019

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

knowledge distillation · 0.9context alignment · 0.9sample selection · 0.8linear temporal logic · 0.8balanced loss · 0.8formal methods · 0.5co-design · 0.5between-subjects experiment · 0.5
YearPublicationVenuePosition
2025 Learning Harmonized Representations for Speculative Sampling
abstract
Speculative sampling is a promising approach to accelerate the decoding stage for Large Language Models (LLMs). Recent advancements that leverage target LLM's contextual information, such as hidden states and KV cache, have shown significant practical improvements. However, these approaches suffer from inconsistent context between training and decoding. We also observe another discrepancy between the training and decoding objectives in existing speculative sampling methods. In this work, we propose a solution named HArmonized Speculative Sampling (HASS) that learns harmonized representations to address these issues. HASS accelerates the decoding stage without adding inference overhead through harmonized objective distillation and harmonized context alignment. Experiments on four LLaMA models demonstrate that HASS achieves 2.81x-4.05x wall-clock time speedup ratio averaging across three datasets, surpassing EAGLE-2 by 8%-20%. The code is available at https://github.com/HArmonizedSS/HASS.
Lefan Zhang, Yanhua Huang, Ruiwen Xu
ICLR1
2024 Learning from Long-Tailed Noisy Data with Sample Selection and Balanced Loss
Lefan Zhang, Zhang-Hao Tian, Wujun Zhou
IJCAI1
2021 Understanding Trigger-Action Programs Through Novel Visualizations of Program Differences
abstract
Trigger-action programming (if-this-then-that rules) empowers non-technical users to automate services and smart devices. As a user’s set of trigger-action programs evolves, the user must reason about behavior differences between similar programs, such as between an original program and several modification candidates, to select programs that meet their goals. To facilitate this process, we co-designed user interfaces and underlying algorithms to highlight differences between trigger-action programs. Our novel approaches leverage formal methods to efficiently identify and visualize differences in program outcomes or abstract properties. We also implemented a traditional interface that shows only syntax differences in the rules themselves. In a between-subjects online experiment with 107 participants, the novel interfaces better enabled participants to select trigger-action programs matching intended goals in complex, yet realistic, situations that proved very difficult when using traditional interfaces showing syntax differences.
Valerie Zhao, Lefan Zhang, Michael L. Littman, Shan Lu 0001, Blase Ur
CHI2
2019 AutoTap: synthesizing and repairing trigger-action programs using LTL properties
abstract
End-user programming, particularly trigger-action programming (TAP), is a popular method of letting users express their intent for how smart devices and cloud services interact. Unfortunately, sometimes it can be challenging for users to correctly express their desires through TAP. This paper presents AutoTap, a system that lets novice users easily specify desired properties for devices and services. AutoTap translates these properties to linear temporal logic (LTL) and both automatically synthesizes property-satisfying TAP rules from scratch and repairs existing TAP rules. We designed AutoTap based on a user study about properties users wish to express. Through a second user study, we show that novice users made significantly fewer mistakes when expressing desired behaviors using AutoTap than using TAP rules. Our experiments show that AutoTap is a simple and effective option for expressive end-user programming.
Lefan Zhang, Weijia He, Jesse J. Martinez, Noah Brackenbury, Shan Lu 0001, Blase Ur
ICSE1
2018 Prototyping Energy Harvesting Powered Systems with Nonvolatile Processor (Invited Paper)
abstract
Energy harvesting is a promising solution to power ubiquitous Internet-of-Things (IoT) devices. But the frequent and inevitable power failure incurs significant backup overhead, greatly degrading performance and energy efficiency. Nonvolatile processor (NVP), which can checkpoint processor states, is designed to tackle this problem. The conventional system-level design method involves repeated system modification and verification on hardware, in which measurement on hardware consumes the majority time. To expedite the NVP-based system design process, we propose a rapid system prototyping flow to eliminate repeated hardware measurement in the design flow. This method involves an NVP system-level simulator, which takes the harvester power trace, system characteristics extracted from hardware, and user design as the input, and analyzes system energy and time profile under this power trace. Iterative system optimization and verification are conducted on the simulator, with only the final verification on hardware. We demonstrate the advantages of this method by two design cases, in which time, energy efficiency and the impact of different capacitor size are optimized.
Yawen Wu, Zhenge Jia, Lefan Zhang, Yongpan Liu, Jingtong Hu
RSP4