Pages that link to "Item:Q5856264"
From MaRDI portal
The following pages link to Optimal learning with Gaussians and correntropy loss (Q5856264):
Displaying 24 items.
- Online gradient descent algorithms for functional data learning (Q2121498) (← links)
- Fast rates of minimum error entropy with heavy-tailed noise (Q2168008) (← links)
- Learning with correntropy-induced losses for regression with mixture of symmetric stable noise (Q2300760) (← links)
- Error analysis on regularized regression based on the maximum correntropy criterion (Q2668572) (← links)
- Classification with Gaussians and convex loss (Q2880932) (← links)
- (Q3638009) (← links)
- A Statistical Learning Approach to Modal Regression (Q4969033) (← links)
- (Q4969074) (← links)
- New Insights Into Learning With Correntropy-Based Regression (Q5004288) (← links)
- Comparison theorems on large-margin learning (Q5022946) (← links)
- Learning theory of minimum error entropy under weak moment conditions (Q5037873) (← links)
- (Q5149018) (← links)
- Robust kernel-based distribution regression (Q5157866) (← links)
- Asymptotic properties of Kantorovich-type Szász-Mirakjan operators of higher order (Q6112833) (← links)
- Convergence theorems in Orlicz and Bögel continuous functions spaces by means of Kantorovich discrete type sampling operators (Q6112839) (← links)
- Some new inequalities and numerical results of bivariate Bernstein-type operator including Bézier basis and its GBS operator (Q6112850) (← links)
- On approximation of unbounded functions by certain modified Bernstein operators (Q6112851) (← links)
- Linear combinations of two Bernstein polynomials (Q6112858) (← links)
- On wavelet type generalized Bézier operators (Q6167867) (← links)
- On the convergence of gradient descent for robust functional linear regression (Q6564669) (← links)
- Distributed robust regression with correntropy losses and regularization kernel networks (Q6564882) (← links)
- Moduli of smoothness, \(K\)-functionals and Jackson-type inequalities associated with Kernel function approximation in learning theory (Q6587592) (← links)
- Approximation by modified Bernstein polynomials based on real parameters (Q6633204) (← links)
- Optimality of robust online learning (Q6645952) (← links)