4.5 Article

Private and Online Learnability Are Equivalent

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Theory & Methods

Reproducibility in Learning

Russell Impagliazzo et al.

Summary: This article introduces the concept and theoretical research of reproducible algorithms in the context of learning, as well as the application of reproducible algorithms in statistics and learning. It highlights the importance and advantages of reproducible algorithms, and provides some reproducible algorithms for solving fundamental problems.

PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22) (2022)

Article Mathematics

MODEL THEORY AND MACHINE LEARNING

Hunter Chase et al.

BULLETIN OF SYMBOLIC LOGIC (2019)

Proceedings Paper Computer Science, Theory & Methods

How to Use Heuristics for Differential Privacy

Seth V. Neel et al.

2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019) (2019)

Proceedings Paper Computer Science, Theory & Methods

The Role of Interactivity in Local Differential Privacy

Matthew Joseph et al.

2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019) (2019)

Proceedings Paper Computer Science, Interdisciplinary Applications

Prophet Inequalities for IID Random Variables from an Unknown Distribution

Jose Correa et al.

ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION (2019)

Proceedings Paper Computer Science, Theory & Methods

On the Compatibility of Privacy and Fairness

Rachel Cummings et al.

ADJUNCT PUBLICATION OF THE 27TH CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION (ACM UMAP '19 ADJUNCT) (2019)

Article Computer Science, Theory & Methods

Private Learning and Sanitization: Pure vs. Approximate Differential Privacy

Amos Beimel et al.

THEORY OF COMPUTING (2016)

Article Computer Science, Theory & Methods

SAMPLE COMPLEXITY BOUNDS ON DIFFERENTIALLY PRIVATE LEARNING VIA COMMUNICATION COMPLEXITY

Vitaly Feldman et al.

SIAM JOURNAL ON COMPUTING (2015)

Proceedings Paper Computer Science, Theory & Methods

Differentially Private Release and Learning of Threshold Functions

Mark Bun et al.

2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)

Article Computer Science, Artificial Intelligence

Bounds on the sample complexity for private learning and private data release

Amos Beimel et al.

MACHINE LEARNING (2014)

Article Computer Science, Theory & Methods

The Algorithmic Foundations of Differential Privacy

Cynthia Dwork et al.

FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE (2013)

Article Computer Science, Theory & Methods

WHAT CAN WE LEARN PRIVATELY?

Shiva Prasad Kasiviswanathan et al.

SIAM JOURNAL ON COMPUTING (2011)

Article Computer Science, Artificial Intelligence

A primal-dual perspective of online learning algorithms

Shai Shalev-Shwartz et al.

MACHINE LEARNING (2007)

Proceedings Paper Computer Science, Theory & Methods

Towards sharp inapproximability for any 2-CSP

Per Austrin

48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS (2007)

Article Computer Science, Information Systems

Calibrating noise to sensitivity in private data analysis

Cynthia Dwork et al.

THEORY OF CRYPTOGRAPHY, PROCEEDINGS (2006)

Article Computer Science, Hardware & Architecture

Efficient algorithms for online decision problems

A Kalai et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2005)

Article Automation & Control Systems

Stability and generalization

O Bousquet et al.

JOURNAL OF MACHINE LEARNING RESEARCH (2002)