Non-parametric binary regression in metric spaces with logarithmic loss
From MaRDI portal
Cites work
- A distribution-free theory of nonparametric regression
- A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming
- A fully nonparametric modeling approach to binary regression
- A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
- Adaptive metric dimensionality reduction
- All of Nonparametric Statistics
- Analytic Extensions of Differentiable Functions Defined in Closed Sets
- Balls and bins: A study in negative dependence
- Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss
- Computing Maximum Likelihood Estimators of Convex Density Functions
- Convex Optimization, Shape Constraints, Compound Decisions, and Empirical Bayes Rules
- Distance-based classification with Lipschitz functions
- Efficient Classification for Metric Data
- Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
- Extension of range of functions
- Fast learning rates for plug-in classifiers
- Foundations of machine learning
- Gaussian processes for machine learning.
- Introducing interior-point methods for introductory operations research courses and/or linear programming courses
- Introduction to nonparametric estimation
- Introductory lectures on convex optimization. A basic course.
- Minimax nonparametric classification .I. Rates of convergence
- Nonlinear models using Dirichlet process mixtures
- Nonparametric binary regression using a Gaussian process prior
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Rates of contraction of posterior distributions based on Gaussian process priors
- Smoothing methods in statistics
This page was built for publication: Non-parametric binary regression in metric spaces with logarithmic loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355849)
