conftrace_

hard instance

4 papers

Explore in graph

Co-occurring keywords · papers mentioning both

hard instance sampling (1) probabilistic generator (1) 3-coloring problem (1) shortcut policy gradient (1) document-level classification (1) polarity classification (1) denoising diffusion probabilistic model (1) online bipartite matching (1) upper bound (1) adversarial reinforcement learning (1)

Papers

DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models ICML 2025 Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning ICML 2024 Why Do Document-Level Polarity Classifiers Fail? NAACL 2021 Learning to Sample Hard Instances for Graph Algorithms ACML 2019