{"total":43,"rows":[{"id":"2103.00039","title":"Practical and Private (Deep) Learning without Sampling or Shuffling","created":"2021-02-26","cited_by_count":170,"area":null},{"id":"2202.08312","title":"Improved Differential Privacy for SGD via Optimal Private Linear Operators on Adaptive Streams","created":"2022-02-16","cited_by_count":59,"area":null},{"id":"2306.08153","title":"(Amplified) Banded Matrix Factorization: A unified approach to private training","created":"2023-06-13","cited_by_count":49,"area":null},{"id":"2107.01614","title":"Survey: Leakage and Privacy at Inference Time","created":"2021-07-04","cited_by_count":44,"area":null},{"id":"2202.05567","title":"Shuffle Private Linear Contextual Bandits","created":"2022-02-11","cited_by_count":27,"area":null},{"id":"2112.10599","title":"Differentially Private Regret Minimization in Episodic Markov Decision Processes","created":"2021-12-20","cited_by_count":23,"area":null},{"id":"2201.07052","title":"Differentially Private Reinforcement Learning with Linear Function Approximation","created":"2022-01-18","cited_by_count":22,"area":null},{"id":"2210.13537","title":"Private Online Prediction from Experts: Separations and Faster Rates","created":"2022-10-24","cited_by_count":17,"area":null},{"id":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14,"area":null},{"id":"2206.05772","title":"Distributed Differential Privacy in Multi-Armed Bandits","created":"2022-06-12","cited_by_count":14,"area":null},{"id":"2102.12467","title":"No-Regret Algorithms for Private Gaussian Process Bandit Optimization","created":"2021-02-24","cited_by_count":11,"area":null},{"id":"2111.01570","title":"Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits","created":"2021-11-02","cited_by_count":11,"area":null},{"id":"2106.13513","title":"Littlestone Classes are Privately Online Learnable","created":"2021-06-25","cited_by_count":10,"area":null},{"id":"2302.14154","title":"Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime","created":"2023-02-27","cited_by_count":9,"area":null},{"id":"2202.01292","title":"Improved Regret for Differentially Private Exploration in Linear MDP","created":"2022-02-02","cited_by_count":8,"area":null},{"id":"2208.14555","title":"Dynamic Global Sensitivity for Differentially Private Contextual Bandits","created":"2022-08-30","cited_by_count":5,"area":null},{"id":"2210.11222","title":"Learning-Augmented Private Algorithms for Multiple Quantile Release","created":"2022-10-20","cited_by_count":5,"area":null},{"id":"2411.05483","title":"The Limits of Differential Privacy in Online Learning","created":"2024-11-08","cited_by_count":5,"area":null},{"id":"2210.04817","title":"Do you pay for Privacy in Online learning?","created":"2022-10-10","cited_by_count":4,"area":null},{"id":"2402.11119","title":"Private PAC Learning May be Harder than Online Learning","created":"2024-02-16","cited_by_count":4,"area":null},{"id":"2302.14099","title":"On Differentially Private Online Predictions","created":"2023-02-27","cited_by_count":3,"area":null},{"id":"2312.11534","title":"Improved Differentially Private and Lazy Online Convex Optimization","created":"2023-12-15","cited_by_count":3,"area":null},{"id":"2406.03620","title":"Private Online Learning via Lazy Algorithms","created":"2024-06-05","cited_by_count":3,"area":null},{"id":"2510.00076","title":"Private Learning of Littlestone Classes, Revisited","created":"2025-09-30","cited_by_count":3,"area":null},{"id":"2102.07929","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","created":"2021-02-16","cited_by_count":2,"area":null},{"id":"2506.15018","title":"Private Continual Counting of Unbounded Streams","created":"2025-06-17","cited_by_count":2,"area":null},{"id":"2206.08111","title":"On Private Online Convex Optimization: Optimal Algorithms in $\\ell_p$-Geometry and High Dimensional Contextual Bandits","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2310.17385","title":"Multitask Online Learning: Listen to the Neighborhood Buzz","created":"2023-10-26","cited_by_count":1,"area":null},{"id":"2403.15045","title":"DP-Dueling: Learning from Preference Feedback without Compromising User Privacy","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2403.16591","title":"Bridging Privacy and Robustness for Trustworthy Machine Learning","created":"2024-03-25","cited_by_count":1,"area":null},{"id":"2409.19092","title":"Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups","created":"2024-09-27","cited_by_count":1,"area":null},{"id":"2411.16121","title":"DP-CDA: An Algorithm for Enhanced Privacy Preservation in Dataset Synthesis Through Randomized Mixing","created":"2024-11-25","cited_by_count":1,"area":null},{"id":"2502.10997","title":"Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy","created":"2025-02-16","cited_by_count":1,"area":null},{"id":"2505.21790","title":"Faster Rates for Private Adversarial Bandits","created":"2025-05-27","cited_by_count":1,"area":null},{"id":"2510.00574","title":"Private Online Learning against an Adaptive Adversary: Realizable and Agnostic Settings","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2602.07370","title":"Privately Learning Decision Lists and a Differentially Private Winnow","created":"2026-02-07","cited_by_count":1,"area":null},{"id":"2607.00876","title":"The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting","created":"2026-07-01","cited_by_count":1,"area":null},{"id":"2203.03594","title":"Continual and Sliding Window Release for Private Empirical Risk Minimization","created":"2022-03-07","cited_by_count":0,"area":null},{"id":"2309.16105","title":"Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise","created":"2023-09-28","cited_by_count":0,"area":null},{"id":"2503.09538","title":"Differentially Private Equilibrium Finding in Polymatrix Games","created":"2025-03-12","cited_by_count":0,"area":null},{"id":"2505.05613","title":"Optimal Regret of Bernoulli Bandits under Global Differential Privacy","created":"2025-05-08","cited_by_count":0,"area":null},{"id":"2512.06971","title":"Prediction with Expert Advice under Local Differential Privacy","created":"2025-12-07","cited_by_count":0,"area":null},{"id":"2605.23887","title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","created":"2026-05-22","cited_by_count":0,"area":null}],"next_cursor":null}