paper-with-me

홈 › Papers

An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization

2014-09-26 · Hernan Aguirre, Arnaud Liefooghe, Sébastien Verel, Kiyoshi Tanaka

This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set. Several search-assessment indicators are defined to trace the dynamics of survival selection and measure the ability to simultaneously keep optimal solutions and discover new ones under different population sizes, set as a fraction of the size of the Pareto optimal set.

📄 PDF Abstract BibTeX arXiv:1409.7478

Code (0)

등록된 구현이 없습니다.

Tasks

Evolutionary Algorithms

Similar Papers 제목 키워드 기반

An Operator Learning Framework for Spatiotemporal Super-resolution of Scientific Simulations

2023-11-04 · Valentin Duruisseaux, Amit Chakraborty

In numerous contexts, high-resolution solutions to partial differential equations are required to capture faithfully essential dynamics which occur at small spatiotemporal scales, but these solutions can be very difficul…

Operator learningSuper-Resolution

Reference-free logged energy-oracle recovery for neural approximations of symmetric coercive variational problems: conforming Riesz reconstruction and archive-level selection

2026-08-17 · Karim Bounja, Lahcen Laayouni, Boujemaa Achchab, Abdeljalil Sakat arxiv

Neural PDE training yields a finite checkpoint archive, yet its logged energy errors are inaccessible without the exact solution, while loss-based selection does not necessarily recover the logged energy oracle. For admi…

Multi Resolution Analysis (MRA) for Approximate Self-Attention

2022-07-21 · Zhanpeng Zeng, Sourav Pal, Jeffery Kline, Glenn M Fung 외

Transformers have emerged as a preferred model for many tasks in natural langugage processing and vision. Recent efforts on training and deploying Transformers more efficiently have identified many strategies to approxim…

Laplace's Method Approximations for Probabilistic Inference in Belief Networks with Continuous Variables

2013-02-27 · Adriano Azevedo-Filho, Ross D. Shachter

Laplace's method, a family of asymptotic methods used to approximate integrals, is presented as a potential candidate for the tool box of techniques used for knowledge acquisition and probabilistic inference in belief ne…

Model Selection

Fast Sublinear Sparse Representation using Shallow Tree Matching Pursuit

2014-12-01 · Ali Ayremlou, Thomas Goldstein, Ashok Veeraraghavan, Richard Baraniuk

Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognit…

Compressive SensingDenoisingImage DenoisingObject Recognition+1