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

Zih-Syuan Huang

dblp:308/2885 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
—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 2021Computer networks · 1 · 1 first-author · 1 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
Optimization for machine learning · 48% Deep learning architectures and training · 33% Efficient and distributed learning · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › neural network training
structured neural network training
1.322024
Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network · NeurIPS 2024
Training Structured Neural Networks Through Manifold Identification and Variance Reduction · ICLR 2022
Machine learning › Optimization for machine learning › stochastic optimization
adaptive gradient methods
0.812024
Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network · NeurIPS 2024
Machine learning › Optimization for machine learning › optimization › continuous optimization › non-smooth optimization
manifold identification
0.612022
Training Structured Neural Networks Through Manifold Identification and Variance Reduction · ICLR 2022
Machine learning › Optimization for machine learning
variance reduction
0.612022
Training Structured Neural Networks Through Manifold Identification and Variance Reduction · ICLR 2022

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

manifold identification · 1.3inexact subproblem solver · 0.8dual averaging · 0.8variance reduction · 0.6
YearPublicationVenuePosition
2024 Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network
abstract
We propose a Regularized Adaptive Momentum Dual Averaging (RAMDA) algorithm for training structured neural networks. Similar to existing regularized adaptive methods, the subproblem for computing the update direction of RAMDA involves a nonsmooth regularizer and a diagonal preconditioner, and therefore does not possess a closed-form solution in general. We thus also carefully devise an implementable inexactness condition that retains convergence guarantees similar to the exact versions, and propose a companion efficient solver for the subproblems of both RAMDA and existing methods to make them practically feasible. We leverage the theory of manifold identification in variational analysis to show that, even in the presence of such inexactness, the iterates of RAMDA attain the ideal structure induced by the regularizer at the stationary point of asymptotic convergence. This structure is locally optimal near the point of convergence, so RAMDA is guaranteed to obtain the best structure possible among all methods converging to the same point, making it the first regularized adaptive method outputting models that possess outstanding predictive performance while being (locally) optimally structured. Extensive numerical experiments in large-scale modern computer vision, language modeling, and speech tasks show that the proposed RAMDA is efficient and consistently outperforms state of the art for training structured neural network. Implementation of our algorithm is available at https://www.github.com/ismoptgroup/RAMDA.
Zih-Syuan Huang, Ching-pei Lee
NeurIPS1
2024 Direct Edge-to-Edge Local-Learning-Assisted Model-Based Transfer Learning
abstract
With the gradual advancement of technology in the production of consumer goods, the Internet-of-Things (IoT) systems have experienced rapid development, resulting in a massive amount of data that can be processed using deep neural networks. However, annotating the data and training the models require significant manpower, time, and computational resources. Transfer learning can address this problem. Traditional systems rely on centralized servers for transfer learning. Although several studies have proposed distributed systems for direct edge-to-edge instance-based and feature-based transfer learning, they neglect model-based transfer learning within the same domain. This leads to lower learning efficiency, lower privacy protection, and higher transmission costs. Therefore, our study proposes direct edge-to-edge local-learning-assisted model-based transfer learning for a direct edge-to-edge many-to-many model-based transfer learning scenario. The method can transfer model structures and weights between distributed devices without relying on powerful centralized servers. The effectiveness of the proposed approach is demonstrated by applying it to various scenarios.
Zih-Syuan Huang, Ching-Hu Lu, I-Shyan Hwang
IEEE Internet Things J.1
2022 Training Structured Neural Networks Through Manifold Identification and Variance Reduction
Zih-Syuan Huang, Ching-pei Lee
ICLR1