{"total":88,"rows":[{"id":"2204.13650","title":"Unlocking High-Accuracy Differentially Private Image Classification through Scale","created":"2022-04-28","cited_by_count":224,"area":null},{"id":"2106.04378","title":"Adaptive Machine Unlearning","created":"2021-06-08","cited_by_count":176,"area":"safety"},{"id":"2102.13179","title":"Machine Unlearning via Algorithmic Stability","created":"2021-02-25","cited_by_count":130,"area":"safety"},{"id":"2305.08846","title":"Privacy Auditing with One (1) Training Run","created":"2023-05-15","cited_by_count":123,"area":null},{"id":"2110.03620","title":"Hyperparameter Tuning with Renyi Differential Privacy","created":"2021-10-07","cited_by_count":104,"area":null},{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"id":"2103.01278","title":"Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2021-03-01","cited_by_count":51,"area":null},{"id":"2110.01584","title":"Information-theoretic generalization bounds for black-box learning algorithms","created":"2021-10-04","cited_by_count":49,"area":null},{"id":"2203.01255","title":"Low-Degree Multicalibration","created":"2022-03-02","cited_by_count":45,"area":null},{"id":"2201.08430","title":"Reproducibility in Learning","created":"2022-01-20","cited_by_count":44,"area":null},{"id":"2303.12921","title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","created":"2023-03-22","cited_by_count":42,"area":null},{"id":"2102.08598","title":"Leveraging Public Data for Practical Private Query Release","created":"2021-02-17","cited_by_count":39,"area":null},{"id":"2302.10863","title":"A Unifying Perspective on Multi-Calibration: Game Dynamics for Multi-Objective Learning","created":"2023-02-21","cited_by_count":30,"area":null},{"id":"2202.01312","title":"Causal Imitation Learning under Temporally Correlated Noise","created":"2022-02-02","cited_by_count":28,"area":"offlinerl"},{"id":"2201.10408","title":"An Algorithmic Framework for Bias Bounties","created":"2022-01-25","cited_by_count":21,"area":null},{"id":"2206.01349","title":"On the Privacy Properties of GAN-generated Samples","created":"2022-06-03","cited_by_count":17,"area":"safety"},{"id":"2305.14311","title":"Statistical Indistinguishability of Learning Algorithms","created":"2023-05-23","cited_by_count":17,"area":null},{"id":"2101.06640","title":"Estimating informativeness of samples with Smooth Unique Information","created":"2021-01-17","cited_by_count":15,"area":null},{"id":"2102.02976","title":"Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels","created":"2021-02-05","cited_by_count":15,"area":null},{"id":"2507.06969","title":"Unifying Re-Identification, Attribute Inference, and Data Reconstruction Risks in Differential Privacy","created":"2025-07-09","cited_by_count":15,"area":null},{"id":"2105.01747","title":"Information Complexity and Generalization Bounds","created":"2021-05-04","cited_by_count":14,"area":null},{"id":"2209.01687","title":"Reconciling Individual Probability Forecasts","created":"2022-09-04","cited_by_count":14,"area":null},{"id":"2209.07312","title":"Multicalibrated Regression for Downstream Fairness","created":"2022-09-15","cited_by_count":14,"area":null},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14,"area":null},{"id":"2304.02240","title":"List and Certificate Complexities in Replicable Learning","created":"2023-04-05","cited_by_count":13,"area":null},{"id":"2111.10352","title":"On the power of adaptivity in statistical adversaries","created":"2021-11-19","cited_by_count":12,"area":null},{"id":"2301.13334","title":"A Bias-Accuracy-Privacy Trilemma for Statistical Estimation","created":"2023-01-30","cited_by_count":12,"area":null},{"id":"2204.03230","title":"What You See is What You Get: Principled Deep Learning via Distributional Generalization","created":"2022-04-07","cited_by_count":11,"area":null},{"id":"2305.12100","title":"How Spurious Features Are Memorized: Precise Analysis for Random and NTK Features","created":"2023-05-20","cited_by_count":11,"area":null},{"id":"2110.11688","title":"Differentially Private Coordinate Descent for Composite Empirical Risk Minimization","created":"2021-10-22","cited_by_count":10,"area":null},{"id":"2208.05949","title":"Valid Inference After Causal Discovery","created":"2022-08-11","cited_by_count":10,"area":null},{"id":"2310.20579","title":"Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks","created":"2023-10-31","cited_by_count":10,"area":null},{"id":"2107.14527","title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","created":"2021-07-30","cited_by_count":9,"area":null},{"id":"2201.08704","title":"Adaptive Data Analysis with Correlated Observations","created":"2022-01-21","cited_by_count":9,"area":null},{"id":"2302.05707","title":"On Differential Privacy and Adaptive Data Analysis with Bounded Space","created":"2023-02-11","cited_by_count":9,"area":null},{"id":"2302.08661","title":"Subsampling Suffices for Adaptive Data Analysis","created":"2023-02-17","cited_by_count":9,"area":null},{"id":"2102.13189","title":"Rip van Winkle's Razor: A Simple Estimate of Overfit to Test Data","created":"2021-02-25","cited_by_count":8,"area":null},{"id":"2106.10761","title":"Generalization in the Face of Adaptivity: A Bayesian Perspective","created":"2021-06-20","cited_by_count":7,"area":null},{"id":"2307.04733","title":"A unifying framework for differentially private quantum algorithms","created":"2023-07-10","cited_by_count":7,"area":null},{"id":"2202.13736","title":"On the Robustness of CountSketch to Adaptive Inputs","created":"2022-02-28","cited_by_count":5,"area":null},{"id":"2304.06787","title":"A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions","created":"2023-04-13","cited_by_count":5,"area":null},{"id":"2305.15452","title":"Adaptive Data Analysis in a Balanced Adversarial Model","created":"2023-05-24","cited_by_count":5,"area":null},{"id":"2506.20173","title":"Valid Selection among Conformal Sets","created":"2025-06-25","cited_by_count":5,"area":null},{"id":"2207.01560","title":"High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent","created":"2022-07-04","cited_by_count":4,"area":null},{"id":"2209.04053","title":"Algorithms with More Granular Differential Privacy Guarantees","created":"2022-09-08","cited_by_count":4,"area":null},{"id":"2210.08248","title":"A Closer Look at the Calibration of Differentially Private Learners","created":"2022-10-15","cited_by_count":4,"area":null},{"id":"2307.02501","title":"Generalization Guarantees via Algorithm-dependent Rademacher Complexity","created":"2023-07-04","cited_by_count":4,"area":null},{"id":"2402.17390","title":"Robustness-Congruent Adversarial Training for Secure Machine Learning Model Updates","created":"2024-02-27","cited_by_count":4,"area":null},{"id":"2510.27638","title":"Panprediction: Optimal Predictions for Any Downstream Task and Loss","created":"2025-10-31","cited_by_count":4,"area":null},{"id":"2303.01709","title":"Streaming Algorithms for Learning with Experts: Deterministic Versus Robust","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2412.14396","title":"Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis","created":"2024-12-18","cited_by_count":3,"area":null},{"id":"2606.11045","title":"What Fits (Into Few Tokens) Doesn't Overfit: Compression and Generalization in ML Research Agents","created":"2026-06-09","cited_by_count":3,"area":"agents"},{"id":"2311.04561","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","created":"2023-11-08","cited_by_count":2,"area":null},{"id":"2412.09686","title":"The Cost of Replicability in Active Learning","created":"2024-12-12","cited_by_count":2,"area":null},{"id":"2511.11413","title":"Multicalibration Yields Better Matchings","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2112.08439","title":"Generalization Bounds for Stochastic Gradient Langevin Dynamics: A Unified View via Information Leakage Analysis","created":"2021-12-14","cited_by_count":1,"area":null},{"id":"2202.06880","title":"Black-Box Generalization: Stability of Zeroth-Order Learning","created":"2022-02-14","cited_by_count":1,"area":null},{"id":"2405.13375","title":"Adaptive Data Analysis for Growing Data","created":"2024-05-22","cited_by_count":1,"area":null},{"id":"2406.02599","title":"Privacy-Aware Randomized Quantization via Linear Programming","created":"2024-06-01","cited_by_count":1,"area":null},{"id":"2502.07656","title":"Causal Imitation Learning under Expert-Observable and Expert-Unobservable Confounding","created":"2025-02-11","cited_by_count":1,"area":"offlinerl"},{"id":"2505.15303","title":"Laplace Sample Information: Data Informativeness Through a Bayesian Lens","created":"2025-05-21","cited_by_count":1,"area":null},{"id":"2507.13700","title":"Tight Bounds for Answering Adaptively Chosen Concentrated Queries","created":"2025-07-18","cited_by_count":1,"area":null},{"id":"2510.01291","title":"Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2605.07674","title":"Differentially Private Auditing Under Strategic Response","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2204.08809","title":"Making Progress Based on False Discoveries","created":"2022-04-19","cited_by_count":0,"area":null},{"id":"2207.10668","title":"Improved Generalization Guarantees in Restricted Data Models","created":"2022-07-20","cited_by_count":0,"area":null},{"id":"2301.09203","title":"Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model","created":"2023-01-22","cited_by_count":0,"area":null},{"id":"2303.04195","title":"PRIMO: Private Regression in Multiple Outcomes","created":"2023-03-07","cited_by_count":0,"area":null},{"id":"2309.01030","title":"Online Adaptive Mahalanobis Distance Estimation","created":"2023-09-02","cited_by_count":0,"area":null},{"id":"2310.20299","title":"Verification of Neural Networks Local Differential Classification Privacy","created":"2023-10-31","cited_by_count":0,"area":null},{"id":"2311.00346","title":"Adversarially Robust Distributed Count Tracking via Partial Differential Privacy","created":"2023-11-01","cited_by_count":0,"area":null},{"id":"2410.15501","title":"Predicting adaptively chosen observables in quantum systems","created":"2024-10-20","cited_by_count":0,"area":null},{"id":"2507.16345","title":"The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\\ell_2$ Norm Estimation","created":"2025-07-22","cited_by_count":0,"area":null},{"id":"2509.02391","title":"Gaming and Cooperation in Federated Learning: What Can Happen and How to Monitor It","created":"2025-09-02","cited_by_count":0,"area":null},{"id":"2509.20463","title":"Efficiently Attacking Memorization Scores","created":"2025-09-24","cited_by_count":0,"area":null},{"id":"2512.13506","title":"Learning under Distributional Drift: Prequential Reproducibility as an Intrinsic Statistical Resource","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2602.01177","title":"Privacy Implies Stability: Information-Theoretic Generalization Bounds for Quantum Learning","created":"2026-02-01","cited_by_count":0,"area":null},{"id":"2602.07732","title":"Efficient Adaptive Data Analysis over Dense Distributions","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2602.07999","title":"Tighter Information-Theoretic Generalization Bounds via a Novel Class of Change of Measure Inequalities","created":"2026-02-08","cited_by_count":0,"area":null},{"id":"2602.09499","title":"Computationally Efficient Replicable Learning of Parities and Applications","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2603.07319","title":"ShakyPrepend: A Multi-Group Learner with Improved Sample Complexity","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2605.19625","title":"Optimal Reconstruction from Linear Queries","created":"2026-05-19","cited_by_count":0,"area":null},{"id":"2605.26222","title":"From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2607.07085","title":"Is Randomness Necessary for Adaptive Data Analysis?","created":"2026-07-08","cited_by_count":0,"area":null},{"id":"2607.15528","title":"Publicly-Verifiable Certificates for Statistical Algorithms","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2608.08722","title":"Gaming Without an Attacker: Benchmark Fingerprinting in LLM-Driven Search Under Selection Pressure","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2609.32109","title":"How Reusable Are Benchmarks with Richer Feedback?","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.33180","title":"Which Self-Improvements Should We Trust? Reliable Self-Improvement When Agents Reuse Their Benchmarks","created":"2026-09-27","cited_by_count":0,"area":null}],"next_cursor":null}