← Search

Shangling Jui

16 accepted papers

2024

A Theory of Non-acyclic Generative Flow Networks

AAAI 2024technical

GFlowNets is a novel flow-based method for learning a stochastic policy to generate objects via a sequence of actions and with probability proportional to a given positive reward. We contribute to relaxing hypotheses limiting the application range of GFlowNets, in particular: acyclicity (or lack the…

Cited by 4SourcePDFScholar
2024

Rethinking Optimization and Architecture for Tiny Language Models

ICML 2024poster

The power of large language models (LLMs) has been demonstrated through numerous data and computing resources. However, the application of language models on mobile devices is facing huge challenge on the computation and memory costs, that is, tiny language models with high performance are urgently…

2023

AIO-P: Expanding Neural Performance Predictors beyond Image Classification

AAAI 2023technical

Evaluating neural network performance is critical to deep neural network design but a costly procedure. Neural predictors provide an efficient solution by treating architectures as samples and learning to estimate their performance on a given task. However, existing predictors are task-dependent, pr…

2023

AutoGO: Automated Computation Graph Optimization for Neural Network Evolution

NeurIPS 2023poster

Optimizing Deep Neural Networks (DNNs) to obtain high-quality models for efficient real-world deployment has posed multi-faceted challenges to machine learning engineers. Existing methods either search for neural architectures in heuristic design spaces or apply low-level adjustments to computation…

2023

GENNAPE: Towards Generalized Neural Architecture Performance Estimators

AAAI 2023technical

Predicting neural architecture performance is a challenging task and is crucial to neural architecture design and search. Existing approaches either rely on neural performance predictors which are limited to modeling architectures in a predefined design space involving specific sets of operators and…

2023

Reparameterization through Spatial Gradient Scaling

ICLR 2023poster

Reparameterization aims to improve the generalization of deep neural networks by transforming a convolution operation into equivalent multi-branched structures during training. However, there exists a gap in understanding how reparameterization may change and benefit learning processes for neural ne…

2022

Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation

NeurIPS 2022accept

We propose a simple but effective source-free domain adaptation (SFDA) method. Treating SFDA as an unsupervised clustering problem and following the intuition that local neighbors in feature space should have more similar predictions than other features, we propose to optimize an objective of predic…

2022

Distilling GANs with Style-Mixed Triplets for X2I Translation with Limited Data

ICLR 2022poster

Conditional image synthesis is an integral part of many X2I translation systems, including image-to-image, text-to-image and audio-to-image translation systems. Training these large systems generally requires huge amounts of training data. Therefore, we investigate knowledge distillation to transfe…

Cited by 2SourcePDFScholar
2022

R5: Rule Discovery with Reinforced and Recurrent Relational Reasoning

ICLR 2022spotlight

Systematicity, i.e., the ability to recombine known parts and rules to form new sequences while reasoning over relational data, is critical to machine intelligence. A model with strong systematicity is able to train on small-scale tasks and generalize to large-scale tasks. In this paper, we propose…

2022

Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability

AAAI 2022technical

Sample average approximation (SAA), a popular method for tractably solving stochastic optimization problems, enjoys strong asymptotic performance guarantees in settings with independent training samples. However, these guarantees are not known to hold generally with dependent samples, such as in onl…

Cited by 10SourcePDFScholar
2021

Damped Anderson Mixing for Deep Reinforcement Learning: Acceleration, Convergence, and Stabilization

NeurIPS 2021poster

Anderson mixing has been heuristically applied to reinforcement learning (RL) algorithms for accelerating convergence and improving the sampling efficiency of deep RL. Despite its heuristic improvement of convergence, a rigorous mathematical justification for the benefits of Anderson mixing in RL ha…

Cited by 19SourcePDFScholar
2021

Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptation

NeurIPS 2021poster

Domain adaptation (DA) aims to alleviate the domain shift between source domain and target domain. Most DA methods require access to the source data, but often that is not possible (e.g. due to data privacy or intellectual property). In this paper, we address the challenging source-free domain adapt…

2021

Generalized Source-Free Domain Adaptation

ICCV 2021poster

Domain adaptation (DA) aims to transfer the knowledge learned from source domain to an unlabeled target domain. Some recent works tackle source-free domain adaptation (SFDA) where only source pre-trained model is available for adaptation to target domain. However those methods does not consider keep…

Cited by 324PDFcodeScholar
2021

Generative Adversarial Neural Architecture Search

IJCAI 2021poster

Despite the empirical success of neural architecture search (NAS) in deep learning applications, the optimality, reproducibility and cost of NAS schemes remain hard to assess. In this paper, we propose Generative Adversarial NAS (GA-NAS) with theoretically provable convergence guarantees, promoting…

Cited by 14SourcePDFScholar
2021

ReNAS: Relativistic Evaluation of Neural Architecture Search

CVPR 2021poster

An effective and efficient architecture performance evaluation scheme is essential for the success of Neural Architecture Search (NAS). To save computational cost, most of existing NAS algorithms often train and evaluate intermediate neural architectures on a small proxy dataset with limited trainin…

Cited by 106PDFcodeScholar
2020

Semantic Drift Compensation for Class-Incremental Learning

CVPR 2020poster

Class-incremental learning of deep networks sequentially increases the number of classes to be classified. During training, the network has only access to data of one task at a time, where each task contains several classes. In this setting, networks suffer from catastrophic forgetting which refers…

Cited by 413PDFcodeScholar