combinatorial complexity
Combinatorial complexity refers to the computational difficulty associated with problems where the number of possible combinations or configurations grows exponentially with the size of the input, which can be a significant challenge in optimization and decision-making problems in AI.
- A Few Moments Please: Scalable Graphon Learning via Moment Matching
- Breaking the Performance Ceiling in Reinforcement Learning requires Inference Strategies
- Breaking the Performance Ceiling in Reinforcement Learning requires Inference Strategies
- COGNAC: Cooperative Graph-based Networked Agent Challenges for Multi-Agent Reinforcement Learning
- IMPACT: Irregular Multi-Patch Adversarial Composition Based on Two‑Phase Optimization