default search action
Ting Hu 0002
Person information
- affiliation (PhD 2009): Wuhan University, School of Mathematics and Statistics, China
Other persons with the same name
- Ting Hu — disambiguation page
- Ting Hu 0001
— Queen's University, Kingston, Canada (and 2 more)
- Ting Hu 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Cheng Wang, Ting Hu
Pairwise learning problems with regularization networks and Nyström subsampling approach. Neural Networks 157: 176-192 (2023) - 2022
- [j14]Ting Hu, Yunwen Lei:
Early Stopping for Iterative Regularization with General Loss Functions. J. Mach. Learn. Res. 23: 339:1-339:36 (2022) - 2021
- [j13]Ting Hu, Qiang Wu, Ding-Xuan Zhou:
Kernel gradient descent algorithm for information theoretic learning. J. Approx. Theory 263: 105518 (2021) - [j12]Yunwen Lei, Ting Hu, Ke Tang:
Generalization Performance of Multi-pass Stochastic Gradient Descent with Convex Loss Functions. J. Mach. Learn. Res. 22: 25:1-25:41 (2021) - 2020
- [j11]Xin Guo
Distributed Minimum Error Entropy Algorithms. J. Mach. Learn. Res. 21: 126:1-126:31 (2020) - [j10]Yunwen Lei
Stochastic Gradient Descent for Nonconvex Learning Without Bounded Gradient Assumptions. IEEE Trans. Neural Networks Learn. Syst. 31(10): 4394-4400 (2020)
2010 – 2019
- 2019
- [j9]Baobin Wang, Ting Hu
Online Gradient Descent for Kernel-Based Maximum Correntropy Criterion. Entropy 21(7): 644 (2019) - [j8]Baobin Wang, Ting Hu
Distributed pairwise algorithms with gradient descent methods. Neurocomputing 333: 364-373 (2019) - [j7]Weiping Liu, Jia Sun, Wanyi Li
Deep Learning on Point Clouds and Its Application: A Survey. Sensors 19(19): 4188 (2019) - [i3]Yunwen Lei, Ting Hu, Ke Tang:
Stochastic Gradient Descent for Nonconvex Learning without Bounded Gradient Assumptions. CoRR abs/1902.00908 (2019) - 2018
- [j6]Baobin Wang, Ting Hu:
Semi-Supervised Minimum Error Entropy Principle with Distributed Method. Entropy 20(12): 968 (2018) - 2016
- [j5]Ting Hu, Qiang Wu
Convergence of Gradient Descent for Minimum Error Entropy Principle in Linear Regression. IEEE Trans. Signal Process. 64(24): 6571-6579 (2016) - 2014
- [i2]Jun Fan, Ting Hu, Qiang Wu, Ding-Xuan Zhou:
Consistency Analysis of an Empirical Minimum Error Entropy Algorithm. CoRR abs/1412.5272 (2014) - 2013
- [j4]Ting Hu, Jun Fan, Qiang Wu, Ding-Xuan Zhou:
Learning theory approach to minimum error entropy criterion. J. Mach. Learn. Res. 14(1): 377-397 (2013) - 2012
- [j3]Dao-Hong Xiang, Ting Hu, Ding-Xuan Zhou
Approximation Analysis of Learning Algorithms for Support Vector Regression and Quantile Regression. J. Appl. Math. 2012: 902139:1-902139:17 (2012) - [i1]Ting Hu, Jun Fan, Qiang Wu, Ding-Xuan Zhou:
Learning Theory Approach to Minimum Error Entropy Criterion. CoRR abs/1208.0848 (2012) - 2011
- [j2]Dao-Hong Xiang, Ting Hu, Ding-Xuan Zhou
Learning with varying insensitive loss. Appl. Math. Lett. 24(12): 2107-2109 (2011)
2000 – 2009
- 2009
- [j1]Ting Hu, Ding-Xuan Zhou:
Online Learning with Samples Drawn from Non-identical Distributions. J. Mach. Learn. Res. 10: 2873-2898 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: