Copertina

An Optimal Tightness Bound for the Simulation Lemma

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lobel, Sam, Parr, Ronald
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximate Next Policy Sampling: Replacing Conservative Target Policy Updates in Deep RL
di: Sandhu, Dillon, et al.
Pubblicazione: (2026)

Mitigating Partial Observability in Sequential Decision Processes via the Lambda Discrepancy
di: Allen, Cameron, et al.
Pubblicazione: (2024)

A Unifying View of Linear Function Approximation in Off-Policy RL Through Matrix Splitting and Preconditioning
di: Wu, Zechen, et al.
Pubblicazione: (2025)

An Optimal Sauer Lemma Over $k$-ary Alphabets
di: Hanneke, Steve, et al.
Pubblicazione: (2026)

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

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
di: Karpov, Nikolai, et al.
Pubblicazione: (2025)

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

Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds
di: Edelman, Ezra, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
di: Mussi, Marco, et al.
Pubblicazione: (2024)

Tight Bounds for Logistic Regression with Large Stepsize Gradient Descent in Low Dimension
di: Crawshaw, Michael, et al.
Pubblicazione: (2026)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
di: Rapoport, Emma, et al.
Pubblicazione: (2025)

Tight Bounds for Schrödinger Potential Estimation in Unpaired Data Translation
di: Puchkin, Nikita, et al.
Pubblicazione: (2025)

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

SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming
di: Chiu, Hong-Ming, et al.
Pubblicazione: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
di: Scarlett, Jonathan
Pubblicazione: (2018)

Tight Generalization Error Bounds for Stochastic Gradient Descent in Non-convex Learning
di: Xiong, Wenjun, et al.
Pubblicazione: (2025)

MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics
di: Liu, Xinyu, et al.
Pubblicazione: (2026)

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

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
di: Di Gregorio, Simone, et al.
Pubblicazione: (2025)

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

Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds
di: Ruan, Boyuan, et al.
Pubblicazione: (2026)

PrivSGP-VR: Differentially Private Variance-Reduced Stochastic Gradient Push with Tight Utility Bounds
di: Zhu, Zehan, et al.
Pubblicazione: (2024)

Stein's Lemma for the Reparameterization Trick with Exponential Family Mixtures
di: Lin, Wu, et al.
Pubblicazione: (2019)

Tight Bounds on the Binomial CDF, and the Minimum of i.i.d Binomials, in terms of KL-Divergence
di: Zhu, Xiaohan, et al.
Pubblicazione: (2025)

Almost Tight Error Bounds on Differentially Private Continual Counting
di: Henzinger, Monika, et al.
Pubblicazione: (2022)

Misspecified $Q$-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error
di: Du, Ally Yalei, et al.
Pubblicazione: (2024)

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

Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets
di: Larsen, Kasper Green, et al.
Pubblicazione: (2025)

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

Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Clipping Bias and Remedies
di: Li, Qiang, et al.
Pubblicazione: (2024)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
di: Tuynman, Adrienne, et al.
Pubblicazione: (2022)

Adaptive Error-Bounded Hierarchical Matrices for Efficient Neural Network Compression
di: Mango, John, et al.
Pubblicazione: (2024)