Penghang Yin

Orcid: 0000-0001-6098-8493

According to our database1, Penghang Yin authored at least 26 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
COMQ: A Backpropagation-Free Algorithm for Post-Training Quantization.
CoRR, 2024

2023
Feature Affinity Assisted Knowledge Distillation and Quantization of Deep Neural Networks on Label-Free Data.
IEEE Access, 2023

2020
Recurrence of Optimum for Training Weight and Activation Quantized Networks.
CoRR, 2020

Learning Quantized Neural Nets by Coarse Gradient Method for Non-linear Classification.
CoRR, 2020

Global Convergence and Geometric Characterization of Slow to Fast Weight Evolution in Neural Network Training for Classifying Linearly Non-Separable Data.
CoRR, 2020

2019
Understanding Straight-Through Estimator in Training Activation Quantized Neural Nets.
Proceedings of the 7th International Conference on Learning Representations, 2019

Non-Ergodic Convergence Analysis of Heavy-Ball Algorithms.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights.
SIAM J. Imaging Sci., 2018

Linear Feature Transform and Enhancement of Classification on Deep Neural Network.
J. Sci. Comput., 2018

Stochastic Backward Euler: An Implicit Gradient Descent Algorithm for k-Means Clustering.
J. Sci. Comput., 2018

Unbalanced and Partial L<sub>1</sub> Monge-Kantorovich Problem: A Scalable Parallel First-Order Method.
J. Sci. Comput., 2018

Computations of Optimal Transport Distance with Fisher Information Regularization.
J. Sci. Comput., 2018

Adversarial Defense via Data Dependent Activation Function and Total Variation Minimization.
CoRR, 2018

Blended Coarse Gradient Descent for Full Quantization of Deep Neural Networks.
CoRR, 2018

Laplacian Smoothing Gradient Descent.
CoRR, 2018

Alternating direction method of multipliers with difference of convex functions.
Adv. Comput. Math., 2018

2017
Deep Learning for Real-Time Crime Forecasting and its Ternarization.
CoRR, 2017

Link Flow Correction For Inconsistent Traffic Flow Data Via 𝓁<sub>1</sub>-Minimization.
CoRR, 2017

2016
A geometric blind source separation method based on facet component analysis.
Signal Image Video Process., 2016

Point Source Super-resolution Via Non-convex L<sub>1</sub> Based Methods.
J. Sci. Comput., 2016

Training Ternary Neural Networks with Exact Proximal Operator.
CoRR, 2016

Iterative ℓ<sub>1</sub> minimization for non-convex compressed sensing.
CoRR, 2016

2015
Minimization of ℓ<sub>1-2</sub> for Compressed Sensing.
SIAM J. Sci. Comput., 2015

Computing Sparse Representation in a Highly Coherent Dictionary Based on Difference of L<sub>1</sub> and L<sub>2</sub>.
J. Sci. Comput., 2015

Transformed Schatten-1 Iterative Thresholding Algorithms for Matrix Rank Minimization and Applications.
CoRR, 2015

2014
Ratio and difference of $l_1$ and $l_2$ norms and sparse representation with coherent dictionaries.
Commun. Inf. Syst., 2014


  Loading...