{"total":23,"rows":[{"id":"2110.03960","title":"Mixability made efficient: Fast online multiclass logistic regression","created":"2021-10-08","cited_by_count":12,"area":null},{"id":"2209.04417","title":"Expected Worst Case Regret via Stochastic Sequential Covering","created":"2022-09-09","cited_by_count":12,"area":null},{"id":"2104.06714","title":"Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution","created":"2021-04-14","cited_by_count":11,"area":null},{"id":"2211.08202","title":"A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)","created":"2022-11-15","cited_by_count":11,"area":null},{"id":"2112.08581","title":"Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)","created":"2021-12-16","cited_by_count":8,"area":null},{"id":"2211.11081","title":"A Theory of Unsupervised Translation Motivated by Understanding Animal Communication","created":"2022-11-20","cited_by_count":6,"area":null},{"id":"2211.13084","title":"Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives","created":"2022-11-23","cited_by_count":6,"area":null},{"id":"2104.03372","title":"Lower Bounds from Fitness Levels Made Easy","created":"2021-04-07","cited_by_count":5,"area":null},{"id":"2109.06584","title":"Choosing the Right Algorithm With Hints From Complexity Theory","created":"2021-09-14","cited_by_count":5,"area":null},{"id":"2304.08774","title":"3-Objective Pareto Optimization for Problems with Chance Constraints","created":"2023-04-18","cited_by_count":5,"area":null},{"id":"2305.10259","title":"Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise","created":"2023-05-17","cited_by_count":5,"area":null},{"id":"2311.09858","title":"Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets","created":"2023-11-16","cited_by_count":3,"area":null},{"id":"2203.02693","title":"Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)","created":"2022-03-05","cited_by_count":2,"area":null},{"id":"2304.10848","title":"How Well Does the Metropolis Algorithm Cope With Local Optima?","created":"2023-04-21","cited_by_count":2,"area":null},{"id":"2302.08021","title":"Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus","created":"2023-02-16","cited_by_count":1,"area":null},{"id":"2303.07455","title":"(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error","created":"2023-03-13","cited_by_count":1,"area":null},{"id":"2403.08153","title":"The Runtime of Random Local Search on the Generalized Needle Problem","created":"2024-03-13","cited_by_count":1,"area":null},{"id":"2604.07473","title":"When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection","created":"2026-04-08","cited_by_count":1,"area":null},{"id":"2305.07908","title":"Convergence and scaling of Boolean-weight optimization for hardware reservoirs","created":"2023-05-13","cited_by_count":0,"area":null},{"id":"2404.03838","title":"A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis","created":"2024-04-04","cited_by_count":0,"area":null},{"id":"2601.11499","title":"On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds","created":"2026-01-16","cited_by_count":0,"area":null},{"id":"2604.04083","title":"Parent Selection Mechanisms in Elitist Crossover-Based Algorithms","created":"2026-04-05","cited_by_count":0,"area":null},{"id":"2605.28703","title":"A Fresh Look at Lamarckian Evolution and the Baldwin Effect","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}