Quick sensitivity analysis for incremental data modification and its application to leave-one-out CV in linear classification problems

Knowledge Discovery and Data Mining (KDD), 2015

11 April 2015

Papers citing "Quick sensitivity analysis for incremental data modification and its application to leave-one-out CV in linear classification problems"

10 / 10 papers shown

Distributionally Robust Safe Sample Screening

Hiroyuki Hanada

Aoyama Tatsuya

Akahane Satoshi

...

Hanju Lee

Ichiro Takeuchi

167

10 Jun 2024

Distributionally Robust Safe Screening

...

186

25 Apr 2024

Probing the Transition to Dataset-Level Privacy in ML Models Using an Output-Specific and Data-Resolved Privacy Profile

Elliott Zaresky-Williams

Edward Raff

Brian Testa

212

27 Jun 2023

Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning

302

23 Jun 2023

Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data ModificationsNeural Computation (Neural Comput.), 2023

282

22 Jun 2023

Tighter Bound Estimation of Sensitivity Analysis for Incremental and Decremental Data Modification

Gao Huang

229

06 Mar 2020

Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values

278

01 Mar 2018

Safe Triplet Screening for Distance Metric Learning

Tomoki Yoshida

Ichiro Takeuchi

Masayuki Karasuyama

324

12 Feb 2018

Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization

204

01 Jun 2016

Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization

191

15 Feb 2016