2 7 Ju l 2 01 9 Bayesian Robustness : A Nonasymptotic Viewpoint
暂无分享,去创建一个
[1] Sivaraman Balakrishnan,et al. Robust estimation via robust gradient estimation , 2018, Journal of the Royal Statistical Society: Series B (Statistical Methodology).
[2] Pradeep Ravikumar,et al. Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression , 2019, COLT.
[3] Michael I. Jordan,et al. Sampling can be faster than optimization , 2018, Proceedings of the National Academy of Sciences.
[4] Jerry Li,et al. Sever: A Robust Meta-Algorithm for Stochastic Optimization , 2018, ICML.
[5] David B. Dunson,et al. Robust Bayesian Inference via Coarsening , 2015, Journal of the American Statistical Association.
[6] Pravesh Kothari,et al. Efficient Algorithms for Outlier-Robust Regression , 2018, COLT.
[7] Martin J. Wainwright,et al. Log-concave sampling: Metropolis-Hastings algorithms are fast! , 2018, COLT.
[8] Peter L. Bartlett,et al. Convergence of Langevin MCMC in KL-divergence , 2017, ALT.
[9] Chong Wang,et al. A General Method for Robust Bayesian Modeling , 2015, Bayesian Analysis.
[10] Prateek Jain,et al. Consistent Robust Regression , 2017, NIPS.
[11] David M. Blei,et al. Robust Probabilistic Modeling with Bayesian Data Reweighting , 2016, ICML.
[12] David B. Dunson,et al. Robust and Scalable Bayes via a Median of Subset Posterior Measures , 2014, J. Mach. Learn. Res..
[13] Santosh S. Vempala,et al. Agnostic Estimation of Mean and Covariance , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Daniel M. Kane,et al. Robust Estimators in High Dimensions without the Computational Intractability , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[15] É. Moulines,et al. Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm , 2015, 1507.05021.
[16] Prateek Jain,et al. Robust Regression via Hard Thresholding , 2015, NIPS.
[17] A. Dalalyan. Theoretical guarantees for approximate sampling from smooth and log‐concave densities , 2014, 1412.7392.
[18] T. L. McCluskey,et al. An assessment of features related to phishing websites using an automated technique , 2012, 2012 International Conference for Internet Technology and Secured Transactions.
[19] R. Schilling,et al. Brownian Motion: An Introduction to Stochastic Processes , 2012 .
[20] Maxim Sviridenko,et al. Concentration and moment inequalities for polynomials of independent random variables , 2012, SODA.
[21] Yee Whye Teh,et al. Bayesian Learning via Stochastic Gradient Langevin Dynamics , 2011, ICML.
[22] Radford M. Neal. MCMC Using Hamiltonian Dynamics , 2011, 1206.1901.
[23] Chih-Jen Lin,et al. A Practical Guide to Support Vector Classication , 2008 .
[24] C. Villani,et al. Generalization of an Inequality by Talagrand and Links with the Logarithmic Sobolev Inequality , 2000 .
[25] J. Rosenthal,et al. Optimal scaling of discrete approximations to Langevin diffusions , 1998 .
[26] R. Tweedie,et al. Exponential convergence of Langevin distributions and their discrete approximations , 1996 .
[27] R. Tweedie,et al. Rates of convergence of the Hastings and Metropolis algorithms , 1996 .
[28] James O. Berger,et al. An overview of robust Bayesian analysis , 1994 .
[29] Miklós Simonovits,et al. Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.
[30] Frederick R. Forst,et al. On robust estimation of the location parameter , 1980 .
[31] D. Ermak. A computer simulation of charged particles in solution. I. Technique and equilibrium properties , 1975 .
[32] P. J. Huber. Robust Regression: Asymptotics, Conjectures and Monte Carlo , 1973 .
[33] Bruno De Finetti,et al. The Bayesian Approach to the Rejection of Outliers , 1961 .
[34] J. Tukey. A survey of sampling from contaminated distributions , 1960 .