An online matrix factorization algorithm is given that matches offline performance up to log factors, supporting online private query release and discrepancy minimization.
Sphere packing numbers for subsets of the B oolean n -cube with bounded V apnik- C hervonenkis dimension
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Existence of a high-arity sample compression scheme of non-trivial quality implies high-arity PAC learnability.
citing papers explorer
-
Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
An online matrix factorization algorithm is given that matches offline performance up to log factors, supporting online private query release and discrepancy minimization.
-
High-arity Sample Compression
Existence of a high-arity sample compression scheme of non-trivial quality implies high-arity PAC learnability.