{"list":"other","total":52,"rows":[{"id":"1610.05820","title":"Membership Inference Attacks against Machine Learning Models","created":"2016-10-18","cited_by_count":2281},{"id":"2012.07805","title":"Extracting Training Data from Large Language Models","created":"2020-12-14","cited_by_count":2189},{"id":"1611.03530","title":"Understanding deep learning requires rethinking generalization","created":"2016-11-10","cited_by_count":1674},{"id":"2112.03570","title":"Membership Inference Attacks From First Principles","created":"2021-12-07","cited_by_count":878},{"id":"1802.08232","title":"The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networks","created":"2018-02-22","cited_by_count":864},{"id":"2202.07646","title":"Quantifying Memorization Across Neural Language Models","created":"2022-02-15","cited_by_count":763},{"id":"2008.03703","title":"What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation","created":"2020-08-09","cited_by_count":497},{"id":"1906.05271","title":"Does Learning Require Memorization? A Short Tale about a Long Tail","created":"2019-06-12","cited_by_count":460},{"id":"1705.07809","title":"Information-theoretic analysis of generalization capability of learning algorithms","created":"2017-05-22","cited_by_count":303},{"id":"2110.11216","title":"User-friendly introduction to PAC-Bayes bounds","created":"2021-10-21","cited_by_count":239},{"id":"2006.06914","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","created":"2020-06-12","cited_by_count":173},{"id":"2001.09122","title":"Reasoning About Generalization via Conditional Mutual Information","created":"2020-01-24","cited_by_count":147},{"id":"2206.07758","title":"Reconstructing Training Data from Trained Neural Networks","created":"2022-06-15","cited_by_count":133},{"id":"1911.02151","title":"Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates","created":"2019-11-06","cited_by_count":119},{"id":"1901.04609","title":"Tightening Mutual Information Based Bounds on Generalization Error","created":"2019-01-15","cited_by_count":117},{"id":"1902.03736","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","created":"2019-02-11","cited_by_count":106},{"id":"1805.00216","title":"Privately Learning High-Dimensional Distributions","created":"2018-05-01","cited_by_count":104},{"id":"2012.06421","title":"When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?","created":"2020-12-11","cited_by_count":104},{"id":"1902.10710","title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","created":"2019-02-27","cited_by_count":98},{"id":"1511.05219","title":"How much does your data exploration overfit? Controlling bias via information usage","created":"2015-11-16","cited_by_count":95},{"id":"2004.12983","title":"Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms","created":"2020-04-27","cited_by_count":89},{"id":"1902.04217","title":"VC Classes are Adversarially Robustly Learnable, but Only Improperly","created":"2019-02-12","cited_by_count":83},{"id":"1311.3158","title":"Fingerprinting Codes and the Price of Approximate Differential Privacy","created":"2013-11-13","cited_by_count":82},{"id":"2203.01550","title":"A Characterization of Multiclass Learnability","created":"2022-03-03","cited_by_count":67},{"id":"2309.04381","title":"Generalization Bounds: Perspectives from Information Theory and PAC-Bayes","created":"2023-09-08","cited_by_count":61},{"id":"2005.11818","title":"Proper Learning, Helly Number, and an Optimal SVM Bound","created":"2020-05-24","cited_by_count":53},{"id":"2110.01584","title":"Information-theoretic generalization bounds for black-box learning algorithms","created":"2021-10-04","cited_by_count":49},{"id":"1503.06960","title":"Sample compression schemes for VC classes","created":"2015-03-24","cited_by_count":47},{"id":"2102.01117","title":"SGD Generalizes Better Than GD (And Regularization Doesn't Help)","created":"2021-02-01","cited_by_count":38},{"id":"1608.04414","title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","created":"2016-08-15","cited_by_count":37},{"id":"2106.09683","title":"PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes","created":"2021-06-17","cited_by_count":31},{"id":"2012.09922","title":"Individually Conditional Individual Mutual Information Bound on Generalization Error","created":"2020-12-17","cited_by_count":30},{"id":"2111.05275","title":"Towards a Unified Information-Theoretic Framework for Generalization","created":"2021-11-09","cited_by_count":30},{"id":"2010.10994","title":"On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm","created":"2020-10-21","cited_by_count":28},{"id":"2010.12039","title":"Reducing Adversarially Robust Learning to Non-Robust PAC Learning","created":"2020-10-22","cited_by_count":28},{"id":"2006.13508","title":"A Limitation of the PAC-Bayes Framework","created":"2020-06-24","cited_by_count":25},{"id":"2102.02145","title":"Adversarially Robust Learning with Unknown Perturbation Sets","created":"2021-02-03","cited_by_count":24},{"id":"2307.03848","title":"Optimal Learners for Realizable Regression: PAC Learning and Online Learning","created":"2023-07-07","cited_by_count":23},{"id":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19},{"id":"2212.13556","title":"Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization","created":"2022-12-27","cited_by_count":19},{"id":"2209.07369","title":"Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization","created":"2022-09-15","cited_by_count":17},{"id":"2302.04925","title":"Information Theoretic Lower Bounds for Information Theoretic Upper Bounds","created":"2023-02-09","cited_by_count":17},{"id":"2003.06152","title":"Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study","created":"2020-03-13","cited_by_count":16},{"id":"2206.14800","title":"Understanding Generalization via Leave-One-Out Conditional Mutual Information","created":"2022-06-29","cited_by_count":16},{"id":"2107.00469","title":"Never Go Full Batch (in Stochastic Convex Optimization)","created":"2021-06-29","cited_by_count":14},{"id":"1404.1504","title":"A Compression Technique for Analyzing Disagreement-Based Active Learning","created":"2014-04-05","cited_by_count":11},{"id":"2206.04743","title":"Strong Memory Lower Bounds for Learning Natural Models","created":"2022-06-09","cited_by_count":11},{"id":"2210.06511","title":"Evaluated CMI Bounds for Meta Learning: Tightness and Expressiveness","created":"2022-10-12","cited_by_count":11},{"id":"1705.08184","title":"Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions","created":"2017-05-23","cited_by_count":8},{"id":"1810.01864","title":"Agnostic Sample Compression Schemes for Regression","created":"2018-10-03","cited_by_count":7},{"id":"1804.05474","title":"A Direct Sum Result for the Information Complexity of Learning","created":"2018-04-16","cited_by_count":6},{"id":"2310.20102","title":"Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Bounds","created":"2023-10-31","cited_by_count":6}],"next_cursor":null}