ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Sample complexity”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGmath.STstat.MLTheoreticalRecentJun 18, 2026

Optimal Deterministic Multicalibration and Omniprediction

Georgy Noarov, Aaron Roth

The paper presents a minimax-optimal multicalibration algorithm that outputs a deterministic predictor.

View →
cs.LGcs.AIstat.MLRecentMay 28, 2026

The Sample Complexity of Multiclass and Sparse Contextual Bandits

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.

View →
cs.GTcs.DSEmpiricalRecentJun 9, 2026

Proportionality from Sampled Approvals

Gregory Kehne

One clear sentence describing what this paper does

View →
stat.MLcs.DScs.LGTheoreticalRecentAug 13, 2026

Bagging Robustly Learns VC Classes with Linear Sample Complexity

Omar Montasser

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.

View →
cs.DScs.AIcs.LGTheoreticalRecentJun 9, 2026

The Power of Test-Time Training for Approximate Sampling

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

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.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →
cs.DScs.CCTheoreticalRecentJul 31, 2026

A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina +1 more

The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.CCcs.DScs.ITTheoreticalRecentJul 16, 2026

Space-Entropy Lower Bounds for Random Sampling

Thomas L. Draper, Feras A. Saad

This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →
cs.LGcs.ITmath.STEmpiricalRecentSep 23, 2026

Even Sharper Bounds for Transductive Learning and Its Applications

Yingzhen Yang

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…

View →
cs.DScs.CCTheoreticalRecentJun 11, 2026

Sketching Intersection Profiles: A Simple Proof and Three Applications

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi +2 more

This paper settles the complexity of three sketching problems in graphs and distributions.

View →
cs.CCcs.AIcs.FLTheoreticalRecentJun 23, 2026

Token Complexity of Certifying Stochastic-Oracle Reliability

Jie Wang

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.

View →