Nicholas Donald Lane

Nicholas Donald Lane

Auto-generated profile, based on publicly available information

Nicholas Donald Lane

University of Cambridge

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2020
Verified
Book Chapter
Closed access
PDF file
RLRoyson Lee
Royson Lee
ŁDŁukasz Dudziak
Łukasz Dudziak
MAMohamed Abdelfattah
Mohamed Abdelfattah
SVStylianos I. Venieris
Stylianos I. Venieris
HKHyeji Kim
Hyeji Kim
NLNicholas D. Lane
Nicholas D. Lane

21 December 2022 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
ELEdgar Liberis
Edgar Liberis
NLNicholas D. Lane
Nicholas D. Lane
Wearable, embedded, and IoT devices are a centrepiece of many ubiquitous computing applications, such as fitness tracking, health monitoring, home security and voice assistants. By gathering user data through a variety of sensors and leveraging machine learning (ML), applications can adapt their behaviour: in other words, devices become "smart". Such devices are typically powered by microcontroller units (MCUs). As MCUs continue to improve, smart devices become capable of performing a non-trivial amount of sensing and data processing, including machine learning inference, which results in a greater degree of user data privacy and autonomy, compared to offloading the execution of ML models to another device. Advanced predictive capabilities across many tasks make neural networks an attractive ML model for ubiquitous computing applications; however, on-device inference on MCUs remains extremely challenging. Orders of magnitude less storage, memory and computational ability, compared to what is typically required to execute neural networks, impose strict structural constraints on the network architecture and call for specialist model compression methodology. In this work, we present a differentiable structured pruning method for convolutional neural networks, which integrates a model's MCU-specific resource usage and parameter importance feedback to obtain highly compressed yet accurate models. Compared to related network pruning work, compressed models are more accurate due to better use of MCU resource budget, and compared to MCU specialist work, compressed models are produced faster. The user only needs to specify the amount of available computational resources and the pruning algorithm will automatically compress the network during training to satisfy them. We evaluate our methodology using benchmark image and audio classification tasks and find that it (a) improves key resource usage of neural networks up to 80x; (b) has little to no overhead or even improves model training time; (c) produces compressed models with matching or improved resource usage up to 1.4x in less time compared to prior MCU-specific model compression methods.

3 March 2020
Verified
Conference Paper
Open access
CTCatherine Tong
Catherine Tong
STShyam A. Tailor
Shyam A. Tailor
NLNicholas D. Lane
Nicholas D. Lane

8 May 2023
Verified
Conference Paper
Open access
CMChenyang Ma
Chenyang Ma
XQXinchi Qiu
Xinchi Qiu
DBDaniel Beutel
Daniel Beutel
NLNicholas Lane
Nicholas Lane
The privacy-sensitive nature of decentralized datasets and the robustness of eXtreme Gradient Boosting (XGBoost) on tabular data raise the needs to train XGBoost in the context of federated learning (FL). Existing works on federated XGBoost in the horizontal setting rely on the sharing of gradients, which induce per-node level communication frequency and serious privacy concerns. To alleviate these problems, we develop an innovative framework for horizontal federated XGBoost which does not depend on the sharing of gradients and simultaneously boosts privacy and communication efficiency by making the learning rates of the aggregated tree ensembles learnable. We conduct extensive evaluations on various classification and regression datasets, showing our approach achieves performance comparable to the state-of-the-art method and effectively improves communication efficiency by lowering both communication rounds and communication overhead by factors ranging from 25x to 700x.

23 October 2022
Verified
Book Chapter
Closed access
PDF file
AKAlexandros Kouris
Alexandros Kouris
SVStylianos I. Venieris
Stylianos I. Venieris
SLStefanos Laskaridis
Stefanos Laskaridis
NLNicholas Lane
Nicholas Lane

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
LXLichuan Xiang
Lichuan Xiang
LDLukasz Dudziak
Lukasz Dudziak
MAMohamed S. Abdelfattah
Mohamed S. Abdelfattah
TCThomas Chau
Thomas Chau
NLNicholas D. Lane
Nicholas D. Lane
HWHongkai Wen
Hongkai Wen
We formalize and analyze a fundamental component of dif- ferentiable neural architecture search (NAS): local “opera- tion scoring” at each operation choice. We view existing operation scoring functions as inexact proxies for accuracy, and we find that they perform poorly when analyzed empir- ically on NAS benchmarks. From this perspective, we intro- duce a novel perturbation-based zero-cost operation scor- ing (Zero-Cost-PT) approach, which utilizes zero-cost prox- ies that were recently studied in multi-trial NAS but de- grade significantly on larger search spaces, typical for dif- ferentiable NAS. We conduct a thorough empirical evalu- ation on a number of NAS benchmarks and large search spaces, from NAS-Bench-201, NAS-Bench-1Shot1, NAS- Bench-Macro, to DARTS-like and MobileNet-like spaces, showing significant improvements in both search time and accuracy. On the ImageNet classification task on the DARTS search space, our approach improved accuracy compared to the best current training-free methods (TE-NAS) while be- ing over 10× faster (total searching time 25 minutes on a single GPU), and observed significantly better transferabil- ity on architectures searched on the CIFAR-10 dataset with an accuracy increase of 1.8 pp. Our code is available at: https://github.com/zerocostptnas/zerocost operation score.