Optimal Sample Complexity

Follow this field Ask about this field

Recent momentum

emerging

0 papers in the last 28 days · 0.0% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this field, kept on the site without email delivery.

Period ending 2026-09-21

13 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Period ending 2026-09-14

13 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Period ending 2026-09-07

6 new papers

A weekly snapshot of new work published in Optimal Sample Complexity.

Inside this field

Focused directions

Focused topic

Optimal Sample Complexity

Within Optimal Sample Complexity

210 papersExplore

Focused topic

Sample Complexity

Within Optimal Sample Complexity

62 papersExplore

Focused topic

Lower Bounds

Within Optimal Sample Complexity

51 papersExplore

Focused topic

Upper Bounds

Within Optimal Sample Complexity

48 papersExplore

Focused topic

Concentration Inequalities

Within Optimal Sample Complexity

41 papersExplore

Focused topic

Worst-Case

Within Optimal Sample Complexity

33 papersExplore

Focused topic

New Bounds

Within Optimal Sample Complexity

24 papersExplore

426 papers

Latest in Optimal Sample Complexity

Browse all topics →

Can Agent Benchmarks Support Their Scores? Evidence-Supported Bounds for Interactive-Agent Evaluation
May 11, 2026Shanshan Gao, Liyi ZhouAgentic Benchmarks Failure Mechanism
The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently
May 11, 2026Elisabetta Cornacchia, Dan Mikulincer, Elchanan MosselSpatio-Temporal Correlations Stochastic Gradient Descent
Unveiling High-Probability Generalization in Decentralized SGD
May 11, 2026Jiahuan Wang, Ping Luo, Ziqing Wen +2Stochastic Gradient Descent Generalization Bounds
Selection of the Best Policy under Fairness Constraints for Subpopulations
May 11, 2026Tingyu Zhu, Yuhang Wu, Zeyu ZhengFairness Constraints Subgroup Information
Bayesian Optimization with Structured Measurements: A Vector-Valued RKHS Framework
May 10, 2026Wenbin Wang, Colin N. JonesBayesian Optimization Kernel Hilbert Spaces
Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects
May 10, 2026Kevin Dao, Jose Israel RodriguezCounterexample New Bounds
Online Set Learning from Precision and Recall Feedback
May 10, 2026Lee Cohen, Yishay Mansour, Shay Moran +1Learning-Augmented Algorithms Optimal Sample Complexity
Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
May 10, 2026Zhiming Huang, Bingshan Hu, Jianping PanThompson Sampling Linear Bandits
Instance-Adaptive Online Multicalibration
May 10, 2026Zhiming Huang, Jamie Morgenstern, Aaron Roth +1Learning-Augmented Algorithms Multicalibration and Calibration
Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
May 9, 2026Qingyue Zhao, Kaixuan Ji, Heyang Zhao +1Kullback-Leibler Regularization Optimal Sample Complexity
Learnability and Competition in High-Dimensional Multi-Component ICA
May 8, 2026Eser Ilke Genc, Samet Demir, Zafer DoganIndependent Component Analysis Low-Data Regimes
Vertex-Softmax: Tight Transformer Verification via Exact Softmax Optimization
May 8, 2026Navid Rezazadeh, Arash Gholami DavoodiGumbel-Softmax Relaxation Transformer Attention
Direct Bethe Free Energy Minimization for Bayesian Neural Networks
May 8, 2026Pavel ProchazkaBayesian Neural Networks Bayesian
On Observation Time for Recovering Latent Hawkes Networks
May 8, 2026Jonas Linkerhägner, Michele Bortolasi, Lorenzo Baldassari +2Complex Networks Determinantal Point Process
Embedding Dimension Lower Bounds for Universality of Deep Sets and Janossy Pooling
May 8, 2026Ali Syed, Aditya Nambiar, Jonathan W. SiegelEmbedding Dimension Equivariant Neural Networks
Bayesian Sensitivity of Causal Inference Estimators under Evidence-Based Priors
May 8, 2026Nikita Dhawan, Daniel Shen, Leonardo Cotta +1Causal Inferences Model Sensitivity
Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means
May 8, 2026Valentin Kilian, Stefano Cortinovis, François CaronConfidence Intervals Bayesian
Finite-Time Analysis of MCTS in Continuous POMDP Planning
May 8, 2026Da Kong, Vadim IndelmanPartially Observable Markov Decision Process Monte Carlo Tree Search
A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning
May 8, 2026Nong Minh Hieu, Antoine LedentMulticlass Classification Contrastive Learning
Approximation Error Upper and Lower Bounds for Hölder Class with Transformers
May 8, 2026Xin He, Yuling Jiao, Xiliang Lu +1Transformer Architectures Generalization Bounds
Bounded Fitting for Expressive Description Logics
May 8, 2026Maurice Funk, Jean Christoph Jung, Tom VoellmerSatisfiability New Bounds
Sample Complexity of Stochastic Optimization with Integer Variables
May 8, 2026Hongyu Cheng, Yinghao Zheng, Marco Molinaro +1Stochastic Optimization Mixed-Integer Programming
Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
May 8, 2026Ishank Juneja, Carlee Joe-Wong, Osman YağanMulti-Armed Bandits Linear Regret
Conformal-Style Quantile Analyses for Stochastic Bandits
May 8, 2026Chengyu Du, Mengfan XuLinear Bandits Quantile Regression
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
May 8, 2026Anastasis Kratsios, Gregory Cousins, Haitz Sáez de Ocáriz Borde +2Feed-Forward Network Multilayer Perceptrons
Less Random, More Private: What is the Optimal Subsampling Scheme for DP-SGD?
May 8, 2026Andy Dong, Ayfer ÖzgürDifferential Privacy Subsampling
Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
May 7, 2026Adam R. Klivans, Shyamal Patel, Konstantinos Stavropoulos +1Distributional Learning Distribution Shifts
When and Why SignSGD Outperforms SGD: A Theoretical Study Based on $\ell_1$ -norm Lower Bounds
May 7, 2026Hongyi Tao, Dingzhi Yu, Lijun ZhangStochastic Gradient Descent Riemannian Optimization
A Closed-Form Upper Bound for Admissible Learning-Rate Steps in Belief-Space Dynamics
May 7, 2026Zixi Li, Youzhen LiLarge Step Sizes Belief Space
Trade-off Functions for DP-SGD with Subsampling based on Random Shuffling: Tight Upper and Lower Bounds
May 7, 2026Marten van Dijk, Murat Bilgehan ErtanDifferential Privacy Stochastic Gradient Descent
Matrix-Decoupled Concentration for Autoregressive Sequences: Dimension-Free Guarantees for Sparse Long-Context Rewards
May 7, 2026Pei-Sen LiAutoregressive Model Concentration Inequalities
Convex-Geometric Error Bounds for Positive-Weight Kernel Quadrature
May 7, 2026Satoshi HayakawaKernel Hilbert Spaces Convex Sets
Distributionally Robust Multi-Objective Optimization
May 7, 2026Yufeng Yang, Fangning Zhuo, Ziyi Chen +2Multi-Objective Optimization Proximal Gradient Descent
Nearly Optimal Attention Coresets
May 7, 2026Edo Liberty, Alexandr Andoni, Eldar KleinerGeometry-Aware Uncertainty Coresets Top-K
Information-theoretic Limits of Learning and Estimation
May 6, 2026Abbas El Gamal, Maxim RaginskyInformation-Theoretic Limits Concentration Inequalities
Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval
May 6, 2026Nicholas Barnfield, Juno Kim, Eshaan Nichani +2Dense Associative Memory Decision Thresholds
Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
May 6, 2026Harin Lee, Min-hwan OhLinear Regret Multi-Armed Bandits
Differential Privacy in the Extensive-Form Bandit Problem
May 6, 2026Stephen Pasteris, Rahul Savani, Theodore TurocyDifferential Privacy Imperfect-Information Games
Worst-Case Discovery and Runtime Protection for RL-Based Network Controllers
May 6, 2026Hongyu Hè, Minhao Jin, Maria ApostolakiIterative Reinforcement Learning Worst-Case
Distributed Learning with Adversarial Gradient Perturbations
May 5, 2026Nawapon Sangsiri, Yufei TaoDistributional Learning Optimal Sample Complexity
On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants
May 5, 2026Brian Keith-Norambuena, Juan Bekios-CalfaMulti-Label Classification Discriminative Models
Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation
May 4, 2026Jingchu Gai, Laixi ShiMulti-Agent Reinforcement Learning Markov Decision Processes
Active multiple matrix completion with adaptive confidence sets
May 4, 2026Andrea Locatelli, Alexandra Carpentier, Michal ValkoTensor Completion Active Learning
A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
May 4, 2026Tim SinenOptimal Sample Complexity Sample Complexity
On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
May 4, 2026Kaixuan Ji, Qiwei Di, Heyang Zhao +2Kullback-Leibler Regularization Linear Bandits
How Label Imbalance Shapes Geometry: A General Spectral Analysis of Multi-Label Neural Collapse
May 3, 2026Xiaoxuan Ma, Yixuan Yang, Song Li +1Multi-Label Classification Neural Collapse
Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
May 2, 2026Fan Chen, Jian Qian, Alexander Rakhlin +1Conformal Test Martingales Concentration Inequalities
Concepts Whisper While Syntax Shouts: Spectral Anti-Concentration and the Dual Geometry of Transformer Representations
May 2, 2026Pratyush Acharya, Nuraj Rimal, Habish DhakalCross-Lingual Transfer Concentration Inequalities
New Bounds for Kernel Sums via Fast Spherical Embeddings
May 2, 2026Tal WagnerKernel Method Optimal Sample Complexity
New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
May 1, 2026Jay Bhan, Nicole Nobili, Patrick LangerGraph Theory Evolutionary Search
Matroid Algorithms Under Size-Sensitive Independence Oracles
Apr 30, 2026Kiarash Banihashem, MohammadTaghi Hajiaghayi, Mahdi JafariRaviz +1Sharp Joint-Kl Oracle Theory Upper Bounds
Exponential families from a single KL identity
Apr 30, 2026Marc DymetmanKullback-Leibler Divergence Exponents
Mind the Gap: Structure-Aware Consistency in Preference Learning
Apr 30, 2026Mehryar Mohri, Yutao ZhongLarge Language Model Alignment Direct Preference Optimization
A Note on How to Remove the $\ln\ln T$ Term from the Squint Bound
Apr 29, 2026Francesco OrabonaX-Logsmask New Bounds
On the Learning Curves of Revenue Maximization
Apr 29, 2026Steve Hanneke, Alkis Kalavasis, Shay Moran +1Optimal Sample Complexity Maximization
Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals
Apr 29, 2026Jizhou Huang, Brendan JubaOptimal Sample Complexity Homomorphic Encryption
Occam's Razor is Only as Sharp as Your ELBO
Apr 28, 2026Ethan Harvey, Michael C. HughesModel Selection Bayesian
Online learning with Erdős-Rényi side-observation graphs
Apr 28, 2026Tomáš Kocák, Gergely Neu, Michal ValkoBandits Optimal Sample Complexity
The Optimal Sample Complexity of Multiclass and List Learning
Apr 27, 2026Chirag PabbarajuMulticlass Classification Optimal Sample Complexity
Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning
Apr 25, 2026Akihiro Takemura, Katsumi Inoue, Masaaki NishinoNeuro-Symbolic Framework Label Constraint Modeling

