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.

James Liu

dblp:83/5709 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0003-2572-0522ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Efficient and distributed learning · 87% Transfer learning and domain adaptation · 13%
Computer graphics and multimedia
1 paper
Virtual and augmented reality · 100%
Human-computer interaction and pervasive computing
1 paper
Immersive interaction · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.622025
Training-Free Activation Sparsity in Large Language Models · ICLR 2025
BitDelta: Your Fine-Tune May Only Be Worth One Bit · NeurIPS 2024
Machine learning › Efficient and distributed learning › model compression › sparsity
activation sparsity
0.912025
Training-Free Activation Sparsity in Large Language Models · ICLR 2025
Machine learning › Efficient and distributed learning
inference acceleration
0.912025
Training-Free Activation Sparsity in Large Language Models · ICLR 2025
Machine learning › Transfer learning and domain adaptation
fine-tuning
0.812024
BitDelta: Your Fine-Tune May Only Be Worth One Bit · NeurIPS 2024
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
BitDelta: Your Fine-Tune May Only Be Worth One Bit · NeurIPS 2024
Machine learning › Efficient and distributed learning › model compression
quantization
0.812024
BitDelta: Your Fine-Tune May Only Be Worth One Bit · NeurIPS 2024
Virtual and augmented reality › immersive interaction › 3d interaction
locomotion in virtual environments
0.312018
Increasing Walking in VR using Redirected Teleportation · UIST 2018
Immersive interaction › virtual reality locomotion
redirected walking
0.312018
Increasing Walking in VR using Redirected Teleportation · UIST 2018

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

