| Gradient Information Matters in Policy Optimization by Back-propagating through Model | 0 | 0.34 | 2022 |
| Improved OOD Generalization via Adversarial Training and Pre-training | 0 | 0.34 | 2021 |
| Reweighting Augmented Samples by Minimizing the Maximal Expected Loss | 0 | 0.34 | 2021 |
| Interpreting the Basis Path Set in Neural Networks | 0 | 0.34 | 2021 |
| On The Weight Spectrum Of Pre-Transformed Polar Codes | 0 | 0.34 | 2021 |
| Reweighting Augmented Samples by Minimizing the Maximal Expected Loss. | 0 | 0.34 | 2021 |
| The Complete Affine Automorphism Group of Polar Codes | 0 | 0.34 | 2021 |
| The Scale-Invariant Space for Attention Layer in Neural Network | 1 | 0.43 | 2020 |
| Target transfer Q-learning and its convergence analysis | 1 | 0.36 | 2020 |
| Evaluating Natural Language Generation via Unbalanced Optimal Transport | 0 | 0.34 | 2020 |
| Positively Scale-Invariant Flatness of ReLU Neural Networks. | 0 | 0.34 | 2019 |
| BN-invariant Sharpness Regularizes the Training Model to Better Generalization. | 0 | 0.34 | 2019 |
| OptQuant: Distributed training of neural networks with optimized quantization mechanisms. | 0 | 0.34 | 2019 |
| Off-policy Learning for Multiple Loggers | 0 | 0.34 | 2019 |
| G-SGD: Optimizing ReLU Neural Networks in its Positively Scale-Invariant Space. | 0 | 0.34 | 2019 |
| G-SGD - Optimizing ReLU Neural Networks in its Positively Scale-Invariant Space. | 0 | 0.34 | 2019 |
| Target Transfer Q-Learning and Its Convergence Analysis. | 0 | 0.34 | 2018 |
| Finite Sample Analysis of the GTD Policy Evaluation Algorithms in Markov Setting | 2 | 0.36 | 2018 |
| Differential Equations for Modeling Asynchronous Algorithms. | 2 | 0.38 | 2018 |
| Asynchronous Stochastic Proximal Optimization Algorithms with Variance Reduction. | 5 | 0.44 | 2017 |
| Asynchronous Stochastic Gradient Descent with Delay Compensation. | 14 | 0.66 | 2017 |
| Generalization Error Bounds for Optimization Algorithms via Stability. | 1 | 0.34 | 2017 |
| Convergence Analysis of Distributed Stochastic Gradient Descent with Shuffling. | 8 | 0.70 | 2017 |
| Asynchronous Accelerated Stochastic Gradient Descent. | 2 | 0.37 | 2016 |
| A Probabilistic Method for Estimating the Sharing of Identity by Descent for Populations with Migration. | 0 | 0.34 | 2016 |
| A Communication-Efficient Parallel Algorithm for Decision Tree. | 1 | 0.35 | 2016 |
| Asynchronous Stochastic Gradient Descent with Delay Compensation for Distributed Deep Learning. | 4 | 0.39 | 2016 |
| A new method for modeling coalescent processes with recombination. | 6 | 0.50 | 2014 |
| Generalization Analysis For Game-Theoretic Machine Learning | 4 | 0.39 | 2014 |
| Page importance computation based on Markov processes | 4 | 0.43 | 2011 |
| Comparison of two algorithms for computing page importance | 1 | 0.38 | 2010 |
| A framework to compute page importance based on user behaviors | 14 | 0.75 | 2010 |
| BrowseRank: letting web users vote for page importance | 103 | 3.45 | 2008 |
| Ranking Websites: A Probabilistic View | 1 | 0.44 | 2007 |
| Supervised rank aggregation | 53 | 1.73 | 2007 |
