Approximation error from discretizations and its applications
From MaRDI portal
Cites work
- A convex formulation for high-dimensional sparse sliced inverse regression
- A graphical tool for selecting the number of slices and the dimension of the model in SIR and SAVE approaches
- A Simple and Effective Discretization of a Continuous Random Variable
- An asymptotic theory for sliced inverse regression
- An effective discretization method for disposing high-dimensional data
- Application of the Bootstrap Approach to the Choice of Dimension and the α Parameter in the SIRαMethod
- Approximation error from discretizations and its applications
- Bagging predictors
- Discretization for Naive-Bayes learning: managing discretization bias and variance
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Empirical-Bias Bandwidths for Local Polynomial Nonparametric Regression and Density Estimation
- Estimation and Inference of Heterogeneous Treatment Effects using Random Forests
- Estimation of a continuous distribution on the real line by discretization methods
- Fused estimators of the central subspace in sufficient dimension reduction
- Generalized random forests
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 469135 (Why is no real title available?)
- scientific article; zbMATH DE number 788275 (Why is no real title available?)
- scientific article; zbMATH DE number 854954 (Why is no real title available?)
- scientific article; zbMATH DE number 5681750 (Why is no real title available?)
- Introduction to nonparametric estimation
- Locally Adaptive Bandwidth Choice for Kernel Regression Estimators
- Multivariate discretization for set mining
- Nonparametric K-sample tests via dynamic slicing
- On Sliced Inverse Regression With High-Dimensional Covariates
- Optimal quantization applied to sliced inverse regression
- Optimal rates of convergence for nonparametric estimators
- Random forests
- Random Forests and Adaptive Nearest Neighbors
- Random Forests and Kernel Methods
- Sliced Inverse Regression for Dimension Reduction
- Smooth Location-Dependent Bandwidth Selection for Local Polynomial Regression
- Sparse minimum discrepancy approach to sufficient dimension reduction with simultaneous variable selection in ultrahigh dimension
- Sparse sliced inverse regression via Lasso
- Subspace Estimation with Automatic Dimension and Variable Selection in Sufficient Dimension Reduction
- Sur les équations aux dérivées partielles de la physique mathématique.
Cited in
(2)
This page was built for publication: Approximation error from discretizations and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974381)
