Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
暂无分享,去创建一个
Zhi-Hua Zhou | Xin Yao | Chao Qian | Ke Tang | Yang Yu | Yang Yu | Chao Qian | Zhi-Hua Zhou | X. Yao | K. Tang
[1] Chao Qian,et al. A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms , 2018, IJCAI.
[2] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[3] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[4] JansenThomas,et al. On the analysis of the (1+ 1) evolutionary algorithm , 2002 .
[5] Markus Wagner,et al. Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization , 2018, PPSN.
[6] Joseph Naor,et al. Submodular Maximization with Cardinality Constraints , 2014, SODA.
[7] Yang Yu,et al. Evolutionary Learning: Advances in Theories and Algorithms , 2019 .
[8] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[9] Maxim Sviridenko,et al. An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem , 1999, Discret. Appl. Math..
[10] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[11] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.
[12] Vahab S. Mirrokni,et al. Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.
[13] Oliver Giel,et al. Expected runtimes of a simple multi-objective evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[14] Frank Neumann,et al. Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints , 2018, AAAI.
[15] Yang Yu,et al. Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection , 2018, IJCAI.
[16] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[17] Frank Neumann,et al. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.
[18] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[19] Yaron Singer,et al. Maximization of Approximately Submodular Functions , 2016, NIPS.
[20] Frank Neumann,et al. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem , 2004, Eur. J. Oper. Res..
[21] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[22] Frank Neumann,et al. Computing Minimum Cuts by Randomized Search Heuristics , 2008, GECCO '08.
[23] Neil D. Lawrence,et al. Fast Sparse Gaussian Process Methods: The Informative Vector Machine , 2002, NIPS.
[24] Andreas Krause,et al. Guarantees for Greedy Maximization of Non-submodular Functions with Applications , 2017, ICML.
[25] Martin Skutella,et al. Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.
[26] Alexandros G. Dimakis,et al. On Approximation Guarantees for Greedy Low Rank Optimization , 2017, ICML.
[27] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[28] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[29] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[30] Ingo Wegener,et al. A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.
[31] Andreas Krause,et al. Submodular Dictionary Selection for Sparse Representation , 2010, ICML.
[32] Wusheng Chou,et al. Path planning for mobile robot using self-adaptive learning particle swarm optimization , 2016, Science China Information Sciences.
[33] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[34] Abhimanyu Das,et al. Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.
[35] Yang Yu,et al. On Constrained Boolean Pareto Optimization , 2015, IJCAI.
[36] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[37] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[38] Carsten Witt,et al. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.
[39] Wei You,et al. Virtual network function scheduling via multilayer encoding genetic algorithm with distributed bandwidth allocation , 2018, Science China Information Sciences.
[40] Alexandros G. Dimakis,et al. Restricted Strong Convexity Implies Weak Submodularity , 2016, The Annals of Statistics.
[41] Yang Yu,et al. An analysis on recombination in multi-objective evolutionary optimization , 2011, GECCO '11.
[42] Ben Taskar,et al. Determinantal Point Processes for Machine Learning , 2012, Found. Trends Mach. Learn..
[43] Jon Lee. Maximum entropy sampling , 2001 .
[44] John R. Koza,et al. What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results , 2003, IEEE Intell. Syst..
[45] Charles E. Heckler,et al. Applied Multivariate Statistical Analysis , 2005, Technometrics.
[46] Yang Yu,et al. Parallel Pareto Optimization for Subset Selection , 2016, IJCAI.
[47] Frank Neumann,et al. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms , 2015, Evolutionary Computation.
[48] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).