Ian En-Hsu Yen

Affiliations:
  • University of Texas at Austin, Department of Computer Science


According to our database1, Ian En-Hsu Yen authored at least 39 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
FP8-BERT: Post-Training Quantization for Transformer.
CoRR, 2023

2022
S4: a High-sparsity, High-performance AI Accelerator.
CoRR, 2022

Towards ℓ1 Regularization for Deep Neural Networks: Model Sparsity Versus Task Difficulty.
Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigm.
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2022

2021
Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigm.
CoRR, 2021

Rethinking Network Pruning - under the Pre-train and Fine-tune Paradigm.
Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

2020
Minimizing FLOPs to Learn Efficient Sparse Representations.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Temporal popularity prediction of locations for geographical placement of retail stores.
Knowl. Inf. Syst., 2019

Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Efficient Global String Kernel with Random Features: Beyond Counting Substructures.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Temporal Structure Mining for Weakly Supervised Action Detection.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

2018
Sublinear-Time Learning and Inference for High-Dimensional Models.
PhD thesis, 2018

Learning Tensor Latent Features.
CoRR, 2018

D2KE: From Distance to Kernel and Embedding.
CoRR, 2018

MixLasso: Generalized Mixed Regression via Convex Atomic-Norm Regularization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Representer Point Selection for Explaining Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Scalable Spectral Clustering Using Random Binning Features.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Loss Decomposition for Fast Learning in Large Output Spaces.
Proceedings of the 35th International Conference on Machine Learning, 2018

Word Mover's Embedding: From Word2Vec to Document Embedding.
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

Random Warping Series: A Random Features Method for Time-Series Embedding.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
PPDsparse: A Parallel Primal-Dual Sparse Method for Extreme Classification.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Latent Feature Lasso.
Proceedings of the 34th International Conference on Machine Learning, 2017

Doubly Greedy Primal-Dual Coordinate Descent for Sparse Empirical Risk Minimization.
Proceedings of the 34th International Conference on Machine Learning, 2017

Scalable Convex Multiple Sequence Alignment via Entropy-Regularized Dual Decomposition.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

Greedy Direction Method of Multiplier for MAP Inference of Large Output Domain.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Large-scale Submodular Greedy Exemplar Selection with Structured Similarity Matrices.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Dual Decomposed Learning with Factorwise Oracle for Structural SVM of Large Output Domain.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

A Convex Atomic-Norm Approach to Multiple Sequence Alignment and Motif Discovery.
Proceedings of the 33nd International Conference on Machine Learning, 2016

PD-Sparse : A Primal and Dual Sparse Approach to Extreme Multiclass and Multilabel Classification.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Scalable Exemplar Clustering and Facility Location via Augmented Block Coordinate Descent with Column Generation.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Tackling the Achilles Heel of Social Networks: Influence Propagation based Language Model Smoothing.
Proceedings of the 24th International Conference on World Wide Web, 2015

Sparse Linear Programming via Primal and Dual Augmented Coordinate Descent.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A Dual Augmented Block Minimization Framework for Learning with Limited Memory.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A Convex Exemplar-based Approach to MAD-Bayes Dirichlet Process Mixture Models.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Constant Nullspace Strong Convexity and Fast Convergence of Proximal Methods under High-Dimensional Settings.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Indexed block coordinate descent for large-scale linear classification with limited memory.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013


  Loading...