conftrace_

upper bound

25 papers

Explore in graph

Co-occurring keywords

lower bound (173) graph coloring (24) plan length (2) np-hard problem (43) probabilistic graphical model (226) multi-objective optimization (364) exact algorithm (25) branch-and-bound algorithm (7) combinatorial optimization (1039) variational gap (1)

Papers

Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem AAAI 2024
Fat-Shattering Dimension of k-fold Aggregations JMLR 2024
Minimax Linear Regression under the Quantile Risk COLT 2024
Bounding Evidence and Estimating Log-Likelihood in VAE AISTATS 2023
A Refined Upper Bound and Inprocessing for the Maximum K-plex Problem IJCAI 2023
A Practical Upper Bound for the Worst-Case Attribution Deviations CVPR 2023
Pareto Regret Analyses in Multi-objective Multi-armed Bandit ICML 2023
New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem IJCAI 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
Computing Plan-Length Bounds Using Lengths of Longest Paths AAAI 2021
An Improved Upper Bound for SAT AAAI 2021
Novel Upper Bounds for the Constrained Most Probable Explanation Task NIPS 2021
A One-step Approach to Covariate Shift Adaptation ACML 2020
Plan-Length Bounds: Beyond 1-Way Dependency AAAI 2019
A Theoretically Sound Upper Bound on the Triplet Loss for Improving the Efficiency of Deep Distance Metric Learning CVPR 2019
SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach EMNLP 2018
A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms IJCAI 2018
Computational Approaches for Stochastic Shortest Path on Succinct MDPs IJCAI 2018
Stochastic Anytime Search for Bounding Marginal MAP IJCAI 2018
Diameter-Based Active Learning ICML 2017
On the Accuracy of Self-Normalized Log-Linear Models NIPS 2015
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup ICML 2015
Learning a Hidden Hypergraph JMLR 2006