← Search

Zhenzhe Zheng

11 accepted papers

2026

EnViT: Enhancing the Performance of Early-Exit Vision Transformers via Exit-Aware Structured Dropout-Enabled Self-Distillation

AAAI 2026technical

Vision Transformers (ViTs) have gained significant attention and widespread adoption due to their impressive performance in various computer vision tasks. However, in practice, their substantial computational overhead often leads to high inference latency and increased overheads when deployed on res

Cited by 0SourcePDFScholar
2025

AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference

AAAI 2025technical

Long-context large language models (LLMs) inference is increasingly critical, motivating a number of studies devoted to alleviating the substantial storage and computational costs in such scenarios. Layer-wise skipping methods are promising optimizations but rarely explored in long-context inference…

2025

ClusterFusion: Expanding Operator Fusion Scope for LLM Inference via Cluster-Level Collective Primitive

NeurIPS 2025poster

Large language model (LLM) decoding suffers from high latency due to fragmented execution across operators and heavy reliance on off-chip memory for data exchange and reduction. This execution model limits opportunities for fusion and incurs significant memory traffic and kernel launch overhead. Wh…

Cited by 0SourceScholar
2025

Optimizing the Battery-Swapping Problem in Urban E-Bike Systems with Reinforcement Learning

IJCAI 2025

E-bikes (EBs) are a key transportation mode in urban area, especially for couriers of delivery platforms, but underdeveloped EB systems can hinder courier's productivity due to limited battery capacity. Battery-swapping stations address this issue by enabling riders to exchange depleted batteries fo

Cited by 0SourcePDFScholar
2023

Truthful Auctions for Automated Bidding in Online Advertising

IJCAI 2023poster

Automated bidding, an emerging intelligent decision-making paradigm powered by machine learning, has become popular in online advertising. Advertisers in automated bidding evaluate the cumulative utilities and have private financial constraints over multiple ad auctions in a long-term period. Based…

Cited by 11SourcePDFScholar
2023

Utility Maximizer or Value Maximizer: Mechanism Design for Mixed Bidders in Online Advertising

AAAI 2023technical

Digital advertising constitutes one of the main revenue sources for online platforms. In recent years, some advertisers tend to adopt auto-bidding tools to facilitate advertising performance optimization, making the classical utility maximizer model in auction theory not fit well. Some recent studie…

Cited by 11SourcePDFScholar
2021

Toward Understanding the Influence of Individual Clients in Federated Learning

AAAI 2021technical

Federated learning allows mobile clients to jointly train a global model without sending their private data to a central server. Extensive works have studied the performance guarantee of the global model, however, it is still unclear how each individual client influences the collaborative training p…

Cited by 51SourcePDFScholar
2020

Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising

ICML 2020poster

In E-commerce, advertising is essential for merchants to reach their target users. The typical objective is to maximize the advertiser’s cumulative revenue over a period of time under a budget constraint. In real applications, an advertisement (ad) usually needs to be exposed to the same user multip…

Cited by 29SourcePDFScholar
2020

Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising

IJCAI 2020poster

Bipartite b-matching is fundamental in algorithm design, and has been widely applied into diverse applications, such as economic markets, labor markets, etc. These practical problems usually exhibit two distinct features: large-scale and dynamic, which requires the matching algorithm to be repeatedl…

Cited by 0SourcePDFScholar