conftrace_

np-hard

12 papers

Explore in graph

Co-occurring keywords · papers mentioning both

approximation algorithm (2) high-dimensional two-sample testing (1) kernel max-sliced wasserstein distance (1) uniqueness (1) constrained gumbel trick (1) differentiable scheduling (1) converge (1) third order local optimum (1) pls-complete (1) second-order optimality condition (1)

Papers

Anytime-Constrained Equilibria in Polynomial Time ICML 2025 Blackwell’s Approachability with Approximation Algorithms COLT 2025 Measuring Diversity: Axioms and Challenges ICML 2025 Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances ICML 2025 Box Facets and Cut Facets of Lifted Multicut Polytopes ICML 2024 Collaborative Learning with Different Labeling Functions ICML 2024 Differentiable Combinatorial Scheduling at Scale ICML 2024 Graph-Triggered Rising Bandits ICML 2024 Optimally Improving Cooperative Learning in a Social Setting ICML 2024 The Computational Complexity of Finding Second-Order Stationary Points ICML 2024 Trained Random Forests Completely Reveal your Dataset ICML 2024 Efficient approaches for escaping higher order saddle points in non-convex optimization COLT 2016