Vitaly Feldman
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Adam M. Smithonce
- Adam Sealfononce
- Elaine Angelinoonce
all 11 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Privacy amplification by random allocation | Trust in Decentralized Systems 2026 | 2026-03-16 |
Analyzes k‑out‑t random allocation sampling and provides an algorithm that computes the privacy loss distribution (PLD) for that scheme efficiently, with… | ||
| Open Problem Session | Privacy and the Science of Data Analysis 2019 | 2019-04-08 |
Nine eight-minute open problems present concrete conjectures, partial results and explicit gaps: a private VC equivalence conjecture linking private uniform… | ||
| Learning without Interaction Requires Separation | Privacy and the Science of Data Analysis 2019 | 2019-04-08 |
Shows that non‑interactive local differential privacy (LDP) provably needs many more samples: any non‑interactive LDP PAC learner for a negation‑closed class… | ||
| Generalization Bounds for Uniformly Stable Algorithms | Robust and High-Dimensional Statistics (Simons Institute workshop, 2018) | 2018-10-29 |
Shows a new high‑probability generalization bound for uniformly stable algorithms that replaces the prior γ·√n blowup with a bound that scales like √(γ + 1/n)… | ||
| Presentation of Evolvability | Computational Theories of Evolution | 2014-03-17 |
Defines genomes as computable functions and fitness as an empirical performance against an ideal function under an unknown distribution, then shows evolution… | ||
| nothing matches | ||