Unverified50% confidenceFactExact time
Even if the relaxed problem attains the global optimum, there still exists an integrality gap between the rounded 0/1 solution and the true optimal solution, and its size depends on the specific instance structure.
1
Sources
50%
Confidence
Long-term
Relevance
10/17/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedOn non-degenerate classes, every consistent learner (no matter how it breaks ties) achieves the optimal realizable sample complexity, with the gap only within a constant factor.72% similarUnverifiedGradient methods can usually only find a local optimum of the relaxed problem, and the rounded solution is not necessarily the optimal 0/1 solution.71% similarUnverifiedContext optimization should be treated as a trade-off problem with explicit coverage constraints, rather than purely a compression problem.70% similarUnverifiedThere is an essential separation between the information-theoretically optimal regret Õ(md+k) and the regret achievable in polynomial time; this gap is inherent to computational complexity rather than a shortcoming of algorithm design.70% similarUnverifiedMechanism three: when the number of questions is sufficiently large, the minimax excess risk reaches the identification lower bound of N^{-β}, which cannot be broken even with infinitely many questions, and this lower bound is independent of the number of questions.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1051481API
curl https://kongchang.com/api/v1/knowledge/claims/1051481MCP
get_claim(id=1051481)