Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem (2405.18772v1)

Published 29 May 2024 in cs.NE

Abstract: Chance-constrained problems involve stochastic components in the constraints which can be violated with a small probability. We investigate the impact of different types of chance constraints on the performance of iterative search algorithms and study the classical maximum coverage problem in graphs with chance constraints. Our goal is to evolve reliable chance constraint settings for a given graph where the performance of algorithms differs significantly not just in expectation but with high confidence. This allows to better learn and understand how different types of algorithms can deal with different types of constraint settings and supports automatic algorithm selection. We develop an evolutionary algorithm that provides sets of chance constraints that differentiate the performance of two stochastic search algorithms with high confidence. We initially use traditional approximation ratio as the fitness function of (1+1)~EA to evolve instances, which shows inadequacy to generate reliable instances. To address this issue, we introduce a new measure to calculate the performance difference for two algorithms, which considers variances of performance ratios. Our experiments show that our approach is highly successful in solving the instability issue of the performance ratios and leads to evolving reliable sets of chance constraints with significantly different performance for various types of algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. Benchmarking in Optimization: Best Practice and Open Issues. CoRR abs/2007.03488 (2020).
  2. Evolving diverse TSP instances by means of novel and creative mutation operators. In FOGA. ACM, 58–71.
  3. Submodular Maximization with Cardinality Constraints. In SODA. SIAM, 1433–1452.
  4. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40, 6 (2011), 1740–1766.
  5. William H. Cunningham. 1985. On submodular function minimization. Comb. 5, 3 (1985), 185–192.
  6. IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. CoRR abs/2111.04077 (2021).
  7. Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023. ijcai.org, 5558–5566.
  8. Anh Viet Do and Frank Neumann. 2020. Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms. In Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 12270). Springer, 588–603.
  9. Optimization of Chance-Constrained Submodular Functions. In AAAI. AAAI Press, 1460–1467.
  10. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs/1810.05281 (2018).
  11. Benchmarking discrete optimization heuristics with IOHprofiler. Appl. Soft Comput. 88 (2020), 106027.
  12. The chance constrained Travelling Thief Problem: Problem formulations and algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear.
  13. Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. In ECAI 2020 - 24th European Conference on Artificial Intelligence 2020, Vol. 325. IOS Press, 435–442.
  14. Maximizing Non-monotone Submodular Functions. SIAM J. Comput. 40, 4 (2011), 1133–1153.
  15. Tobias Friedrich and Frank Neumann. 2014. Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. In Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8672). Springer, 922–931.
  16. Tobias Friedrich and Frank Neumann. 2015. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evol. Comput. 23, 4 (2015), 543–558.
  17. Feature-Based Diversity Optimization for Problem Instance Classification. Evol. Comput. 29, 1 (2021), 107–128.
  18. Automated Algorithm Selection: Survey and Perspectives. Evol. Comput. 27, 1 (2019), 3–45.
  19. An Efficient Evolutionary Algorithm for Chance-Constrained Bi-Objective Stochastic Optimization. IEEE Trans. Evol. Comput. 17, 6 (2013), 786–796. https://doi.org/10.1109/TEVC.2013.2244898
  20. A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69, 2 (2013), 151–182.
  21. George L. Nemhauser and Laurence A. Wolsey. 1978. Best Algorithms for Approximating the Maximum of a Submodular Set Function. Math. Oper. Res. 3, 3 (1978), 177–188.
  22. An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14, 1 (1978), 265–294.
  23. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO ’21: Genetic and Evolutionary Computation Conference. ACM, 261–269.
  24. Aneta Neumann and Frank Neumann. 2020. Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. In PPSN (1) (Lecture Notes in Computer Science, Vol. 12269). Springer, 404–417.
  25. Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. In PPSN (1) (Lecture Notes in Computer Science, Vol. 13398). Springer, 294–307.
  26. Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. In CEC. IEEE, 1–9.
  27. Frank Neumann and Shayan Poursoltan. 2016. Feature-based algorithm selection for constrained continuous optimisation. In CEC. IEEE, 1461–1468.
  28. Frank Neumann and Carsten Witt. 2022. Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. In IJCAI. ijcai.org, 4800–4806.
  29. Frank Neumann and Carsten Witt. 2023. 3-Objective Pareto Optimization for Problems with Chance Constraints. In GECCO. ACM, 731–739.
  30. Effective 2- and 3-objective MOEA/D approaches for the chance constrained knapsack problem. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear.
  31. Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear.
  32. Kokila Perera and Aneta Neumann. 2024. Multi-objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear.
  33. Chandra A. Poojari and Boby Varghese. 2008. Genetic Algorithm based technique for solving Chance Constrained Problems. Eur. J. Oper. Res. 185, 3 (2008), 1128–1154. https://doi.org/10.1016/j.ejor.2006.06.045
  34. John R. Rice. 1976. The Algorithm Selection Problem. Adv. Comput. 15 (1976), 65–118.
  35. Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. AAAI Press, 4292–4293.
  36. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In PPSN (2) (Lecture Notes in Computer Science, Vol. 13399). Springer, 526–541.
  37. Kate Smith-Miles. 2008. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41, 1 (2008), 6:1–6:25.
  38. Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. In CEC. IEEE, 1–10.
  39. IOHanalyzer: Detailed performance analyses for iterative optimization heuristics: hot-off-the-press track @ GECCO 2022. In GECCO Companion. ACM, 49–50.
  40. David H. Wolpert and William G. Macready. 1997. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 1 (1997), 67–82.
  41. Evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM, 338–346.
  42. Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. In GECCO ’20: Genetic and Evolutionary Computation Conference 2020. ACM, 271–279.
  43. Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. In GECCO. ACM, 1187–1194.
  44. Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. In ECAI 2023 - 26th European Conference on Artificial Intelligence 2023 (Frontiers in Artificial Intelligence and Applications, Vol. 372). IOS Press, 2826–2833.
  45. Sampling-based Pareto optimization for chance-constrained monotone submodular problems. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets