upper bound

Bounds on L_p Errors in Density Ratio Estimation via f-Divergence Loss Functions ICLR 2025 Center-Based Approximation of a Drifting Distribution ALT 2025 DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models ICML 2025 Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025 Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds ICLR 2025 Bayesian Regret Minimization in Offline Bandits ICML 2024 Estimating the Permanent by Nesting Importance Sampling ICML 2024 Fat-Shattering Dimension of k-fold Aggregations JMLR 2024 Improved Bounds for Pure Private Agnostic Learning: Item-Level and User-Level Privacy ICML 2024 KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem AAAI 2024 Minimax Linear Regression under the Quantile Risk COLT 2024 Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers ECCV 2024 Towards Certifiably Robust Face Recognition ECCV 2024 A Practical Upper Bound for the Worst-Case Attribution Deviations CVPR 2023 A Refined Upper Bound and Inprocessing for the Maximum K-plex Problem IJCAI 2023 Bounding Evidence and Estimating Log-Likelihood in VAE AISTATS 2023 New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem IJCAI 2023 Pareto Regret Analyses in Multi-objective Multi-armed Bandit ICML 2023 An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs AAAI 2022 A New Bounding Scheme for Influence Diagrams AAAI 2021 An Improved Upper Bound for SAT AAAI 2021 Computing Plan-Length Bounds Using Lengths of Longest Paths AAAI 2021 Novel Upper Bounds for the Constrained Most Probable Explanation Task NeurIPS 2021 A One-step Approach to Covariate Shift Adaptation ACML 2020 A Theoretically Sound Upper Bound on the Triplet Loss for Improving the Efficiency of Deep Distance Metric Learning CVPR 2019