Beyond worst-case analysis

The need for deeply understanding when algorithms work (or not) has never been greater.

[1]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[2]  Bodo Manthey,et al.  Smoothed Analysis of the k-Means Method , 2011, JACM.

[3]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS.

[4]  Michael I. Jordan,et al.  How to Escape Saddle Points Efficiently , 2017, ICML.

[5]  M. Dorigo,et al.  More Examples , 2004 .

[6]  Heiko Röglin.  Smoothed Analysis , 2016, Encyclopedia of Algorithms.

[7]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[8]  Pravesh Kothari,et al.  A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[9]  Daniel Dadush,et al.  A friendly smoothed analysis of the simplex method , 2017, STOC.

[10]  Susanne Albers,et al.  On paging with locality of reference , 2002, STOC '02.

[11]  Santosh S. Vempala,et al.  Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.

[12]  Noga Alon,et al.  Finding a large hidden clique in a random graph , 1998, SODA '98.

[13]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[14]  Avrim Blum,et al.  Center-based clustering under perturbation stability , 2010, Inf. Process. Lett..

[15]  Robert Elsässer,et al.  Settling the Complexity of Local Max-Cut (Almost) Completely , 2010, ICALP.

[16]  Heiko Röglin,et al.  Smoothed Analysis of Local Search for the Maximum-Cut Problem , 2017, ACM Trans. Algorithms.

[17]  Nathan Linial,et al.  Are Stable Instances Easy? , 2009, Combinatorics, Probability and Computing.

[18]  Jerry Li,et al.  Being Robust (in High Dimensions) Can Be Practical , 2017, ICML.

[19]  Maria-Florina Balcan,et al.  Clustering under approximation stability , 2013, JACM.

[20]  Cristopher Moore,et al.  The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness , 2017, Bull. EATCS.

[21]  Aravindan Vijayaraghavan,et al.  Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut , 2013, SODA.

[22]  Shai Ben-David,et al.  Clusterability: A Theoretical Study , 2009, AISTATS.

[23]  Santosh S. Vempala,et al.  Latent Semantic Indexing , 2000, PODS 2000.

[24]  K. Borgwardt.  The Simplex Method: A Probabilistic Analysis , 1986 .

[25]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[26]  Tim Roughgarden,et al.  A PAC Approach to Application-Specific Algorithm Selection , 2015, SIAM J. Comput..

[27]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[28]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[29]  Michael E. Saks,et al.  Clustering is difficult only when it does not matter , 2012, ArXiv.

[30]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[31]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[32]  Behnam Neyshabur,et al.  Implicit Regularization in Deep Learning , 2017, ArXiv.

[33]  Geoffrey E. Hinton,et al.  Deep Learning , 2015, Nature.

[34]  Amit Kumar,et al.  Clustering with Spectral Norm and the k-Means Algorithm , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[35]  Konstantin Makarychev,et al.  Algorithms for stable and perturbation-resilient problems , 2017, STOC.

[36]  Samy Bengio,et al.  Understanding deep learning requires rethinking generalization , 2016, ICLR.

[37]  Yuval Peres,et al.  Local max-cut in smoothed polynomial time , 2017, STOC.

[38]  Tim Roughgarden,et al.  A PAC Approach to Application-Specific Algorithm Selection , 2017, SIAM J. Comput..

[39]  Ankur Moitra,et al.  How robust are reconstruction thresholds for community detection? , 2015, STOC.

[40]  Uriel Feige,et al.  Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..

[41]  Sanjeev Arora,et al.  A Practical Algorithm for Topic Modeling with Provable Guarantees , 2012, ICML.