Copertina

Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yan, Xiankun, Neumann, Aneta, Neumann, Frank
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
di: Yan, Xiankun, et al.
Pubblicazione: (2024)

Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms
di: Neumann, Aneta, et al.
Pubblicazione: (2020)

Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints
di: Neumann, Frank, et al.
Pubblicazione: (2024)

Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems
di: Wigney, Liam, et al.
Pubblicazione: (2026)

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
di: Pathiranage, Ishara Hewa, et al.
Pubblicazione: (2024)

On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem
di: Pathiranage, Ishara Hewa, et al.
Pubblicazione: (2026)

Bi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling Problem under Uncertainty with Chance Constraints
di: Pathiranage, Ishara Hewa, et al.
Pubblicazione: (2025)

Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems
di: Ahouei, Saba Sadeghi, et al.
Pubblicazione: (2025)

Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization
di: Neumann, Frank, et al.
Pubblicazione: (2024)

Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
di: Shi, Feng, et al.
Pubblicazione: (2022)

Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
di: Antipov, Denis, et al.
Pubblicazione: (2024)

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
di: Antipov, Denis, et al.
Pubblicazione: (2024)

Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
di: Ahouei, Saba Sadeghi, et al.
Pubblicazione: (2024)

Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem
di: Dang, Duc-Cuong, et al.
Pubblicazione: (2024)

Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
di: Don, Thilina Pathirage, et al.
Pubblicazione: (2025)

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
di: Pan, Shuaiqun, et al.
Pubblicazione: (2025)

Evolutionary Algorithm for Chance Constrained Quadratic Multiple Knapsack Problem
di: Perera, Kokila Kasuni, et al.
Pubblicazione: (2025)

Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem
di: Perera, Kokila Kasuni, et al.
Pubblicazione: (2024)

The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
di: Angmalisang, Helen Yuliana, et al.
Pubblicazione: (2026)

Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
di: Harder, Jonathan Gadea, et al.
Pubblicazione: (2024)

Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
di: Tran, Tan D., et al.
Pubblicazione: (2024)

Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables
di: Neumann, Frank, et al.
Pubblicazione: (2021)

Learning Submodular Sequencing from Samples
di: Yuan, Jing, et al.
Pubblicazione: (2024)

Chance-constrained Flow Matching for High-Fidelity Constraint-aware Generation
di: Liang, Jinhao, et al.
Pubblicazione: (2025)

Evolutionary Multi-Objective Diversity Optimization
di: Do, Anh Viet, et al.
Pubblicazione: (2024)

Effective Traveling for Metric Instances of the Traveling Thief Problem
di: Eube, Jan, et al.
Pubblicazione: (2026)

Scalable Submodular Policy Optimization via Pruned Submodularity Graph
di: Anand, Aditi, et al.
Pubblicazione: (2025)

Beyond ELBOs: A Large-Scale Evaluation of Variational Methods for Sampling
di: Blessing, Denis, et al.
Pubblicazione: (2024)

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
di: Jadav, Hareshkumar, et al.
Pubblicazione: (2026)

Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions
di: Perera, Kokila Kasuni, et al.
Pubblicazione: (2025)

Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
di: Don, Thilina Pathirage, et al.
Pubblicazione: (2026)

PRISM: A Design Framework for Open-Source Foundation Model Safety
di: Neumann, Terrence, et al.
Pubblicazione: (2024)

Is Monotonic Sampling Necessary in Diffusion Models?
di: Khan, Muhammad Haris
Pubblicazione: (2026)

Low-Resource Transliteration for Roman-Urdu and Urdu Using Transformer-Based Models
di: Butt, Umer, et al.
Pubblicazione: (2025)

End-To-End Learning of Gaussian Mixture Priors for Diffusion Sampler
di: Blessing, Denis, et al.
Pubblicazione: (2025)

MonoSOWA: Scalable monocular 3D Object detector Without human Annotations
di: Skvrna, Jan, et al.
Pubblicazione: (2025)

Stochastic Multi-round Submodular Optimization with Budget
di: Auletta, Vincenzo, et al.
Pubblicazione: (2024)

Submodular Evaluation Subset Selection in Automatic Prompt Optimization
di: Nian, Jinming, et al.
Pubblicazione: (2026)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)