conftrace_

theoretical bound

17 papers

Explore in graph

Co-occurring keywords

sample complexity (1169) learning theory (519) recurrent neural network (1790) misspecification error (5) linear combination (13) observational panel datum (1) analogical inference (3) algebraic normal form (1) algorithm configuration (18) graph problem (5)

Papers

Speculative Decoding Speed-of-Light: Optimal Lower Bounds via Branching Random Walks EACL 2026
Align-Pro: A Principled Approach to Prompt Optimization for LLM Alignment AAAI 2025
Transferability Bound Theory: Exploring Relationship between Adversarial Transferability and Flatness NIPS 2024
Improved Sample Complexity Bounds for Diffusion Model Training NIPS 2024
On the Misspecification of Linear Assumptions in Synthetic Controls AISTATS 2024
Length independent PAC-Bayes bounds for Simple RNNs AISTATS 2024
On Gap-dependent Bounds for Offline Reinforcement Learning NIPS 2022
Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoning NIPS 2021
Sample Complexity Bounds for RNNs with Application to Combinatorial Graph Problems (Student Abstract) AAAI 2020
On Performance Estimation in Automatic Algorithm Configuration AAAI 2020
On Making Stochastic Classifiers Deterministic NIPS 2019
Deep ReLU Networks Have Surprisingly Few Activation Patterns NIPS 2019
Behavior of Analogical Inference w.r.t. Boolean Functions IJCAI 2018
Theoretical Limits of Speed and Resolution for Kinodynamic Planning in a Poisson Forest RSS 2015
Exploiting easy data in online optimization NIPS 2014
Noise Thresholds for Spectral Clustering NIPS 2011
Impossibility Theorems for Domain Adaptation AISTATS 2010