Cover Image

Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Edelman, Ezra, Goel, Surbhi
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adversarial Resilience in Sequential Prediction via Abstention
by: Goel, Surbhi, et al.
Published: (2023)

The Evolution of Statistical Induction Heads: In-Context Learning Markov Chains
by: Edelman, Benjamin L., et al.
Published: (2024)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
by: Agrawal, Shubhada, et al.
Published: (2025)

Information Theoretic Lower Bounds for Information Theoretic Upper Bounds
by: Livni, Roi
Published: (2023)

Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts
by: Wang, James, et al.
Published: (2026)

Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers
by: Grishina, Ekaterina, et al.
Published: (2024)

Trade-off Functions for DP-SGD with Subsampling based on Random Shuffling: Tight Upper and Lower Bounds
by: van Dijk, Marten, et al.
Published: (2026)

Tight Lower Bounds and Improved Convergence in Performative Prediction
by: Khorsandi, Pedram, et al.
Published: (2024)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
by: Bai, Cedar Site, et al.
Published: (2024)

Bounded-Abstention Pairwise Learning to Rank
by: Ferrara, Antonio, et al.
Published: (2025)

Bounded-Abstention Multi-horizon Time-series Forecasting
by: Stradiotti, Luca, et al.
Published: (2026)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

Approximation Error Upper and Lower Bounds for Hölder Class with Transformers
by: He, Xin, et al.
Published: (2026)

Lower Bounds on the MMSE of Adversarially Inferring Sensitive Features
by: Welfert, Monica, et al.
Published: (2025)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

Risk Estimation in a Markov Cost Process: Lower and Upper Bounds
by: Thoppe, Gugan, et al.
Published: (2023)

An Optimal Tightness Bound for the Simulation Lemma
by: Lobel, Sam, et al.
Published: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

Genetic Column Generation for Computing Lower Bounds for Adversarial Classification
by: Penka, Maximilian
Published: (2024)

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
by: Fahrbach, Matthew, et al.
Published: (2025)

Which Algorithms Have Tight Generalization Bounds?
by: Gastpar, Michael, et al.
Published: (2024)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

Lower Bounds on Adversarial Robustness for Multiclass Classification with General Loss Functions
by: Trillos, Camilo Andrés García, et al.
Published: (2025)

Tight Bounds for Jensen's Gap with Applications to Variational Inference
by: Mazur, Marcin, et al.
Published: (2025)

Learning When to Stop: Selective Imitation Learning Under Arbitrary Dynamics Shift
by: Goel, Surbhi, et al.
Published: (2026)

Tight Generalization Bounds for Noiseless Inverse Optimization
by: Fatemi, Pouria, et al.
Published: (2026)

Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds
by: Xu, Yunbei, et al.
Published: (2026)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)

An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification
by: Trillos, Nicolas Garcia, et al.
Published: (2024)

Lower Bounds for Public-Private Learning under Distribution Shift
by: Setlur, Amrith, et al.
Published: (2025)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
by: Iwazaki, Shogo
Published: (2025)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)

Tight Bounds for Learning Polyhedra with a Margin
by: Patel, Shyamal, et al.
Published: (2026)

Bandits with Abstention under Expert Advice
by: Pasteris, Stephen, et al.
Published: (2024)

E-Globe: Scalable $ε$-Global Verification of Neural Networks via Tight Upper Bounds and Pattern-Aware Branching
by: Li, Wenting, et al.
Published: (2026)

Complexity Matters: Dynamics of Feature Learning in the Presence of Spurious Correlations
by: Qiu, GuanWen, et al.
Published: (2024)

Upper Generalization Bounds for Neural Oscillators
by: Huang, Zifeng, et al.
Published: (2026)

Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback
by: Huang, Ruiyuan, et al.
Published: (2025)