暂无分享,去创建一个
Maria-Florina Balcan | Ellen Vitercik | Travis Dick | Travis Dick | Maria-Florina Balcan | Ellen Vitercik
[1] Anand D. Sarwate,et al. Differentially Private Empirical Risk Minimization , 2009, J. Mach. Learn. Res..
[2] Tim Roughgarden,et al. A PAC Approach to Application-Specific Algorithm Selection , 2015, SIAM J. Comput..
[3] Tuomas Sandholm,et al. Methods for Boosting Revenue in Combinatorial Auctions , 2004, AAAI.
[4] Anindya De,et al. Lower Bounds in Differential Privacy , 2011, TCC.
[5] Kevin Leyton-Brown,et al. Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees , 2017, IJCAI.
[6] Uri Zwick,et al. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.
[7] Ambuj Tewari,et al. Online Learning: Stochastic, Constrained, and Smoothed Adversaries , 2011, NIPS.
[8] Varun Kanade,et al. Online Optimization of Smoothed Piecewise Constant Functions , 2016, AISTATS.
[9] Noga Alon,et al. Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues , 2017, NIPS.
[10] Joaquin Quiñonero Candela,et al. Practical Lessons from Predicting Clicks on Ads at Facebook , 2014, ADKDD'14.
[11] Santosh S. Vempala,et al. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[12] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[13] Claudio Gentile,et al. On the generalization ability of on-line learning algorithms , 2001, IEEE Transactions on Information Theory.
[14] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[15] Moses Charikar,et al. Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] D. Pollard. Convergence of stochastic processes , 1984 .
[17] Tuomas Sandholm,et al. Approximating Revenue-Maximizing Combinatorial Auctions , 2005, AAAI.
[18] Henk Tijms,et al. Understanding Probability , 2012 .
[19] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[20] Ian Goodfellow,et al. Deep Learning with Differential Privacy , 2016, CCS.
[21] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[22] Avrim Blum,et al. Near-optimal online auctions , 2005, SODA '05.
[23] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[24] Robert D. Kleinberg. Nearly Tight Bounds for the Continuum-Armed Bandit Problem , 2004, NIPS.
[25] Tim Roughgarden,et al. Learning Simple Auctions , 2016, COLT.
[26] Kobbi Nissim,et al. Differentially Private Release and Learning of Threshold Functions , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[27] Peter L. Bartlett,et al. Rademacher and Gaussian Complexities: Risk Bounds and Structural Results , 2003, J. Mach. Learn. Res..
[28] Maria-Florina Balcan,et al. Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems , 2016, COLT.
[29] Maria-Florina Balcan,et al. Sample Complexity of Automated Mechanism Design , 2016, NIPS.
[30] Michael Langberg,et al. The RPR2 rounding technique for semidefinite programs , 2006, J. Algorithms.
[31] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[32] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[33] Roman Garnett,et al. Differentially Private Bayesian Optimization , 2015, ICML.
[34] Guy N. Rothblum,et al. Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[35] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[36] Shai Ben-David,et al. Understanding Machine Learning: From Theory to Algorithms , 2014 .
[37] Sergei Vassilvitskii,et al. Revenue Optimization with Approximate Bid Predictions , 2017, NIPS.
[38] Raef Bassily,et al. Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds , 2014, 1405.7085.
[39] Koichi Yamazaki,et al. A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..
[40] Tim Roughgarden,et al. Minimizing Regret with Multiple Reserves , 2016, EC.
[41] Edith Elkind,et al. Designing and learning optimal finite support auctions , 2007, SODA '07.
[42] Vladimir Koltchinskii,et al. Rademacher penalties and structural risk minimization , 2001, IEEE Trans. Inf. Theory.
[43] Vasilis Syrgkanis,et al. Learning to Bid Without Knowing your Value , 2017, EC.
[44] Sébastien Bubeck,et al. Convex Optimization: Algorithms and Complexity , 2014, Found. Trends Mach. Learn..
[45] Frank Thomson Leighton,et al. The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[46] Yannai A. Gonczarowski,et al. Efficient empirical revenue maximization in single-parameter auction environments , 2016, STOC.
[47] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[48] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[49] Tim Roughgarden,et al. Ironing in the Dark , 2015, EC.
[50] R. D. Gordon. Values of Mills' Ratio of Area to Bounding Ordinate and of the Normal Probability Integral for Large Values of the Argument , 1941 .
[51] Haipeng Luo,et al. Oracle-Efficient Learning and Auction Design , 2016, ArXiv.
[52] Tuomas Sandholm,et al. Automated Design of Revenue-Maximizing Combinatorial Auctions , 2015, Oper. Res..
[53] R. Dudley. The Sizes of Compact Subsets of Hilbert Space and Continuity of Gaussian Processes , 1967 .
[54] Claudio Gentile,et al. Ieee Transactions on Information Theory 1 Regret Minimization for Reserve Prices in Second-price Auctions , 2022 .
[55] Vasilis Syrgkanis. A Sample Complexity Measure with Applications to Learning Optimal Auctions , 2017, NIPS.
[56] Yang Cai,et al. Learning Multi-Item Auctions with (or without) Samples , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[57] Mehryar Mohri,et al. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve , 2013, ICML.
[58] Kunal Talwar,et al. Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[59] Nikhil R. Devanur,et al. Online Auctions and Multi-scale Online Learning , 2017, EC.
[60] Anna R. Karlin,et al. A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders , 2016, WINE.
[61] Tim Roughgarden,et al. Making the Most of Your Samples , 2018, SIAM J. Comput..