Picture for Naoki Hamada

Naoki Hamada

Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization

Add code
May 23, 2022
Figure 1 for Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Figure 2 for Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Figure 3 for Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Figure 4 for Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Viaarxiv icon

A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization

Add code
Mar 29, 2022
Figure 1 for A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization
Figure 2 for A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization
Figure 3 for A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization
Figure 4 for A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization
Viaarxiv icon

GenéLive! Generating Rhythm Actions in Love Live!

Add code
Feb 25, 2022
Figure 1 for GenéLive! Generating Rhythm Actions in Love Live!
Figure 2 for GenéLive! Generating Rhythm Actions in Love Live!
Figure 3 for GenéLive! Generating Rhythm Actions in Love Live!
Figure 4 for GenéLive! Generating Rhythm Actions in Love Live!
Viaarxiv icon

Explicitly Multi-Modal Benchmarks for Multi-Objective Optimization

Add code
Oct 07, 2021
Figure 1 for Explicitly Multi-Modal Benchmarks for Multi-Objective Optimization
Figure 2 for Explicitly Multi-Modal Benchmarks for Multi-Objective Optimization
Figure 3 for Explicitly Multi-Modal Benchmarks for Multi-Objective Optimization
Viaarxiv icon

All unconstrained strongly convex problems are weakly simplicial

Add code
Jun 24, 2021
Figure 1 for All unconstrained strongly convex problems are weakly simplicial
Figure 2 for All unconstrained strongly convex problems are weakly simplicial
Figure 3 for All unconstrained strongly convex problems are weakly simplicial
Figure 4 for All unconstrained strongly convex problems are weakly simplicial
Viaarxiv icon

Approximate Bayesian Computation of Bézier Simplices

Add code
Apr 13, 2021
Figure 1 for Approximate Bayesian Computation of Bézier Simplices
Figure 2 for Approximate Bayesian Computation of Bézier Simplices
Figure 3 for Approximate Bayesian Computation of Bézier Simplices
Figure 4 for Approximate Bayesian Computation of Bézier Simplices
Viaarxiv icon

Asymptotic Risk of Bezier Simplex Fitting

Add code
Jun 17, 2019
Figure 1 for Asymptotic Risk of Bezier Simplex Fitting
Figure 2 for Asymptotic Risk of Bezier Simplex Fitting
Figure 3 for Asymptotic Risk of Bezier Simplex Fitting
Figure 4 for Asymptotic Risk of Bezier Simplex Fitting
Viaarxiv icon

Data-Driven Analysis of Pareto Set Topology

Add code
Apr 19, 2018
Figure 1 for Data-Driven Analysis of Pareto Set Topology
Figure 2 for Data-Driven Analysis of Pareto Set Topology
Figure 3 for Data-Driven Analysis of Pareto Set Topology
Figure 4 for Data-Driven Analysis of Pareto Set Topology
Viaarxiv icon

Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts

Add code
Apr 18, 2017
Figure 1 for Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts
Figure 2 for Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts
Figure 3 for Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts
Figure 4 for Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts
Viaarxiv icon

Population Synthesis via k-Nearest Neighbor Crossover Kernel

Add code
Aug 26, 2015
Figure 1 for Population Synthesis via k-Nearest Neighbor Crossover Kernel
Figure 2 for Population Synthesis via k-Nearest Neighbor Crossover Kernel
Figure 3 for Population Synthesis via k-Nearest Neighbor Crossover Kernel
Figure 4 for Population Synthesis via k-Nearest Neighbor Crossover Kernel
Viaarxiv icon