20 results for “Sample complexity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper presents a minimax-optimal multicalibration algorithm that outputs a deterministic predictor.
Liad Erez, Fan Chen, Alon Cohen, Tomer Koren +3 more
The paper analyzes the sample complexity of contextual bandits in the $s$-sparse setting, achieving optimal sample bounds for identifying an $\epsilon$-optimal policy.
One clear sentence describing what this paper does
This paper improves the sample complexity of learning robust predictors to adversarial examples using a simple algorithm that combines bagging and robust empirical risk minimization.
This paper formalizes test-time training (TTT) as a problem of sampling from a given probability measure and shows a quadratic lower bound on the query complexity of sampling.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
The paper introduces Sharper Transductive Local Complexity (STLC), a localized complexity method for transductive learning that achieves the standard inductive rate and matches the transductive minima…
This paper settles the complexity of three sketching problems in graphs and distributions.
This paper introduces a framework for certifying the reliability of stochastic oracles and derives bounds on the minimum expected token cost for reliable oracle certification.