May 11, 2026 · cs.AIJ/K move · Enter open · S save

Can Agent Benchmarks Support Their Scores? Evidence-Supported Bounds for Interactive-Agent Evaluation

Shanshan Gao, Liyi Zhou

The University of Sydney

Interactive agent benchmarks map an agent run to a binary outcome through outcome checks. When these checks rely on surface level signals or fail to capture the agent's actual action path, they cannot reliably determine whether the run succeeded. For example, a benchmark task may ask whether Alice's shipping address was changed, while the outcome check only verifies that the agent clicked "Save." This does not guarantee that the intended state change occurred, since the agent may have modified the wrong record. Treating such a run as successful therefore makes the reported score misleading. Benchmark quality thus depends not only on task design, but also on the reliability of outcome detection. We address this problem by introducing an outcome evidence reporting layer for existing benchmarks, without modifying their tasks, agents, or evaluators. The layer performs three functions. First, before scoring, it specifies which stored artifacts are required to verify the claimed outcome for each case. Second, it applies a locked checklist to each completed run and assigns one of three evidence labels: Evidence Pass, Evidence Fail, or Unknown. Third, it reports evidence supported score bounds that quantify uncertainty arising from Unknown cases. Rather than silently counting, discarding, or hiding uncertain cases inside a single aggregate success rate, the framework keeps them explicitly visible. We evaluate the outcome evidence layer on five public benchmarks: ANDROIDWORLD, AGENTDOJO, APPWORLD, tau3 bench retail, and MINIWOB. The resulting reports separate several empirically distinct failure modes.

Agentic Benchmarks Failure Mechanism Upper Bounds

Open paper Ask about it PDF