Differentially Private Sliced Inverse Regression: Minimax Optimality and Algorithm
From MaRDI portal
Cites work
- A statistical framework for differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Asymptotic Distribution-Free Independence Test for High-Dimension Data
- Causal discoveries for high dimensional mixed data
- Comment
- Contour regression: a general approach to dimension reduction
- Differentially private inference via noisy optimization
- Error variance estimation in ultrahigh-dimensional additive models
- High-dimensional statistics. A non-asymptotic viewpoint
- Model-Free Feature Screening and FDR Control With Knockoff Features
- On almost linearity of low dimensional projections from high dimensional data
- On consistency and sparsity for sliced inverse regression in high dimensions
- On Sliced Inverse Regression With High-Dimensional Covariates
- On the optimality of sliced inverse regression in high dimensions
- Online sufficient dimension reduction through sliced inverse regression
- Sequential sufficient dimension reduction for large \(p\), small \(n\) problems
- Sliced Inverse Regression for Dimension Reduction
- Sparse SIR: optimal rates and adaptive estimation
- Sparse sliced inverse regression via Lasso
- Statistical foundations of data science
- Sufficient dimension reduction: methods and applications with R
- Testing predictor contributions in sufficient dimension reduction.
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
- Theory of Cryptography
This page was built for publication: Differentially Private Sliced Inverse Regression: Minimax Optimality and Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320026)
