Strategic PAC learnability is preserved when hypothesis classes and cost-induced neighborhoods are first-order definable over the reals with exponentiation, controlling sample complexity by formula complexity.
Transactions of the American Mathematical Society , volume=
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 4roles
background 2polarities
background 2representative citing papers
An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.
citing papers explorer
-
Strategic PAC Learnability via Geometric Definability
Strategic PAC learnability is preserved when hypothesis classes and cost-induced neighborhoods are first-order definable over the reals with exponentiation, controlling sample complexity by formula complexity.
-
Optimal Phylogenetic Reconstruction from Sampled Quartets
An efficient algorithm recovers phylogenetic trees from Θ(n) noisy quartets under random classification noise, matching the information-theoretic lower bound and achieving near-optimal quartet distance.
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Triplet constraints realizable in D-dimensional Euclidean space cannot be preserved above 50% accuracy by any embedding of dimension at most cD for constant c<1, with UGC-hardness preventing better polynomial-time solutions in any dimension.
- Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming