Search Results for author:
Found 11 papers, 5 papers with code
Decoding at the Speed of Thought: Harnessing Parallel Decoding of Lexical Units for LLMs
The core of our approach is the observation that a pre-trained language model can confidently predict multiple contiguous tokens, forming the basis for a \textit{lexical unit}, in which these contiguous tokens could be decoded in parallel.
Video-LaVIT: Unified Video-Language Pre-training with Decoupled Visual-Motional Tokenization
In light of recent advances in multimodal Large Language Models (LLMs), there is increasing attention to scaling them from image-text data to more informative real-world videos.
Ranked #3 on
Text-to-Video Generation
on MSR-VTT
USDC: Unified Static and Dynamic Compression for Visual Transformer
To alleviate two disadvantages of two categories of methods, we propose to unify the static compression and dynamic compression techniques jointly to obtain an input-adaptive compressed model, which can further better balance the total compression ratios and the model performances.
ASP: Automatic Selection of Proxy dataset for efficient AutoML
Deep neural networks have gained great success due to the increasing amounts of data, and diverse effective neural network designs.
KwaiYiiMath: Technical Report
Recent advancements in large language models (LLMs) have demonstrated remarkable abilities in handling a variety of natural language processing (NLP) downstream tasks, even on mathematical tasks requiring multi-step reasoning.
Ranked #96 on
Arithmetic Reasoning
on GSM8K
(using extra training data)
Unified Language-Vision Pretraining in LLM with Dynamic Discrete Visual Tokenization
Specifically, we introduce a well-designed visual tokenizer to translate the non-linguistic image into a sequence of discrete tokens like a foreign language that LLM can read.
SHARK: A Lightweight Model Compression Approach for Large-scale Recommender Systems
Increasing the size of embedding layers has shown to be effective in improving the performance of recommendation models, yet gradually causing their sizes to exceed terabytes in industrial recommender systems, and hence the increase of computing and storage costs.
Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networks
We propose an improved end-to-end Minimax optimization method for this sparse learning problem to better balance the model performance and the computation efficiency.
PA&DA: Jointly Sampling PAth and DAta for Consistent NAS
Our method only requires negligible computation cost for optimizing the sampling distributions of path and data, but achieves lower gradient variance during supernet training and better generalization performance for the supernet, resulting in a more consistent NAS.
Real-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertising
Real-time advertising allows advertisers to bid for each impression for a visiting user.
Deep Interest Network for Click-Through Rate Prediction
In this way, user features are compressed into a fixed-length representation vector, in regardless of what candidate ads are.
Ranked #1 on
Click-Through Rate Prediction
on Amazon
