Sharp Logarithmic-Product Bounds for List Replicability of Sign Matrices
cs.LG, math.CO
Submitted: 2026-11-07
Updated: 2026-11-07
Terminology
Sources
- Minimum ranks of sign patterns via sign vectors and duality
- Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
- Simplicial covering dimension of extremal concept classes
- Tight list replicability bounds via a novel sphere covering theorem
- Sign-Rank, Index, and List Replicability: Connections and Separations
- A polylogarithmic bound for list replicability
- Near-Optimal List Replicability from Littlestone Dimension
- The complexity of computing the minimum rank of a sign pattern matrix
- Local Borsuk-Ulam, Stability, and Replicability
- Ample completions of OMs and CUOMs
- Spherical dimension
- Replicability and stability in learning
- Bounds on the regularity and projective dimension of ideals associated to graphs
- List and Certificate Complexities in Replicable Learning
- A Topological Figiel-Lindenstrauss-Milman Theorem and its Applications
- A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
- Sample-efficient proper PAC learning with approximate differential privacy
- Using oriented matroids to find low rank structure in presence of nonlinearity
- Private Learning of Littlestone Classes, Revisited
- A very short proof of the Figiel-Lindenstrauss-Milman theorem
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis