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

Le-Trung Nguyen

dblp:393/0699 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › memory-efficient training
activation memory reduction
0.912025
Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning · ICML 2025
Machine learning › Efficient and distributed learning › model compression
low-rank approximation
0.912025
Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning · ICML 2025
Machine learning › Efficient and distributed learning › edge computing › on-device machine learning
on-device learning
0.912025
Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning · ICML 2025
Machine learning › Efficient and distributed learning › model compression › neural network compression
activation compression
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Machine learning › Efficient and distributed learning › model compression › low-rank approximation
tensor decomposition for neural networks
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Distributed systems › edge computing
edge AI
0.212024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024

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

singular value decomposition · 1.5high-order singular value decomposition · 1.5backpropagation · 0.9FLOP reduction · 0.9
YearPublicationVenuePosition
2025 Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning
abstract
On-device learning has emerged as a promising direction for AI development, particularly because of its potential to reduce latency issues and mitigate privacy risks associated with device-server communication, while improving energy efficiency. Despite these advantages, significant memory and computational constraints still represent major challenges for its deployment. Drawing on previous studies on low-rank decomposition methods that address activation memory bottlenecks in backpropagation, we propose a novel shortcut approach as an alternative. Our analysis and experiments demonstrate that our method can reduce activation memory usage, even up to $120.09\times$ compared to vanilla training, while also reducing overall training FLOPs up to $1.86\times$ when evaluated on traditional benchmarks.
Le-Trung Nguyen, Aël Quélennec, Enzo Tartaglione
ICML1
2024 Activation Map Compression through Tensor Decomposition for Deep Learning
abstract
Internet of Things and Deep Learning are synergetically and exponentially growing industrial fields with a massive call for their unification into a common framework called Edge AI. While on-device inference is a well-explored topic in recent research, backpropagation remains an open challenge due to its prohibitive computational and memory costs compared to the extreme resource constraints of embedded devices. Drawing on tensor decomposition research, we tackle the main bottleneck of backpropagation, namely the memory footprint of activation map storage. We investigate and compare the effects of activation compression using Singular Value Decomposition and its tensor variant, High-Order Singular Value Decomposition. The application of low-order decomposition results in considerable memory savings while preserving the features essential for learning, and also offers theoretical guarantees to convergence. Experimental results obtained on main-stream architectures and tasks demonstrate Pareto-superiority over other state-of-the-art solutions, in terms of the trade-off between generalization and memory footprint.
Le-Trung Nguyen, Aël Quélennec, Enzo Tartaglione, Samuel Tardieu
NeurIPS1