weight quantization · 0.9magnitude-based pruning · 0.9quantization · 0.8delta decomposition · 0.8redirected teleportation · 0.7portal-based reorientation · 0.7
YearPublicationVenuePosition
2026 Data Inclusion Proofs for Account-based Blockchains Storage Nodes
Nhi Luu, James Liu, Zhengnan Hua, Joseph Hilsberg, Sushmita Ruj
ICBC3
2026 SqlRewriter: Harnessing Community Knowledge to Rewrite SQL Queries
Qiushi Bai, Yihong Yu, Colin Michael Harrison, James Liu, Jessie He, Hartley Tran, Chen Li 0001
ICDE5
2025 Training-Free Activation Sparsity in Large Language Models
abstract
Activation sparsity can enable practical inference speedups in large language models (LLMs) by reducing the compute and memory-movement required for matrix multiplications during the forward pass. However, existing methods face limitations that inhibit widespread adoption. Some approaches are tailored towards older models with ReLU-based sparsity, while others require extensive continued pre-training on up to hundreds of billions of tokens. This paper describes TEAL (**T**raining-Fre**e** **A**ctivation Sparsity in **L**LMs), a simple training-free method that applies magnitude-based activation sparsity to hidden states throughout the entire model. TEAL achieves 40-50\% model-wide sparsity with minimal performance degradation across Llama-2, Llama-3, and Mistral families, with sizes varying from 7B to 70B. We improve existing sparse kernels and demonstrate wall-clock decoding speed-ups of up to 1.53× and 1.8× at 40\% and 50\% model-wide sparsity. TEAL is compatible with weight quantization, enabling further efficiency gains.
James Liu, Pragaash Ponnusamy, Tianle Cai, Ben Athiwaratkun
ICLR1
2024 BitDelta: Your Fine-Tune May Only Be Worth One Bit
abstract
Large Language Models (LLMs) are typically trained in two phases: pre-training on large internet-scale datasets, and fine-tuning for downstream tasks. Given the higher computational demand of pre-training, it is intuitive to assume that fine-tuning adds less new information to the model, and is thus more compressible. We explore this assumption by decomposing the weights of fine-tuned models into their pre-trained components and an additional delta. We introduce a simple method, BitDelta, which successfully quantizes this delta down to 1 bit without compromising performance. This interesting finding not only highlights the potential redundancy of information added during fine-tuning, but also has significant implications for the multi-tenant serving and multi-tenant storage of fine-tuned models. By enabling the use of a single high-precision base model accompanied by multiple 1-bit deltas, BitDelta dramatically reduces GPU memory requirements by more than 10x, thus reducing per-user generation latency by more than 10x in multi-tenant settings. We validate BitDelta through experiments across Llama-2, Mistral and MPT model families, and on models up to 70B parameters, showcasing minimal performance degradation in all tested settings.
James Liu, Guangxuan Xiao, Jason D. Lee, Song Han 0003, Tri Dao, Tianle Cai
NeurIPS1
2019 Underwater Virtual Reality System for Neutral Buoyancy Training: Development and Evaluation
abstract
During terrestrial activities, sensation of pressure on the skin and tension in muscles and joints provides information about how the body is oriented relative to gravity and how the body is moving relative to the surrounding environment. In contrast, in aquatic environments when suspended in a state of neutral buoyancy, the weight of the body and limbs is offloaded, rendering these cues uninformative. It is not yet known how this altered sensory environment impacts virtual reality experiences. To investigate this question, we converted a full-face SCUBA mask into an underwater head-mounted display and developed software to simulate jetpack locomotion outside the International Space Station. Our goal was to emulate conditions experienced by astronauts during training at NASA's Neutral Buoyancy Lab. A user study was conducted to evaluate both sickness and presence when using virtual reality in this altered sensory environment. We observed an increase in nausea related symptoms underwater, but we cannot conclude that this is due to VR use. Other measures of sickness and presence underwater were comparable to measures taken above water. We conclude with suggestions for improved underwater VR systems and improved methods for evaluation of these systems based on our experience.
Christian Sinnott, James Liu, Courtney Matera, Savannah Halow, Ann Jones, Matthew Moroz, Jeffrey Mulligan, Michael Crognale, Eelke Folmer, Paul R. MacNeilage
VRST2
2018 Increasing Walking in VR using Redirected Teleportation
abstract
Teleportation is a popular locomotion technique that lets users safely navigate beyond the confines of available positional tracking space without inducing VR sickness. Because available walking space is limited and teleportation is faster than walking, a risk with using teleportation is that users might end up abandoning walking input and only relying on teleportation, which is considered detrimental to presence. We present redirected teleportation; an improved version of teleportation that uses iterative non-obtrusive reorientation and repositioning using a portal to redirect the user back to the center of the tracking space, where available walking space is larger. A user study compares the effectiveness, accuracy, and usability of redirected teleportation with regular teleportation using a navigation task in three different environments. Results show that redirected teleportation allows for a better utilization of available tracking space than regular teleportation, as it requires significantly fewer teleportations, while users walk more and use a larger portion of the available tracking space.
James Liu, Hirav Parekh, Majed Al Zayer, Eelke Folmer
UIST1
2007 Efficient Rate Control for H.264 using RD-Cost
abstract
A novel adaptive coding characteristic prediction scheme called RD-cost prediction model is proposed. Through this linear model and optimum bit allocation, RD-cost and texture bits budget of current basic unit can be obtained, and then the quantization parameter (QP) can be directly calculated. Simulation results show that the H.264 encoder, using the proposed algorithm, achieves a visual quality improvement up to 0.302 dB, meets better with target bit rates, produces more flat bit-rate curve and decreases more computation complexity than that using H.264 previous rate control method JVT-G012.
Zhengguang Xie, James Liu
ICME2
2007 A General Method for Detecting All-Zero Blocks Prior to DCT and Quantization
abstract
This paper presents an innovative algorithm for detecting all-zero discrete cosine transform (DCT) coefficient blocks prior to DCT and quantization for all block-based video coding standards. A mathematic model is established based on analyzing DCT coefficient distribution and applying Paseval energy conservation theorem. The algorithm is applied to H.264 video coding and experimental results show up to 32% higher detection ratio without degrading video quality, compared with results of the existing methods. Furthermore, up to 47% higher detection ratio is achieved by changing the threshold based on DCT coefficient distribution. For motion estimation, much less search points needed by using the proposed method as early termination criterion than that by using the existing methods
Zhengguang Xie, James Liu, Tiejun Yang
IEEE Trans. Circuits Syst. Video Technol.3
2006 TCtract-A Collocation Extraction Approach for Noun Phrases Using Shallow Parsing Rules and Statistic Models
Wanyin Li, Qin Lu 0001, James Liu
PACLIC3
1999 A Cantonese-English machine translation system PolyU-MT-99
James Liu
MTSummit2